Improving search using a fault-tolerant overlay in unstructured P2P systems

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2007, Pages

  Acosta, William ^a   Chandra, Surendar ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

P2P and ubiquitous computing

Indexed keywords

BANDWIDTH CONSUMPTION; BLOOM FILTERING; FAULT-TOLERANT; GNUTELLA; INTERNATIONAL CONFERENCES; LOCAL INFORMATION; MESSAGE ROUTING; P2P SYSTEMS; PARALLEL PROCESSING; RANDOMLY DISTRIBUTED; ROUTE MESSAGES; SEARCH PERFORMANCE; STRUCTURED P2P SYSTEMS; TRAFFIC TRACES;

BANDWIDTH; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEMS; TOPOLOGY;

TELECOMMUNICATION SYSTEMS;

EID: 47249151025     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.48     Document Type: Conference Paper

References (32)

1. W. Acosta and S. Chandra. Trace driven analysis of the long term evolution of gnutella peer-to-peer traffic. In Proceedings of the Passive and Active Measurment Conference (PAM'07), 2007.
2. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review E, 64, 2001.
3. N. Alon. Eigenvalues and expanders. Combinatorica, (6):83-96, 1986.
4. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
5. M. Castro, M. Costa, and A. Rowstron. Should we build gnutella on a structured overlay? In Proceedings from the 2nd Workshop on Hot Topics in Networks (HotNets-II), 2003.
6. N. Chang and M. Liu. Revisiting the ttl-based controlled flooding search: optimality and randomization. In Proceedings of the 10th annual international conference on Mobile computing and networking, pages 85-99. ACM Press, 2004.
7. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 407-418. ACM Press, 2003.
8. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
9. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenkcr, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 1-12, New York, NY, USA, 1987. ACM Press.
10. M. Fiedler. Algebraic connectivity of graphs. Czech. Math J., 23:298-305, 1973.
11. A. Frangiono and S. S. Capizzano. Spectral analysis of (sequences of) graph matrices. SIAM Journal of Matrix Analysis and Applications, 23(2):339-348, 2001.
12. A. M. Frieze. Edge-disjoint paths in expander graphs. SIAM Journal on Computing, 30(6):1790-1801, 2001.
13. A. M. Frieze and L. Zhao. Optimal construction of edge-disjoint paths in random regular graphs. Combinatorics, Probability and Computing, 9(3):241-263, May 2000.
14. Gnutella protocol v0.4. http://dss.clip2.com/GnutellaProtocol04.pdf.
15. Gnutella protocol v0.6. http://rfc-gnutella.sourceforge.net/src/rfc-0_6- draft.html.
16. N. Kahale. Eigenvalues and expansion of regular graphs. Journal of the ACM, 42(5):1091-1106, 1995.
17. J. H. Kim and V. H. Vu. Generating random regular graphs. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 213-222. ACM Press, 2003.
18. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In IEEE INFOCOM, 2003.
19. C. Lindemann and O. P. Waldhorst. Exploiting epidemic data dissemination for consistent lookup operations in mobile applications. SIGMOBILE Mob. Comput. Commun. Rev., 8(3):44-56, 2004.
20. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th international conference on Supercomputing, pages 84-95. ACM Press, 2002.
21. P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In IPTPS '02: 1st International Workshop on Peer-to-Peer Systems, 2002.
22. Overnet. http://www.overnet.org/.
23. Y. Qiao and F. E. Bustamante. Structured and unstructured overlays under the microscope - a measurement-based view of two p2p systems that people use. In Proceedings of the USENIX Annual Technical Conference, 2006.
24. A. H. Rasti, D. Stutzbach, and R. Rejaie. On the long-term evolution of the two-tier gnutella overlay. In IEEE Golbal Internet, 2006.
25. S. C. Rhea and J. Kubiatowicz. Probilistic location and routing. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), June 2002.
26. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 6(1), 2002.
27. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.
28. J. Stribling. Planetlab all pair ping data. http://www.pdos.lcs.mit.edu/ ~strib/pl_app/.
29. D. Stutzbach, R. Rejaie, and S. Sen. Characterizing unstructured overlay topologies in modern p2p file-sharing systems. IEEE/ACM Transactions on Networking, 2007.
30. W. Vogels, R. van Renesse, and K. Birman. The power of epidemics: Robust communication for large-scale distributed systems, 2003.
31. D. Vukadinovic, P. Huang, and T. Erlebach. On the spectrum and structure of internet topology graphs. In In proceedings of Innovative Internet Community Systems (I2CS), Khlungsborn, Germany, June 2002.
32. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE Infocom, volume 2, pages 594-602, San Francisco, CA, March 1996. IEEE.