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

Article

Free access

Replication strategies in unstructured peer-to-peer networks

Authors:

Scott ShenkerAuthors Info & Claims

SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 177 - 190

https://doi.org/10.1145/633025.633043

Published: 19 August 2002 Publication History

Abstract

The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind search is to proactively replicate data. We evaluate and compare different replication strategies and reveal interesting structure: Two very common but very different replication strategies - uniform and proportional - yield the same average performance on successful queries, and are in fact worse than any replication strategy which lies between them. The optimal strategy lies between the two and can be achieved by simple distributed algorithms. These fundamental results o.er a new understanding of replication and show that currently deployed replication strategies are far from optimal and that optimal replication is attainable by protocols that resemble existing ones in simplicity and operation.

References

[1]

Boeing proxy logs. http://www.web-caching.com/traces-logs.html.

[2]

Open Source Community. The free network project - rewiring the internet. In http://freenet.sourceforge.net/, 2001.

[3]

Open Source Community. Gnutella. In http://gnutella.wego.com/, 2001.

[4]

KaZaA file sharing network. KaZaA. In http://www.kazaa.com/, 2002.

[5]

Morpheus file sharing system. Morpheus. In http://www.musiccity.com/, 2002.

[6]

Napster Inc. The napster homepage. In http://www.napster.com/, 2001.

[7]

J. Kangasharju, K. W. Ross, and D. A. Turner. Optimal content replication in P2P communities. Manuscript, 2002.

[8]

L. Kleinrock. Queueing Systems, Volume II: Computer Applications. Wiley-Interscience, New York, 1976.

[9]

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 annual ACM International Conference on supercomputing, 2002.

Digital Library

[10]

S. Ratnassamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM'01 Conference, 2001.

Digital Library

[11]

A. Rowstron and P. Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proceedings of SOSP'01, 2001.

Digital Library

[12]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnana. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM'01 Conference, 2001.

Digital Library

[13]

FastTrack Peer-to-Peer technology company. FastTrack. In http://www.fasttrack.nu/, 2001.

[14]

N. H. Vaidya and S. Hameed. Scheduling data broadcast in asymmetric communication environments. ACM/Baltzer Wireless Networks, 5, 1999.

Digital Library

[15]

B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department, 2001.

Digital Library

Cited By

Malak DMutlu FZhang JYeh E(2024)Joint Power Control and Caching for Transmission Delay Minimization in Wireless HetNetsIEEE/ACM Transactions on Networking10.1109/TNET.2023.331967432:2(1477-1492)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3319674
Si Salem TIosifidis GNeglia G(2022)Enabling Long-term Fairness in Dynamic Resource AllocationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35706066:3(1-36)Online publication date: 8-Dec-2022
https://dl.acm.org/doi/10.1145/3570606
Li YSi Salem TNeglia GIoannidis S(2021)Online Caching Networks with Adversarial GuaranteesProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/34910475:3(1-39)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1145/3491047
Show More Cited By

Index Terms

Replication strategies in unstructured peer-to-peer networks

Recommendations

Search and replication in unstructured peer-to-peer networks
ICS '02: Proceedings of the 16th international conference on Supercomputing

Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. However, the flooding-based ...
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 SIGCOMM conference

The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique ...
Search and replication in unstructured peer-to-peer networks
ACM International Conference on Supercomputing 25th Anniversary Volume

Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. However, the flooding-based ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

August 2002

368 pages

ISBN:158113570X

DOI:10.1145/633025

Conference Chairs:
Matt Mathis
Pittsburgh Supercomputing Center
,
Peter Steenkiste
Carnegie Mellon University
,
Program Chairs:
Hari Balakrishnan
Massachusetts Institute of Technology
,
Vern Paxson
ICIR

ACM SIGCOMM Computer Communication Review Volume 32, Issue 4
Proceedings of the 2002 SIGCOMM conference
October 2002
332 pages
ISSN:0146-4833
DOI:10.1145/964725
Issue’s Table of Contents

Copyright © 2002 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM02

Sponsor:

SIGCOMM02: SIGCOMM 2002 Conference

August 19 - 23, 2002

Pennsylvania, Pittsburgh, USA

Acceptance Rates

SIGCOMM '02 Paper Acceptance Rate 25 of 300 submissions, 8%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

538
Total Citations
View Citations
3,106
Total Downloads

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

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Malak DMutlu FZhang JYeh E(2024)Joint Power Control and Caching for Transmission Delay Minimization in Wireless HetNetsIEEE/ACM Transactions on Networking10.1109/TNET.2023.331967432:2(1477-1492)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3319674
Si Salem TIosifidis GNeglia G(2022)Enabling Long-term Fairness in Dynamic Resource AllocationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35706066:3(1-36)Online publication date: 8-Dec-2022
https://dl.acm.org/doi/10.1145/3570606
Li YSi Salem TNeglia GIoannidis S(2021)Online Caching Networks with Adversarial GuaranteesProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/34910475:3(1-39)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1145/3491047
Domingues GMendonça GSilva ELeão RMenasché DRottenstreich ODehghan MTowsley D(2021)The Role of Hysteresis in Caching SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/34505646:1(1-38)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450564
Kadambi SChen JCooper BLomax DRamakrishnan RSilberstein ATam EGarcia-Molina H(2020)Where in the world is my data?Proceedings of the VLDB Endowment10.14778/3402707.34027404:11(1040-1050)Online publication date: 3-Jun-2020
https://dl.acm.org/doi/10.14778/3402707.3402740
Li YIoannidis S(2020)Universally Stable Cache NetworksIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155416(546-555)Online publication date: Jul-2020
https://doi.org/10.1109/INFOCOM41043.2020.9155416
Siham KBelabbas Y(2019)Combination of Scheduling and Dynamic Data Replication for Cloud Computing WorkflowsInternational Journal of Information Retrieval Research10.4018/IJIRR.20191001039:4(23-35)Online publication date: Oct-2019
https://doi.org/10.4018/IJIRR.2019100103
He DJiang JYang GWestphal CPoor VHan Z(2019)Pushing smart caching to the edge with BayCacheProceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services10.1145/3360774.3360823(90-99)Online publication date: 12-Nov-2019
https://dl.acm.org/doi/10.1145/3360774.3360823
Li JZafari FTowsley DLeung KSwami AWolter KKnottenbelt Wvan Hoorn ANambiar MKoziolek H(2018)Joint Data Compression and CachingProceedings of the 2018 ACM/SPEC International Conference on Performance Engineering10.1145/3184407.3184410(229-240)Online publication date: 30-Mar-2018
https://dl.acm.org/doi/10.1145/3184407.3184410
Ioannidis SYeh EYeh EIoannidis S(2018)Adaptive Caching Networks With Optimality GuaranteesIEEE/ACM Transactions on Networking10.1109/TNET.2018.279358126:2(737-750)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2793581
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents