期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：2
页码：551-554
出版社：Shri Pannalal Research Institute of Technolgy
摘要：One among the several emerging distributed computing systems is Peer-to-Peer (P2P) systems that provide a platform for large internet scale distributed applications, with no dedicated infrastructure, develops distributed applications by dividing them across individual systems termed peers which takes the role of both client as well as servers. Popularity of objects in such a system can change rapidly, which demands the need for a rapid and light weight content replication strategy that takes this dynamic popularity changes into consideration. While considering P2P in distributed file sharing applications, data availability in a P2P system, which is highly related to how users select peers to replicate data, has significant impact on system's performance. In addition to optimized availability, the proposed solution should guarantee reduced search and data access latency in worst case. The proposed solution should dynamically adaptable to instantaneous query arrival rate as well as dynamic membership of individual peers. It should provide good performance with reduced number of control messages. Thus an intelligent placement of replicas considering various factors of the system always out perform a random placement of replicas on random peers. This paper discuss various such RPA proposed for structured as well as unstructured P2P and finally compare them and summarized the major outcomes. This paper can enable the readers to choose appropriate replication strategy for their applications.
