Rate-function scheduling

Rate-function scheduling (RFS) is a new deadline-based packet-scheduling service discipline that supports quality-of-service guarantees for applications with real-time communication requirements. RFS is distinguished from other service disciplines in that it achieves all of the following goals: analytically-derived performance bounds, performance isolation among sessions, flexible and efficient allocation of bandwidth, implementation simplicity, work-conserving operation, and bandwidth-fair operation (defined in the paper). Through the specification of rate functions, sessions can control their bandwidth usage and their upper bounds on delay. For a class of rate functions, which we show is sufficient for providing sessions with delay bounds, RFS is as simple to implement and to calculate service bounds such as Zhang's VirtualClock service discipline. We also show that the non-preemptive earliest deadline first policy is a simple degeneration of RFS.

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

[2]  D.C. Verma,et al.  Delay jitter control for real-time communication in a packet switching network , 1991, Proceedings of TRICOMM `91: IEEE Conference on Communications Software: Communications for Distributed Applications and Systems.

[3]  Joseph Pasquale,et al.  An upper bound on delay for the VirtualClock service discipline , 1995, TNET.

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

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

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

[7]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[8]  Joseph Pasquale,et al.  Leave-in-Time: a new service discipline for real-time communications in a packet-switching network , 1995, SIGCOMM '95.

[9]  George C. Polyzos,et al.  Scheduling for quality of service guarantees via service curves , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

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

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  Joseph Pasquale,et al.  A schedulability condition for deadline-ordered service disciplines , 1997, TNET.

[13]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

[15]  S. Jamaloddin Golestani.  A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

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

[17]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

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

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

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