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 | |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA Duration: 4 May 1997 → 6 May 1997 |