Research Article An Efficient Framework for Large Scale Multimedia Content Distribution in P2P Network: I2NC M. Anandaraj, P. Ganeshkumar, K. P. Vijayakumar, and K. Selvaraj Department of Information Technology, PSNA CET, Tamilnadu 624 622, India Correspondence should be addressed to M. Anandaraj; ananddgl@yahoo.com Received 11 May 2015; Revised 11 August 2015; Accepted 12 August 2015 Academic Editor: Vincenzo Eramo Copyright © 2015 M. Anandaraj et al. Tis is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Network coding (NC) makes content distribution more efective and easier in P2P content distribution network and reduces the burden of the original seeder. It generalizes traditional network routing by allowing the intermediate nodes to generate new coded packet by combining the received packets. Te randomization introduced by network coding makes all packets equally important and resolves the problem of locating the rarest block. Further, it reduces trafc in the network. In this paper, we analyze the performance of traditional network coding in P2P content distribution network by using a mathematical model and it is proved that trafc reduction has not been fully achieved in P2P network using traditional network coding. It happens due to the redundant transmission of noninnovative information block among the peers in the network. Hence, we propose a new framework, called I2NC (intelligent-peer selection and incremental-network coding), to eliminate the unnecessary fooding of noninnovative coded packets and thereby to improve the performance of network coding in P2P content distribution further. A comparative study and analysis of the proposed system is made through various related implementations and the results show that 10–15% of trafc reduced and improved the average and maximum download time by reducing original seeder’s workload. 1. Introduction and Related Work P2P network does not require any central coordination by any central authority or server. It is more fault-tolerant and scalable than traditional centralized client server system. When a new node arrives at the network and requests some service, it provides services to other nodes in the network as well to make use of the services provided by other nodes in the network. It increases total system bandwidth and also reduces the server’s load. Tis causes limitless scalability of the system without any need for additional cost [1]. Tis type of system is especially useful for distributing large scale multimedia content efciently to a large group of users. Existing research works in P2P content distribution networks are grouped around three broad questions: frst, the fundamental perfor- mance limits of the network based on its capacity to exchange information over a given network, second, the possibility to design efcient mechanisms that have desirable properties that meet out the practical requirements, and, fnally, the ways to monitor, manage, and control the network. Te problem formulations in P2P network are around these questions and information fow over networks may be considered to be an optimization problem: we felt that there is a need to improve the throughput as high as possible for a given bandwidth but to reduce the delay for a specifed throughput. Network coding has theoretically proven mechanisms for improving the performance of P2P network in terms of both throughput and average download time. Network coding [2] not only allows intermediate nodes to store and forward the received packets, but also allows the intermediate node to perform the arbitrary coding operation on the received packets. Applying network coding to P2P content distribution makes the data scheduling simple and reduces the burden of original seeder. Tis method also enhances the application-level throughput [3, 4]. It is argued that the computational overhead incurred by the coding and decoding operation may counteract its benefts [5, 6]. It impedes the adoption and deployment of network coding for content distribution. Several researchers worked on reducing the complexity of network coding [7], so it can be used in both wired and wireless networks. Chunk based network coding has been introduced to reduce coding complexity and by using local Hindawi Publishing Corporation e Scientific World Journal Volume 2015, Article ID 303505, 12 pages http://dx.doi.org/10.1155/2015/303505