Workconserving vs. non-workconserving packet scheduling: an issue revisited

Many packet schedulers for QoS networks are equipped with a rate control mechanism. The function of a rate control mechanism (rate controller) is to buffer packets from flows which exceed their negotiated traffic profile. It has been established that rate controllers lead to reduced buffer requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the other hand, rate controllers make a scheduler non-workconserving, and, thus, may yield higher average end-to-end delays. In this study, we show that by properly modifying a rate controller, one can design a scheduler which balances buffer requirements against average delays. We present a scheduler, called earliness-based earliest deadline first (EEDF), which achieves such a balancing using a tunable rate control mechanism. In simulation experiments, we compare EEDP with a rate-controlled EDF scheduler and a workconserving version of EDF.

[1]  Henning Schulzrinne,et al.  Real-time communication in packet-switched networks , 1994, Proc. IEEE.

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

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

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

[5]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[6]  Domenico Ferrari,et al.  Improving utilization for deterministic service in multimedia communication , 1994, 1994 Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[7]  Rene L. Cruz,et al.  SCED+: efficient management of quality of service guarantees , 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.

[8]  Anindo Banerjea,et al.  Queueing delays in rate controlled ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[9]  Hui Zhang.  Providing end-to-end performance guarantees using non-work-conserving disciplines , 1995, Comput. Commun..

[10]  R. Braden,et al.  Resource Reservation Protocol (rsvp) , 1995 .

[11]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

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

[13]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[14]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[15]  K. Sivarajan.  Eecient Network Qos Provisioning Based on per Node Traac Shaping , 1996 .

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

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

[18]  Anindo Banerjea,et al.  The Tenet real-time protocol suite: design, implementation, and experiences , 1996, TNET.

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

[20]  S. Jamaloddin Golestani,et al.  A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..

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

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

[23]  Hui Zhang,et al.  Service disciplines for packet-switching integrated services networks , 1993 .

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

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