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.
Similar content being viewed by others
References
Rodriguez, P., Biersack, E.W.: Dynamic parallel access to replicated content in the Internet. IEEE/ACM Trans. Netw. 10(4), 455–465 (2002)
(2000) The BitTorrent Protocol Specification. (Online). http://wiki.theory.org/index.php/BitTorrentSpecification
Legout, A., UrvoyKeller, G., Michiardi, P.: Rarest First and Choke Algorithms are Enough. In: Internet Measurement Conference 2006, (2006)
Tian, Y., Wu, D. Ng, K.-W.: Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks. In: INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1–11, Apr. (2006)
Availability. http://wiki.theory.org/Availability
Jia, C. Hongxiao, Z., Jinsheng, Y.: Randomness Betters Nearest-Rarest in the P2P Clustering Networks. In: Wireless Communications, Networking and Mobile Computing, WiCom ‘09. 5th International Conference on, pp. 1–4, (2009)
Alshwede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)
Wu, L., Curran, K.: A practical network coding and routing scheme based on maximum flow combination. Int. J. Netw. Manage 22(5), 373–396 (2012)
Nan, W., Ansari, N.: Downloader-Initiated random linear network coding for peer-to-peer file sharing. IEEE Syst. J. 5, 61–69 (2011)
Gkantsidis, C., Miller, J., Rodriguez, P.: Comprehensive View of a Live Network Coding P2P System. In: Presented at the Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeriro, Brazil, (2006)
Chou, P. A., Wu Y., Jain, K.: Practical Network Coding. In: Allerton Conference on Communication, Control, and Computing, Monticello, (2003)
Ma, G., Xu, Y., Lin, M., Xuan, Y.: A Content Distribution System Based on Sparse Linear Network Coding. In: Third Workshop on Network Coding (Netcod 2007), (2007)
Gkantsidis, C., Rodriguez, P.R.: Network Coding For Large Scale Content Distribution. In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4, pp. 2235–2245, Mar. (2005)
Gkantsidis, C., Miller, J., Rodriguez, P.: Anatomy of a P2P Content Distribution system with Network Coding. In: Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS 2006), (2006)
Dah Ming, C., Yeung, R. W., Jiaqing, H., Bin, F.: Can Network Coding Help in P2P Networks?. In: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on, pp. 1–5, (2006)
Wang, M. , Li, B.: How Practical is Network Coding?. In Quality of Service, 2006. IWQoS 2006. 14th IEEE International Workshop on, pp. 274-278, Jun. (2006)
Jin, X., Gary Chan, S.-H.: Unstructured Peer-to-Peer Network Architectures. In: Handbook of Peer-to-Peer Networking, Springer, pp. 117–142, (2010)
Chou, P.A., Yunnan, W.: Network Coding for the Internet and Wireless Networks. Sig. Process. Mag. IEEE 24, 77–85 (2007)
OverSim. http://www.oversim.org/
Langberg, M., Sprintson, A., Bruck, J.: The encoding complexity of network coding. IEEE Trans. Inf. Theory 52(6), 2386–2397 (2006)
Lanberg, M., Sprintson, A.: Recent Results on the Algorithmic Complexity of Network Coding. In: Proceedings of the 5th Workshop on Network Coding, Theory, and Applications, (2009)
Kramer, G., Savari, S.A.: Edge—cut bounds on network coding rates. J. Netw. Syst. Manage. 14(1), 49–67 (2006)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-Like p2p Systems Scalable. In: Proceedings of ACM SIGCOMM on Applications, technologies, architectures, and protocols for computer communications, New York, USA, (2003)
Yao, Z., Leonard, D., Wang, X., Loguinov, D.: Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks. In: Network Protocols, 2006. ICNP ‘06. Proceedings of the 2006 14th IEEE International Conference on, pp. 32–41, Nov. (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leu, JS., Yu, MC. & Yueh, HC. Improving Network Coding Based File Sharing for Unstructured Peer-to-Peer Networks. J Netw Syst Manage 23, 803–829 (2015). https://doi.org/10.1007/s10922-014-9323-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10922-014-9323-7