SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Randomized algorithms
Self-stabilization
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Construction of a Fault-Tolerant Network from a Tree
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Unifying stabilization and termination in message-passing systems
Distributed Computing
Testing Expansion in Bounded-Degree Graphs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Xheal: localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Physical expander in virtual tree overlay
DISC'11 Proceedings of the 25th international conference on Distributed computing
Journal of the ACM (JACM)
Spanders: Distributed spanning expanders
Science of Computer Programming
| Hi-index | 0.00 |
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.