On scheduling real-time traffic under controlled load service in anintegrated services Internet
Hongyuan Shi
Sethu, H.
Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA;
This paper appears in: High Performance Switching and Routing, 2001 IEEE Workshop on
Publication Date: 2001
On page(s): 11-15
Meeting Date: 05/29/2001 - 05/31/2001
Location: Dallas, TX, USA
ISBN: 0-7803-6711-1
References Cited: 5
INSPEC Accession Number: 7042729
Digital Object Identifier: 10.1109/HPSR.2001.923595
Current Version Published: 2002-08-07
Abstract
The controlled load service defined within the IETF's Integrated
Services architecture for QoS in the Internet requires source points to
regulate the traffic while the network provides a soft guarantee on
performance. Packets sent in violation of the traffic are marked so that
the network may give them lower priority. We have defined the
requirements of a scheduler serving packets belonging to the controlled
load service. Besides efficiency and throughput goals, we define another
important requirement to bound the additional delay of unmarked packets
caused due to the transmission of marked packets. For any given desired
bound α on this additional delay, we present the CL(α)
scheduler which achieves the bound while also achieving a per-packet
work complexity of O(1). We also provide analytical proofs of these
results on the CL(α) scheduler. The principle used in this
algorithm can also be used to schedule flows with multilevel priorities,
such as in some real-time video streams as well as in other emerging
service models of the Internet that mark packets to identify drop
precedences
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
