By Topic

Tradeoffs in designing networks with end-to-end statistical QoS guarantees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Liebeherr ; Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA ; S. Patek ; E. Yilmaz

Recent research on 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 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, and compare the achievable statistical multiplexing gain. Each of the designs presents a particular trade-off between the 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 two designs. The presented class-level aggregation design is shown to yield very high achievable link utilizations while simultaneously achieving the desired statistical guarantees on delay

Published in:

Quality of Service, 2000. IWQOS. 2000 Eighth International Workshop on

Date of Conference: