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.
Thanks to Grand-Large INRIA-Futurs team for their contributions and thanks to Ubistorage company (www.ubistorage.com) for their contributions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fedak, G., et al.: Xtremweb: A generic global computing system. In: CCGRID2001, workshop on Global Computing on Personal Devices (2001)
Kubiatowicz, J., et al.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of ACM ASPLOS, November 2000, ACM Press, New York (2000)
Wells, C.: The oceanstore archive: Goals, structures, and self-repair. Master’s thesis, University of California, Berkeley (2001)
Chen, Y., et al.: A prototype implementation of archival intermemory. In: Proceedings of the Fourth ACM International Conference on Digital Libraries, ACM Press, New York (1999)
Druschel, P., Rowstron, A.: PAST: A large-scale, persistent peer-to-peer storage utility. In: Procedings of HOTOS, pp. 75–80 (2001)
Adya, A., et al.: Farsite: Federated, available, and reliable storage for an incompletely trusted environment (2002)
Soyez, O.: Us: Prototype de stockage pair à pair. In: RENPAR 2003, la Colle sur Loup, France, pp. 214–218 (2003)
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of ACM 38, 335–348 (1989)
Weatherspoon, H., Moscovitz, T., Kubiatowicz, J.: Introspective failure analysis: Avoiding correlated failures in peer-to-peer systems. In: Proceedings of International Workshop on Reliable Peer-to-Peer Distributed Systems (2002)
Randriamaro, C., et al.: Data distribution in a peer to peer storage system. In: GP2PC05 2005, UK, Cardiff (May 2005)
Li, J., et al.: Comparing the performance of distributed hash tables under churn (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Soyez, O., Randriamaro, C., Utard, G., Wlazinski, F. (2007). Dynamic Distribution for Data Storage in a P2P Network. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)