By Topic

Downloader-Initiated Random Linear Network Coding for Peer-to-Peer File Sharing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nan Wang ; Eatontown, NJ, USA ; Nirwan Ansari

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.

Published in:

IEEE Systems Journal  (Volume:5 ,  Issue: 1 )