A hypergraph approach to linear network coding in multicast networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 21, Issue 7, 2010, Pages 968-982

  Yang, Min ^a   Yang, Yuanyuan ^b  

^a FalconStor Software   (United States)

^b Stony Brook University   (United States)

Author keywords

Hypergraph; Linear coding; Multicast network; Network coding

Indexed keywords

COMPUTATION TIME; GRAPH SIZES; HYPERGRAPH; ITERATIVE REFINEMENT; LINEAR CODES; LINEAR CODING; LINEAR NETWORK CODING; MEDIUM SIZE; MULTICAST NETWORK; MULTICAST TREE; MULTIPLE RECEIVERS; NETWORK CODING; POLYNOMIAL-TIME; PRE-PROCESSING ALGORITHMS; SHORTEST PATH PROBLEM; SIMULATION RESULT; SOURCE NODES;

ALGORITHMS; ENCODING (SYMBOLS); GRAPH THEORY; INFORMATION THEORY; LINEAR NETWORKS; MULTICASTING; POLYNOMIAL APPROXIMATION;

COMPUTER SIMULATION;

EID: 77953098094     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2009.144     Document Type: Article

References (29)

1. R. Ahlswede, N. Cai, S.Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol.46, no.4, pp. 1204-1216, July 2000.
2. S.Y.R. Li, R.W. Yeung, and N. Cai, "Linear Network Coding," IEEE Trans. Information Theory, vol.49, no.2, pp. 371-381, Feb. 2003.
3. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Trans. Networking, vol.11, no.5, pp. 782-795, Oct. 2003.
4. T. Ho, M. Medard, J. Shi, M. Effros, and D.R. Karger, "On Randomized Network Coding," Proc. Ann. Allerton Conf. Comm., Control, and Computing, 2003.
5. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Trans. Information Theory, vol.52, no.10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
6. D.S. Lun, N. Ratnakar, R. Koetter, M. Medard, E. Ahmed, and H. Lee, "Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding," Proc. IEEE INFOCOM '05, Mar. 2005.
7. D.S. Lun, M. Medard, T. Ho, and R. Koetter, "Network Coding with a Cost Criterion," Proc. 2004 Int'l Symp. Information Theory and its Applications (ISITA '04), Oct. 2004.
8. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XORs in the Air: Practical Wireless Network Coding," Proc. ACM SIGCOMM '06, Sept. 2006.
9. P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
10. N. Harvey, D.R. Karger, and K. Murota, "Deterministic Network Coding by Matrix Completion," Proc. ACM-SIAM Symp. Discrete Algorithms, Jan. 2005.
11. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial Time Algorithms for Multicast Network Code Construction," IEEE Trans. Information Theory, vol.51, no.6, pp. 1973-1982, June 2005.
12. M. Kim, C.W. Ahn, M. Medard, and M. Effros, "On Minimizing Network Coding Resources: An Evolutionary Approach," Proc. Workshop on Network Coding, Theory and Applications (NetCod), 2006.
13. K. Bhattad, N. Ratnakar, R. Koetter, and K.R. Narayanan, "Minimal Network Coding for Multicast," Proc. IEEE Int'l Symp. Information Theory, 2005.
14. J.K. Sundararajan, M. Medard, R. Koetter, and E. Erez, "A Systematic Approach to Network Coding Problems Using Conflict Graphs," Proc. UCSD Workshop Information Theory and its Applications, Feb. 2006.
15. P. Paul and S.V. Raghavan, "Survey of Multicast Routing Algorithms and Protocols," Proc. 15th Int'l Conf. Computer Comm., Aug. 2002.
16. J. Cheriyan and M.R. Salavatipour, "Hardness and Approximation Results for Packing Steiner Trees," Algorithmica, vol.45, no.1, pp. 21-43, 2006.
17. K. Jain, M. Mahdian, and M.R. Salavatipour, "Packing Steiner Trees," Proc. 14th ACM-SIAM Symp. Discrete Algorithms, 2003.
18. Z. Li, B. Li, D. Jiang, and L.C. Lau, "On Achieving Optimal Throughput with Network Coding," Proc. IEEE INFOCOM '05, Mar. 2005.
19. C. Chekuri, C. Fragouli, and E. Soljanin, "On Average Throughput and Alphabet Size in Network Coding," IEEE/ACM Trans. Networking, vol.14, pp. 2410-2424, June 2006.
20. C. Fragouli, J.Y. Le Boudec, and J. Widmer, "On the Benefits of Network Coding for Wireless Applications," Proc. Workshop on Network Coding, Theory and Applications (NetCod), 2006.
21. C. Fragouli and E. Soljanin, "Information Flow Decomposition for Network Coding," IEEE Trans. Information Theory, vol.52, no.3, pp. 829-848, Mar. 2006.
22. C. Wu and B. Li, "Echelon: Peer-to-Peer Network Diagnosis with Network Coding," Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS), 2006.
23. S. Jaggi, P.A. Chou, and K. Jain, "Low Complexity Algebraic Multicast Network Codes," Proc. IEEE Int'l Symp. Information Theory, 2003.
24. J.K. Sundararajan, M. Medard, M. Kim, A. Eryilmaz, D. Shah, and R. Koetter, "Network Coding in a Multicast Switch," Proc. IEEE INFOCOM '07, May 2007.
25. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2001.
26. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments," Proc. ACM Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
27. V.N. Padmanabhan, H.J. Wang, and P.A. Chou, "Resilient Peer-to- Peer Streaming," Proc. IEEE Int'l Conf. Network Protocols (ICNP), 2003.
28. The Network Simulator-ns-2, http://www.isi.edu/nsnam/ns/, 2009.
29. GT ITM: Georgia Tech Internetwork Topology Models, http:// www.cc.gatech.edu/projects/gtitm/, 2009.