Scalable scheduling support for loss and delay constrained media streams

Real time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requires fast and efficient scheduling support at the server. The paper describes the practical issues concerned with the implementation of a scalable real time packet scheduler resident on a server, designed to meet service constraints on information transferred across a network to many clients. Specifically, we describe the implementation issues and performance achieved by Dynamic Window-Constrained Scheduling (DWCS), which is designed to meet the delay and loss constraints on packets from multiple streams with different performance objectives. In fact, DWCS is designed to limit the number of late packets over finite numbers of consecutive packets in loss-tolerant and/or delay-constrained, heterogeneous traffic streams. We show how DWCS can be efficiently implemented to provide service guarantees to hundreds of streams. We compare the costs of different implementations, including an approximation algorithm, which trades service quality for speed of execution.

[1]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

[2]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services , 2000, TNET.

[3]  Andrew T. Campbell,et al.  A survey of QoS architectures , 1998, Multimedia Systems.

[4]  Albert G. Greenberg,et al.  Hardware-eecient Fair Queueing Architectures for High-speed Networks , 1996 .

[5]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[6]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Karsten Schwan,et al.  On adaptive resource allocation for complex real-time applications , 1997, Proceedings Real-Time Systems Symposium.

[8]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[9]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[10]  Jon M. Peha,et al.  A cost-based scheduling algorithm to support integrated services , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[11]  Richard Black,et al.  Explicit Network Scheduling , 1994 .

[12]  Andrew T. Campbell,et al.  A quality of service architecture , 1994, CCRV.

[13]  Karsten Schwan,et al.  Dynamic window-constrained scheduling for multimedia applications , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[14]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[15]  William J. Bolosky,et al.  Distributed schedule management in the Tiger video fileserver , 1997, SOSP.

[16]  Hongyi Zhou,et al.  Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads , 1992, IEEE Trans. Software Eng..

[17]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[18]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[19]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[20]  Domenico Ferrari,et al.  Client requirements for real-time communication services , 1990, IEEE Communications Magazine.

[21]  Carl A. Waldspurger,et al.  Stride Scheduling: Deterministic Proportional- Share Resource Management , 1995 .

[22]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[23]  Michael B. Jones,et al.  CPU reservations and time constraints: efficient, predictable scheduling of independent activities , 1997, SOSP.

[24]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[25]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.