This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Hypergraph Approach to Linear Network Coding in Multicast Networks
July 2010 (vol. 21 no. 7)
pp. 968-982
ASCII Text
x 
 
Min Yang, Yuanyuan Yang, "A Hypergraph Approach to Linear Network Coding in Multicast Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 968-982, July, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2009.144,
author = {Min Yang and Yuanyuan Yang},
title = {A Hypergraph Approach to Linear Network Coding in Multicast Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {21},
number = {7},
issn = {1045-9219},
year = {2010},
pages = {968-982},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.144},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - A Hypergraph Approach to Linear Network Coding in Multicast Networks
IS - 7
SN - 1045-9219
SP968
EP982
EPD - 968-982
A1 - Min Yang,
A1 - Yuanyuan Yang,
PY - 2010
KW - Network coding
KW - linear coding
KW - multicast network
KW - hypergraph.
VL - 21
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Min Yang, State University of New York at Stony Brook, Stony Brook
Yuanyuan Yang, State University of New York at Stony Brook, Stony Brook
Network coding is a promising generalization of routing which allows a node to generate output messages by encoding its received messages. A typical scenario where network coding offers unique advantages is a multicast network where a source node generates messages and multiple receivers collect the messages. In a multicast network, linear network codes are preferred due to its sufficiency and simplicity. In this paper, we propose an approach to transforming the linear coding problem into a graph theory problem. By utilizing hypergraphs, we model the linear codes by constructing a pseudodual graph of the multicast network. Then, a valid linear code is equivalent to a cover in the pseudodual graph satisfying some constraints. By iterative refinements, an eligible cover can be found in polynomial time. Moreover, we propose several preprocessing algorithms to further reduce the computation time required by the iterative refinements by reducing the graph size before transformation. An important contribution of this work is that the proposed approach can be readily extended to solve many minimal network coding problems. By assigning different weights to edges, minimal network coding problems are reduced to the shortest path problem in the pseudodual graph. Our simulation results show that the proposed preprocessing algorithms can reduce the computation time by about 40-50 percent in a medium size multicast network compared to the scheme without preprocessing algorithms, and the throughput of the system with network coding is 25 percent higher than that with the traditional approach of multiple multicast trees.

[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.
[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/nsnamns/, 2009.
[29] GT ITM: Georgia Tech Internetwork Topology Models, http://www.cc.gatech.edu/projectsgtitm/, 2009.

Index Terms:
Network coding, linear coding, multicast network, hypergraph.
Citation:
Min Yang, Yuanyuan Yang, "A Hypergraph Approach to Linear Network Coding in Multicast Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 968-982, July 2010, doi:10.1109/TPDS.2009.144
Usage of this product signifies your acceptance of the Terms of Use.