A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE/ACM Transactions on Networking (TON)
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
A schedulability condition for deadline-ordered service disciplines
IEEE/ACM Transactions on Networking (TON)
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Exact Admission Control for Networks with Bounded Delay Services
Exact Admission Control for Networks with Bounded Delay Services
Efficient network QoS provisioning based on per node traffic shaping
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Utilization-Based Admission Control for Scalable Real-Time Communication
Real-Time Systems
| Hi-index | 0.00 |
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.