Self Stabilizing Distributed Queuing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Self-Stabilizing Distributed Queuing
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We describe a simple tree-correction theorem that states that any locally checkable protocol that works on a tree can be efficiently stabilized in time proportional to the height of the tree. We show how new protocols can be designed, and how existing work can be easily understood using this theorem.