Recent Replica Placement Algorithms in P2P Networks - A Review

Peer-to-Peer (P2P) systems provide a platform for large internet scale distributed applications with no dedicated infrastructure. In P2P systems, applications are developed by dividing them across individual systems termed peers which take the role of both client as well as server. Popularity of objects in such a system can change rapidly, which demands the need for a rapid and light weight content replication strategy which considers this dynamic popularity changes. While considering P2P in distributed file sharing applications, data availability has significant impact on the system's performance. In addition to optimized availability, the replica placement should guarantee reduced search and data access latency. It should be dynamically adaptable to instantaneous query arrival rate as well as dynamic membership of individual peers. Also, it should provide good performance with reduced number of control messages. Thus an intelligent placement of replicas considering various factors of the system always outperforms a random placement of replicas on random peers. This paper reviews and compares various recent replica placement algorithms for structured as well as unstructured P2P networks.

[1]  Mohamed Hefeeda,et al.  Traffic modeling and proportional partial caching for peer-to-peer systems , 2008, TNET.

[2]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[3]  Laxmi N. Bhuyan,et al.  An effective pointer replication algorithm in P2P networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[4]  Kate Ching-Ju Lin,et al.  Bandwidth-Aware Replica Placement for Peer-to-Peer Storage Systems , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[5]  Ming Tang,et al.  Dynamic replication algorithms for the multi-tier Data Grid , 2005, Future Gener. Comput. Syst..

[6]  Jianliang Xu,et al.  On replica placement for QoS-aware content distribution , 2004, IEEE INFOCOM 2004.

[7]  P. Golda Jeyasheeli,et al.  Cost effective file replication in P2P file sharing systems , 2012, 2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET).

[8]  Jun Li,et al.  A k-coordinated decentralized replica placement algorithm for the ring-based CDN-P2P architecture , 2010, The IEEE symposium on Computers and Communications.

[9]  Bin Liu,et al.  Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[10]  Krzysztof Rzadca,et al.  Replica Placement in P2P Storage: Complexity and Game Theoretic Analyses , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[11]  Daeil Seo,et al.  Replica Placement Algorithm for Highly Available Peer-to-Peer Storage Systems , 2009, 2009 First International Conference on Advances in P2P Systems.

[12]  Dimitrios Gunopulos,et al.  Approximating Aggregation Queries in Peer-to-Peer Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[13]  Jun Li,et al.  A Replica Placement Algorithm for Hybrid CDN-P2P Architecture , 2009, 2009 15th International Conference on Parallel and Distributed Systems.