By Topic

Can Network Coding Help in P2P Networks?

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

4 Author(s)
Dah Ming Chiu ; Department of Information Engineering, The Chinese University of Hong Kong ; R. W. Yeung ; Jiaqing Huang ; Bin Fan

In this paper, we compare the maximum achieveable throughput using network coding with routing in P2P networks. Our analysis is based on a simple star network where there is no multicast and network coding can only be applied at the peers. Under the idealized assumption that there is perfect information to realize optimal routing, this model captures the essential elements of a P2P network, yet allows simple analysis for what can be achieved by network coding and by routing respectively. The conclusion is that there is no coding advantage. We then discuss the applicability of this result to a real P2P content distribution system which may operate at lower throughput due to various other factors. Finally, in addition to yielding insights to the present case of P2P networks, we believe this type of non-multicast network models can lead to other new results for network coding in general.

Published in:

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks

Date of Conference:

03-06 April 2006