Avalanche: A Network Coding Analysis

In this paper, we study the application of random network coding in peer-to-peer (P2P) networks. The system we analyze is based on a prototype called Avalanche proposed in [8] for large scale content distribution on such networks. We present the necessary techniques for analyzing the system and show that random network coding provides the system with both maximum bandwidth efficiency and robustness. We also point out that the model for random network coding in P2P networks is very different from the one that has been studied extensively in the literature.

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

[2]  Ning Cai,et al.  Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory) , 2006 .

[3]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

[4]  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..

[5]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[6]  R. Yeung,et al.  Network coding theory , 2006 .

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

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

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