Rate-function scheduling
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1063-1071
- https://doi.org/10.1109/infcom.1997.631124
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- Rate-controlled static-priority queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Delay jitter control for real-time communication in a packet switching networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rate controlled servers for very high-speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling for quality of service guarantees via service curvesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A schedulability condition for deadline-ordered service disciplinesIEEE/ACM Transactions on Networking, 1997
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Comparison of rate-based service disciplinesACM SIGCOMM Computer Communication Review, 1991
- VirtualClockACM Transactions on Computer Systems, 1991
- A stop-and-go queueing framework for congestion managementACM SIGCOMM Computer Communication Review, 1990
- Analytic InequalitiesPublished by Springer Nature ,1970