Comparison of rate-based service disciplines
- 1 August 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 21 (4) , 113-121
- https://doi.org/10.1145/115992.116004
Abstract
This paper compares six new queue service disciplines that can be implemented at the output queues of switches in a connection-oriented packet switched data network. ‘Hrese are Vktual Clock, Fair Qtreueing, Delay-Earliest-Due-Date, Jitter-Earliest-Due-Date, Stop-and-Go and Hierarchical Round Robin. We describe their mechanisms, their similarities and differences, and some implementation strategies. In particular, we show why each discipline can or cannot provide bandwidth, delay and delay jitter guarantees. This leads to some interesting conclusions about the relative strengths and weaknesses of each approach.Keywords
This publication has 8 references indexed in Scilit:
- Congestion control through input rate regulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Congestion-free transmission of real-time traffic in packet networksPublished 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
- Client requirements for real-time communication servicesPublished by RFC Editor ,1990
- A stop-and-go queueing framework for congestion managementPublished by Association for Computing Machinery (ACM) ,1990
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problemCommunications of the ACM, 1988