Probabilistic end-to-end delay bounds for earliest deadline first scheduling

We analyze the earliest-deadline-first (EDF) scheduling discipline within the framework of statistical multiplexing. We derive techniques for bounding the probability of delay violations when the session injections are independent. This enables us to determine whether a given set of sessions can all meet their delay bounds with the required violation probability. These techniques can be used by a connection admission control (CAC) scheme to decide whether to admit a new session. Our analysis applies to both the single node problem and the network problem in which the sessions have multiple hops. We also give extensive numerical results to illustrate how our bounds may be calculated and to compare the results with estimates that have been derived for generalized processor sharing (GPS). In addition we show that by altering the deadlines for EDF we can match the desired violation probabilities more closely.

[1]  Donald F. Towsley,et al.  Efficient admission control for EDF schedulers , 1997, Proceedings of INFOCOM '97.

[2]  Debasis Mitra,et al.  Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

[4]  Keith W. Ross,et al.  Guaranteeing statistical QoS to regulated traffic: the single node case , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[6]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[7]  D. Mitra,et al.  Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Lisa Zhang,et al.  General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[9]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[10]  Jörg Liebeherr,et al.  Workconserving vs. non-workconserving packet scheduling: an issue revisited , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[11]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[12]  Jean-Yves Le Boudec,et al.  Regulation of a connection admission control algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .

[14]  Vijay Sivaraman,et al.  Achieving high utilization in guaranteed services networks using early-deadline-first scheduling , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[15]  Vijay Sivaraman,et al.  Statistical Analysis of Delay Bound Violations at an Earliest Deadline First (EDF) Scheduler , 1999, Perform. Evaluation.

[16]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[17]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[18]  Jörg Liebeherr,et al.  A near-optimal packet scheduler for QoS networks , 1997, Proceedings of INFOCOM '97.

[19]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

[20]  Lisa Zhang,et al.  Packet routing with arbitrary end-to-end delay requirements , 1999, STOC '99.

[21]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[22]  Lisa Zhang,et al.  Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..