Fast self-stabilizing depth-first token circulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2194, Issue , 2001, Pages 200-215

  Petit, Franck ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ARBITRARY PERTURBATIONS; ARBITRARY ROOTED NETWORKS; ARBITRARY STATE; DEPTH FIRST; DEPTH FIRST SEARCH; FINITE TIME; MEMORY STATE; TOKEN CIRCULATION;

ARTIFICIAL INTELLIGENCE;

EID: 84958953871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45438-1_14     Document Type: Conference Paper

References (20)

1. A Arora and MG Gouda. Distributed reset. IEEE Transactions on Computers, 43:1026-1038, 1994.
2. B Awerbuch, S Kutten, Y Mansour, B Patt-Shamir, and G Varghese. Time optimal self-stabilizing synchronization. In STOC'93 Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 652-661, 1993.
3. GM Brown, MG Gouda, and CL Wu. Token systems that self-stabilize. IEEE Transactions on Computers, 38:845-852, 1989.
4. JE Burns and J Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11:330-344, 1989.
5. NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.
6. Z Collin and S Dolev. Self-stabilizing depth-first search. Information Processing Letters, 49:297-301, 1994.
7. AK Datta, C Johnen, F Petit, and V Villain. Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing, 13(4):207-218, 2000.
8. EW Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
9. S Dolev, A Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
10. S Dolev, A Israeli, and S Moran. Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems, 8(4):424-440, 1997.
11. S Ghosh. An alternative solution to a problem on self-stabilization. ACM Transactions on Programming Languages and Systems, 15:735-742, 1993.
12. MG Gouda and FF Haddix. The stabilizing token ring in three bits. Journal of Parallel and Distributed Computing, 35:43-48, 1996.
13. ST Huang and NS Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7:61-66, 1993.
14. C Johnen, G Alari, J Beauquier, and AK Datta. Self-stabilizing depth-first token passing on rooted networks. In WDAG'97 Distributed Algorithms 11th International Workshop Proceedings, Spring er-Verlag LNCS: 1320, pages 260-274, 1997.
15. C Johnen and J Beauquier. Space-efficient distributed self-stabilizing depth-first token circulation. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 4.1-4.15, 1995.
16. F Petit. Highly space-efficient self-stabilizing depth-first token circulation for trees. In OPODIS'97, International Conference On Principles Of Distributed Systems Proceedings, pages 221-235, 1997.
17. F Petit and V Villain. Color optimal self-stabilizing depth-first token circulation. In I-SPAN 97, Third International Symposium on Parallel Architectures, Algorithms and Networks Proceedings, pages 317-323. IEEE Computer Society Press, 1997.
18. F Petit and V Villain. Time and space optimality of distributed depth-first token circulation algorithms. In Proceedings of DIM AC S Workshop on Distributed Data and Structures, pages 91-106. Carleton University Press, 1999.
19. F Petit and V Villain. Optimality and self-stabilization in rooted tree networks. Parallel Processing Letters, 10(1):3-14, 2000.
20. V Villain. A key tool for optimality in the state model. In Proceedings of DIMACS Workshop on Distributed Data and Structures, pages 133-148. Carleton University Press, 1999.