Replica Placement Algorithm for Highly Available Peer-to-Peer Storage Systems

Title
Replica Placement Algorithm for Highly Available Peer-to-Peer Storage Systems
Authors
송규원김수현서대일
Keywords
P2P Storage system; Replica placement; Peer model; availability; BitTorrent; Peer-to-Peer storage system
Issue Date
2009-11
Publisher
2009 First International Conference on Advances in P2P Systems
Citation
VOL 1, NO 1, 160-167
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 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.
URI
http://pubs.kist.re.kr/handle/201004/36882
Appears in Collections:
KIST Publication > Conference Paper
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