Maximum Throughput Network Routing Subject to Fair Flow Allocation
- 22 July 2014
- book chapter
- Published by Springer Nature
- p. 1-12
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering2012
- Upward Max Min Fairness2012
- Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphsCombinatorica, 2010
- SNDlib 1.0—Survivable Network Design LibraryNetworks, 2009
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networksEuropean Journal of Operational Research, 2008
- Max–min fairness in multi-commodity flowsComputers & Operations Research, 2008
- A polynomial algorithm for solving a general max‐min fairness problemEuropean Transactions on Telecommunications, 2005
- Bandwidth sharing: objectives and algorithmsIEEE/ACM Transactions on Networking, 2002
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974