Abstract
Network coding has recently drawn tremendous attention. Applying network coding to Peer-to-Peer (P2P) file sharing is still a relatively new area of study. Adopting network coding in a P2P file sharing network can make data distribution more effective and relieve the burden of the original seeder. In this paper, we first provide the mathematical analysis modeled from contemporary P2P file sharing protocols to analyze the efficiency of network coding in P2P file sharing networks. Then, we further investigate the “unlucky combination” problem encountered by the traditional random linear network coding algorithm when applied to a P2P file sharing network. Hence, we propose a “Downloader-Initiated Random Linear Network Coding” algorithm, which lets the downloader determine the random linear coding to eliminate the “unlucky combination” problem, and therefore further improves the performance of P2P file sharing networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.