Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Data distribution in a peer to peer storage system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

This article presents a data distribution algorithm for data storage in a P2P storage system, named Us. One of the Us aims is data durability. For scalability, data are distributing on thin peers using the well known Rabin dispersal technique. Unlike other systems such as OceanStore, where data are distributed on server peers, data are distributed on end user peers. In Us, when a peer fails, a reconstruction process rebuilds lost data with help from others peers. In a previous works, we showed that for data durability such system has to face a continuous large number of reconstructions to insure data durability. To minimize end user traffic due to the reconstruction process, distribution strategies must take into account a new measure: the maximum disturbance cost of a peer during the reconstruction process. The disturbance cost is indicated by the number of data communications which are requested from a single peer for rebuilding lost data. The main goal of this article is to define algorithm able to dilute the reconstruction process in the system. We show that this problem is similar to an open mathematical problem. Hence a algorithm is defined in order to distribute data and minimize the maximum disturbance cost for each peer. Finally, toe show that our distribution algorithm is close to the non-constructive theoretical optimal distribution.

Published in:

Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on  (Volume:1 )

Date of Conference:

9-12 May 2005