SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Reducing and characterizing packet loss for high-speed computer networks with real-time services
Reducing and characterizing packet loss for high-speed computer networks with real-time services
Scalable QoS provision through buffer management
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-performance communication networks (2nd ed.)
High-performance communication networks (2nd ed.)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
IEEE Transactions on Computers
Queueing Theory for Computer Communications
Queueing Theory for Computer Communications
Deadline-based network resource management
Deadline-based network resource management
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Pipelined heap (priority queue) management for advanced scheduling in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Issues and trends in router design
IEEE Communications Magazine
Priority queue schedulers with approximate sorting in output-buffered switches
IEEE Journal on Selected Areas in Communications
Answering Multiple-Item Queries in Data Broadcast Systems
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
| Hi-index | 0.00 |
The use of deadline-based scheduling in support of real-time delivery of application data units (ADUs) in a packet-switched network is investigated. Of interest is priority scheduling where a packet with a smaller ratio of T/H (time until delivery deadline over number of hops remaining) is given a higher priority. We refer to this scheduling algorithm as the T/H algorithm. T/H has time complexity of O(logN) for a backlog of N packets and was shown to achieve good performance in terms of the percentage of ADUs that are delivered on-time. We develop a new and efficient algorithm, called T/H-p, that has O(1) time complexity. The performance difference of T/H, T/H-p and FCFS are evaluated by simulation. Implementations of T/H and T/H-p in high-speed routers are also discussed. We show through simulation that T/H-p is superior to FCFS but not as good as T/H. In view of the constant time complexity, T/H-p is a good candidate for high-speed routers when both performance and implementation cost are taken into consideration.