Improving P2P Performance by Applying Proper Replica Placement Strategies
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 2
Abstract
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. Index Terms— Peer-to-Peer (P2P) systems, structured P2P, unstructured P2P, replica placement algorithms
Authors and Affiliations
Thara R J , Kala Karun , Shine S
Keywords
Related Articles
- EP ID EP87784
- DOI -
- Views 111
- Downloads 0
Association Rule Mining using Apriori Algorithm: A Survey
— Association rule mining is the most important technique in the field of data mining. Association rule mining finding frequent patterns, associations, correlations, or causal structures among sets of items or obje...
Optimal Design RRC Pulse Shape Polyphase FIR Decimation Filter for Multi-Standard Wireless Transceivers
Pulse Shaping Filters or Root Raised Cosine (RRC) low pass filters emerges as one of the hottest topic in field of Wireless Communication technology. Low pass filters are used for decimation and for interpolation. When...
Bit Error Probability for Wireless Communication by using A Two Level FH-CDMA scheme over Fading Channel
here mainly discussing ‘two-level’ frequency hopping code division multiple –access(FH-CDMA) scheme for wireless communication systems and this scheme provides flexibility in the selection of modulation codes and F...
Grid Density Based Clustering Algorithm
Clustering is the one of the most important task of the data mining. Clustering is the unsupervised method to find the relations between points of dataset into several groups. It can be done by using various types...
Text Extraction From Images
Images and videos on webs and in databases are increasing. It is a pressing task to develop effective methods to manage and retrieve these multimedia resources by their content. Text, which carries high-level seman...