Dynamic distribution for data storage in a P2P network
2007
This article presents a dynamic data distribution method for data storage in a P2P network. In our system named Us (Ubiquitous storage), 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. In a previous work, we defined a static distribution scheme which minimizes this reconstruction cost derivated from affine plan theory. In this paper we extend this distribution scheme to deal with the dynamic behaviour of peer to peer systems.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
1
Citations
NaN
KQI