Abstract

Network coding (NC) makes content distribution more effective 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. The randomization introduced by network coding makes all packets equally important and resolves the problem of locating the rarest block. Further, it reduces traffic 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 traffic 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 flooding 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 traffic reduced and improved the average and maximum download time by reducing original seeder's workload.

Highlights

  • Introduction and Related WorkP2P network does not require any central coordination by any central authority or server

  • Cycles in traditional routing since the same data need to be transmitted over multiple paths in different linear combinations in network code based transmission

  • Nonnetwork coding and random linear network coding are considered to compare with I2NC

Read more

Summary

Introduction and Related Work

P2P network does not require any central coordination by any central authority or server. Applying network coding to P2P content distribution makes the data scheduling simple and reduces the burden of original seeder This method enhances the application-level throughput [3, 4]. Downloader-Initiated Random Linear Network Coding [9] has been proposed to solve the unlucky combination problem in P2P file sharing system. In their approach, each peer needs to examine neighboring peer’s current vector before transmitting the coded packet. (i) We propose a novel network coding mechanism for P2P content distribution, which attempts to reduce the complexity associated with network coding and to maximize the innovative information flow in the network.

System Model
Traditional Network Coding Mechanism
Mathematical Analysis of Traditional Network Coding
Proposed System Architecture
Experimental Results and Analysis
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call