Allocating bandwidth for bursty connections

Jon Kleinberg*, Yuval Rabani, Eva Tardos

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

48 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 languageAmerican English
Pages (from-to)664-673
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA
Duration: 4 May 19976 May 1997

Fingerprint

Dive into the research topics of 'Allocating bandwidth for bursty connections'. Together they form a unique fingerprint.

Cite this