Abstract.

This article presents a dynamic method for data storage for a P2P system.
In our system (named Us), peers are arranged in groups called Metapeers to deal with account failure correlation.
To minimize end user traffic according to the reconstruction process, distribution must take into account a new measure: the maximum disturbance cost of a peer.
The main goal of this article is to give theoretical results to be able to define algorithms that deal with failure correlation,  that minimize the disturbance cost of a peer and that dilute dynamically the reconstruction process in the system.

@inproceedings{GP2PC05,
 author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
 title = {Data distribution for failure correlation management in a peer to peer storage system},
 booktitle = "ISPDC 2005, France, Lille",
 month = "September",
 year = "2005",
}