Design Methods for Utility Max-Min Fair Share Networks

摘要

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.