Comprehensive view of a live network coding P2P system

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2006, Pages 177-188

  Gkantsidis, Christos ^a   Miller, John ^a   Rodriguez, Pablo ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Content distribution; NAT issues; Network coding; Peer to peer; Secure random chesksums

Indexed keywords

CONTENT BASED RETRIEVAL; DISTRIBUTED COMPUTER SYSTEMS; RANDOM PROCESSES; REAL TIME SYSTEMS; SERVERS; TRACKING (POSITION);

CONTENT DISTRIBUTION SYSTEMS; NAT ISSUES; NETWORK CODING; SECURE RANDOM CHESKSUMS;

NETWORK SECURITY;

EID: 34547410740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1177080.1177104     Document Type: Conference Paper

References (32)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W Yeung. Network information flow. IEEE Transactions on Information Theory, 2000.
2. A. Bharambe, C. Herley, and Venkat Padmanabhan. Analysing and improving bittorrent performance. In Infocom 2006, 2006.
3. Ernst Biersack, Pablo Rodriguez, and Pascal Felber. Performance analysis of peer-to-peer networks for file distribution. In Fifth International Workshop on Quality of Future Internet Services (QofIS04), 2004.
4. John Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav Rost. Informed content delivery across adaptive overlay networks. In SIGCOMM, Pittsburgh, PA, 2002. ACM.
5. John Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, 1998.
6. P. A. Chou, Y. Wu, and K Jain. Practical network coding. In Allerton Conference on Communication, Control, and Computing, 2003.
7. Fan R. K. Chung. Spectral graph theory. Regional conference series in mathematics, no. 92. Published for the Conference Board of the mathematical sciences by the American Mathematical Society, Providence, R.I., 1997. Fan R.K. Chung. 26 cm. "CBMS Conference on Recent Advances in Spectral Graph Theory held at California State University at Fresno, June 6-10, 1994"-T.p. verso.
8. BramCohen. .
9. P. Felber and Ernst Biersack. Self-scaling networks for content distribution. In International Workshop on Self Properties in Complex Information Systems, 2004.
10. C. Fragouli, J.-Y. Le Boudec, and J. Widmer. Network coding: An instant primer. Technical Report TR-2005-010, EPFL, 2005.
11. C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. In IEEE Incofom, Miami, FL, 2005.
12. C. Gkantsidis and P. Rodriguez. Cooperative security for network coding file distribution. In IEEE Infocom, 2006.
13. Christos Gkantsidis, Milena Mihail, and Amin Saberi.
14. Conductance and congestion in power law graphs. In ACM SIGMETRICS, pages 148-159, San Diego, CA, US, 2003. ACM Press.
15. Christos Gkantsidis, Milena Mihail, and Amin Saberi. Random walks in peer-to-peer networks. In IEEE Infocom, Hong Kong, 2004.
16. Christos Gkantsidis, Milena Mihail, and Ellen Zegura. The markov chain simulation method for generating connected power law random graphs. In SIAM Alenex, Baltimore, MD, 2003.
17. Christos Gkantsidis, Milena Mihail, and Ellen Zegura. Spectral analysis of Internet topologies. In IEEE Infocom, San Francisco, CA, US, 2003.
18. S. Guha and P. Francis. Characterization and measurement of TCP traversal through NATs and firewalls. In ACMIMC, 2005.
19. 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), page 442, Yokohama, Japan, 2003.
20. BBCiMP. .
21. AOL In2TV. .
22. 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.
23. S. Katti, H. Rahul, W. Hu, D. Katabi, J. Crowcroft, and M. Medard. Network coding made practical. , 2006.
24. 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.
25. M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution. In IEEE Symposium on Security and Privacy, 2004.
26. Ching Law and Kai-Yeung Siu. Distributed construction of random expander networks. In IEEE Infocom, San Francisco, CA, USA, 2003.
27. Zongpeng Li, Baochun Li, and Lap Chi Lau. On achieving maximum information flow rates in undirected networks. Joint Special Issue on Networking and Information Theory, IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, June 2006.
28. David Mackay. Information theory, inference, and learning algorithms. In Cambridge University Press, 2003.
29. Petar Maymounkov and David Mazires. Rateless codes and big downloads. In IPTPS'03, 2003.
30. D. Qiu and R. Srikant. Modeling and performance analysis of bittorrentlike peer-to-peer networks. In ACM SIGCOMM04, Portland, 2004.
31. Ye Tian, D. Wu, and K.-W. Ng. Modeling, analysis and improvement for bittorrent-like file sharing networks. In IEEE Infocom, 2006.
32. V. Vishnumurthy and P. Francis. On heterogeneous overlay construction and random node selection in unstructured p2p networks. In IEEE Infocom, 2006.