Achieving high utilization in guaranteed services networks using early-deadline-first scheduling

Among packet scheduling disciplines for providing end-to-end quality-of-service (QoS) guarantees to different applications, two classes of algorithms have received particular attention: those based on generalized processor sharing (GPS) and those based on earliest-deadline first (EDF) scheduling. The powerful properties of GPS-based schemes translate easily into simple call admission control (CAC) procedures. The intense research on GPS has also resulted in very efficient implementation techniques, which have made the cost of these schedulers very affordable. The EDF discipline, in conjunction with per-node traffic shaping [which we refer to as rate-controlled EDF (RC-EDF)] has also been proposed for end-to-end QoS provisioning. However, an appropriate framework for CAC with RC-EDF has not been developed, nor the possible advantages of using RC-EDF in place of GPS have been properly characterized. Furthermore, the implementation complexity of an RC-EDF server is potentially very high, and no technique to reduce costs has been proposed. In this paper, we first formulate an end-to-end CAC framework for RC-EDF that can be implemented in practice. Then, using this framework, we numerically compare the schedulable regions of RC-EDF and GPS and show that, when the traffic mix in the network consists of connections with both stringent and loose delay requirements, RC-EDF can substantially outperform GPS in the number of admitted connections, and can thus achieve much higher network utilization. Finally, we propose a technique to substantially reduce the implementation complexity of a RC-EDF server.

[1]  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.

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

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

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

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

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

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

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

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

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

[11]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

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

[13]  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.

[14]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[15]  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.

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

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