Name
Abstract | ||
|---|---|---|
Recent research on statistical multiplexing has provided many new insights into the achievable multiplexing gain in QoS networks. However, usually, these results are stated in terms of the gain experienced at a single switch, and evaluating the statistical multiplexing gain in a general network remains a difficult challenge. In this paper we describe two distinct network designs for statistical end-to-end delay guarantees, referred to as class-level aggregation and path-level aggregation. These designs illustrate an inherent trade-off between attainable statistical multiplexing gain and the ability to support delay guarantees. The key characteristic of both designs is that they do not require, and instead, intentionally avoid, consideration of the correlation between flows at multiplexing points inside the network. Numerical examples are presented for a comparison of the statistical multiplexing gain achievable by the two designs. The class-level aggregation design is shown to yield very high achievable link utilizations while simultaneously achieving desired statistical guarantees on delay. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1023619518243 | Telecommunications Systems |
Keywords | DocType | Volume |
statistical multiplexing,statistical service,quality-of-service | Journal | 23 |
Issue | ISSN | Citations |
1-2 | 1572-9451 | 13 |
PageRank | References | Authors |
0.88 | 35 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen D. Patek | 1 | 131 | 17.32 |
| J. Liebeherr | 2 | 1565 | 145.22 |
| Erhan Yilmaz | 3 | 91 | 6.34 |