CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

File Sharing between Peer-to-Peer using Network Coding Algorithm

by Rathod Vijay U., V.R. Chirchi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 129 - Number 9
Year of Publication: 2015
Authors: Rathod Vijay U., V.R. Chirchi
10.5120/ijca2015906973

Rathod Vijay U., V.R. Chirchi . File Sharing between Peer-to-Peer using Network Coding Algorithm. International Journal of Computer Applications. 129, 9 ( November 2015), 24-29. DOI=10.5120/ijca2015906973

@article{ 10.5120/ijca2015906973,
author = { Rathod Vijay U., V.R. Chirchi },
title = { File Sharing between Peer-to-Peer using Network Coding Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { November 2015 },
volume = { 129 },
number = { 9 },
month = { November },
year = { 2015 },
issn = { 0975-8887 },
pages = { 24-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume129/number9/23103-2015906973/ },
doi = { 10.5120/ijca2015906973 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:22:58.945324+05:30
%A Rathod Vijay U.
%A V.R. Chirchi
%T File Sharing between Peer-to-Peer using Network Coding Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 129
%N 9
%P 24-29
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Network coding is a good improvement of network routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network coding due to two reasons: 1. in peer-to-peer network, the topology is not fixed. So, it is very much easier to create the topology which suits the network coding; 2. Peer-to-peer network every nodes are end hosts, so it is easier to perform the complex operation related to network coding like decoding and encoding rather than storing and forwarding the message. In this paper, as propose an algorithm to apply network coding algorithm to peer-to-peer file sharing which employs a peer-to-peer network to distribute files resided in a web server or a file server. The scheme exploits a special type of network topology called combination network. It was proved that combination networks can achieve unbounded network coding gain measured by the ratio of network throughput with network coding to that without network coding. Here network coding algorithm encodes a file into multiple messages and divides peers into multiple groups with each group responsible for relaying one of the messages. The encoding algorithm is designed to satisfy the property that any subset of the messages can be used to decode the original file as long as the size of the subset is sufficiently large. To meet this requirement, here first define an algorithm which satisfies the desired property, and then connect peers in the same group to flood the corresponding message, and connect peers in different groups to distribute messages for decoding. This paper has considered number of theoretical and practical scenarios where network coding or its variant is applied on peer-to-peer file sharing based on Network coding with the aim to improve performance parameters like throughput and reliability. This paper has mainly focused on the comparative analysis of file sharing between peer-to-peer using network coding algorithms.

References
  1. Min Yang and Yuanyuan Yang,” Applying network coding to peer-to-peer file sharing,” IEEE TRANSACTION ON COMPUTERS, vol.63, no.8, august 2014.
  2. R. Ahlswede, N. CAI, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inf. Theory,vol. 46, no. 4,pp. 1204–1216, Jul. 2000.
  3. S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371–381, Feb. 2003.
  4. R. Koetter and M. Medard, “An algebraic approach to networkcoding,”IEEE/ACMTrans.Netw.,vol.11,no.5,pp.782–795,Oct.2003.
  5. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger, “On randomized network coding,” in Proc. Annu. Allerton Conf. Commun. Control Comput. 2003, pp. 4413–4430.
  6. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi et al., “A random linear network coding approach to multicast,” IEEE Trans.Inf. Theory, vol. 52, no. 10, pp. 4413–4430, Oct. 2006.
  7. D. S. Lun, N. Ratnakar, R. Koetter, M. Medard, E. Ahmed, and H. Lee, “Achieving minimum-cost multicast: A decentralized approach based on network coding,” in Proc. IEEE INFOCOM’05 Mar. 2005, pp. 1607–1617.
  8. D. S. Lun, M.Medard, T. Ho, and R. Koetter, “Network coding with a cost criterion,” in Proc. Int. Symp. Inf. Theory Appl. (ISITA’04), Oct. 2004, pp. 1232–1237
  9. Y. Zhu, B. C. Li, and J. Guo, “Multicast with network coding in application-layer overlay networks,” IEEE J. Sel. Areas Commun.,vol. 22, no. 1, pp. 107–120, Sep. 2004.
  10. Bit Torrent. (2004) [Online]. Available: http://bittorrent.com.
  11. J. W. Byers, M. Luby, and M. Mitzenmacher, “A digital fountain approach to asynchronous reliable multicast,” IEEE J. Sel. Areas Commun., vol. 20, no. 3, pp. 1528–1540, Oct. 2002.
  12. A. G. Dimakis, P. B. Godfrey, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” in Proc.IEEE INFOCOM’07, May. 2007, pp. 4359–4551.
  13. D. M. Chiu, R. W.Yeung, J. Huang, and B. Fan, “Can network coding help in P2P networks?” in Proc. Int. Symp. Model. Optimiz. Mobile Ad Hoc Wireless Netw. 2006, pp. 1–5.
  14. M. Kim, C. W. Ahn, M. Medard, and M. Effros, “On minimizing network coding resources: An evolutionary approach,” in Proc.NetCod, 2006.
  15. K. Bhattad, N. Ratnakar, R. Koetter, and K. R.Narayanan, “Minimal network coding for multicast,” in Proc. IEEE Int. Symp. Inf. Theory, Sep. 2005, pp. 1730–1734.
  16. C. K. Ngai and R. W. Yeung, “Network coding gain of combination networks,” in Proc. IEEE Inf. Theory Workshop, Oct. 2004, pp. 283–287.
  17. C. Fragouli, J.Y.LeBoudec, and J.Widmer, “On the benefits of network coding for wireless applications,” in Proc. Net Cod, 2006, pp. 1–6.
  18. C. Wu and B. Li, “Echelon: Peer-to-peer network diagnosis with network coding,” in Proc. IEEE Int. Workshop Quality Service (IWQoS), Jun. 2006, pp. 20–29.
  19. Y. H. Chu, S. G. Rao, S. Seshan, and H. Zhang, “A case for end system multicast,” IEEE J. Sel. Areas Commun., Special Issue on Networking Support for Multicast, vol. 20, no. 8, pp. 1456–1471, Oct. 2002.
  20. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain et al., “Polynomial time algorithms for multicast network code construction,” IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973–1982, Jun. 2005.
  21. C. Gkantsidis and P. R. Rodriguez, “Network coding for large scale content distribution,” IEEE INFOCOM 2005, Miami, FL, USA, Mar. 2005.
  22. M. Yang and Y. Yang, “An efficient hybrid peer-to-peer system for distributed data sharing,” IEEE Trans. Comput., vol. 59, no. 9,pp. 1158–1171, Sep. 2010.
  23. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” in Proc. ACM SIGCOMM, 2001, pp. 149–160.
  24. (2003). Gnutella Protocol Development, the gnutella v0.6 protocol [Online]. Available: http://rfc-gnutella.sourceforge.net/developer/index.html.
  25. S.Ratnasamy, M.Handley, R.M.Karp, and S.Shenker, “Topologically aware overlay construction and server selection,” IEEEINFOCOM’02, New York, NY, USA, Jun. 2002.
  26. M. Yang and Y. Yang, “A hyper graph approach to linear network coding in multicast networks,” IEEE Trans. Parallel Distrib. Syst., vol.21, no. 7, pp. 968–982, Jul. 2010.
  27. Y. Yang, J. Wang, and M. Yang, “A service-centric multicast architecture and route protocol IEEE Trans. Parallel Distrib. Syst., vol.19, no. 1, pp. 35–51, Jan. 2008.
  28. X. Deng, Y. Yang, and S. Hong, “A flexible platform for hardware aware network experiments and a case study on wireless network coding,” IEEE/ACM Trans. Netw., vol. 21, no. 1, pp. 149–161,Feb. 2013.
  29. Y. Yang and J. Wang, “A new self-routing multicast network,” IEEETrans. Parallel Distrib. Syst., vol. 10, no. 12, pp. 1299–1316, Dec. 1999.
  30. N.Cai and R.W.Yeung,”Secure network coding”, Proc.-IEEE International symposium on information Theory, pp.323, 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Network Coding Algorithm Peer-to-Peer Networks Web-based Applications File Sharing Multicast

Powered by PhDFocusTM