Distributed Rate Allocation for Multi-path Routing Based on Network Utility Maximization

In this paper, the multi-path utility maximization problem is investigated. As the objective function of Multipath routing is not strictly concave, the dual problem may not be differentiable for every point when one attempts to use a duality approach. To ensure the objective function strictly concave, a logarithmic term is introduced. We propose a distributed rate allocation algorithm and prove the convergence performance. Simulation results show that the mechanism can converge rapidly and make better use of network resources.