Computing optimal max-min fair resource allocation for elastic flows
IEEE/ACM Transactions on Networking (TON)
Lexicographically Minimum and Maximum Load Linear Programming Problems
Operations Research
Max-min fairness in multi-commodity flows
Computers and Operations Research
Max-Min fair distribution of modular network flows on fixed paths
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.00 |
In this paper we consider the fair flow problem in multiple source multiple sink network, as applied to telecommunication networks. We present an iterative algorithm for computing fair routing in networks where the available resources are shared among competing flows according to a max-min fair sharing criterion. Our main objective is computing optimal routing paths, with regard to max-min fairness, in stable and known traffic conditions. It is a linearprogramming based approach which permits a lexicographical maximization of the vector of fair-share attributed to the connections competing for network resources. An optimality proof and some computational results are also presented.