Replica Placement Algorithm based on Peer Availability for P2P Storage Systems

Title
Replica Placement Algorithm based on Peer Availability for P2P Storage Systems
Authors
송규원김수현서대일장성환
Keywords
Peer-to-Peer storage system; replica placement; peer model; availability; BitTorrent
Issue Date
2010-06
Publisher
International Journal On Advances in Networks and Services
Citation
VOL 3, NO 1-2, 230-241
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.
URI
http://pubs.kist.re.kr/handle/201004/37938
ISSN
1942-2644
Appears in Collections:
KIST Publication > Article
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE