A Family of Stable Multipath Dual Congestion Control Algorithms
We consider the problem of multipath congestion control in the Internet. The aim is to take advantage of multiple paths diversity to achieve efficient bandwidth allocation and improve network efficiency. But there exist some potential difficulties when one directly uses the well-known network utilit...
Saved in:
Published in | Journal of computer science and technology Vol. 30; no. 6; pp. 1274 - 1289 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.11.2015
Springer Nature B.V Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing 100084, China%School of Mathematics and Systems Science, Beihang University, Beijing 100191, China%Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China%School of Computer Science, Beijing Institute of Technology, Beijing 100081, China Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing 100084, China |
Subjects | |
Online Access | Get full text |
ISSN | 1000-9000 1860-4749 |
DOI | 10.1007/s11390-015-1598-y |
Cover
Summary: | We consider the problem of multipath congestion control in the Internet. The aim is to take advantage of multiple paths diversity to achieve efficient bandwidth allocation and improve network efficiency. But there exist some potential difficulties when one directly uses the well-known network utility maximization model to design stable multipath congestion control algorithms for the alternative paths. In this paper, we propose a generalized multipath utility maximization model to consider the problem of joint routing and rate control, which can be reduced to specific models with different parameter settings. And then we develop a family of multipath dual congestion control algorithms which are stable in the absence of delays. We also derive decentralized and scalable sufficient conditions for a particular scheme when propagation delays exist in networks. The simulation results show that the proposed multipath dual congestion control algorithms with appropriate parameter settings can achieve stable resource shares while maintaining fairness among the involved users. |
---|---|
Bibliography: | flow control, resource allocation, duality, stability, multipath congestion control 11-2296/TP We consider the problem of multipath congestion control in the Internet. The aim is to take advantage of multiple paths diversity to achieve efficient bandwidth allocation and improve network efficiency. But there exist some potential difficulties when one directly uses the well-known network utility maximization model to design stable multipath congestion control algorithms for the alternative paths. In this paper, we propose a generalized multipath utility maximization model to consider the problem of joint routing and rate control, which can be reduced to specific models with different parameter settings. And then we develop a family of multipath dual congestion control algorithms which are stable in the absence of delays. We also derive decentralized and scalable sufficient conditions for a particular scheme when propagation delays exist in networks. The simulation results show that the proposed multipath dual congestion control algorithms with appropriate parameter settings can achieve stable resource shares while maintaining fairness among the involved users. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 1000-9000 1860-4749 |
DOI: | 10.1007/s11390-015-1598-y |