Paper Info
Title
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
Abstract
This paper describes how Dynamic Window-Constrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with different performance objectives. We show that: (1) DWCS can guarantee that no more than x packets miss their deadlines for every y consecutive packets requiring service, as long as the minimum aggregate bandwidth requirement of all real-time packet streams does not exceed the available bandwidth, (2) using DWCS, the delay of service to realtime packet streams is bounded even when the scheduler is overloaded, (3) DWCS can ensure that the delay bound of any given stream is independent of other streams, and (4) a fast response time for best-effort packet streams, in the presence of real-time packet streams, is possible. Furthermore, if a feasible schedule exists, each stream is guaranteed a minimum fraction of available bandwidth over a finite window of time.
Year
DOI
Venue
2000
10.1109/REAL.2000.896013
Orlando, FL
Keywords
DocType
ISSN
packet switching,quality of service,real-time systems,scheduling,best-effort packet streams,bounded service delay,dynamic window-constrained scheduling,fast response time,minimum aggregate bandwidth requirement,missed deadlines,overloaded scheduler,performance objectives,real-time packet streams,real-time service guarantee,stream delay bound
Conference
1052-8725
ISBN
Citations 
PageRank 
0-7695-0900-2
56
3.01
References 
Authors
15
2
Name
Order
Citations
PageRank
Richard West1563.01
Christian Poellabauer252960.18