Resolving the topology mismatch problem in unstructured peer-to-peer networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 20, Issue 11, 2009, Pages 1668-1681

  Hsiao, Hung Chang ^a   Liao, Hao ^a   Huang, Cheng Chyun ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Gnutella; Location awareness; Topology mismatch; Unstructured peer to peer systems

Indexed keywords

COMMUNICATION DELAYS; COMMUNICATION LATENCY; COMMUNICATION PATH; EXTENSIVE SIMULATIONS; GNUTELLA; LOCATION AWARENESS; OVERLAY CONNECTIONS; OVERLAY TOPOLOGIES; P2P NETWORK; PERFORMANCE ANALYSIS; PERFORMANCE METRICS; PERFORMANCE QUALITY; PHYSICAL NETWORK; POLYLOGARITHMIC; TOPOLOGY MATCHING; TOPOLOGY MISMATCH PROBLEM; UNSTRUCTURED PEER-TO-PEER; UNSTRUCTURED PEER-TO-PEER NETWORK; UNSTRUCTURED PEER-TO-PEER SYSTEMS;

CLIENT SERVER COMPUTER SYSTEMS; COMMUNICATION; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; TELECOMMUNICATION NETWORKS;

BROADCASTING;

EID: 70350059301     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2009.24     Document Type: Article

References (40)

1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM, pp. 161-172, Aug. 2001.
2. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, pp. 149-160, Aug. 2001.
3. A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Lecture Notes in Computer Science (LNCS), vol. 2218, pp. 161-172, Nov. 2001.
4. B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
5. Gnutella, http://rfc-gnutella.sourceforge.net/, 2009.
6. M. Ripeanu, I. Foster, and A. Iamnitchi, "Mapping the Gnutella Network," IEEE Internet Computing, vol. 6, no. 1, pp. 50-57, Jan./Feb. 2002.
7. S. Sen and J. Wang, "Analyzing Peer-to-Peer Traffic across Large Networks," IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.
8. Y. Liu, "A Two-Hop Solution to Solving Topology Mismatch," IEEE Trans. Parallel Distribution Systems, vol. 19, no. 11, pp. 1591-1600, Nov. 2008.
9. Y. Liu, L. Xiao, X. Liu, L.M. Ni, and X. Zhang, "Location Awareness in Unstructured Peer-to-Peer Systems," IEEE Trans. Parallel Distributed Systems, vol. 12, no. 2, pp. 163-174, Feb. 2005.
10. Y. Liu, L. Xiao, and L.M. Ni, "Building a Scalable Bipartite P2P Overlay Network," IEEE Trans. Parallel Distributed Systems, vol. 18, no. 9, pp. 1296-1306, Sept. 2007.
11. C. Law and K.-Y. Siu, "Distributed Construction of Random Expander Networks," Proc. IEEE INFOCOM, pp. 2133-2143, Mar. 2003.
12. G. Pandurangan, P. Raghavan, and E. Upfal, "Building Low-Diameter Peer-to-Peer Networks," IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 995-1002, Aug. 2003.
13. M.K. Reiter, A. Samar, and C. Wang, "Distributed Construction of a Fault-Tolerant Network from a Tree," Proc. 24th IEEE Symp. Reliable Distributed Systems (SRDS '05), pp. 155-165, Oct. 2005.
14. X. Zhang, Q. Zhang, Z. Zhang, G. Song, and W. Zhu, "A Construction of Locality-Aware Overlay Network: MOverlay and Its Performance," IEEE J. Selected Areas in Comm., vol. 18, no. 28, pp. 995-1002, Jan. 2004.
15. B. Bollobás, Random Graphs, second ed. Cambridge Univ. Press, 2001.
16. B. Bollobás and W.F. de la Vega, "The Diameter of Random Regular Graphs," Combinatorica, vol. 2, no. 2, pp. 125-134, June 1982.
17. J.M. Kleinberg, "The Small-World Phenomenon: An Algorithm Perspective," Proc. 32nd ACM Ann. Symp. Theory Computing (STOC '00) pp. 163-170, May 2000.
18. S. Milgram, "The Small-World Problem," Psychology Today, vol. 2, pp. 60-67, 1967.
19. D.J. Watts and S.H. Strogatz, "Collective Dynamics of Small-World Networks," Nature, vol. 393, pp. 440-442, June 1998.
20. S. Merugu, S. Srinivasan, and E. Zegura, "Adding Structure to Unstructured Peer-to-Peer Networks: The Use of Small-World Graphs," J. Parallel and Distributed Computing, vol. 65, no. 2, pp. 142-153, Feb. 2005.
21. Y.K. Hui, C.S. Lui, and K.Y. Yau, "Small-World Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd," Computer Networks vol. 50, no. 15, pp. 2727-2746, Oct. 2006.
22. S. Wang, D. Xuan, and W. Zhao, "Analyzing and Enhancing the Resilience of Structured Peer-to-Peer Systems," J. Parallel Distributed Computing, vol. 65, no. 2, pp. 207-219, Feb. 2005.
23. L. Xiao, Y. Liu, and L.M. Ni, "Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment," IEEE Trans. Computers vol. 54, no. 9, pp. 1091-1103, Sept. 2005.
24. S. Jiang, L. Guo, X. Zhang, and H. Wang, "LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search," IEEE Trans. Parallel Distributed Systems, vol. 19, no. 5, pp. 601-614, May 2008.
25. T. Qiu, G. Chen, M. Ye, E. Chan, and B.Y. Zhao, "Towards Location-Aware Topology in Both Unstructured and Structured P2P Systems," Proc. 36th Int'l Conf. Parallel Processing (ICPP '07 ), Sept. 2007.
26. L. Lovász, "Random Walks on Graphs: A Survey," Combinatorics, Paul Erdös Is Eighty, vol. 2, pp. 1-46, 1993.
27. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, 2005.
28. V. King and J. Saia, "Choosing a Random Peer," Proc. 23rd ACM Symp. Principles Distributed Computing (PODC '03), pp. 125-130, July 2004.
29. M. Zhong, K. Shen, and J. Seiferas, "The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks," IEEE Trans. Computers, vol. 57, no. 5, pp. 619-633, May 2008.
30. H. Zhang, A. Goel, and R. Govindan, "Improving Lookup Latency in Distributed Hash Table Systems Using Random Sampling," IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 1121-1134, Oct. 2005.
31. D.R. Karger and M. Ruhl, "Finding Nearest Neighbors in Growth-Restricted Metrics," Proc. 34th ACM Ann. Symp. Theory of Computing (STOC '02), pp. 741-750, May 2002.
32. PlanetLab, http://www.planet-lab.org/, 2009.
33. J.C. Chu, K.S. Labonte, and B.N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," Proc. SPIE - ITCom Conf. Scalability and Traffic Control in IP Networks, pp. 310-321, July 2002.
34. S. Saroiu, P.K. Gummadi, and S.D. Gribble, "Measurement Study of Peer-to-Peer File Sharing Systems," Proc. Ninth SPIE/ACM Conf. Multimedia Computing and Networking (MMCN '02), Jan. 2002.
35. Napster, http://www.napster.com/, 2009.
36. K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, "Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload," Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 314-329, Oct. 2003.
37. E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization Princeton Univ. Press, 2003.
38. S. Jin and H. Jiang, "Novel Approaches to Efficient Flooding Search in Peer-to-Peer Networks," Computer Networks, vol. 51, no. 10, pp. 2818-2832, July 2007.
39. W. Aiello, F.R.K. Chung, and L. Lu, "A Random Graph Model for Massive Graphs," Proc. 32nd ACM Ann. Symp. Theory of Computing (STOC '00) pp. 171-180, May 2000.
40. D. Stutzbach, "The Ion P2P Project: Empirical Characterizations of P2P Systems," http://mirage.cs.uoregon.edu/P2P/info.cgi, 2009.