The Successive Approximation Approach for Multi-Path Utility Maximization Problem
In this paper, the authors solve the Network Utility Maximization (NUM) problem for networks with both multi-path and single-path users. To deal with the non-strictly convexity and non-separability of the problem, they approximate it to a new strictly convex and separable problem which is efficiently solved by the standard dual-based decomposition approach. After a sequence of approximations, the solution to the approximation problem converges to a globally optimal solution of the original NUM. From the theoretical analysis, they also introduce a design of multipath Reno (mReno) based on the reverse engineering framework of TCP Reno. The fairness among multi-path users and single-path users is guaranteed.