APRE: A Replication Method for Unstructured P2P Networks

We present APRE, a replication method for structureless Peer-to-Peer overlays. The goal of our method is to achieve real-time replication of even the most sparsely located content relative to demand. APRE adaptively expands or contracts the replica set of an object in order to improve the sharing process and achieve a low load distribution among the providers. To achieve that, it utilizes search knowledge to identify possible replication targets inside query-intensive areas of the overlay. We present detailed simulation results where APRE exhibits both efficiency and robustness relative to the number of requesters and the respective request rates. The scheme proves particularly useful in the event of flash crowds, managing to quickly adapt to sudden surges in load.

[1]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[2]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[3]  Karl Aberer,et al.  Updates in highly unreliable, replicated peer-to-peer systems , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[4]  Josh Cates,et al.  Robust and efficient data management for a distributed hash table , 2003 .

[5]  Theoni Pitoura,et al.  Replication, Load Balancing and Efficient Range Query Processing in DHTs , 2006, EDBT.

[6]  Pablo Rodriguez,et al.  Dynamic parallel access to replicated content in the internet , 2002, TNET.

[7]  Vijay Gopalakrishnan,et al.  Adaptive replication in peer-to-peer systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[8]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM 2001.

[9]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

[10]  Dimitrios Tsoumakos,et al.  AGNO: An Adaptive Group Communication Scheme for Unstructured P2P Networks , 2005, Euro-Par.

[11]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  Mary Baker,et al.  Practical load balancing for content requests in peer-to-peer networks , 2002, Distributed Computing.

[13]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[14]  J. Weiner,et al.  Describing inequality in plant size or fecundity , 2000 .

[15]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[16]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[17]  Mary Baker,et al.  Peer-to-Peer Caching Schemes to Address Flash Crowds , 2002, IPTPS.

[18]  Pascal Felber,et al.  Proactive hot spot avoidance for Web server dependability , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[19]  Dan Rubenstein,et al.  A lightweight, robust P2P system to handle flash crowds , 2002, IEEE Journal on Selected Areas in Communications.

[20]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[21]  W.F. Poon,et al.  Comparison of Data Replication Strategies for Peer-to-Peer Video Streaming , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[22]  Marcel Waldvogel,et al.  Dynamic Replica Management in Distributed Hash Tables , 2003 .

[23]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[24]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[25]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[26]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[27]  Rob Sherwood,et al.  Slurpie: a cooperative bulk data transfer protocol , 2004, IEEE INFOCOM 2004.

[28]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[29]  Jussi Kangasharju,et al.  Secure and resilient peer-to-peer e-mail design and implementation , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).