Improving Network Coding Based File Sharing for Unstructured Peer-to-Peer Networks

Abstract A network coding based peer-to-peer (P2P) file sharing system has been proposed in recent years. It uses the random combination of encoded pieces to make the file sharing more effective. Most of the conventional P2P file sharing systems adopt a random (or rarest piece first) transmission policy to avoid too many duplicated pieces and rare pieces occurring in the network. Network coding can simply solve this problem. However, some of the studies show that network coding brings the overhead of coding/decoding delay and message overhead; after all, the performance of network coding is not better than other schemes that are without network coding. Therefore, we propose a network coding based file sharing system over unstructured P2P networks considering the overhead from the network coding. We make comparisons with other schemes without network coding. Our simulation results show that the proposed network coding based file sharing system is better than others, when the network coding scheme and non-network coding scheme adopt the same network environment even though the network coding is executed under a limited computation resource.

[1]  Pablo Rodriguez,et al.  Dynamic parallel access to replicated content in the internet , 2002, TNET.

[2]  Michael Langberg,et al.  Recent Results on the Algorithmic Complexity of Network Coding , 2009 .

[3]  Serap A. Savari,et al.  Edge-Cut Bounds on Network Coding Rates , 2006, Journal of Network and Systems Management.

[4]  Kam-Wing Ng,et al.  Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[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]  Yinlong Xu,et al.  A Content Distribution System based on Sparse Linear Network Coding , 2006 .

[7]  Christos Gkantsidis,et al.  Anatomy of a P2P Content Distribution system with Network Coding , 2006, IPTPS.

[8]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

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

[10]  Jia Cao,et al.  Randomness Betters Nearest-Rarest in the P2P Clustering Networks , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[11]  Michael Langberg,et al.  The encoding complexity of network coding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[12]  Nirwan Ansari,et al.  Downloader-Initiated Random Linear Network Coding for Peer-to-Peer File Sharing , 2011, IEEE Systems Journal.

[13]  Gary Shueng Han Chan,et al.  Unstructured Peer-to-Peer Network Architectures , 2010 .

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

[15]  Lianlong Wu,et al.  A practical network coding and routing scheme based on maximum flow combination , 2012, Int. J. Netw. Manag..

[16]  Christos Gkantsidis,et al.  Comprehensive view of a live network coding P2P system , 2006, IMC '06.

[17]  Dmitri Loguinov,et al.  Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[18]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

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

[20]  Guillaume Urvoy-Keller,et al.  Rarest first and choke algorithms are enough , 2006, IMC '06.