An Adaptive Probabilistic Replication Method for Unstructured P2P Networks

We present APRE, a replication method for unstructured 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 over 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]  Torsten Grust,et al.  Advances in database technology - EDBT 2006 : 10th International Conference on Extending Database Technology, Munich, Germany, March 2006; proceedings , 2006 .

[2]  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.

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

[4]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

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

[6]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[7]  Dimitrios Tsoumakos,et al.  APRE: A Replication Method for Unstructured P2P Networks , 2006 .

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

[9]  David Mazières,et al.  Democratizing Content Publication with Coral , 2004, NSDI.

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

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

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

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

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

[15]  Balachander Krishnamurthy,et al.  Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites , 2002, WWW.

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

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

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

[19]  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.

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

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

[22]  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..

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