Skip to main content
SpringerLink
Log in

Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4280))

Included in the following conference series:

Abstract

We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining this with previous results concerning failure detectors and resource discovery.

This work is partially funded by the PCRI/INRIA Futurs – Project Grand-Large and ACI Grid (French incentive).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43 (March 1996)

    Google Scholar 

  2. Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of the computing Machinery 17(11), 643–644 (1974)

    MATH  Google Scholar 

  3. Herault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: Self-stabilizing spanning tree algorithm for large scale systems. Technical Report 1457, LRI (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI bat 490, Universite Paris-Sud, 91405 Cedex, Orsay, France

    Thomas Herault, Pierre Lemarinier, Olivier Peres, Laurence Pilard & Joffroy Beauquier

Authors
  1. Thomas Herault
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Lemarinier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier Peres
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Laurence Pilard
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Joffroy Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Nevada Las Vegas,  

    Ajoy K. Datta

  2. LIP6, INRIA-Université Paris 6, France

    Maria Gradinariu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J. (2006). Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49823-0_44

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation