An Improved Network Coding-Based Cooperative Content Distribution Scheme

Reducing the additional computational overheads caused by network coding operations in the a novel cooperative content distribution paradigm which is based on network coding is valuable for both theoretical interests and practical interests. Regretably, little work about this problem, especially from the perspective of practical interests, has been reported in the present literature. To issue this problem, in this paper, we propose an improved network coding scheme which is based on the new mechanisms of clustered network coding, random choice and independence checking. Simulation results show that the proposed scheme can reduce the additional computational overheads significantly and achieve better performance than current used network coding scheme.

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

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

[3]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[4]  Nazareno Andrade,et al.  Influences on cooperation in BitTorrent communities , 2005, P2PECON '05.

[5]  Bin Fan,et al.  Can Network Coding Help in P2P Networks? , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

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

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

[8]  Michael Langberg,et al.  The encoding complexity of network coding , 2005, ISIT.

[9]  Andrew B. Whinston,et al.  P2P Networking: An Information-Sharing Alternative , 2001, Computer.