Abstract
Without assuming any knowledge of the underlying physical topology, the conventional P2P mechanisms are designed to randomly choose logical neighbors, causing a serious topology mismatch problem between the P2P overlay network and the underlying physical network. This mismatch problem incurs a great stress in the Internet infrastructure and adversely restraints the performance gains from the various search or routing techniques. In order to alleviate the mismatch problem, reduce the unnecessary traffic and response time, we propose two schemes, namely, location-aware topology matching (LTM) and scalable bipartite overlay (SBO) techniques. Both LTM and SBO achieve the above goals without bringing any noticeable extra overheads. More-over, both techniques are scalable because the P2P over-lay networks are constructed in a fully distributed manner where global knowledge of the network is not necessary. This paper demonstrates the effectiveness of LTM and SBO, and compares the performance of these two approaches through simulation studies.
Chapter PDF
References
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/
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutellalike P2P Systems Scalable. In: Proceedings of ACM SIGCOMM (2003)
Chu, Y., Rao, S.G., Zhang, H.: A Case for End System Multicast. In: Proceedings of ACM SIGMETRICS (2000)
Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang, X.: Location-Aware Topology Matching in Unstructured P2P Systems. In: Proceedings of IEEE INFOCOM (2004)
Liu, Y., Xiao, L., Ni, L.M.: Building a Scalable Bipartite P2P Overlay Network. In: Proceedings of 18th International Parallel and Distributed Processing Symposium, IPDPS (2004)
Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: A Distributed Approach to Solving Overlay Mismatch Problem. In: Proceedings of the 24th International Conference on Distributed Computing Systems, ICDCS (2004)
Menasce, D.A., Kanchanapalli, L.: Probabilistic Scalable P2P Resource Location Services. ACM SIGMETRICS Performance Evaluation Review 30, 48–58 (2002)
Ripeanu, M., Iamnitchi, A., Foster, I.: Mapping the Gnutella Network. IEEE Internet Computing (2002)
Ritter, Why Gnutella Can’t Scale. No, Really, http://www.tch.org/gnutella.html
Saroiu, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An Analysis of Internet Content Delivery Systems. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (2002)
Sen, S., Wang, J.: Analyzing Peer-to-peer Traffic Across Large Networks. In: Proceedings of ACM SIGCOMM Internet Measurement Workshop (2002)
Wang, C., Xiao, L., Liu, Y., Zheng, P.: Distributed Caching and Adaptive Search in Multilayer P2P Networks. In: Proceedings of the 24th International Conference on Distributed Computing Systems, ICDCS (2004)
Xu, Z., Tang, C., Zhang, Z.: Building Topology-aware Overlays Using Global Soft-state. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Liu, Y., Xiao, L., Ni, L.M., Yang, B. (2004). Efficient Gnutella-like P2P Overlay Construction. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive