A robust ring transmission protocol
Computer Networks and ISDN Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Towards a new distributed programming environment (CORDS)
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
| Hi-index | 0.00 |
The paper deals with the problem of managing full and empty slots in a slotted ring network. Two solutions are formally described and proved correct. The first solution is deterministic; it recovers in O(N) round trips after the last error, where N is the number of nodes in the network. The second solution is randomized; the expected number of round trips to recovery after the last error is O(ln N).