SCED+: efficient management of quality of service guarantees

Publisher Website
Google Scholar
Abstract
Current proposals for the provision of deter- ministic quality of service guarantees in integrated services networks require per-session management of traffic flowing in network switches, raising scalability questions for practi- cal implementation of high speed packet switching in large scale networks. At the same time, the end-to-end delay bounds associated with current proposals can be overly con- servs.tive, limiting the utility of the bounds to guide eilicient resource allocation. In this paper, we introduce SCED+, a network scheduling algorithm that yields scalable provision of tight deterministic end-to-end delay bounds. These features are a thieved through the use of aggregation and efficient sta- tistical multiplexing between best-effort and guaranteed traffic. The !3CED+ algorithm also supports statistical multiplexing between "guaranteed" traffic streams, providing tight end- to-en.d delay bounds for traffic streams which can tolerate non-zero packet 10SS rates. In order to facilitate the anal- ysis of SCED+, we refine the so-called %etwork calculus~~ to acldress delay jitter, and introduce a simple and unified approach to the analysis of output burstiness of traffic de- parting from a general network element.

This publication has 23 references indexed in Scilit: