Brief announcement: self-stabilizing spanning tree algorithm for large scale systems

Authors:
Thomas Herault;Pierre Lemarinier;Olivier Peres;Laurence Pilard;Joffroy Beauquier
Affiliations:
Universite Paris-Sud, Orsay Cedex, France;Universite Paris-Sud, Orsay Cedex, France;Universite Paris-Sud, Orsay Cedex, France;Universite Paris-Sud, Orsay Cedex, France;Universite Paris-Sud, Orsay Cedex, France
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 2
Cited 4

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control

Communications of the ACM

Tiara: A Self-stabilizing Deterministic Skip List

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Corona: a stabilizing deterministic message-passing skip list

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Tiara: A self-stabilizing deterministic skip list and skip graph

Theoretical Computer Science
Corona: A stabilizing deterministic message-passing skip list

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.