Title of article
Tight bounds for bandwidth allocation on two links
Author/Authors
Leah Epstein، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
8
From page
181
To page
188
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.
Keywords
On-line algorithms , Scheduling , Related machines , Bandwidth allocation
Journal title
Discrete Applied Mathematics
Serial Year
2005
Journal title
Discrete Applied Mathematics
Record number
886097
Link To Document