SIAM Journal on Applied Mathematics
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Can internet video-on-demand be profitable?
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly applied heuristics such as rarest first protocols. In this paper, we revisit the problem of broadcasting multiple data blocks from a single source in an overlay network using gossiplike protocols. Our new finding reveals that the marginal benefit of network coding critically depends on the dynamics of network topologies. We show that although network coding is optimal as a block selection mechanism, simple non-coding protocols are close to optimal in complete and random graphs, leading to marginal benefits of network coding. However, network coding demonstrates salient benefits in clustered and time-varying topologies, which are common in real-world systems with ISP-locality mechanisms implemented. Through both theoretical analysis and simulation results, we unveil the underlying reasons behind discrepancies in the power of network coding under different scenarios.