Allocating bandwidth for bursty connections

Jon Kleinberg; Yuval Rabani; Eva Tardos

doi:10.1145/258533.258661

Allocating bandwidth for bursty connections

Jon Kleinberg^*
, Yuval Rabani
, Eva Tardos

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

56 Scopus citations

Abstract

Statistical multiplexing is studied in the perspective of approximation algorithms by considering a model of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable. Stochastic load balancing, stochastic binpacking, and stochastic knapsack were also considered. In stochastic load balancing, the number of links is given and the expected value of the maximum load is minimized. In binpacking and knapsack, the link capacity and an allowed overflow probability are given, and the objective is to assign connections to links. The approximation algorithm uses the standard definition of effective bandwidth.

Original language	English
Pages (from-to)	664-673
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/258533.258661
State	Published - 1997
Externally published	Yes
Event	29th annual ACM symposium on Theory of computing, STOC 1997 - El Paso, TX, USA Duration: 4 May 1997 → 6 May 1997

Access to Document

10.1145/258533.258661

Cite this

@article{af40564b043f413fb955175f5f5330bc,

title = "Allocating bandwidth for bursty connections",

abstract = "Statistical multiplexing is studied in the perspective of approximation algorithms by considering a model of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable. Stochastic load balancing, stochastic binpacking, and stochastic knapsack were also considered. In stochastic load balancing, the number of links is given and the expected value of the maximum load is minimized. In binpacking and knapsack, the link capacity and an allowed overflow probability are given, and the objective is to assign connections to links. The approximation algorithm uses the standard definition of effective bandwidth.",

author = "Jon Kleinberg and Yuval Rabani and Eva Tardos",

year = "1997",

doi = "10.1145/258533.258661",

language = "אנגלית",

pages = "664--673",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery",

note = "29th annual ACM symposium on Theory of computing, STOC 1997 ; Conference date: 04-05-1997 Through 06-05-1997",

}

TY - JOUR

T1 - Allocating bandwidth for bursty connections

AU - Kleinberg, Jon

AU - Rabani, Yuval

AU - Tardos, Eva

PY - 1997

Y1 - 1997

N2 - Statistical multiplexing is studied in the perspective of approximation algorithms by considering a model of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable. Stochastic load balancing, stochastic binpacking, and stochastic knapsack were also considered. In stochastic load balancing, the number of links is given and the expected value of the maximum load is minimized. In binpacking and knapsack, the link capacity and an allowed overflow probability are given, and the objective is to assign connections to links. The approximation algorithm uses the standard definition of effective bandwidth.

AB - Statistical multiplexing is studied in the perspective of approximation algorithms by considering a model of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable. Stochastic load balancing, stochastic binpacking, and stochastic knapsack were also considered. In stochastic load balancing, the number of links is given and the expected value of the maximum load is minimized. In binpacking and knapsack, the link capacity and an allowed overflow probability are given, and the objective is to assign connections to links. The approximation algorithm uses the standard definition of effective bandwidth.

UR - https://www.scopus.com/pages/publications/0030699603

U2 - 10.1145/258533.258661

DO - 10.1145/258533.258661

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0030699603

SN - 0734-9025

SP - 664

EP - 673

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - 29th annual ACM symposium on Theory of computing, STOC 1997

Y2 - 4 May 1997 through 6 May 1997

ER -

Allocating bandwidth for bursty connections

Abstract

Access to Document

Other files and links

Fingerprint

Cite this