Abstract
Successful search and versatile query support are two important requirements for peer-to-peer (P2P) search applications. Replication strategy is an effective approach to improve the search performance of unstructured P2P systems. However, existing replication strategies either adapt only to popular queries or incur excessive replication cost for unpopular queries. In this work, we propose HRS, a hybrid replication strategy to improve the search performance of unstructured P2P networks. By combining a query popularity independent strategy with the square-root strategy, HRS can effectively and efficiently handle both kind of queries, popular or not. We evaluate this design through mathematical proof and comprehensive simulations. Results show that HRS outperforms existing replication-based search paradigms in terms of search performance and resource consummation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang, X.: Location-aware topology matching in p2p systems. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China. IEEE, Los Alamitos (2004)
Cao, J., Liu, F.B., Xu, C.Z.: P2pgrid: integrating p2p networks into the grid environment. Concurr. Comput. Pract. Exper. 19(7), 1023–1046 (2007)
Li, M., Lee, W.C., Sivasubramaniam, A.: Semantic small world: An overlay network for peer-to-peer search. In: Proceedings of IEEE ICNP 2004, Washington, DC, USA, pp. 228–238. IEEE Computer Society Press, Los Alamitos (2004)
Saroiu, S., Gummadi, K., Gribble, S.: Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems Journal 9(2), 170–184 (2003)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, pp. 407–418. ACM, New York (2003)
Morris, J.C.: Distriwiki: a distributed peer-to-peer wiki network. In: Proceedings of ACM ISW 2007, Quebec, Canada, pp. 69–74. ACM, New York (2007)
Urdaneta, G., Pierre, G., Steen, M.v.: A decentralized wiki engine for collaborative wikipedia hosting. In: Proceedings of WEBIST 2007, Barcelona, Spain, pp. 855–858. Springer, Heidelberg (2007)
Chen, H., Jin, H., Wang, J., Liu, Y., Ni, L.M.: Efficient multi-keyword search over p2p web. In: Proceedings of ACM WWW 2008, Beijing, China, pp. 989–997. ACM, New York (2008)
Deshpande, M., Amit, A., Chang, M., Venkatasubramanian, N., Mehrotra, S.: Flashback: A peer-to-peer web server for flash crowds. In: Proceedings of IEEE ICDCS 2007, Toronto, Ontario, Canada, p. 15. IEEE, Los Alamitos (2007)
Chamberlin, D.: Xquery: a query language for XML. In: Proceedings of ACM SIGMOD 2003, San Diego, California, USA, p. 682. ACM, New York (2003)
Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proceedings of ACM SIGCOMM 2002, Pittsburgh, PA, USA, pp. 177–190. ACM, New York (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM 2001, San Diego, California, USA, pp. 149–160. ACM, New York (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001, San Francisco, California, USA, pp. 161–172. ACM, New York (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)
Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The case for a hybrid p2p search infrastructure. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 141–150. Springer, Heidelberg (2005)
Chen, H., Jin, H., Liu, Y., Ni, L.M.: Difficulty-aware hybrid search in peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems (TPDS) (2008)
Zaharia, M., Keshav, S.: Gossip-based search selection in hybrid peer-to-peer networks. In: Proceedings of IPTPS 2006, Santa Barbara, CA, USA (2006)
Li, J., Loo, B.T., Hellerstein, J., Kaashoek, F., Karger, D.R., Morris, R.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 207–215. Springer, Heidelberg (2003)
Ferreira, R.A., Ramanathan, M.K., Awan, A., Grama, A., Jagannathan, S.: Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of P2P 2005, Konstanz, Germany, pp. 165–172. IEEE, Los Alamitos (2005)
Terpstra, W.W., Kangasharju, J., Leng, C., Buchmann, A.P.: Bubblestorm: Resilient, probabilistic, and exhaustive peer-to-peer search. In: Proceedings of ACM SIGCOMM 2007, Kyoto, Japan, pp. 49–60. ACM, New York (2007)
Luo, X., Qin, Z., Han, J., Chen, H.: Dht-assisted probabilistic exhaustive search in unstructured p2p networks. In: Proceedings of IEEE IPDPS 2008, Miami, Florida, USA. IEEE, Los Alamitos (2008)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Massouli, L., Le Merrer, E., Kermarrec, A.M., Ganesh, A.: Peer counting and sampling in overlay networks: Random walk methods. In: Proceedings of ACM PODC 2006, Denver, CO, USA, pp. 123–132. ACM, New York (2006)
Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K., Demers, A.: Decentralized schemes for size estimation in large and dynamic groups. In: Proceedings of IEEE NCA 2005, Cambridge, MA, USA, pp. 41–48. IEEE, Los Alamitos (2005)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of ACM ICS 2002, pp. 84–95. ACM, New York (2002)
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China. IEEE, Los Alamitos (2004)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)
Lovasz, L.: Combinatorics. Paul Erdos is Eighty 2(2), 353–398 (1996)
Awan, A., Ferreira, R.A., Jagannathan, S., Grama, A.: Distributed uniform sampling in unstructured peer-to-peer networks. In: Proceedings of HICSS 2006, Washington, DC, USA, p. 223.3. IEEE, Los Alamitos (2006)
Bar-Yossef, Z., Friedman, R., Kliot, G.: Rawms - random walk based lightweight membership service for wireless ad hoc networks. ACM Trans. Comput. Syst. 26(2), 1–66 (2008)
Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability. In: Oram, A. (ed.) The O’Reilly Peer-to-Peer and Web Services Conference. O’Reilly, Sebastopol (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chen, H., Jin, H., Luo, X., Qin, Z. (2008). HRS: A Hybrid Replication Strategy for Exhaustive P2P Search. In: Cao, J., Li, M., Wu, MY., Chen, J. (eds) Network and Parallel Computing. NPC 2008. Lecture Notes in Computer Science, vol 5245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88140-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-88140-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88139-1
Online ISBN: 978-3-540-88140-7
eBook Packages: Computer ScienceComputer Science (R0)