Content-access QoS in peer-to-peer networks using a fast MDS erasure code

Authors:
Laurent Dairaine;Jérôme Lacan;Laurent Lancérica;Jérôme Fimes
Affiliations:
ENSICA, 1 place ímile Blouin, 31056 Toulouse cedex 5, France and LAAS-CNRS, 5 avenue du Colonel Roche, 31077 Toulouse cedex 4, France and NICTA, National, ICT Australia Bay 15 Locomotive Work ...;ENSICA, 1 place ímile Blouin, 31056 Toulouse cedex 5, France;ENSICA, 1 place ímile Blouin, 31056 Toulouse cedex 5, France and TéSA, 2, rue Charles Camichel, F-31071 Toulouse, Cedex 7 BP 7122, France;ENSICA, 1 place ímile Blouin, 31056 Toulouse cedex 5, France and TéSA, 2, rue Charles Camichel, F-31071 Toulouse, Cedex 7 BP 7122, France
Venue:
Computer Communications
Year:
2005

Citing 11
Cited 3

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Optimal File Sharing in Distributed Networks

SIAM Journal on Computing
Effective erasure codes for reliable computer communication protocols

ACM SIGCOMM Computer Communication Review
A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Distributed systems (3rd ed.): concepts and design

Distributed systems (3rd ed.): concepts and design
Improving Data Access in P2P Systems

IEEE Internet Computing
Distributed Search in P2P Networks

IEEE Internet Computing
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
When FEC Speed up Data Access in P2P Networks

IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
Erasure Coding Vs. Replication: A Quantitative Comparison

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks

Redundant data composition of peers in P2P streaming systems using Cauchy Reed-Solomon codes

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
FNT-based Reed-Solomon erasure codes

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Path diversity over packet switched networks: performance analysis and rate allocation

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper describes an enhancement of content access Quality of Service in peer to peer (P2P) networks. The main idea is to use an erasure code to distribute the information over the peers. This distribution increases the users' choice on disseminated encoded data and therefore, statistically enhances the overall throughput of the transfer. 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. Based on a bandwidth distribution, statistical content-access QoS are guaranteed in function of both the content replication level in the network and the file dissemination strategies. A simple application in the context of media streaming is proposed. Finally, the constraints on the erasure code related to the proposed system are analysed and a new fast MDS erasure code is proposed, implemented and evaluated.