Abstract
Peer-to-peer (P2P) and Grid computing systems have emerged as popular models aiming at further utilizing Internet information and resources, complementing the available client–server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatch problems between the overlay network and the physical underlying network. The topology mismatch problem brings a great stress in the Internet infrastructure and greatly limits the performance gain from various search or routing techniques in P2P and Grid systems. Aiming at alleviating the mismatch problem and reducing the unnecessary traffic, we have proposed two approaches, adaptive overlay topology optimization (AOTO) and location-aware topology matching (LTM) techniques, to reduce the total traffic cost and average query response time. Both AOTO and LTM are scalable and completely distributed in the sense that they do not require any global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. This paper shows the effectiveness of AOTO and LTM and compares the performance of these two approaches through simulation studies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
“BRITE”, http://www.cs.bu.edu/brite/
“Fasttrack”, http://www.fasttrack.nu
“Gnutella”, http://gnutella.wego.com/
“The Gnutella Protocol Specification 0.6”, http://rfc-gnutella.sourceforge.net
“KaZaA”, http://www.kazaa.com
“NTP: The Network Time Protocol”, http://www.ntp.org/
V. Almeida, A. Bestavros, M. Crovella and A. d. Olivera, “Characterizing Reference Locality in the WWW”, in Proceedings of the IEEE Conference on Parallel and Distributed Information Systems (PDIS), 1996.
L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications”, in Proceedings of IEEE INFOCOM, 1999.
I. Foster and A. Iamnitchi, “On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing”, in Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
B. Krishnamurthy and J. Wang, “Topology Modeling via Cluster Graphs,” in Proceedings of SIGCOMM Internet Measurement Workshop, 2001.
Y. Liu, X. Liu, L. Xiao, L. M. Ni and X. Zhang, “Location-Aware Topology Matching in Unstructured P2P Systems”, in Proceedings of IEEE INFOCOM, 2004.
Y. Liu, L. Xiao and L.M. Ni, “Building a Scalable Bipartite P2P Overlay Network”, in Proceedings of 18th International Parallel and Distributed Processing Symposium (IPDPS), 2004.
Y. Liu, Z. Zhuang, L. Xiao and L.M. Ni, “AOTO: Adaptive Overlay Topology Optimization in Unstructured P2P Systems”, in Proceedings of IEEE GLOBECOM, 2003.
Y. Liu, Z. Zhuang, L. Xiao and L.M. Ni, “A Distributed Approach to Solving Overlay Mismatch Problem”, in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS), 2004.
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 ACM International Conference on Supercomputing, 2002.
E.P. Markatos, “Tracing a Large-Scale Peer-to-Peer System: An Hour in the Life of Gnutella”, in Proceedings of the 2nd IEEE/ACM International Symp. on Cluster Computing and the Grid, 2002.
D.A. Menasce and L. Kanchanapalli, “Probabilistic Scalable P2P Resource Location Services”, ACM SIGMETRICS Performance Evaluation Review, Vol. 30, pp. 48–58, 2002.
V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts”, in Proceedings of ACM SIGCOMM, 2001.
S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks”, in Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS), 2003.
L. Peterson, D. Culler, T. Anderson and T. Roscoe, “A Blueprint for Introducing Disruptive Technology into the Internet”, in Proceedings of HOTNETS, 2002.
S. Ratnasamy, M. Handley, R. Karp and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection”, in Proceedings of IEEE INFOCOM, 2002.
M. Ripeanu, A. Iamnitchi and I. Foster, “Mapping the Gnutella Network”, IEEE Internet Computing, 2002.
Ritter, “Why Gnutella Can’t Scale. No, Really”, http://www.tch.org/gnutella.html
S. Saroiu, P. Gummadi and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems”, in Proceedings of Multimedia Computing and Networking (MMCN), 2002.
S. Saroiu, K.P. Gummadi, R.J. Dunn, S.D. Gribble and H.M. Levy, “An Analysis of Internet Content Delivery Systems”, in Proceedings of the 5th Symposium on Operating Systems Design and Implementation, 2002.
S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks”, in Proceedings of ACM SIGCOMM Internet Measurement Workshop, 2002.
K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability”, http://www2.cs.cmu.edu/~kunwadee/research/p2p/gnutella.html
M. Waldvogel and R. Rinaldi, “Efficient Topology-Aware Overlay Network”, in Proceedings of ACM HotNets, 2002.
Z. Xu, C. Tang and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State”, in Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), 2003.
B. Yang and H. Garcia-Molina, “Efficient Search in Peer-to-Peer Networks”, in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), 2002.
Z. Zhuang, Y. Liu, L. Xiao and L.M. Ni, “Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks”, in Proceedings of International Conference on Parallel Processing (ICPP), 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Y., Xiao, L., Ni, L.M. et al. Building Efficient Overlays. J Grid Computing 2, 183–192 (2004). https://doi.org/10.1007/s10723-004-4203-0
Issue Date:
DOI: https://doi.org/10.1007/s10723-004-4203-0