一族稳定的多路径对偶拥塞控制算法
A Family of Stable Multipath Dual Congestion Control Algorithms
-
摘要: 在考虑用多路径进行带宽分配以提高互联网的有效性时, 直接基于网络效用最大化模型来设计对偶拥塞控制算法存在技术上的困难。为了解决这个难题, 本文提出了一个广义的效用最大化模型, 其是文献上已提出的模型的推广。我们讨论了该模型的对偶问题并设计了一族全局稳定的对偶拥塞控制算法。这些算法可以同时求解这个广义效用最大化模型和它的对偶问题。当网络存在传播延迟时, 我们针对这族算法的一种特定机制给出了保证算法稳定的充分条件, 这些条件是分布式和可扩展的。Abstract: 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.