Abstract
In this study, the problem of selecting paths for routing is considered so as to provide a bandwidth allocation that is as fair as possible. The first approximation algorithms for this basic optimization problem, for single-source unsplittable routing in an arbitrary direct graph, are derived. Special cases of the model include several fundamental load balancing problems, endowing them with a natural fairness criterion to which the approach can be applied.
| Original language | English |
|---|---|
| Pages (from-to) | 568-578 |
| Number of pages | 11 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999 |
Bibliographical note
Funding Information:1A preliminary version of this paper appears in ‘‘Proc. 40th IEEE Symp. Foundations of Computer Science’’. 2Supported in part by a David and Lucile Packard Foundation Fellowship, an ONR Young Investigator Award, NSF Faculty Early Career Development Award CCR-9701399, and BSF Grant 96-00402. 3Work at the Technion supported by BSF Grant 96-00402, Ministry of Science Contract 9480198, and by the Fund of the Promotion of Research at the Technion. 4Research partially supported by NSF Grant CCR-9700163, ONR Grant N00014-98-1-058, and BSF Grant 96-00402.