A New Distributed Optimal Utility Max-Min Fair Resource Allocation

A central issue in computer network is how to allocate bandwidth to flows fairly, in a decentralized manner. However, there are few researches in the literature of utility-fair network resource allocation algorithm. In this paper, we propose a new approach to achieve utility max-min fairness in network bandwidth allocation, which based on a vector optimization and some extension to the famous kuhn-tucker conditions for nonlinear optimization. We formulate a nonlinear program that finds the optimal bandwidth allocation. This leads to a source link algorithm which we show its convergence to the optimal allocation by an example.