Distributed random digraph transformations for peer-to-peer networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 308-317

  Mahlmann, Peter ^a   Schindelhauer, Christian ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

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

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

DISTRIBUTED ALGORITHMS; EXPANDER GRAPHS; PEER TO PEER NETWORKS; RANDOM GRAPHS;

COMPUTER NETWORKS;

EID: 33749542316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148162     Document Type: Conference Paper

References (18)

1. S. M. Botros and S. R. Waterhouse. Search in jxta and other distributed networks. In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001), pages 30-35, 2001.
2. C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 980-988, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
3. T. Feder, A. Guetz, M. Mihail, and A. Saberi. The flip markov chain and peer-to-peer networks. http://www.stanford.edu/~saberi/switch.pdf, 2006.
4. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE INFOCOM 2004- Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 2004.
5. Gnutella. The gnutella protocol specification vO.4.
6. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distribted object location in a dynamic network. In Proceedings of the fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-02), pages 41-52, New York, Aug. 10-13 2002. ACM Press.
7. M. A. Jovanovic, F. S. Annexstein, and K. A. Herman. Scalability issues in large peer-to-peer networks -a case study of Gnutella. Technical report, University of Cincinnati, 2001.
8. M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), pages 98-107, 2003.
9. M. Kim and M. Medard. Robustness in large-scale random networks. In IEEE INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 2004.
10. M. Kim, M. Medard, and E. A. M. Torres. On reliability of large-scale random networks. http://web.mit.edu/minkyu/www/doc/ToNsubmitted.pdf, 2005.
11. 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, New York, NY, USA, 2002. ACM Press.
12. P. Mahlmann and C. Schindelhauer. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In SPAA '05: Proceedings of the seventeenth annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 155-164, New York, NY, USA, 2005. ACM Press.
13. M. Naor and U. Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In SPAA '03: Proceedings of the fifteenth annual ACM Symposium on Parallel Algorithms and Architectures, pages 50-59, New York, NY, USA, 2003. ACM Press.
14. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter p2p networks. In FOCS '01: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 492, Washington, DC, USA, 2001. IEEE Computer Society.
15. M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. In Proceedings of the 1st International Conference on Peer-to-Peer Computing (P2P 2001), pages 99-100, 2001.
16. J. Ritter. Why gnutella can't scale. http://www.darkridge.com/~jpr5/doc/ gnutella.html, 2001.
17. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnari. 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.
18. 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.