Distributed Algorithms for Minimum Cost Multicast With Network Coding

Network coding techniques are used to find the minimum-cost transmission scheme for multicast sessions with or without elastic rate demand. It is shown that in wireline networks, solving for the optimal coding subgraphs in network coding is equivalent to finding the optimal routing scheme in a multicommodity flow problem. A set of node-based distributed gradient projection algorithms are designed to jointly implement congestion control/routing at the source node and ¿virtual¿ routing at intermediate nodes. The analytical framework and distributed algorithms are further extended to interference-limited wireless networks where link capacities are functions of the signal-to-interference-plus-noise ratio (SINR). To achieve minimum-cost multicast in this setting, the transmission powers of links must be jointly optimized with coding subgraphs and multicast input rates. Node-based power allocation and power control algorithms are developed for the power optimization. The power algorithms, when iterated in conjunction with the congestion control and routing algorithms, converge to the jointly optimal multicast configuration. The scaling matrices required in the gradient projection algorithms are explicitly derived and are shown to guarantee fast convergence to the optimum from any initial condition.

[1]  Klara Nahrstedt,et al.  Optimal distributed multicast routing using network coding: theory and applications , 2004, PERV.

[2]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[3]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[4]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[5]  XiYufang,et al.  Distributed algorithms for minimum cost multicast with network coding , 2010 .

[6]  Sanjay Shakkottai,et al.  Min-Cost Selfish Multicast With Network Coding , 2006, IEEE Transactions on Information Theory.

[7]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.

[8]  R. Srikant,et al.  Congestion control for fair resource allocation in networks with multicast flows , 2004, IEEE/ACM Transactions on Networking.

[9]  K. Jain,et al.  Practical Network Coding , 2003 .

[10]  Michael L. Honig,et al.  Distributed interference compensation for wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[11]  Tracey Ho,et al.  Network Coding with a Cost Criterion , 2004 .

[12]  Edmund M. Yeh,et al.  Optimal Distributed Power Control, Routing, and Congestion Control in Wireless Networks , 2006 .

[13]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[14]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[15]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[16]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[17]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[18]  Mung Chiang,et al.  To layer or not to layer: balancing transport and physical layers in wireless multihop networks , 2004, IEEE INFOCOM 2004.

[19]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Yunnan Wu,et al.  Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut Approach , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[21]  T. Ho,et al.  On Linear Network Coding , 2010 .

[22]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[23]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[24]  Tracey Ho,et al.  An information-theoretic view of network management , 2005, IEEE Transactions on Information Theory.

[25]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[26]  Klara Nahrstedt,et al.  Optimal Distributed Multicast Routing using Network Coding , 2007, 2007 IEEE International Conference on Communications.

[27]  Leandros Tassiulas,et al.  Optimization based rate control for multipath sessions , 2001 .

[28]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[29]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  Ness B. Shroff,et al.  The multi-path utility maximization problem , 2003 .