Self-stabilizing depth-first token circulation in arbitrary rooted networks

Distributed Computing

Volumn 13, Issue 4, 2000, Pages 207-218

  Datta, Ajoy K ^a,d   Johnen, Colette ^b   Petit, Franck ^c   Villain, Vincent ^c  

^a University of Nevada Las Vegas   (United States)

^b CNRS   (France)

^c UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^d UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; PROGRAM PROCESSORS;

ARBITRARY ROOTED NETWORKS; DISTRIBUTED MUTUAL EXCLUSION; SELF STABILIZING DEPTH FIRST TOKEN CIRCULATION; SPANNING TREE; TOKEN PASSING;

NETWORK PROTOCOLS;

EID: 0034318605     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008919     Document Type: Article

References (22)

1. Beauquier J, Debas O: An optimal self-stabilizing algorithm for mutual exclusion on bidirectional non uniform rings. In Proceedings of the Second Workshop on Self-Stabilizing Systems, p. 17.1-17.13 (1995)
2. Brown GM, Gouda MG, Wu CL: Token systems that self-stabilize. IEEE Trans Comp , 38:845-852, (1989)
3. Burns JE, Gouda MG, Miller RE: On relaxing interleaving assumptions. In Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report No. STP-379-89, (1989)
4. Burns JE, Pachl J: Uniform self-stabilizing rings. ACM Trans Program Languages Syst, 11:330-344, (1989)
5. Collin Z, Dolev S: Self-stabilizing depth-first search. Inform Process Lett, 49:297-301, (1994)
6. Datta AK, Johnen C, Petit F, Villain V: Self-stabilizing depth-first token circulation in arbitrary rooted networks. In SIROCCO'98, The 5th International Colloquium On Structural Information and Communication Complexity Proceedings, p. 229-243. Carleton University Press (1998)
7. Dijkstra EW: Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644 (1974)
8. Dolev S, Israeli A, Moran S: Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib Comput, 7:3-16 (1993)
9. Flatebo M, Datta AK, Schoone AA: Self-stabilizing multi-token rings. Distrib Comput, 8:133-142 (1994)
10. Ghosh S: An alternative solution to a problem on self-stabilization. ACM Trans Program Languages Syst, 15:735-742 (1993)
11. Gouda MG, Haddix FF: The stabilizing token ring in three bits. J Parallel Distrib Comput, 35:43-48, (1996)
12. Gouda MG, Multari N: Stabilizing communication protocols. IEEE Trans Comput, 40:448-458 (1991)
13. Huang ST, Chen NS: Self-stabilizing depth-first token circulation on networks. Distrib Comput, 7:61-66 (1993)
14. Johnen C, Alari G, Beauquier J, Datta AK: Self-stabilizing depth-first token passing on rooted networks. In WDAG97 Distributed Algorithms 11th International Workshop Proceedings, LNCS: 1320, p. 260-274, Berlin Heidelberg New York: Springer 1997
15. Johnen C, Beauquier J: Space-efficient distributed self-stabilizing depth-first token circulation. In Proceedings of the Second Workshop on Self-Stabilizing Systems, p. 4.1-4.15 (1995)
16. Kruijer HSM: Self-stabilization (in spite of distributed control) in tree-structured systems. Inform Process Lett, 8:91-95 (1979)
17. Petit F: Highly space-efficient self-stabilizing depth-first token circulation for trees. In: OPODIS'97, International Conference On Principles Of Distributed Systems Proceedings, p. 221-235 1997
18. Petit F, Villain V: Color optimal self-stabilizing depth-first token circulation. In I-SPAN'97, Third International Symposium on Parallel Architectures, Algorithms and Networks Proceedings. p. 317-323. IEEE Computer Society Press 1997
19. Petit F, Villain V: Color optimal self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems. In PDCS-97 10th International Conference on Parallel and Distributed Computing Systems Proceedings, p. 227-233. International Society for Computers and Their Applications, 1997
20. Petit F, Villain V: A space-efficient and self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems. In Euro-par'97 Parallel Processing, Proceedings LNCS:1300, pages 476-479. Berlin Heidelberg New York: Springer 1997
21. Petit F, Villain V: Optimality and self-stabilization in rooted tree networks. Parallel Processing Letters, 1999. To appear.
22. Villain V: A new lower bound for self-stabilizing mutual exclusion algorithms. Technical Report RR97-17, LaRIA, University of Picardie Jules Verne, 1997.