Congestion Control for Multicast Flows With Network Coding

Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, the problem of flow control at end-systems for network-coding-based multicast flows is addressed. Optimization-based models are formulated for network resource allocation, based on which two sets of decentralized controllers at sources and links/nodes for congestion control are developed for wired networks with given coding subgraphs and without given coding subgraphs, respectively. With random network coding, both sets of controllers can be implemented in a distributed manner, and work at the transport layer to adjust source rates and at network layer to carry out network coding. The convergence of the proposed controllers to the desired equilibrium operating points is proved, and numerical examples are provided to complement the theoretical analysis. The extension to wireless networks is also briefly discussed.

[1]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

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

[3]  Yufang Xi,et al.  Distributed Algorithms for Minimum Cost Multicast With Network Coding , 2010, IEEE/ACM Transactions on Networking.

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

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

[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]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

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

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

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

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

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

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

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

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

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

[18]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

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

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

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

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

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

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

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

[28]  ModianoEytan,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

[29]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

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

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

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