Optimization based rate control for multicast with network coding: A multipath formulation

Network coding offers new capabilities for efficient information multicasting in communication networks. In this paper, we study rate control for multicast with network coding. We propose a path-based multicasting scheme, where each source has multiple paths to each receiver in the multicast group. One advantage of this approach over a tree-based approach is that it is easier to find a minimum cost set of paths as compared to trees. We present three end-to-end rate control algorithms which operate over the set of paths supplied by the network layer. With random network coding, all algorithms can be implemented in a distributed manner. Our algorithms can also be generalized to solve other optimization problems with non-strictly concave objection function.

[1]  Raymond W. Yeung,et al.  Multilevel diversity coding with distortion , 1995, IEEE Trans. Inf. Theory.

[2]  Tracey Ho,et al.  Rate Control for Multicast with Network Coding , 2006 .

[3]  Hanif D. Sherali,et al.  Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..

[4]  F. Paganini,et al.  Congestion control with adaptive multipath routing based on optimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[5]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

[7]  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.

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

[9]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

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

[11]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

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

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

[14]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[15]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

[17]  Leandros Tassiulas,et al.  Optimization based rate control for multirate multicast sessions , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[19]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[21]  Leandros Tassiulas,et al.  A framework for routing and congestion control for multicast information flows , 2002, IEEE Trans. Inf. Theory.

[22]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

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

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

[25]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[26]  Yunnan Wu,et al.  Network planning in wireless ad hoc networks: a cross-Layer approach , 2005, IEEE Journal on Selected Areas in Communications.

[27]  Leandros Tassiulas,et al.  Layered multicast rate control based on Lagrangian relaxation and dynamic programming , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[28]  Steven McCanne,et al.  Low-Complexity Video Coding for Receiver-Driven Layered Multicast , 1997, IEEE J. Sel. Areas Commun..

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

[30]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[31]  H LowSteven,et al.  Optimal flow control and routing in multi-path networks , 2003 .

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

[33]  Richard J. La,et al.  Measurement based optimal multi-path routing , 2004, IEEE INFOCOM 2004.

[34]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[35]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[36]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

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