Random network coding in peer-to-peer networks: From theory to practice

Proceedings of the IEEE

Volumn 99, Issue 3, 2011, Pages 513-523

  Li, Baochun ^a   Niu, Di ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Content distribution; media streaming; peer to peer (P2P) networks; random gossip; random network coding; randomized algorithms

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; FLOW GRAPHS; MEDIA STREAMING; MESH GENERATION; MESH NETWORKING; NETWORK CODING; TOPOLOGY;

CONTENT DISTRIBUTION; PEER TO PEER (P2P) NETWORK; RANDOM GOSSIP; RANDOM NETWORK CODING; RANDOMIZED ALGORITHMS;

PEER TO PEER NETWORKS;

EID: 79951942028     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2091930     Document Type: Article

References (32)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
3. S. Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithm for network information flow," in Proc. 15th ACM Symp. Parallelism Algorithms Architectures, Jun. 2003, pp. 286-294.
5. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. Int. Symp. Inf. Theory, 2003, DOI: 10.1109/ISIT. 2003.1228459.
6. P. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Commun. Control Comput., Oct. 2003. Available: http://sites.google.com/site/saloot2/practical-network-coding.pdf.
7. B. Pittel, "On spreading a rumor," SIAM J. Appl. Math., vol. 47, no. 1, pp. 213-223, 1987.
8. S. Sanghavi, B. Hajek, and L. Massoulie, "Gossiping with multiple messages," in Proc. IEEE INFOCOM, Anchorage, AK, 2007, pp. 2135-2143. (Pubitemid 47334447)
9. A. Bar-Noy and S. Kipnis, "Broadcasting multiple messages in simultaneous send/receive systems," Discrete Appl. Math., vol. 55, pp. 95-105, 1994.
10. J. Mundinger, R. Weber, and G. Weiss, "Optimal scheduling of peer-to-peer file dissemination," J. Scheduling, pp. 105-120, 2007.
11. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE INFOCOM, Mar. 2005, vol. 4, pp. 2235-2245. (Pubitemid 41382341)
12. S. Deb, M. Medard, and C. Choute, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2486-2507, Jun. 2006. (Pubitemid 43898905)
13. D. Mosk-Aoyama and D. Shah, "Information dissemination via network coding," in Proc. IEEE Int. Symp. Inf. Theory, Oct. 2006, pp. 1748-1752. (Pubitemid 351244398)
14. D. Vasudevan and S. Kudekar. (2009, Jan.). Algebraic gossip on arbitrary networks. Available: http://arxiv.org/pdf/0901.1444.
15. M. Borokhovich, C. Avin, and Z. Lotker, "Tight bounds for algebraic gossip on graphs," in Proc. IEEE Int. Symp. Inf. Theory, 2010, pp. 1758-1762.
16. R. W. Yeung, "Avalanche: A network coding analysis," Commun. Inf. Syst., vol. 7, no. 4, pp. 353-358, 2007.
17. D. Niu and B. Li, "On the resilience-complexity tradeoff of network coding in dynamic P2P networks," in Proc. 15th IEEE Int. Workshop Quality of Service, Evanston, IL, Jun. 2007, pp. 38-46. (Pubitemid 47469068)
18. L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang, "Measurements, analysis, and modeling of BitTorrent-like systems," in Proc. ACM Internet Meas. Conf., Oct. 2005, pp. 35-48.
19. C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive view of a live network coding P2P system," in Proc. 6th ACM Internet Meas. Conf., 2006, pp. 177-188. (Pubitemid 47165600)
20. X. Zhang, J. Liu, B. Li, and T.-S. P. Yum, "CoolStreaming/DONet: A data-driven overlay network for efficient live media streaming," in Proc. IEEE INFOCOM, 2005, vol. 3, pp. 2102-2111. (Pubitemid 41390720)
21. B. Li, S. Xie, Y. Qu, G. Y. Keung, C. Lin, J. Liu, and X. Zhang, "Inside the new coolstreaming: Principles, measurements and performance implications," in Proc. IEEE INFOCOM, 2008, pp. 1031-1039.
22. Y. Huang, T. Z. Fu, D.-M. Chiu, J. C. Lui, and C. Huang, "Challenges, design and analysis of a large-scale P2P-VoD system," in Proc. ACM SIGCOMM, 2008, pp. 375-388.
23. C. Feng, B. Li, and B. Li, "Understanding the performance gap between pull-based mesh streaming protocols and fundamental limits," in Proc. IEEE INFOCOM, Apr. 2009, pp. 891-899.
24. 2: Random push with random network coding in live peer-to-peer streaming," IEEE J. Sel. Areas Commun., vol. 25, no. 9, pp. 1655-1666, Dec. 2007.
25. C. Feng and B. Li, "On large-scale peer-to-peer streaming systems with network coding," in Proc. ACM Multimedia, Oct. 2008, pp. 269-278.
26. H. Shojania and B. Li, "Parallelized progressive network coding with hardware acceleration," in Proc. 15th Int. Workshop Quality of Service, 2007, pp. 47-55. (Pubitemid 47469069)
27. H. Shojania, B. Li, and X. Wang, "Nuclei: GPU-accelerated many-core network coding," in Proc. IEEE INFOCOM, 2009, pp. 459-467.
28. J. Nickolls, I. Buck, M. Garland, and K. Skadron, "Scalable parallel programming with CUDA," ACM Queue, vol. 6, no. 2, pp. 40-53, 2008.
29. H. Shojania and B. Li, "Pushing the envelope: Extreme network coding on the GPU," in Proc. 29th Int. Conf. Distrib. Comput. Syst., 2009, pp. 490-499.
30. H. Shojania and B. Li, "Tenor: Making coding practical from servers to smartphones," in Proc. ACM Multimedia, Oct. 2010, pp. 45-54.
31. S. Annapureddy, S. Guha, C. Gkantsidis, D. Gunawardena, and P. Rodriguez, "Is high-quality VoD feasible using P2P swarming?" in Proc. 16th Int. World Wide Web Conf., 2007, pp. 903-912. (Pubitemid 47582320)
32. Z. Liu, C. Wu, B. Li, and S. Zhao, "UUSee: Large-scale operational on-demand streaming with random network coding," in Proc. IEEE INFOCOM, 2010, DOI: 10.1109/INFCOM.2010.5462030.