Skip to main content
SpringerLink
Log in

Fast Self-Stabilizing Depth-First Token Circulation

  • Conference paper
  • First Online:
Self-Stabilizing Systems (WSS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2194))

Included in the following conference series:

Abstract

We present a simple deterministic distributed depth-first token circulation (DFTC) protocol for arbitrary rooted network. This protocol does not require processors to have identifiers, 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 converge to the intended behavior in finite time. The proposed protocol stabilizes in O(n) time units, i.e., no more than the time for the token to visit all the processors (in the depth-first search order). It compares very favorably with all previously published DFTC algorithms for arbitrary rooted networks—they all stabilize in O(n x D) times, where D is the diameter of the network.

Supported in part by the Pole of Modelization of Picardie.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arora and MG Gouda. Distributed reset. IEEE Transactions on Computers, 43:1026–1038, 1994.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  3. GM Brown, MG Gouda, and CL Wu. Token systems that self-stabilize. IEEE Transactions on Computers, 38:845–852, 1989.

    Article  MathSciNet  Google Scholar 

  4. JE Burns and J Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11:330–344, 1989.

    Article  Google Scholar 

  5. NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147–151, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  6. Z Collin and S Dolev. Self-stabilizing depth-first search. Information Processing Letters, 49:297–301, 1994.

    Article  MATH  Google Scholar 

  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.

    Article  Google Scholar 

  8. EWD Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643–644, 1974.

    MATH  Google Scholar 

  9. S Dolev, A Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  11. S Ghosh. An alternative solution to a problem on self-stabilization. ACM Transactions on Programming Languages and Systems, 15:735–742, 1993.

    Article  Google Scholar 

  12. MG Gouda and FF Haddix. The stabilizing token ring in three bits. Journal of Parallel and Distributed Computing, 35:43–48, 1996.

    Article  MATH  Google Scholar 

  13. ST Huang and NS Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7:61–66, 1993.

    Article  Google Scholar 

  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, Springer-Verlag LNCS:1320, pages 260–274, 1997.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  18. F Petit and V Villain. Time and space optimality of distributed depth-first token circulation algorithms. In Proceedings of DIMACS Workshop on Distributed Data and Structures, pages 91–106. Carleton University Press, 1999.

    Google Scholar 

  19. F Petit and V Villain. Optimality and self-stabilization in rooted tree networks. Parallel Processing Letters, 10(1):3–14, 2000.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaRIA, Université de Picardie Jules Verne, 5, rue de Moulin Neuf, 80000, Amiens, France

    Franck Petit

Authors
  1. Franck Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Nevada, Box 454019, Las Vegas, NV, 89154-4019, USA

    Ajoy K. Datta

  2. Department of Computer Science, University of Iowa, Iowa City, IA, 52242, USA

    Ted Herman

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petit, F. (2001). Fast Self-Stabilizing Depth-First Token Circulation. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45438-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42653-0

  • Online ISBN: 978-3-540-45438-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation