A Large Family of Multi-Path Dual Congestion Control Algorithms
The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing scheme fails to react to instantaneous network congestion. Multi-path routing schemes thus have been proposed aiming at improving network efficiency. Unfortunately, the natural optimization problem to consider is concave but not strictly concave. It thus brings a huge challenge to design stable multi-path congestion control algorithms. In this paper, the authors propose a generalized multi-path utility maximization model to consider the problem of routes selection and flow control, and derive a family of multi-path dual congestion control algorithms.