Note: Tight bounds for bandwidth allocation on two links

Authors:
Leah Epstein
Affiliations:
Department of Mathematics, University of Haifa, 31905 Haifa, Israel
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 3
Cited 2

On-Line Machine Covering

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
The exact LPT-bound for maximizing the minimum completion time

Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters

On-line machine covering on two machines with local migration

Computers & Mathematics with Applications
Online scheduling with rejection and withdrawal

Theoretical Computer Science

Quantified Score

Hi-index	0.06

Visualization

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.