Toward the Next-Generation Peer-to-Peer ServicesView this Special Issue
Research Article | Open Access
Zhan Zhang, Yong Tang, Shigang Chen, Ying Jian, "A Hybrid Query Scheme to Speed Up Queries in Unstructured Peer-to-Peer Networks", Advances in Multimedia, vol. 2007, Article ID 064938, 10 pages, 2007. https://doi.org/10.1155/2007/64938
A Hybrid Query Scheme to Speed Up Queries in Unstructured Peer-to-Peer Networks
Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate resources. However, existing query schemes, for example, flooding, random walks, and interest-based shortcut suffer various problems in reducing communication overhead and in shortening response time. In this paper, we study the possible problems in the existing approaches and propose a new hybrid query scheme, which mixes inter-cluster queries and intracluster queries. Specifically, the proposed scheme works by efficiently locating the clusters, sharing similar interests with intercluster queries, and then exhaustively searching the nodes in the found clusters with intracluster queries. To facilitate the scheme, we propose a clustering algorithm to cluster nodes that share similar interests, and a labeling algorithm to explicitly capture the clusters in the underlying overlays. As demonstrated by extensive simulations, our new query scheme can improve the system performance significantly by achieving a better tradeoff among communication overhead, response time, and ability to locate more resources.
- I. Stoica, R. Morris, and D. Liben-Nowell et al., “Chord: a scalable peer-to-peer lookup protocol for Internet applications,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17–32, 2003.
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '01), pp. 161–172, ACM Press, San Diego, Calif, USA, August 2001.
- 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 Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 41–53, 2004.
- A. I. T. Rowstron and P. Druschel, “Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” in Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware '01), pp. 329–350, Heidelberg, Germany, November 2001.
- C. G. Plaxton, R. Rajaraman, and A. W. Richa, “Accessing nearby copies of replicated objects in a distributed environment,” Theory of Computing Systems, vol. 32, no. 3, pp. 241–280, 1999.
- D. Malkhi, M. Naor, and D. Ratajczak, “Viceroy: a scalable and dynamic emulation of the butterfly,” in Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC '02), pp. 183–192, ACM Press, Monterey, Calif, USA, July 2002.
- A. Kumar, S. Merugu, J. Xu, and X. Yu, “Ulysses: a robust, low-diameter, low-latency peer-to-peer network,” in Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP '03), pp. 258–267, Atlanta, Ga, USA, November 2003.
- 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 (MOBICOM '04), pp. 85–99, Philadelphia, Pa, USA, September-October 2004.
- J. Ritter, 2001, Why Gnutella can't scale. no, really. http://www.darkridge.com/~jpr5/doc/gnutella.html.
- Morpheus, “Morpheus file sharing system,” 2002, http://www.musiccity.com/.
- KaZaA, “Kazaa file sharing network,” 2002, http://www.kazaa.com/.
- Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making gnutella-like P2P systems scalable,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), pp. 407–418, ACM Press, Karlsruhe, Germany, August 2003.
- C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks in peer-to-peer networks,” in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), vol. 1, pp. 120–130, Hong Kong, March 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 International Conference on Supercomputing (ICS '02), pp. 84–95, ACM Press, New York, NY, USA, June 2002.
- K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient content location using interest-based locality in peer-to-peer systems,” in Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '03), vol. 3, pp. 2166–2176, San Francisco, Calif, USA, March-April 2003.
- N. B. Chang and M. Liu, “Optimal controlled flooding search in a large wireless network,” in Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt '05), pp. 229–237, Trentino, Italy, April 2005.
- K. Sripanidkulchai, “The popularity of Gnutella queries and its implications on scalability,” February 2001, http://www.cs.cmu.edu/~kunwadee/research/p2p/gnutella.html.
- C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid search schemes for unstructured peer-to-peer networks,” in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), vol. 3, pp. 1526–1537, Miami, Fla, USA, March 2005.
- A. Iamnitchi, M. Ripeanu, and I. Foster, “Small-world file-sharing communities,” in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), vol. 2, pp. 952–963, Hong Kong, March 2004.
Copyright © 2007 Zhan Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.