Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aberer, K., Punceva, M., Hauswirth, M., Schmidt, R.: Improving Data Access in P2P Systems. IEEE Internet Computing 6(1), 58–67 (2002)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-peer Networks. In: ACM SIGCOMM 2002 (August 2002)
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)
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)
Lai, K., Baker, M.: Nettimer: a tool for measuring bottleneck link bandwidth. In: Proc. USENIX Symp. on Internet Technologies and Systems (2001)
Rizzo, L.: Effective Erasure Codes for Reliable Computer Communication Protocols. Computer Communication Review (April 1997)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dairaine, L., Lancérica, L., Lacan, J. (2003). Enhancing Peer-to-Peer Parallel Data Access with PeerFecT. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds) Group Communications and Charges. Technology and Business Models. NGC ICQT 2003 2003. Lecture Notes in Computer Science, vol 2816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39405-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-39405-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20051-2
Online ISBN: 978-3-540-39405-1
eBook Packages: Springer Book Archive