{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:13:55Z","timestamp":1764364435675,"version":"3.37.3"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> Most of the existing peer-to-peer (P2P) content distribution schemes carry out a random or rarest piece first content dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem is solved using P2P content distribution based on network coding scheme. Network coding scheme uses random linear combination of coded pieces. Hence, the above-stated problem is solved easily and simply. Our proposed mechanism uses network coding mechanism in which several contents having the same message are grouped into different groups and coding operation is performed only within the same group. The interested peers are also divided into several groups with each group having the responsibility to spread one set of contents of messages. The coding system is designed to assure the property that any subset of the messages can be utilized to decode the original content as long as the size of the subset is suitably large. To meet this condition, dynamic smart network coding (DSNC) scheme is defined which assures the preferred property, then peers are connected in the same group to send the corresponding message, and connect peers in different groups to disseminate messages for carrying out decoding operation. Moreover, the proposed system is readily expanded to support topology change to get better system performance further in terms of reliability, link stress and throughput. The simulation results prove that the proposed system can attain 20\u201325% higher throughput than existing systems, good reliability, link failure and robustness to peer churn. <\/jats:p>","DOI":"10.1142\/s0218126620501571","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T06:43:16Z","timestamp":1573195396000},"page":"2050157","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Framework for Network Code based Multimedia Content Distribution in Hybrid P2P Network"],"prefix":"10.1142","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0255-8094","authenticated-orcid":false,"given":"M.","family":"Anandaraj","sequence":"first","affiliation":[{"name":"Department of Information Technology, PSNA College of Engineering and Technology, Dindigul, Tamilnadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ganeshkumar","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, AI-Imam Mohammad Ibn Saud Islamic University, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Selvaraj","sequence":"additional","affiliation":[{"name":"Department of Information Technology, PSNA College of Engineering and Technology, Dindigul, Tamilnadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. P.","family":"Vijayakumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, SRM Institute of Science and Technology, Chennai, Tamilnadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,12,16]]},"reference":[{"key":"S0218126620501571BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2572001"},{"key":"S0218126620501571BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09751-0_5"},{"key":"S0218126620501571BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-007-0003-1"},{"key":"S0218126620501571BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-007-0017-9"},{"key":"S0218126620501571BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/1384529.1375477"},{"key":"S0218126620501571BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-007-0006-y"},{"key":"S0218126620501571BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-4002-1"},{"key":"S0218126620501571BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.88"},{"key":"S0218126620501571BIB009","first-page":"150","volume-title":"Proc. 5th Int. Workshop on Peer-to-Peer Systems (IPTPS)","author":"Gkantsidis C.","year":"2006"},{"volume-title":"Network Coding: Fundamentals and Applications","year":"2011","author":"M\u00e9dard M.","key":"S0218126620501571BIB010"},{"key":"S0218126620501571BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.53"},{"key":"S0218126620501571BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"S0218126620501571BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"first-page":"1607","volume-title":"Proc. IEEE INFOCOM\u201905","author":"Lun D. S.","key":"S0218126620501571BIB014"},{"first-page":"1232","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA\u201904)","author":"Lun D. S.","key":"S0218126620501571BIB015"},{"key":"S0218126620501571BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"S0218126620501571BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2010.2063377"},{"first-page":"550","volume-title":"Proc. 6th ACM SIGCOMM Conf. Internet Measurement","author":"Gkantsidis C.","key":"S0218126620501571BIB018"},{"key":"S0218126620501571BIB019","doi-asserted-by":"publisher","DOI":"10.1002\/nem.1797"},{"key":"S0218126620501571BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"S0218126620501571BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"S0218126620501571BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"S0218126620501571BIB023","first-page":"303","volume":"2015","author":"Anandaraj M.","year":"2015","journal-title":"Int. J. Sci. World"},{"key":"S0218126620501571BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-380918-6.00004-4"},{"volume-title":"Proc. of the First Workshop on Economics of Peer-to-Peer Systems","author":"Cohen B.","key":"S0218126620501571BIB025"},{"key":"S0218126620501571BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.012711.090610"},{"key":"S0218126620501571BIB027","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2873239"},{"key":"S0218126620501571BIB028","doi-asserted-by":"publisher","DOI":"10.1142\/S021812661650119X"},{"issue":"8","key":"S0218126620501571BIB029","first-page":"501","volume":"28","author":"Li P.","year":"2018","journal-title":"J. Circuits, Syst. Comput."},{"first-page":"213","volume-title":"IEEE Int. Conf. Recent Advances in Energy-efficient Computing and Communication (ICRAECC-2019)","author":"Anandaraj M.","key":"S0218126620501571BIB030"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126620501571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T10:35:38Z","timestamp":1598870138000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126620501571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,16]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S0218126620501571"],"URL":"https:\/\/doi.org\/10.1142\/s0218126620501571","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"type":"print","value":"0218-1266"},{"type":"electronic","value":"1793-6454"}],"subject":[],"published":{"date-parts":[[2019,12,16]]}}}