Dynamic distribution for data storage in a P2P network

Authors:
Olivier Soyez;Cyril Randriamaro;Gil Utard;Francis Wlazinski
Affiliations:
INRIA-Futurs, LIFL, Université des Sciences et Technologies de Lille, Villeneuve d'ascq, France;UbiStorage, Pôle Jules Verne, Boves;UbiStorage, Pôle Jules Verne, Boves;LaRIA, Amiens, France
Venue:
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Year:
2007

Citing 6
Cited 0

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
A prototype implementation of archival Intermemory

Proceedings of the fourth ACM conference on Digital libraries
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
XtremWeb: A Generic Global Computing System

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Introspective Failure Analysis: Avoiding Correlated Failures in Peer-to-Peer Systems

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.