Analysis of a WindowConstrained Scheduler for RealTime and BestEffort Packet Streams.pdfVIP

Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams Richard West and Christian Poellabauer College of Computing Georgia Institute of Technology Atlanta, GA 30332 west,chris
@cc.gatech.edu Abstract discipline, for scheduling the transmission of packets from ‘loss-tolerant’ applications, must attempt to guarantee that This paper describes how Dynamic Window- no more than  packets are serviced late for every  packets Constrained Scheduling (DWCS) can guarantee real-time requiring service. service to pac kets fr om multiple streams with differ ent This paper analyzes the real-time properties of Dynamic performance objectives. We show that: (1) D WCS can Window-Constrained Scheduling (DWCS) [18, 19], an al- guarantee that no more than  pac kets miss their deadlines gorithm that is suitable for packet scheduling in real-time for every  consecutive pac kets requiring service, as long communications. DWCS is designed to explicitly service as the minimum aggregate bandwidth requirement of all packet streams in accordance with their loss and delay con- real-time pac ket streams does not exceed the available straints, using just two attributes per packet stream. Fur- bandwidth, (2) using D WCS, the delay of service to real- thermore, DWCS has the desirable property of support- time pac ket streams is bounded even when the scheduler in