Cooperative Content Distribution Using Information Droplets

In this paper, we introduce the erasure-coding scheme of DropletX, a proposed protocol for efficient content distribution in a peer-to-peer network. The file to be distributed is encoded into "information droplets" using a linear code with random coefficients drawn from a finite field. The performance of this random linear code is analyzed and compared with that of LT codes. DropletX's random linear code has significant advantages in terms of lower transmission overhead and peers with higher potential of generating innovative droplets, but significantly greater decoding complexity. Strategies such as pre-computing droplets and incremental decoding are used in DropletX to lower or to distribute the encoding and decoding costs

[1]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Rob Sherwood,et al.  Slurpie: a cooperative bulk data transfer protocol , 2004, IEEE INFOCOM 2004.

[3]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[4]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[5]  Andrew A. Chien,et al.  Evaluation of a High Performance Erasure Code Implementation , 2004 .

[6]  Lawrence Ip,et al.  Limited Randomness LT Codes , 2003 .

[7]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[8]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  K. Jain,et al.  Practical Network Coding , 2003 .

[10]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[11]  László Lovász,et al.  Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding , 2007, PODC '05.

[12]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

[13]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[14]  Jim Gemmell,et al.  Using Multicast FEC to Solve the Midnight Madness Problem , 1997 .

[15]  Christina Fragouli,et al.  Coding schemes for line networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[16]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

[17]  David Mazières,et al.  Rateless Codes and Big Downloads , 2003, IPTPS.

[18]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..