Network coding for large scale content distribution

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2005, Pages 2235-2245

  Gkantsidis, Christos ^a   Rodriguez, Pablo Rodriguez ^b  

^a Georgia Institute of Technology   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK FORWARDING DECISIONS; BLOCK PROPAGATION; NETWORK CODING; NODE ARRIVAL;

COMPUTER SIMULATION; ENCODING (SYMBOLS); PACKET NETWORKS; ROBUSTNESS (CONTROL SYSTEMS); SERVERS; TOPOLOGY;

COMPUTER NETWORKS;

EID: 25644448947     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498511     Document Type: Conference Paper

References (30)

1. akamai, "Akamai," http://www.akamai.com.
2. B. Cohen, "Incentives build robustness in bittorrent," in P2P Economics Workshop, Berkeley, CA, 2003.
3. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, 2000.
4. Philip Chou, Yunnan Wu, and Kamal Jain, "Network coding for the internet," in IEEE Communication Theory Workshop, Capri, 2004, IEEE.
5. Paul Francis, "Yoid: Extending the internet multicast architecture," http://www.icir.org/yoid/docs/, 2000.
6. Yang-hua Chu, Sanjay G. Rao, and Hui Zhang, "A case for end-system multicast," in SIGMETRICS, Santa Clara, CA, 2000, pp. 1-12, ACM.
7. Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Animesh Nandi, Antony Rowston, and Atul Singh, "Splitstream: High-bandwidth multicast in cooperative environments," in 19th Symposium on Operating Systems Principles (SOSP). 2003, ACM.
8. V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, "Distributing streaming media content using cooperating networking," in NOSSDAV, 2002.
9. Vivek K. Goyal, "Multiple descriptive coding: Compression meets the network," IEEE Signal Processing Magazine, vol. 18, no. 5, pp. 73-93, 2001.
10. Pablo Rodriguez-Rodriguez and Ernst Biersack, "Dynamic parallel-access to replicated content in the internet," IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 455-465, 2002.
11. John Byers, Michael Luby, and Michael Mitzenmacher, "Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads," in Infocom, 1999.
12. M. Izal, G. Urvoy-Keller, E. W. Biersack, P. Felber, A. Al Hamra, and L. Garces-Erice, "Dissecting bittorrent: Five months in a torrent's lifetime," in Passive and Active Measurements (PAM), 2004.
13. Dongyu Qiu and R. Srikant, "Modeling and performance analysis of bittorrent-like peer-to-peer networks," in SIGCOMM. 2004, ACM.
14. Rob Sherwood, Ryan Braud, and Bobby Bhattacharjee, "Slurpie: A cooperative bulk data transfer protocol," in Infocom, Hong Kong, HK, 2004, IEEE.
15. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High bandwidth data dissemination using an overlay mesh," in Symposium on Operating Systems Principles (SOSP), 2003.
16. John Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav Rost, "Informed content delivery across adaptive overlay networks," in SIGCOMM, Pittsburgh, PA, 2002, ACM.
17. John Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege, "A digital fountain approach to reliable distribution of bulk data," in SIGCOMM, 1998.
18. Petar Maymounkov and David Mazires, "Rateless codes and big downloads," in IPTPS'03, 2003.
19. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing steiner trees," in 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
20. G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," in 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000.
21. M. Thimm, "On the approximability of the steiner tree problem," Mathematical Foundations of Computer Science, vol. 295, no. 103, pp. 387-402, 2001.
22. Ying Zhu, Baochun Li, and Jiang Guo, "Multicast with network coding in application-layer overlay networks," IEEE Journal on Selected Areas in Communications, 2004.
23. P. A. Chou, Y. Wu, and K Jain, "Practical network coding," in Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2003.
24. Kamal Jain, Laszlo Lovasz, and Philip Chou, "Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding," Tech. Rep., Microsoft Research, 2004, Available at ftp://ftp.research.microsoft.com/pub/tr/TR-2004-135.pdf.
25. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter p2p networks," in 42nd Annual Symposium on Foundations of Computer Science (FOCS01), 2001, pp. 492-199.
26. Reza Rejaie and Shad Stafford, "A framework for architecting peer-to-peer receiver-driven overlays," in International Workshop on Network and Operating System Support for Digital Audio and Video (NOSDAV), Cork, Ireland, 2004, pp. 42-47, ACM Press.
27. Tracey Ho, Ralf Koetter, Muriel Medard, David R. Karger, and Michelle Effros, "The benefits of coding over routing in a randomized setting," in IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 2003, p. 442, IEEE.
28. Eytan Adar and Bernando A. Huberman, "Free riding on gnutella," First Monday, 2000.
29. Maxwell N. Krohn, Michael J. Freedman, and David Mazires, "On-the-fly verification of rateless erasure codes for efficient content distribution," in IEEE Symposium on Security and Privacy, Berkeley, California, 2004. pp. 226-241, IEEE.
30. Christos Gkantsidis and Pablo Rodriguez Rodriguez, "Cooperative security for network coding file distribution," Tech. Rep. MSR-TR-2004-137, Microsoft Research, 2004.