Tight bounds for bandwidth allocation on two links

Leah Epstein

doi:10.1016/j.dam.2005.02.002

Tight bounds for bandwidth allocation on two links

Leah Epstein

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	181-188
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	148
Issue number	2
DOIs	https://doi.org/10.1016/j.dam.2005.02.002
State	Published - 15 May 2005

Keywords

Bandwidth allocation
On-line algorithms
Related machines
Scheduling

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2005.02.002

Cite this

@article{e4da42b1deac4029829c0fe0410912e1,

title = "Tight bounds for bandwidth allocation on two links",

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 = "Bandwidth allocation, On-line algorithms, Related machines, Scheduling",

author = "Leah Epstein",

year = "2005",

month = may,

day = "15",

doi = "10.1016/j.dam.2005.02.002",

language = "English",

volume = "148",

pages = "181--188",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Tight bounds for bandwidth allocation on two links

AU - Epstein, Leah

PY - 2005/5/15

Y1 - 2005/5/15

N2 - 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.

AB - 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.

KW - Bandwidth allocation

KW - On-line algorithms

KW - Related machines

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=17444424234&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2005.02.002

DO - 10.1016/j.dam.2005.02.002

M3 - Article

AN - SCOPUS:17444424234

SN - 0166-218X

VL - 148

SP - 181

EP - 188

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 2

ER -

Tight bounds for bandwidth allocation on two links

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this