Skip to main content
SpringerLink
Log in

Data Distribution in a Peer to Peer Storage System

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

This article presents distributions for data storage in a P2P system. In peer to peer storage system we have to face a continuous stream of peer failures. So to insure data durability data are usually disseminated using a dispersal redundant scheme and a dynamic data reconstruction process is used to rebuild lost data. There is an important communication traffic to maintain data integrity. So, it is important to reduce the impact of this reconstruction process on peer. 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. To begin with, we define a static distribution scheme which minimizes this reconstruction cost based on prime numbers theory. We compare this distribution with the random distribution, the most used in data distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adya, A., Bolosky, W., Castro, M., Chaiken, R., Cermak, G., Douceur, J., Howell, J., Lorch, J., Theimer, M., Wattenhofer, R.: FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment (2002)

  2. Albert, A., Sandler, R.: An introduction to finite projective planes. In: An Introduction to Finite Projective Planes. New York (1968)

  3. Bruck, R.H, Ryser, H.J., Chowla, S.: The nonexistence of certain finite projective planes. In: Canadian Journal of Mathematics, pp. 88–93. (1949)

  4. Chen, Y., Edler, J., Goldberg, A., Gottlieb, A., Sobti, S., Yianilos, P.: A prototype implementation of archival intermemory. In: Proceedings of the Fourth ACM International Conference on Digital Libraries (1999)

  5. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Workshop on Design Issues in Anonymity and Unobservability, pp. 46–66. (2000)

  6. Druschel, P., Rowstron, A.: PAST: A large-scale, persistent peer-to-peer storage utility. In: Proceedings of HOTOS, pp. 75–80. (2001)

  7. Erdős, P.: On the difference of consecutive primes. QJMOX 6, 124–128 (1935)

    Article  Google Scholar 

  8. Fedak, G., Germain, C., Néri, V., Cappello, F.: XtremWeb : A generic global computing system. In: CCGRID2001, Workshop on Global Computing on Personal Devices (2001)

  9. Tarry, G.: Le problème des 36 officiers. In: Compte Rendu de l’Assoc. Français Avanc. Sci. Naturel, pp. 122–123. (1900)

  10. Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An architecture for global-scale persistent storage. In: Proceedings of ACM ASPLOS (2000)

  11. Lam: The search for a finite projective plane of order 10. In: American Mathematical Monthly, pp. 305–318. (1991)

  12. Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 38, 335–348 (1989)

    Article  MathSciNet  Google Scholar 

  13. Randriamaro, C., Soyez, O., Utard, G.: Us : Prototype de stockage pair à pair. In: Technical report LaRIA 2003-09, Laboratoire de Recherche en Informatique d’Amiens (2003)

  14. Randriamaro, C., Soyez, O., Utard, G., Wlazinski, F.: Data distribution for failure correlation management in a peer to peer storage. In: ISPDC 2005, France, Lille (2005a)

  15. Randriamaro, C., Soyez, O., Utard, G., Wlazinski, F.: Data distribution in a peer to peer storage system. In: GP2PC05 2005, UK, Cardiff (2005b)

  16. Randriamaro, C., Soyez, O., Utard, G., Wlazinski, F.: Data distributions in a peer to peer storage. In: Technical report LaRIA 2006-03, Laboratoire de Recherche en Informatique d’Amiens (2006)

  17. Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: Proceedings of International Conference on Peer-to-Peer Computing (2001)

  18. Schonheim, J.: On maximal systems of k-tuples’. Stud. Sci. Math. Hung., 363–368 (1966)

  19. Soyez, O.: Us : Prototype de stockage pair à pair. In: RENPAR 2003, la Colle sur Loup, France, pp. 214–218. (2003)

  20. Utard, G., Vernois, A.: Data durability in peer to peer storage systems. In: 4th IEEE Workshop on Global and Peer to Peer Computing. Chicago (2004)

  21. Wells, C.: The oceanstore archive: Goals, structures, and self-repair. Master’s thesis, University of California, Berkeley (2001)

Download references

Author information

Authors and Affiliations

  1. LaRIA, 5 rue du moulin neuf, 80000, Amiens, France

    Cyril Randriamaro, Olivier Soyez, Gil Utard & Francis Wlazinski

Authors
  1. Cyril Randriamaro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Soyez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gil Utard
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francis Wlazinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Soyez.

Additional information

This Project (http://www.ustorage.net) is supported by the ACI GRID CGP2P and the ACI MD GDX.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Randriamaro, C., Soyez, O., Utard, G. et al. Data Distribution in a Peer to Peer Storage System. J Grid Computing 4, 311–321 (2006). https://doi.org/10.1007/s10723-006-9038-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-006-9038-4

Key words

Search

Navigation