On achieving optimal throughput with network coding

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2005, Pages 2184-2194

  Li, Zongpeng ^a   Li, Baochun ^a   Jiang, Dan ^a   Lau, Lap Chi ^a  

^a NONE

Author keywords

Graph theory; Information theory; Mathematical programming optimization; Simulations

Indexed keywords

COMPUTING STRATEGIES; DATA NETWORKS; NETWORK CODING; NETWORK TOPOLOGIES;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA ACQUISITION; GRAPH THEORY; INFORMATION THEORY; OPTIMIZATION;

NETWORKS (CIRCUITS);

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

References (26)

1. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker, "On Selfish Routing in Internet-Like Environments," in Proc. of ACM SIGCOMM, 2003.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Upper Saddle River, New Jersey, 1993.
3. Z. Li and B. Li, "Network Coding in Undirected Networks," in Proc. of the 38th Annual Conference on Information Sciences and Systems (CISS), 2004.
4. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network Information Flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
5. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-795, October 2003.
6. Z. Wang and J. Crowcroft, "Quality of Service Routing for Supporting Multimedia Applications," IEEE Journal on Selected Areas in Communications, vol. 14, no. 7, pp. 1228-1234, September 1996.
7. A. J. Ballardie, P. F. Francis, and J. Crowcroft, "Core Based Trees," August 1993.
8. Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "A Case for End System Multicast," IEEE Journal on Selected Areas in Communications, pp. 1456-1471, October 2002.
9. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable Application Layer Multicast," in Proc. of ACM SIGCOMM, August 2002.
10. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments," in Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP), October 2003.
11. V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, "Distributing Streaming Media Content Using Cooperative Networking," in Proc. of NOSSDAV 2002, May 2002.
12. J. Byers and J. Considine, "Informed Content Delivery Across Adaptive Overlay Networks," in Proc. of ACM SIGCOMM, August 2002.
13. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh," in Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP 2003), 2003.
14. D. Applegate and E. Cohen, "Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs," in Proc. of ACM SIGCOMM, August 2003, pp. 313-324.
15. S. Y. R. Li, R. W. Yeung, and N. Cai, "Linear Network Coding," IEEE Transactions on Information Theory, vol. 49, pp. 371, 2003.
16. S. Chen, O. Günlük, and B. Yener, "The Multicast Packing Problem," IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 311-318, 2000.
17. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing Steiner Trees," in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
18. G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in Graphs," in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000.
19. W. H. Cunningham, "Optimal Attack and Reinforcement of a Network," Journal of the ACM, vol. 32, pp. 549-561, 1985.
20. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On Achieving Optimal End-to-end Throughput in Data Networks: Theoretical and Empirical Studies," Tech. Rep., ECE, University of Toronto, 2004.
21. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003.
22. C. Gröpl, S. Hougardy, T. Nierhoff, and H. J. Prömel, "Steiner Trees in Uniformly Quasi-bipartite Graphs," Information Processing Letters, vol. 83, no. 4, pp. 195-200, 2002.
23. Z. Li and B. Li, "Efficient Computation of Maximum Multicast Rates," in Proc. of IEEE INFOCOM, 2005.
24. F. Barahona, "Packing Spanning Trees," Mathematics of Operations Research, vol. 20, no. 1, pp. 104-115, 1995.
25. N. Garg, R. Khandekar, K. Kunal, and V. Pandit, "Bandwidth Maximization in Multicasting," in Proceedings of the 11th European Symposium on Algorithms (ESA), 2003.
26. A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/brite.