Home // International Journal On Advances in Networks and Services, volume 3, numbers 1 and 2, 2010 // View article

Replica Placement Algorithm based on Peer Availability for P2P Storage Systems

Authors:
Gyuwon Song
Suhyun Kim
Daeil Seo
Sunghwan Jang

Keywords: Peer-to-Peer storage system, replica placement, peer model, availability, BitTorrent

Abstract:
Peer-to-peer (P2P) technology is an emerging approach to overcoming the limitations of the traditional client server architecture. However, building a highly available P2P system is quite challenging, in particular a P2P storage system. The reason is due to the fundamental nature of P2P systems: peers can join and leave at any time without any notice. Replication is one of the strategies in overcoming the unpredictable behavior of peers. A good replication algorithm should use the minimum number of replicas to provide the desired availability of data. The popular approach in the previous studies is a random placement of replicas, but it ignores the wide difference in the availability of each peer. In this paper, we propose PAT (Peer Availability Table) in order to analyze and predict the state of nodes and develop a replica placement algorithm, which exploits the availability pattern of each individual peer. By comparing our algorithm with a random placement scheme, we show that our algorithm dramatically improves the data availability with moderate overhead in terms of memory consumption and processing time in both ideal and practical conditions. Additionally, we demonstrate the application of PAT as an analysis tool for various P2P systems.

Pages: 237 to 248

Copyright: Copyright (c) to authors, 2010. Used with permission.

Publication date: September 5, 2010

Published in: journal

ISSN: 1942-2644