Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 80-89

  Johnen, Colette ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Anonymous ring; Distributed protocol; Fault tolerant; Mutual exclusion; Self stabilization; Service time; Token circulation; Unfair scheduler

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; OPTIMAL CONTROL SYSTEMS; PERTURBATION TECHNIQUES; PROBABILITY; PROGRAM PROCESSORS; TOPOLOGY;

CIRCULATION PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0036444999     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. J. Beauquier, S. Cordier, and S. Delaët. Optimum probabilistic self-stabilization on uniform rings. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 15.1-15.15, 1995.
2. J. Beauquier and O. Debas. An optimal self-stabilizing algorithm for mutual exclusion on bidirectional non uniform tings. In Proceedings of the Second Workshop on SelfStabilizing Systems, pages 17.1-17.13, 1995.
3. J. Beauquier, J. Durand-Lose, M. Gradinariu, and C. Johnen. Token based self-stabilizing uniform algorithms. Journal of Parallel and Distributed Computing, 62(5):899-921, May 2002.
4. J. Beauquier, M. Gradinariu, and C. Johnen. Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Technical Report 1225, L.R.I, December 1999.
5. G. Brown, M. Gouda, and C. Wu. Token systems that selfstabilize. IEEE Transactions on Computers, 38:845-852, 1989.
6. J. Burns and J. Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11:330-344, 1989.
7. K. Chandy and J. Misra. Parallel Programs Design: A Foundation. Addison-Wesley, 1988.
8. A. Datta, M. Gradinariu, and S. Tixeuil. Self-stabilizing mutual exclusion using unfair distributed scheduler. In IPDPS'2000 Proceedings of the 14th International Parallel and Distributed Processing Symposium, pages 465-470, 2000.
9. A.K. Datta, C. Johnen, F. Petit, and V. Villain. Selfstabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing, 13(4):207-218, 2000.
10. E. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
11. E. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1:5-6, 1986.
12. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
13. J. Durand-Lose. Randomized uniform self-stabilizing mutual exclusion. Information Processing Letters, 74(5-6):203-207, 2000.
14. F. Fich and C. Johnen. A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings. In DISC00 Distributed Computing 15th International Symposium, Springer-Verlag LNCS:2180, pages 224-239, 2001.
15. M. Flatebo, A. Datta, and A. Schoone. Self-stabilizing multi-token rings. Distributed Computing, 8:133-142, 1994.
16. S. Ghosh. An alternative solution to a problem on self-stabilization. ACM Transactions on Programming Languages and Systems, 15:735-742, 1993.
17. M. Gouda and F. Haddix. The stabilizing token ring in three bits. Journal of Parallel and Distributed Computing, 35:43-48, 1996.
18. T. Herman. Probabilistic self-stabilization. Information Processing Letters, 35:63-67, 1990.
19. S. Huang and N. Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7:61-66, 1993.
20. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC90 Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pages 119-131, 1990.
21. G. Itkis, C. Lin, and J. Simon. Deterministic, constant space, self-stabilizing leader election on uniform rings. In WDAG95 Distributed Algorithms 9th International Workshop Proceedings, Springer-Verlag LNCS:972, pages 288-302, 1995.
22. C. Johnen, G. Alari, J. Beauquier, and A. Datta. Self-stabilizing depth-first token passing on rooted networks. In WDAG97 Distributed Algorithms 11th International Workshop Proceedings, Springer-Verlag LNCS:1320, pages 260-274, 1997.
23. C. Jobnen 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.
24. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Transactions on Parallel and Distributed Systems, 8:154-162, 1997.
25. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon. Journal of Parallel and Distributed Computing, 62(5):885-898, May 2002.
26. H. Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Information Processing Letters, 8:91-95, 1979.
27. C. Lin and J. Simon. Observing self-stabilization. In PODC92 Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, pages 113-123, 1992.
28. A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-stabilizing symmetry breaking in constant-space. In STOC92 Proceedings of the 24th Annual ACM Symposium on Theory, of Computing, pages 667-678, 1992.
29. 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.
30. 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, IEEE Computer Society Press. IEEE Computer Society Press, 1997. To appear.
31. L. Rosaz. Self-stabilizing token circulation on asynchronous uniform unidirectional rings. In PODCO0 Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pages 249-258, 2000.
32. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Departament of Electrical Engineering and Computer Science, 1995.
33. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR'94 Fifth International Conference Concurrency Theory, Springer-Verlag LNCS:836, pages 481-496, 1994.
34. S. Wu, S.A. Smolka, and E. Stark. Composition and behaviors of probabilistic i/o automata. In CONCUR'94 Fifth International Conference Concurrency Theory, Springer-Verlag LNCS:836, pages 513-528, 1994.