| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328424 | Discrete Applied Mathematics | 2005 | 8 Pages |
Abstract
We study on-line bandwidth allocation on two parallel links. Motivated by issues of quality of service and fair resource allocation, the goal is to maximize the load of the least loaded link. We analyze several models for which we give tight bounds on the competitive ratio.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Leah Epstein,