More Web Proxy on the site http://driver.im/

research-article

Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation

Authors:

Chittaranjan HotaAuthors Info & Claims

ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and Networking

Article No.: 31, Pages 1 - 9

https://doi.org/10.1145/2684464.2684489

Published: 04 January 2015 Publication History

Abstract

The paper proposes an indexing scheme known as Floating Index Caching. In Floating Index caching, queries carry a summarized index of contents of the peers that are on its way. Each node snoops on the queries passing through it. Queries are sent in the network using ether flooding or random-walk methods. When a query arrives at a node, indexes can be further added to the query or existing indexes replaced with new indexes. In this paper, we classify propagation schemes as depth-wise and breadth-wise, combined with flooding and random-walk methods. Through experimental evaluations, we found that Floating Index Caching with random walkers has the best returns as far as index dissemination is considered. Breadth-wise spreading of indexes through random-walk utilized 54% of the query traffic effectively to spread the indexes. This method has spread indexes of 77% of the nodes onto more than 50% of the network.

References

[1]

Napster, 1999. Retrieved on 6th March 2011.

[2]

Seti@home project, 1999. Retrieved 6th March 2011.

[3]

edonkey2000 protocol specification, 2000. Retrieved 6th March 2011.

[4]

Gnutella protocol specification version 0.4, 2000. Retrieved 6th March 2011.

[5]

Kazaa, 2001. Retrieved 6th March 2011.

[6]

Gnutella protocol specification version 0.6, 2002. Retrieved 6th March 2011.

[7]

L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Phys. Rev. E, 64(4):046135, Sep 2001.

[8]

S. Androutsellis-theotokis and D. Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, 36:335--371, 2004.

Digital Library

[9]

B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13:422--426, July 1970.

Digital Library

[10]

J. Buford, H. Yu, and E. Lua. P2P networking and applications. Morgan Kaufmann series in networking. Elsevier/Morgan Kaufmann, 2009.

Digital Library

[11]

H. Chen, H. Jin, X. Luo, Y. Liu, T. Gu, K. Chen, and L. Ni. BloomCast: Efficient and effective full-text retrieval in unstructured p2p networks. IEEE Transactions on Parallel and Distributed Systems, 23(2):232--241, Feb. 2012. 00009.

Digital Library

[12]

J. Chu, K. Labonte, and B. N. Levine. Availability and Locality Measurements of Peer-to-Peer File Systems. In Proc. ITCom: Scalability and Traffic Control in IP Networks II Conference, volume SPIE 4868, pages 310--321, July 2002.

[13]

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In INTERNATIONAL WORKSHOP ON DESIGNING PRIVACY ENHANCING TECHNOLOGIES: DESIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY, pages 46--66. Springer-Verlag New York, Inc., 2001.

Digital Library

[14]

A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), ICDCS '02, pages 23--, Washington, DC, USA, 2002. IEEE Computer Society.

Digital Library

[15]

L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw., 8:281--293, June 2000.

Digital Library

[16]

P. Gu, J. Wang, and H. Cai. Asap: An advertisement-based search algorithm for unstructured peer-to-peer systems. In Parallel Processing, 2007. ICPP 2007. International Conference on, page 8, sept. 2007.

Digital Library

[17]

A. Y.-J. K. Haribabu, Chittaranjan Hota. Indexing through querying in unstructured peer-to-peer overlay networks. In APNOMS'08, pages 102--111, 2008.

Digital Library

[18]

P. Kumar, S. Gopalan, and V. Sridhar. Multi-attribute based similar content indexing in hybrid peer-to-peer networks. In Networking and Services, 2006. ICNS '06. International conference on, page 24, july 2006.

Digital Library

[19]

T. Lin and H. Wang. Search performance analysis in peer-to-peer networks. In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, P2P '03, pages 204--, Washington, DC, USA, 2003. IEEE Computer Society.

Digital Library

[20]

Y. Liu, S. Wu, N. Xiong, J. Park, and M. Zhang. A cache-based search algorithm in unstructured p2p networks. Journal of Intelligent Manufacturing, 23(6):2101--2107, 2012.

Digital Library

[21]

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, pages 84--95, New York, NY, USA, 2002. ACM.

Digital Library

[22]

A. Oram. Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O'Reilly, Mar. 2001.

Digital Library

[23]

J. A. Pouwelse, J. Yang, M. Meulpolder, D. H. Epema, H. J. Sips, G. Smit, and M. Lew. Buddycast: an operational peer-to-peer epidemic protocol stack. In Proc. of the 14th Annual Conf. of the Advanced School for Computing and Imaging, pages 200--205, 2008.

[24]

P. Reynolds and A. Vahdat. Peer-to-peer keyword search: A retrospective. In D. Eyers and K. Schwan, editors, Middleware 2013, volume 8275 of Lecture Notes in Computer Science, pages 485--496. Springer Berlin Heidelberg, 2013.

[25]

S. C. Rhea and J. Kubiatowicz. Probabilistic location and routing. In INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, volume 3, pages 1248--1257, 2002.

[26]

C. Tang and S. Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. In NSDI, pages 211--224, 2004.

Digital Library

[27]

A. S. Tigelaar, D. Hiemstra, and D. Trieschnigg. Search result caching in peer-to-peer information retrieval networks. Springer, 2011.

[28]

B. Yang and H. Garcia-Molina. Improving search in peer-to-peer networks. In Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on, pages 5--14, 2002.

Digital Library

[29]

E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In INFOCOM, pages 594--602, 1996.

Digital Library

[30]

R. Zhang and Y. Hu. Assisted peer-to-peer search with partial indexing. Parallel and Distributed Systems, IEEE Transactions on, 18(8):1146 --1158, aug. 2007.

Digital Library

Cited By

Wang RHajiaghajani FBiswas S(2017)Distributed caching in mobile networks with heterogeneous content demand2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC.2017.7983101(172-178)Online publication date: Jan-2017
https://doi.org/10.1109/CCNC.2017.7983101

Index Terms

Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation
1. Networks
  1. Network architectures

Recommendations

3D P2P overlay over MANETs

We study the challenging problems of the mismatch between the overlay and the physical network and the resilience of the overlay structure in peer-to-peer (P2P) protocols over a mobile ad hoc network (MANET). Existing P2P protocols have used inflexible ...
Characterizing unstructured overlay topologies in modern P2P file-sharing systems

In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is ...
Software Defined Underlay-aware Structured Peer-to-Peer Overlay
ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking

Structured Peer-to-Peer (P2P) overlay networks based on Distributed Hash Table (DHT) provide self-organization and fault tolerance along with good look-up efficiency. This makes them a perfect alternative for designing distributed applications where ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and Networking

January 2015

360 pages

ISBN:9781450329286

DOI:10.1145/2684464

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 January 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICDCN '15

ICDCN '15: International Conference on Distributed Computing and Networking

January 4 - 7, 2015

Goa, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
77
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang RHajiaghajani FBiswas S(2017)Distributed caching in mobile networks with heterogeneous content demand2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC.2017.7983101(172-178)Online publication date: Jan-2017
https://doi.org/10.1109/CCNC.2017.7983101

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents