Fairness in routing and load balancing
- 20 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Computational Complexity of Combinatorial and Graph-Theoretic ProblemsPublished by Springer Science and Business Media LLC ,2011
- 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
- On the single-source unsplittable flow problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Competitive routing of virtual circuits in ATM networksIEEE Journal on Selected Areas in Communications, 1995
- Approximation algorithms for scheduling unrelated parallel machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962