Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
MPEG: a video compression standard for multimedia applications
Communications of the ACM - Special issue on digital multimedia systems
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A new approach to the control of real-time traffic in packet switching data networks
A new approach to the control of real-time traffic in packet switching data networks
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
A versatile packet multiplexer for quality-of-service networks
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
A Near-Optimal Packet Scheduler for QoS Networks
A Near-Optimal Packet Scheduler for QoS Networks
Scalable QoS provision through buffer management
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
Scaled time priority: an efficient approximation to waiting time priority
Computer Networks: The International Journal of Computer and Telecommunications Networking
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
A cyclic MAC scheduler for collecting data from heterogeneous sensors
Computer Communications
Achieving proportional delay differentiation efficiently
Computer Communications
| Hi-index | 0.02 |
A packet scheduler in a quality-of-service (QoS) network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implementation so that packets can be processed at the speed of the transmission link. The Earliest-Deadline-First (EDF) scheduler is the optimal scheduler for bounded-delay services in the sense that it provides the tightest delay guarantees of any scheduler, but an implementation of EDF requires the sorting of packets, a complex operation that is not practical for high-speed networks. In this study we present the design, implementation, and analysis of the novel Rotating-Priority-Queues+ (RPQ+) scheduler that is near- optimal in the sense that it can approximate EDF with arbitrary precision. The RPQ+ scheduler uses a set of prioritized FIFO queues whose priorities are rearranged (rotated) periodically to increase the priority of waiting packets. We derive admission control tests for RPQ+ and show that it has the following desirable properties: its implementation requires operations independent of the number of queued packets, it can provide worst-case delay guarantees, and its efficiency is "between" that of EDF and Static-Priority (SP) schedulers. We use numerical examples, including examples based on MPEG video, to show that in realistic scenarios RPQ+ can closely approximate EDF even for infrequent queue rotations.