Spanders: Distributed spanning expanders

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1309-1314

  Dolev, Shlomi ^a   Tzachar, Nir ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

expanders; self orgenization; self stabilization

Indexed keywords

EXPANDER GRAPHS; HIERARCHICAL SEQUENCES; MESSAGE PASSING SYSTEMS; MONITORING TECHNIQUES; RANDOM WALK; RAPID MIXING; SELF ORGANIZING; SELF-STABILIZATION; TRACING ALGORITHM;

MESSAGE PASSING; QUALITY OF SERVICE; STABILIZATION;

ALGORITHMS;

EID: 77954718028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774369     Document Type: Conference Paper

References (23)

1. Alon, N., private communications.
2. Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M. R. "Many Random Walks Are Faster Than One", SPAA 2008, pp. 119-128.
3. Arora, A., Dolev, S., and Gouda, G. M., "Maintaining Digital Clocks in Step", Parallel Processing Letters, Vol. 1, No. 1, pp. 11-18, 1991.
4. Arora, A. and Nesterenko, M., "Unifying stabilization and termination in message-passing systems", Distributed Computing, Vol. 17, No. 3, pp. 279-290, 2005. (Pubitemid 40496314)
5. Awan, A., Ferreira A., R., Jagannathan, S. and Grama, A., "Distributed Uniform Sampling in Real-World Networks". Purdue University, CSD Technical report CSD-TR-04-029.
6. Awerbuch, B., Varghese, G. "Distributed program checking: a paradigm for building self-stabilizing distributed protocols". FOCS 1991.
7. Cournier, A., Datta, A., Petit, F., and Villain, V,. "Enabling snap-stabilization," ICDCS, pp. 12-19, 2003.
8. Fan R. K. C., "Spectral Graph Theory", Providence, RI: American Mathematical Society. ISSN 0160-7642; no 92.
9. Czumaj, A., Sohler, C., "Testing Expansion in Bounded-Degree Graphs", FOCS pp. 570-578, 2007.
10. Dolev, S., Self-stabilization, MIT Press, 2000.
11. Diaconis, P., Stroock, D., "Geometric Bounds for Eigenvalues of Markov Chains", the Annals of Applied Probability, Vol. 1, No. 1(Feb., 1991), pp 36-61.
12. Dolev S., Tzachar N., "EMPIRE OF COLONIES: Self-stabilizing and Self-organizing Distributed Algorithms". Theoretical Computer Science, 410 (6-7), pp. 514-532, 2009.
13. Dolev S., Tzachar N., "SPANDERS: Distributed Spanning Expanders", Technical report #08-02, Ben Gurion University, October 2007, https://www.cs.bgu.ac.il/~frankel/TechRep/pdfs/TR-08-02.pdf.
14. Behrends. E., "Introduction to Markov Chains, with special emphasis on rapid mixing", Veiweg, 2000.
15. Goldreich, O., Ron, D., "On Testing Expansion in Bounded-Degree Graphs", ECCC, 2000.
16. Hoory, S., Linial, N., Wigderson, A., "Expander Graphs and Their Applications", American Mathematical Society, 43 (2006) pp. 439-561.
17. King, V., Saia, J., "Choosing a Random Peer", PODC, pp. 125-130, 2004.
18. Law, C., Siu, K.-Y., "Distributed construction of random expander networks", INFOCOM 2003 vol.3, pp 2133-2143. April 2003
19. Lamport, L. "Time, clocks, and the ordering of events in a distributed system". Commun. ACM 21, 7 (Jul. 1978), pp. 558-565. (Pubitemid 8615486)
20. Lovász, L., "Random Walks on Graphs: A Survey". Combinatorics, Paul Erdos is Eighty, (eds. D. Mikl'os, V.T.S'os and T. Szonyi) J. Bolyai Math. Soc., Vol. II
21. Motwani R., Raghavan P., "Randomized Algorithms", Chapter 5.3, Cambridge university press, 2006.
22. Reiter, M.K., Samar, A., Wang, C., "Distributed construction of a fault-tolerant network from a tree", SRDS 2005. pp 155-165. October 2005
23. Sinclair, A., "Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow", LATIN, 1992. pp 474-487.