Traffic shaping for end-to-end delay guarantees with EDF scheduling

The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, earliest deadline first (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as rate-controlled EDF or RC-EDF) has been recognized as an effective means of end-to-end deterministic delay provisioning. An important aspect that has not been addressed satisfactorily in the literature, however, concerns the choice of RC-EDF shaping parameters that realize maximal network utilizations. In this paper, we first establish that except in trivial cases, it is infeasible to identify "optimal" shapers that realize maximal RC-EDF schedulable regions. Ascertaining the optimal flow shaper requires the state of the entire network to be considered, making it computationally impractical. We then propose an heuristic choice of shaper derived from the number of hops traversed by the flow. The resulting shaper is easy to compute, and varies gracefully between the known optimal shapers for limiting values of the hop-length. We show via simulations that for a realistic traffic mix, our choice of shaper allows RC-EDF to outperform the GPS (generalized processor sharing) scheduling discipline as well as RC-EDF disciplines that use shapers chosen independent of the flow hop-length.

[1]  Vijay Sivaraman,et al.  Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

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

[4]  F. M. Chiussi,et al.  Implementing fair queueing in ATM switches. II. The logarithmic calendar queue , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

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

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

[7]  Edward W. Knightly,et al.  On the effects of smoothing for deterministic QoS , 1997, Distributed Syst. Eng..

[8]  Amy R. Reibman,et al.  On VBR video teleconferencing over ATM networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[9]  J. Walrand,et al.  RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic , 1995 .

[10]  Andrea Francini,et al.  Implementing fair queueing in ATM switches: the discrete-rate approach , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[12]  Edward W. Knightly,et al.  Buffering vs. smoothing for end-to-end QoS: fundamental issues and comparison , 2000 .

[13]  Amy R. Reibman,et al.  Traffic descriptors for VBR video teleconferencing over ATM networks , 1995, TNET.

[14]  Joseph Y. Hui,et al.  Applying traffic smoothing techniques for quality of service control in VBR video transmissions , 1998, Comput. Commun..

[15]  Oliver Rose,et al.  Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems , 1995, Proceedings of 20th Conference on Local Computer Networks.

[16]  Keith W. Ross,et al.  Video-on-Demand Over ATM: Constant-Rate Transmission and Transport , 1996, IEEE J. Sel. Areas Commun..

[17]  Hui Zhang,et al.  High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[18]  Donald F. Towsley,et al.  Supporting stored video: reducing rate variability and end-to-end resource requirements through optimal smoothing , 1998, TNET.

[19]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[20]  Keith W. Ross,et al.  Video on demand over ATM: constant-rate transmission and transport , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[21]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[22]  Donald F. Towsley,et al.  Efficient admission control of piecewise linear traffic envelopes at EDF schedulers , 1998, TNET.

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

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

[25]  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).

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

[27]  Vinod Peris,et al.  Architecture for Guaranteed Delay Service in High Speed Networks , 1998 .

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

[29]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[30]  Wu-chi Feng,et al.  An optimal bandwidth allocation strategy for the delivery of compressed prerecorded video , 1997, Multimedia Systems.

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