Peer-to-peer networks based on random transformations of connected regular undirected graphs

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 155-164

  Mahlmann, Peter ^a   Schindelhauer, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Distributed Algorithms; Expander Graphs; Peer to peer Networks; Random Graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY DISTRIBUTIONS;

EXPANDER GRAPHS; PEER-TO-PEER (P2P) NETWORKS; RANDOM GRAPHS;

TELECOMMUNICATION NETWORKS;

EID: 32144447446     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073992     Document Type: Conference Paper

References (21)

1. G. Barnes and U. Feige. Short random walks on graphs. In STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 728-737. ACM Press, 1993.
2. B. Bollobas. Random graphs. Combinatorics, 52:80-102, 1981.
3. B. Bollobas. The isoperimetric number of a random graph. European Journal of Combinatorics, 9:241-244, 1988.
4. C. Cooper, M. Dyer, and C. Greenhill. On markov chains for random regular graphs, 2005. Unpublished Draft.
5. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, volume 1, pages 120-130, Mar. 2004.
6. Gnutella. The gnutella protocol specification v0.4.
7. M. Jerrum and A. Sinclair. Fast uniform generation of regular graphs. Theoretical Computer Science, 73(1):91-100, 1990.
8. M. A. Jovanovic, F. S. Annexstein, and K. A. Berman. Scalability issues in large peer-to-peer networks - a case study of Gnutella. Technical report, University of Cincinnati, 2001.
9. M. Kim and M. Medard. Robustness in large-scale random networks. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, volume 4, pages 2364-2373, Mar. 2004.
10. M. Kim, M. Medard, and E. A. M. Torres. On reliability of large-scale random networks. Submitted to IEEE/ACM Transactions on Networking, 2005.
11. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, volume 3, pages 2133-2143, Mar. 2003.
12. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In Proceedings of the twenty-first Annual Symposium on Principles of Distributed Computing (PODC-02), pages 233-242, New York, July 21-24 2002. ACM Press.
13. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty, 2:353-398, 1996.
14. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS '02: Proceedings of the 16th international conference on Supercomputing, pages 84-95. ACM Press, 2002.
15. B. D. McKay. Subgraphs of random graphs with specified degrees. Congressus Numerantium, 33:213-223, 1981.
16. B. D. McKay and N. C. Wormald. Uniform generation of random regular graphs of moderate degree. Journal of Algorithms, 11:52-67, 1990.
17. L. Page. PageRank: Bringing order to the web. Stanford Digital Libraries Working Paper 1997-0072, Stanford University, 1997.
18. A. Steger and N. C. Wormald. Generating random regular graphs quickly. Combinatorics, Probability and Computing, 8:377-396, 1999.
19. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In R. Guerin, editor, Proceedings of the ACM SIGCOMM 2001 Conference (SIGCOMM-01), volume 31, 4 of Computer Communication Review, pages 149-160, New York, Aug. 27-31 2001. ACM Press.
20. N. C. Wormald. The asymptotic connectivity of labelled regular graphs. Journal of Combinatorial Theory, Series B, 31 (2): 156-167, 1981.
21. N. C. Wormald. Models of random regular graphs. In Surveys in Combinatorics, 1993, Walker (Ed.), London Mathematical Society Lecture Note Series 187, Cambridge University Press. 1999.