Abstract.

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, we show that our distribution algorithm is close to the non-constructive theoretical optimal distribution.

@inproceedings{GP2PC05,
  author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
  title = {Data distribution in a peer to peer storage system},
  booktitle = "GP2PC05 2005, UK, Cardiff",
  month = "May",
  year = "2005",
}