Congestion Control for Multicast Flows With Network Coding

被引:14
作者
Chen, Lijun [1 ]
Ho, Tracey [2 ]
Chiang, Mung [3 ]
Low, Steven H. [2 ]
Doyle, John C. [2 ]
机构
[1] Univ Colorado, Coll Engn & Appl Sci, Boulder, CO 80309 USA
[2] CALTECH, Div Engn & Appl Sci, Pasadena, CA 91125 USA
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
Coding subgraph; congestion control; distributed algorithm; multicast; network coding; ALGORITHM;
D O I
10.1109/TIT.2012.2204170
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:5908 / 5921
页数:14
相关论文
共 31 条
[21]   Dynamic power allocation and routing for time-varying wireless networks [J].
Neely, MJ ;
Modiano, E ;
Rohrs, CE .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (01) :89-103
[22]  
Pagnini F., 2006, ANN C INF SCI SYST
[23]   A framework for routing and congestion control for multicast information flows [J].
Sarkar, S ;
Tassiulas, L .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (10) :2690-2708
[24]  
Shor N.Z., 1985, Monimization Methods for Non-Differentiable Functions
[25]   STABILITY PROPERTIES OF CONSTRAINED QUEUING-SYSTEMS AND SCHEDULING POLICIES FOR MAXIMUM THROUGHPUT IN MULTIHOP RADIO NETWORKS [J].
TASSIULAS, L ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (12) :1936-1948
[26]  
Wardrop JG., 1952, P I CIVIL ENG, V1, P352, DOI DOI 10.1680/IPEDS.1952.11259
[27]   Network planning in wireless ad hoc networks: A cross-layer approach [J].
Wu, Y ;
Chou, PA ;
Zhang, Q ;
Jain, K ;
Zhu, WW ;
Kung, SY .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (01) :136-150
[28]  
Wu Y., 2006, IEEE NETCOD
[29]   Distributed utility maximization for network coding based multicasting: A shortest path approach [J].
Wu, Yunnan ;
Kung, Sun-Yuan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (08) :1475-1488
[30]  
Xi Y., 2005, ALL C