Skip to main content
SpringerLink
Log in

A Comparative Study of Rateless Codes for P2P Persistent Storage

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6366))

Included in the following conference series:

  • 623 Accesses

Abstract

This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communication channels having an unbounded loss rate. They are therefore very well suited to peer-to-peer systems. This evaluation targets two goals. First, it compares the performance of both codes in different adversarial environments and in different application contexts. Second, it helps understanding how the parameters driving the behavior of the coding impact its complexity. To the best of our knowledge, this is the first comprehensive study facilitating application designers in setting the optimal values for the coding parameters to best fit their P2P context.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Anceaume, E., Brasiliero, F., Ludinard, R., Ravoaja, A.: Peercube: an hypercube-based p2p overlay robust against collusion and churn. In: Proceedings of the IEEE International Conference on Self Autonomous and Self Organising Systems, SASO (2008)

    Google Scholar 

  2. Bhagwan, R., Tati, K., Cheng, Y.C., Savage, S., Voelker, G.M.: Total Recall: System support for automated availability management. In: Proceedings of the USENIX Association Conference on Symposium on Networked Systems Design and Implementation, NSDI (2004)

    Google Scholar 

  3. Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803–814. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Houri, Y., Jobmann, M., Fuhrmann, T.: Self-organized data redundancy management for peer-to-peer storage systems. In: Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems (IWSOS). Springer, Heidelberg (2009)

    Google Scholar 

  5. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Wells, C., et al.: OceanStore: an architecture for global-scale persistent storage. In: ACM SIGARCH Computer Architecture, pp. 190–201 (2000)

    Google Scholar 

  6. Luby, M.: LT codes. In: Proceedings of the IEEE International Symposium on Foundations of Computer Science, SFCS (2002)

    Google Scholar 

  7. Maymounkov, P.: Online codes. Research Report TR2002-833, New York University (2002)

    Google Scholar 

  8. Ribeiro, H.B., Anceaume, E.: DataCube: a P2P persistent storage architecture based on hybrid redundancy schema. In: Proceedings of the IEEE Euromicro International Conference on Parallel, Distributed and Network-Based Computing, PDP (2010)

    Google Scholar 

  9. Ribeiro, H.B., Anceaume, E.: Exploiting Rateless Coding in Structured Overlays to achieve Data Persistence. In: Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, AINA (2010)

    Google Scholar 

  10. Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. ACM SIGOPS Operating System Review 35(5), 188–201 (2001)

    Article  Google Scholar 

  11. Russell, J.S.: Report on waves. In: 14th Meeting of the British Association for the Advancement of Science, pp. 311–390 (1844)

    Google Scholar 

  12. Shokrollahi, A.: Raptor codes. IEEE/ACM Transactions on Networking, 2551–2567 (2006)

    Google Scholar 

  13. Sit, E., Haeberlen, A., Dabek, F., Chun, B.G., Weatherspoon, H., Morris, R., Kaashoek, M.F., Kubiatowicz, J.: Proactive replication for data durability. In: Proceedings of the 5rd International Workshop on Peer-to-Peer Systems, IPTPS 2006 (2006)

    Google Scholar 

  14. Tanner, R.: A recursive approach to low complexity codes. IEEE Transactions on Information Theory 27(5), 533–547 (1981)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA / INRIA, Rennes Bretagne-Atlantique, France

    Heverson B. Ribeiro

  2. IRISA / CNRS UMR 6074, France

    Emmanuelle Anceaume

Authors
  1. Heverson B. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuelle Anceaume
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev,Beer-Sheva, 84105, Israel

    Shlomi Dolev

  2. Department of Computer Science, The University of Texas at Dallas, TX 75083-0688, Richardson, USA

    Jorge Cobb

  3. Department of Computer Science, Yale University, 51 Prospect Street, CT 06511, New Haven, USA

    Michael Fischer

  4. Department of Computer Science, Columbia University, 10027, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ribeiro, H.B., Anceaume, E. (2010). A Comparative Study of Rateless Codes for P2P Persistent Storage. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16023-3_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16022-6

  • Online ISBN: 978-3-642-16023-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation