Skip to main content

When FEC Speed up Data Access in P2P Networks

  • Conference paper
  • First Online:
Protocols and Systems for Interactive Distributed Multimedia (IDMS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2515))

Abstract

Peer to peer (P2P) Network is a high level logical network architecture build over end-user nodes interconnected by a physical network infrastructure. The performance in data access over the P2P networks is one of the main issues because the downloading of data is often the longest phase of P2P usage by end-user. In the present effort, we propose an approach based on Forward Error Correction (FEC) to speed-up data access into P2P networks. The main idea is to use FEC to dilute the information over the peers. This dilution allows a greater and flexible choice among downloadable disseminated parts of the FEC-encoded data and then enhances the speed up of the transfer. A case study illustrates the technique and a performance evaluation shows that for the same amount of information disseminated into the P2P network, this solution is more efficient in terms of data access performance compared to classical file replications.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. K. Aberer, M. Punceva, M. Hauswirth, R. Schmidt, “Improving Data Access in P2P Systems”, IEEE Internet Computing 6,1, pp. 58–67, Jan./Feb. 2002.

    Google Scholar 

  2. J. W. Byers, M. Luby, M. Mitzenmacher, A. Rege, “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, ACM SIGCOMM’ 98, September 2–4, 1998.

    Google Scholar 

  3. J.W. Byers, M. Luby, M. Mitzenmacher, “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads”, in INFOCOM 99, 1999.

    Google Scholar 

  4. Y. Chen, J. Edler, A. Goldberg, A. Goettlieb, S. Sobti, P. Yianilos “Prototype Implementation of Archival Intermemory”, in Proc. of IEEE ICDE, February 1996.

    Google Scholar 

  5. Edonkey2000 Peer-to-peer system, http://www.edonkey2000.com, May 2002

  6. Gnutella Peer-to-peer system, http://www.gnutella.com, May 2002

  7. Li Gong, “Peer-to-Peer Networks in Action”, IEEE Internet Computing, January–February 2002

    Google Scholar 

  8. Kazaa Peer-to-peer system, http://www.kazaa.com, May 2002

  9. Napster Peer-to-peer system, http://www.napster.com, May 2002

  10. D. Patterson, G. Gibson, R. Katz, “A case for redundant arrays of inexpensive disks (RAID).,”, Proceedings of A CM SIGMOD’ 88, 1988.

    Google Scholar 

  11. C. G. Plaxton, R. Rajaraman, A. W. Richa, “Accessing Nearby Copies of Replicated Objects in Distributed Environment”, Proc. ACM Symp. Parallel Algorithms and Architectures, ACM Press, New York, June 1997.

    Google Scholar 

  12. I. S. Reed, G. Solomon, “Polynomial Codes Over Certain Finite Field”, J. SIAM, vol. 8, pp. 300–304, 1960.

    MATH  MathSciNet  Google Scholar 

  13. L. Rizzo, “Effective Erasure Codes for Reliable Computer Communication Protocols”, In Computer Communication Review, April 1997.

    Google Scholar 

  14. P. Rodriguez, A. Kirpal, E. W. Biersack, “Parallel-Access for Mirror Sites in the Internet”, In Proceedings of IEEE/Infocom’2000, Tel-Aviv, Israel. March 2000.

    Google Scholar 

  15. S. Saroiu, P. Gummadi, S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems”, Technical Report, UW-CSE-01-06-02, University of Washington, Department of Computer Science and Engineering, Seattle, WA 98195-2350, July 2001

    Google Scholar 

  16. T. Speakman, D. Farinacci, J. Crowcroft, J. Gemmell, S. Lin, A. Tweedly, D. Leshchiner, M. Luby, N. Bhaskar, R. Edmonstone, K. Morse Johnson, T. Montgomery, L. Rizzo, R. Sumanasekera, L. Vicisano, “PGM Reliable Transport Protocol”, April 2000

    Google Scholar 

  17. H. Weatherspoon, J. D. Kubiatowicz, “Erasure Coding vs. Replication: A Quantitative Comparison”, inProc. ofIPTPS’ 02, March 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lacan, J., Lancérica, L., Dairaine, L. (2002). When FEC Speed up Data Access in P2P Networks. In: Boavida, F., Monteiro, E., Orvalho, J. (eds) Protocols and Systems for Interactive Distributed Multimedia. IDMS 2002. Lecture Notes in Computer Science, vol 2515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36166-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36166-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00169-0

  • Online ISBN: 978-3-540-36166-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics