Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Combining fairness with throughput: online routing with multiple objectives
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Introduction to Linear Optimization
Introduction to Linear Optimization
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Linear Programming Based Approach for Computing Optimal Fair Splittable Routing
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
On Efficient Max-Min Fair Routing Algorithms
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Internet Routing and Related Topology Issues
SIAM Journal on Discrete Mathematics
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Max-min fairness in multi-commodity flows
Computers and Operations Research
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Max-min fairness in multi-commodity flows
Computers and Operations Research
Utility max-min fair resource allocation for communication networks with multipath routing
Computer Communications
Do next generation networks need path diversity?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy-aware routing in data center network
Proceedings of the first ACM SIGCOMM workshop on Green networking
Achieving high utilization with software-driven WAN
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Greening data center networks with throughput-guaranteed power-aware routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair rate allocation. The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. We consider nonbounded access rates, but we show how the proposed approach can handle the case of upper-bounded access rates. A proof of optimality and some computational results are also presented.