Abstract
The efficiency of a Peer-to-Peer file sharing overlay is measured in terms of the scalability and versatility of its object lookup strategy. In these networks peers carry out distributed query relaying to discover the service providers. Existing lookup mechanisms like flooding and random walks in unstructured P2P overlays create huge communication overhead and increased response time. In this work we propose efficient lookup in unstructured peer-to-peer overlay networks using indexing through querying, distributing indices through queries. Our simulation studies show that by our approach more than 97% of the queries are answered in one hop and the rest in few hops thus reducing the network load. Our approach is efficient in worst case scenarios where contents are distributed over thousands of peers and the overlay network condition is highly dynamic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Saroiu, S., Gummadi, K., Dunn, R., Gribble, S., Levy, H.: An Analysis of Internet Content Delivery Systems. In: Proceedings of the Fifth Symposium on Operating Systems Design and Implementation, USENIX Association, Berkeley, CA, USA, pp. 315–328 (2002)
Gnutella Protocol Specification Version 0.4, http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf
Kazaa, http://www.kazaa.com
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. In: Proceedings of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication (SIGCOMM), pp. 161–172. ACM Press, New York (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking 11, 17–32 (2003)
Rowstron, A., Druschel, P.: 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), London, pp. 329–350. Springer, Heidelberg (2001)
Yang, B., Patrick, V., Garcia-Molina, H.: Evaluating GUESS and Non-Forwarding Peer-to-Peer Search. In: Proceedings of IEEE 24th International Conference on Distributed Computing Systems (ICDCS), pp. 209–218. IEEE Computer Society, Washington (2004)
Bloom, B.H.: Space/time trade offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), p. 5. IEEE Computer Society, Washington (2002)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), pp. 23–32. IEEE Computer Society, Washington (2002)
Sean, C.R., Kubiatowicz, J.: Probabilistic location and routing. In: Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), pp. 1248–1257. IEEE Computer Society, Washington (2002)
Zhang, R., Hu, Y.C.: Assisted Peer-to-Peer Search with Partial Indexing. IEEE Transactions on Parallel and Distributed Systems 18, 1146–1158 (2007)
Praveen, K., Srividya, G., Sridhar, V.: Multi-attribute Based Similar Content Indexing in Hybrid Peer-to-Peer Networks. In: Proceedings of the International conference on Networking and Services (ICNS), p. 25. IEEE Computer Society, Los Alamitos (2006)
Peng, G., Jun, W., Hailong, C.: ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems. In: Proceedings of the 2007 International Conference on Parallel Processing (ICPP), p. 8. IEEE Computer Sociey, Wasinghton (2007)
Tang, C., Dwarkadas, S.: Hybrid global-local indexing for efficient peer-to-peer information retrieval. In: Proceedings of the 1st Symposium on Networked Systems Design and Implementation, USENIX Association Berkeley, CA, USA, p. 16 (2004)
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison Wesley Longman, Boston (1999)
Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. ACM SIGOPS Operating Systems Review 37, 314–329 (2003)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking (MMCN) (2002)
Fan, L., cao, P., Almeida, J., broder, A.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. IEEE/ACM Transactions on Networking 8, 281–293 (2000)
Gnutella protocol 0.6, http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to Model an Internetwork. In: Proceedings of Fifteenth Annual Joint Conference of the IEEE Computer Societies, pp. 594–602. IEEE Computer Society, New York (1996)
Chu, J., Labonte, K., Levine, B.: Availability and Locality Measurements of Peer-to-Peer File Systems. In: Proceedings of SPIE (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haribabu, K., Hota, C., Ylä-Jääski, A. (2008). Indexing through Querying in Unstructured Peer-to-Peer Overlay Networks. In: Ma, Y., Choi, D., Ata, S. (eds) Challenges for Next Generation Network Operations and Service Management. APNOMS 2008. Lecture Notes in Computer Science, vol 5297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88623-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-88623-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88622-8
Online ISBN: 978-3-540-88623-5
eBook Packages: Computer ScienceComputer Science (R0)