Skip to main content
SpringerLink
Log in
Book cover

Symposium on Self-Stabilizing Systems

SSS 2003: Self-Stabilizing Systems pp 184–198Cite as

Route Preserving Stabilization

  • Conference paper
  • First Online:

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

Abstract

A distributed system is self-stabilizing if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is loop-free if, a path being constructed between two processors p and q, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from p to q.

We present a self-stabilizing loop-free routing algorithm that is also route preserving. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.

This work was supported in part by the French projects STAR and DYNAMO.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A Arora, MG Gouda, and T Herman. Composite routing protocols. In Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, pages 70–78, 1990. 185, 186, 195

    Google Scholar 

  2. B Awerbuch, S Kutten, Y Mansour, B Patt-Shamir, and G Varghese. Time optimal self-stabilizing synchronization. In STOC93 Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 652–661, 1993. 185

    Google Scholar 

  3. F Baccelli, G Cohen, G Olsder, and JP Quadrat. Synchronization and linearity, an algebra for discrete event systems. Series in Probability and Mathematical Statistics, 1992. 195

    Google Scholar 

  4. JA Cobb and MG Gouda. Stabilization of general loop-free routing. Journal of Parallel and Distributed Computing, 62(5):922–944, 2002. 185, 186, 195

    Article  MATH  Google Scholar 

  5. EW Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17(11):643–644, 1974. 184

    MATH  Google Scholar 

  6. S Dolev. Self-stabilizing routing and related protocols. Journal of Parallel and Distributed Computing, 42(2):122–127, 1997. 185

    Article  MathSciNet  Google Scholar 

  7. S Dolev, MG Gouda, and M Schneider. Memory requirements for silent stabilization. Acta Informatica, 36(6):447–462, 1999. 188

    Article  MATH  MathSciNet  Google Scholar 

  8. B Ducourthial. New operators for computing with associative nets. In Proceedings of the Fifth International Colloquium on Structural Information and Communication Complexity (SIROCCO’98), Amalfi, Italia, pages 51–65, 1998. 195

    Google Scholar 

  9. B Ducourthial and S Tixeuil. Self-stabilization with r-operators. Distributed Computing, 14(3):147–162, 2001. 185, 186, 195, 196, 197

    Article  Google Scholar 

  10. B Ducourthial and S Tixeuil. Self-stabilization with path algebra. Theoretical Computer Science, 293(1):219–236, 2003. 185, 197

    Article  MATH  MathSciNet  Google Scholar 

  11. MG Gouda and M Schneider. Stabilization of maximal metric trees. In Proceedings of the Fourth Workshop on Self-Stabilizing Systems (published in association with ICDCS99 The 19th IEEE International Conference on Distributed Computing Systems), pages 10–17. IEEE Computer Society, 1999. 185

    Google Scholar 

  12. C Johnen and S Tixeuil. Route preserving stabilization. Technical Report 1353, LRI, Université Paris-Sud XI, 2003. 195

    Google Scholar 

  13. R Perlman. Interconnexion Networks. Addison Wesley, 2000. 184, 185

    Google Scholar 

  14. G Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994. 195

    Google Scholar 

  15. G Varghese and M Jayaram. The fault span of crash failures. Journal of the Association of the Computing Machinery, 47(2):244–293, 2000. 185

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France

    Colette Johnen & Sébastien Tixeuil

  2. Équipe Grand Large, INRIA Futurs, France

    Sébastien Tixeuil

Authors
  1. Colette Johnen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sébastien Tixeuil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Electrical Engineering and Computer Science, National Central University, Chung-Li, 32054, Taiwan

    Shing-Tsaan Huang

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

    Ted Herman

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johnen, C., Tixeuil, S. (2003). Route Preserving Stabilization. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45032-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40453-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation