Tradeoffs in Designing Networks with End-to-End Statistical QoS GuaranteesReport
Recent research n statistical multiplexing has provided many new insights into the achievable multiplexing gain in QoS networks, however, generally only in terms of the gain experienced at a single switch. Evaluating the statistlcal multiplexing gain in a general network remains a dillicult 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, and compare the achievable statistical multiplexing gain. Each of the designs presents a particular trade-affhetween the attainable statistical nrultiplexinggain and the ability to support delay guarantees. The key characteristic ofbotb designs is that they do not require, and instead, Intentionally avoid, consideration or the correlation between flows at multiplexing points inside the network. Nurnerleal examples are presented for a comparison of the two designs. The presented class-level aggregation design is shown to yield very high achievable link utilizatinns while simultaneously achieving desired statistical guarantee on delay.
Note: Abstract extracted from PDF file via OCR
All rights reserved (no additional license for public reuse)
Liebeherr, Jorg, Stephen Patek, and Erhan Yilmaz. "Tradeoffs in Designing Networks with End-to-End Statistical QoS Guarantees." University of Virginia Dept. of Computer Science Tech Report (2001).
University of Virginia, Department of Computer Science