Exact Admission Control for Networks with Bounded Delay Services

Authors:Liebeherr, Jorg, Department of Computer ScienceUniversity of Virginia Wrege, Dallas, Department of Computer ScienceUniversity of Virginia Ferrari, Domenico, Department of Computer ScienceUniversity of Virginia

To support the requirements for the transmission of continuous media, such as audio and video, multiservice packet switching networks must provide service guarantees to connections, including guarantees on throughput, network delays, and network delay variations. For the most demanding applications, the network must offer a service which can provide deterministic guarantees for the maximum delay of packets from all connections, referred to as bounded delay service. The admission control functions in a network with a bounded delay service must have available schedulability conditions that detect violations of delay guarantees in a network switch. In this study, exact schedulability conditions are presented for packet switches which transmit packets based on an Earliest-Deadline - First (EDF) or a Static - Priority (SP) algorithm. The schedulability conditions are given in terms of a general traffic model, making the conditions applicable to a large class of traffic specifications. A comparison of the new schedulability conditions with existing, less accurate, conditions show the efficiency gain obtained by using exact conditions. Examples are presented that show how the selection of a particular traffic specification and a schedulability condition impact the efficiency of a bounded delay service.
Note: Abstract extracted from PDF file via OCR

All rights reserved (no additional license for public reuse)
Source Citation:

Liebeherr, Jorg, Dallas Wrege, and Domenico Ferrari. "Exact Admission Control for Networks with Bounded Delay Services." University of Virginia Dept. of Computer Science Tech Report (1994).

University of Virginia, Department of Computer Science
Published Date: