Self-stabilizing depth-first token passing on rooted networks

  • Colette Johnen
  • Gianluigi Alari
  • Joffroy Beauquier
  • Ajoy K. Datta
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1320)

Abstract

We present a deterministic distributed depth-first token passing protocol on a rooted network. This protocol does not use either the processor identifiers or the size of the network, but assumes the existence of a distinguished processor, called the root of the network. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to reach a state with no more than one token in the network. The protocol implements a strictly fair token circulationduring a round, every processor obtains the token exactly once. The proposed protocol has extremely small memory requirement-only O(1) bits of memory per incident network link.

Keywords

Mutual exclusion self-stabilization spanning tree token passing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Y. Afek and A. Bremler, “Self-Stabilizing Unidirectional Network Algorithms by Power-Supply,” Sixth ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, 1997.Google Scholar
  2. 2.
    Y. Afek, S. Kutten and M. Yung, “Memory-Efficient Self-Stabilizing Protocols for General Networks,” Proc. 4th Int. Workshop on Distributed Algorithm, LNCS 486, Springer-Verlag, pages 15–28, 1990.Google Scholar
  3. 3.
    B. Awerbuch and R Ostrovsky, “Memory-efficient and self-stabilizing network reset,” Symposium on Principles of Distributed Computing, Los Angeles, California, pages 254–263, 1994.Google Scholar
  4. 4.
    J. Burns, M. Gouda, and R. Miller, “On Relaxing Interleaving Assumptions,” Proceedings of the MCC Workshop on Self-Stabilization, Austin, Texas, November 1989.Google Scholar
  5. 5.
    G. Brown, M. Gouda, and M. Wu, “Token Systems that Self-Stabilize,” IEEE Transactions on Computers, Vol. 38, No. 6, pages 845–852, June 1989.CrossRefGoogle Scholar
  6. 6.
    Burns J. and Pachl J. “Uniform Self-Stabilizing Rings,” ACM Transactions on Programming Language and Systems, Vol. 11, No. 2, pages 330–344, 1989.CrossRefGoogle Scholar
  7. 7.
    E. W. Dijkstra, “Self-Stabilizing Systems in Spite of Distributed Control,” Communications of the ACM 17, pages 643–644, 1974.Google Scholar
  8. 8.
    E. W. Dijkstra, “Self-Stabilization in Spite of Distributed Control,” inSelected writings on computing: a personal perspective, Springer-Verlag, Berlin, pages 41–46, 1982.Google Scholar
  9. 9.
    S. Dolev, A. Israeli, and S. Moran, “Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity,” Proceedings of the gth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, 1990, pages 103–117; also Distributed Computing Vol. 7, pages 3–16, 1993.Google Scholar
  10. 10.
    M. Flatebo and A. K. Datta, “Two-State Self-Stabilizing Algorithms for Token Rings,” IEEE Transactions on Software Engineering, pages 500–504, June 1994.Google Scholar
  11. 11.
    M. Flatebo, A. K. Datta, and A. A. Schoone, “Self-Stabilizing Multi-Token Rings,” Distributed Computing, Vol. 8, pages 133–142, 1995.CrossRefGoogle Scholar
  12. 12.
    S. Ghosh, “An Alternate Solution to a Problem on Self-Stabilization,” ACM Transactions on Programming Languages and Systems, Vol. 15, No. 4, pages 735–742, September 1993.CrossRefGoogle Scholar
  13. 13.
    M.G. Gouda and N. Multari, “Stabilizing Communication Protocols,” IEEE Transactions on Computing, Vol. 40, No. 4, pages 448–458, 1991.CrossRefGoogle Scholar
  14. 14.
    S. Huang and N. Chen, “Self-Stabilizing Depth-First Token Circulation on Networks,” Distributed Computing, Vol. 7, pages 61–66, 1993.Google Scholar
  15. 15.
    A. Israeli and M. Jalfon, “Token Management Schemes and random walks yiels self stabilizing mutual exclusion,” Symposium on Principles of Distributed Computing, pages 119–131, 1990Google Scholar
  16. 16.
    G. Itkis and L. Levin, “Fast and lean self-stabilizing asynchronous protocols,” 35th Symposium on Foundations of Computer Science, Santa Fe, New Mexico, pages 226–239, 1994.Google Scholar
  17. 17.
    C. Johnen and J. Beauquier, “Space-Efficient Distributed Self-Stabilizing Depth-First Token Circulation,” Proceedings of the 2nd Workshop on Self-Stabilizing Systems, Las Vegas, Nevada, pages 4.1–4.15, 1995.Google Scholar
  18. 18.
    C. Johnen, “Memory Efficient, Self-Stabilizing algorithm to construct BFS spanning trees,” Proceeding 16th Principles of Distributed Computing, August 1997.Google Scholar
  19. 19.
    H.S.M. Kruijer, “Self-stabilizing (in spite of distributed control) in tree-structured systems,” Information Processing Letters, vol 29, pages 91–95, 1979CrossRefGoogle Scholar
  20. 20.
    M. Schneider, “Self-Stabilization,” ACM Computing Surveys, Vol. 25, No. 1, pages 45–67, March 1993.CrossRefGoogle Scholar
  21. 21.
    M. Tchuente, “Sur l'auto-stabilisation dans un reseau d'ordinateurs,” RAIRO Informatique Theorique 15, No. 1, pages 47–66, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Colette Johnen
    • 1
  • Gianluigi Alari
    • 2
  • Joffroy Beauquier
    • 1
  • Ajoy K. Datta
    • 3
  1. 1.L.R.I., C.N.R.S. URA 410, Université de Paris-SudFrance
  2. 2.Unité d'Informatique, Université catholique de LouvainBelgium
  3. 3.Department of Computer ScienceUniversity of Nevada Las VegasUSA

Personalised recommendations