Tight bounds for bandwidth allocation on two links

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)181-188
Number of pages8
JournalDiscrete Applied Mathematics
Issue number2
StatePublished - 15 May 2005


  • Bandwidth allocation
  • On-line algorithms
  • Related machines
  • Scheduling

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Tight bounds for bandwidth allocation on two links'. Together they form a unique fingerprint.

Cite this