Fairness in Routing and Load Balancing
- 1 August 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 63 (1), 2-20
- https://doi.org/10.1006/jcss.2001.1752
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Single-source unsplittable flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating max-min fair rates via distributed local scheduling with partial informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved approximation algorithms for unsplittable flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast, Fair and Frugal Bandwidth Allocation in ATM NetworksAlgorithmica, 2002
- On the Single-Source Unsplittable Flow ProblemCombinatorica, 1999
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962