Enhancing Peer-to-Peer Parallel Data Access with PeerFecT

  • Laurent Dairaine
  • Laurent Lancérica
  • Jérôme Lacan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2816)


Data access performances over a Peer-to-Peer (P2P) network is a critical issue since downloading time remains the longest phase of P2P usage by end-user. In the present effort, we propose an innovative approach called PeerFecT (Peer-to-peer with Fec dissemination Technique) based on an erasure code, often called Forward Error Correction (FEC) code, to speed-up data access into P2P networks. The main idea is to use the erasure code to dilute the information over the peers. This dilution allows a greater and flexible choice among all the disseminated encoded data and then statistically enhances the overall throughput of the transfer. This paper focus on the performance gain this technique can provide. A performance evaluation based on an original model using the results of a measurement campaign of sequential and parallel downloads in a real P2P network over Internet is presented. The results show that for the same amount of information disseminated into the P2P network, our solution is more efficient compared to classical file replication approaches.


P2P (Peer-to-peer) Erasure codes parallel data access 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aberer, K., Punceva, M., Hauswirth, M., Schmidt, R.: Improving Data Access in P2P Systems. IEEE Internet Computing 6(1), 58–67 (2002)CrossRefGoogle Scholar
  2. 2.
    Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-peer Networks. In: ACM SIGCOMM 2002 (August 2002)Google Scholar
  3. 3.
    Eugene Ng, T.S., Chu, Y., Rao, S., Sripanidkulchai, K., Zhang, H.: Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. In: INFOCOM 2003 (2003)Google Scholar
  4. 4.
    Lacan, J., Lancérica, L., Dairaine, L.: When FEC Speed Up Data Access in P2P Networks. In: Boavida, F., Monteiro, E., Orvalho, J. (eds.) IDMS 2002 and PROMS 2002. LNCS, vol. 2515, pp. 26–36. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Lai, K., Baker, M.: Nettimer: a tool for measuring bottleneck link bandwidth. In: Proc. USENIX Symp. on Internet Technologies and Systems (2001)Google Scholar
  6. 6.
    Rizzo, L.: Effective Erasure Codes for Reliable Computer Communication Protocols. Computer Communication Review (April 1997)Google Scholar
  7. 7.
    Rodriguez, P., Kirpal, A., Biersack, E.W.: Parallel-Access for Mirror Sites in the Internet. In: Proceedings of IEEE/Infocom 2000, Tel-Aviv, Israel (2000)Google Scholar
  8. 8.
    Saroiu, S., Gummadi, P., Gribble, S.: A Measurement Study of Peer-to-Peer File Sharing Systems. T.R. UW-CSE-01-06-02, Seattle (July 2001) Google Scholar
  9. 9.
    Weatherspoon, H., Kubiatowicz, J.D.: Erasure Coding vs. Replication: A Quantitative Comparison. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 328. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Laurent Dairaine
    • 1
  • Laurent Lancérica
    • 1
  • Jérôme Lacan
    • 1
  1. 1.ENSICA / TéSAToulouse cedex 5France

Personalised recommendations