Abstract
In this paper, we propose a new file search scheme for a three-tier Peer-to-Peer (P2P) architecture. The proposed scheme consists of two parts. The first part determines a way of associating files held by each peer in the bottom layer to subservers in the middle layer, where each subserver plays the same role with the (centralized) server in conventional search engines such as Google and Yahoo!. The second part provides a way of forwarding a query received by the central server in the top layer to an appropriate subserver relevant to the query. The proposed scheme is based on the notion of “tags”, and a technique of priority sequence of tags is introduced to realize a quick forwarding of queries. The result of performance evaluation indicates that the number of tags which must be examined in forwarding a given query is bounded by a small constant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adar, E., Huberman, B.A.: Free Riding on Gnutella. First Monday 5(10) (2000)
Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R.: Looking Up Data in P2P Systems. Communications of the ACM 46(2), 43–48 (2003)
Qin, T.T., Cao, Q., Wei, Q.Y., Fujita, S.: A Hierarchical Architecture for Real-Time File Search in Peer-to-Peer Networks. In:Proc. PDAA, in conjunction with PDCAT09 (December 2009)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A Local Search Mechanism for Peer-to-Peer Networks. In: Proc. CIKM (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ACM SIGMETRICS (2002)
Napster Homepage, http://www.napster.com/
Newman, M.: Power laws, Pareto distributions and Zipf’s law. Contemporary Physics 46, 323–351 (2005)
Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Sotica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM (August 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qin, T., Cao, Q., Wei, Q., Fujita, S. (2010). Quick Forwarding of Queries to Relevant Peers in a Hierarchical P2P File Search System. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13136-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-13136-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13135-6
Online ISBN: 978-3-642-13136-3
eBook Packages: Computer ScienceComputer Science (R0)