Distributed construction of random expander networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 2133-2143

  Law, Ching ^a   Siu, Kai Yeung ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHM; HAMILTON CYCLE; HIGH PROBABILITY; LOOKUP SERVICES; NETWORK SIZE; OFFLINE; SPACE REQUIREMENTS;

OVERLAY NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0041472348     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2003.1209234     Document Type: Conference Paper

References (33)

1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content addressable network," in Proceedings of SIGCOMM 2001, Aug. 2001, pp. 161-172.
2. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of SIGCOMM 2001, Aug. 2001, pp. 149-160. (Pubitemid 32981961)
3. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms.
4. B. Y. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," University of California, Berkeley, Tech. Rep. CSD-01-1141, 2001.
5. A. Frieze, M. Jerrum, M. Molloy, R. Robinson, and N. Wormald, "Generating and counting Hamilton cycles in random regular graphs," Journal of Algorithms, vol. 21, no. 1, pp. 176-198, July 1996. (Pubitemid 126411847)
6. A. M. Frieze and L. Zhao, "Optimal construction of edge-disjoint paths in random regular graphs," in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 17-19 1999, pp. 346-355.
7. H. Garmo, "The asymptotic distribution of long cycles in random regular graphs," Random Structures and Algorithms, vol. 15, 1999.
8. M. Krivelevich, B. Sudakov, V. H. Vu, and N. C. Wormald, "Random regular graphs of high degree," Random Structures and Algorithms, vol. 18, 2001.
9. J. Friedman, "On the second eigenvalue and random walks in random d-regular graphs," Combinatorica, vol. 11, pp. 331-362, 1991.
10. M. Harchol-Balter, T. Leighton, and D. Lewin, "Resource discovery in distributed networks," in Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, May 1999.
11. B. Bollobás, Random Graphs, 2nd ed. Cambridge University Press, Sept. 2001.
12. J. Friedman, "A proof of Alon's second eigenvalue conjecture," 2002. [Online]. Available: http://www.math.ubc.ca/~jf/pubs/index.html
13. N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
14. N. Kahale, "Eigenvalues and expansion of regular graphs," vol. 42, no. 5, pp. 1091-1106, Sept. 1995.
15. J. G. Propp and D. B. Wilson, "How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph," J. Algorithms, vol. 27, no. 2, pp. 170-217, May 1998. (Pubitemid 128451148)
16. D. J. Aldous and J. A. Fill, "Reversible Markov chains and random walks on graphs," monograph in preparation.
17. M. Jerrum and A. Sinclair, "The Markov chain Monte Carlo method: an approach to approximate counting and integration," in Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed. PWS Publishing, 1996, pp. 482-520.
18. L. Lovász, "Random walks on graphs: a survey," Combinatorics, Paul Erdos is Eighty (vol. 2), pp. 353-398, 1996.
19. F. M. Gomes and D. C. Sorensen, "ARPACK++: A C++ implementation of ARPACK eigenvalue package." CRPC, Rice University, Houston, TX, Tech. Rep. TR97729, 1997.
20. U. Feige, "A fast randomized LOGSPACE algorithm for graph connectivity," Theoretical Computer Science, vol. 169, no. 2, pp. 147-160, Dec. 1996. (Pubitemid 126413027)
21. D. Gillman, "A Chernoff bound for random walks on expander graphs," SIAM Journal on Computing, vol. 27, no. 4, pp. 1203-1220, Aug. 1998. [Online]. Available: http://epubs.siam.org/sam-bin/dbq/article/26876 (Pubitemid 128689451)
22. D. Aldous, "On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing," Probability in the Engineering and Informational Sciences, vol. 1, pp. 33-46, 1987.
23. A. Frieze and C. McDiarmid, "Algorithmic theory of random graphs," Random Structures & Algorithms, vol. 10, pp. 5-42, 1997.
24. B. McKay and N. C. Wormald, "Uniform generation of random graphs of moderate degree," Journal of Algorithms, vol. 11, pp. 52-67, 1990.
25. A. Steger and N. C. Wormald, "Generating random regular graphs quickly," Combinatorics, Probability and Computing, vol. 8, pp. 377-396, 1999. (Pubitemid 129640093)
26. G. Katona and A. Seress, "Greedy construction of nearly regular graphs," European Journal of Combinatorics, vol. 14, 1993.
27. Farago, Chlamtac, and Basagni, "Virtual path network topology optimization using random graphs," in Proceedings of the 1999 IEEE Computer and Communications Societies Conference on Computer Communications, 1999.
28. A. Srinivasan, K. G. Ramakrishnan, K. Kumaran, M. Aravamudan, and S. Naqvi, "Optimal design of signaling networks for Internet telephony," in Proceedings of the 2000 IEEE Computer and Communications Societies Conference on Computer Communications, Mar. 2000, pp. 688-716.
29. A.-M. Kermarrec, L. Massoulié, and A. Ganesh, "Reliable probabilistic communication in large-scale information dissemination systems," Microsoft Research Cambridge, Tech. Rep. 2000-105, Oct. 2000.
30. P. Eugster, S. Handurukande, R. Guerraoui, A.-M. Kermarrec, and P. Kouznetsov, "Lightweight probabilistic broadcast," in Proceedings of The International Conference on Dependable Systems and Networks, July 2001.
31. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter P2P networks," in Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, Oct. 2001.
32. N. C. Wormald, "The asymptotic connectivity of labelled regular graphs," Journal of Combinatorial Theory (B), vol. 31, pp. 156-167, 1981.
33. S. E. Nikoletseas, K. V Palem, P. G. Spirakis, and M. Yung, "Connectivity properties in random regular graphs with edge faults," International Journal of Foundations of Computer Science, vol. 11, 2000.