Spanders: Distributed spanning expanders

Shlomi Dolev, Nir Tzachar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations


We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. We use folklore results to randomly define an expander graph. Given the randomized nature of our algorithms, a monitoring technique is presented for ensuring the desired results. The monitoring is based on the fact that expanders have a rapid mixing time and the possibility of examining the rapid mixing time by O(nlogn) short (O(log4 n) length) random walks even for non regular expanders. We then employ our results to construct a hierarchical sequence of spanders, each of them an expander spanning the previous one. Such a sequence of spanders may be used to achieve different quality of service assurances in different applications. Several snap-stabilizing algorithms that are used to utilize the monitoring are presented, including reset and token tracing algorithms for message passing systems.

Original languageEnglish
Title of host publicationAPPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing
Number of pages6
StatePublished - 23 Jul 2010
Event25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre, Switzerland
Duration: 22 Mar 201026 Mar 2010

Publication series

NameProceedings of the ACM Symposium on Applied Computing


Conference25th Annual ACM Symposium on Applied Computing, SAC 2010


  • expanders
  • self-orgenization
  • self-stabilization


Dive into the research topics of 'Spanders: Distributed spanning expanders'. Together they form a unique fingerprint.

Cite this