First In First Out
Comments: The first queueing discipline. Adopted by router manufacturers. Not fair.
Random Early Detect
Comments: Useful in combination with TCP congestion avoidance to protect against network congestion. Adopted by router manufacturers. Not fair.
Weighted Round Robin
Reference: E. Hahne, "Round Robin scheduling for fair flow control",
Ph.D. thesis, Dept. Elect. Eng. And Comput. Sci., M.I.T., Dec. 1986.
Comments: Superseded. Not suitable for variable length packets.
Virtual Clock Multiplexing
Reference: L. Zhang, "A new architecture for packet switching
network protocols", Ph.D. thesis, Dept. Elect. Eng. and Comput. Sci., M.I.T.,
Aug 1989.
Comments: Superseded. Not fair.
Stop and Go Queueing
References: "S. J. Golestani, "Congestion-free transmission of
real-time traffic in packet networks", in Proc. IEEE INFOCOM ’90, San Francisco,
CA, 1990.
"Duration-limited statistical multiplexing of delay sensitive traffic
in packet networks", in Proc. IEEE INFOCOM ’91, 1991.
Comments: Abandoned. Some advantages in respect to WFQ (more
control over jitter), but is not work conserving.
Weighted Fair Queueing (=Packet by packet Generalized Processor Sharing)
References: A. Demers, S. Keshav, S. Shenker, "Analysis and simulation
of a fair queueing algorithm", Internet Res. and Exper., vol. 1, 1990
A. K. Parekh, R. G. Gallager, "A Generalized Processor Sharing Approach
to Flow Control in Integrated Services Networks: The Single-Node Case",
IEEE/ACM Transactions on Networking, Vol. 1, No. 3, June 1993.
A. K. Parekh, R. G. Gallager, "A Generalized Processor Sharing Approach
to Flow Control in Integrated Services Networks: The Multiple Node Case",
IEEE/ACM Transactions on Networking, Vol. 2, No. 2, April 1994.
Comments: The first really fair queueing discipline. Adopted
by router manufactureres. Complex. Better disciplines (less complex and
more fair) have been presented.
Self Clocked Fair Queueing
References: J. Davin and A. Heybey, "A simulation study of fair
queueing and policy enforcement", Computer Communications Review, vol.
20, no. 5, Oct. 1990.
S. J. Golestani, "A self-clocked fair queueing scheme for high speed
applications", in Proc. INFOCOM ’94, Apr. 1994.
Comments: A simplification of Weighted Fair Queueing. Less complex,
less fair.
Worst case fair Weighted Fair Queueing
References: J. C. R. Bennett, H. Zhang, "WF2Q: Worst-case
fair weighted fair queueing", in Proc. IEEE INFOCOM ’96, San Francisco,
CA, Mar. 1996.
Comments: More fair than Weighted Fair Queueing. Complex.
Worst case fair Weighted Fair Queueing +
References: J. C. R. Bennett, H. Zhang, "Hierarchical Packet
Fair Queueing Algorithms", IEEE/ACM Transactions on networking, Vol. 5.,
No. 5, October 1997.
Comments: Similar characteristics of Worst case fair Weighted
Fair Queueing, but less complex.
Start-Time Fair Queueing
References: P. Goyal, H. M. Vin, H. Cheng, "Start-time Fair Queueing:
A Scheduling Algorithm for Integrated Services Packet Switching Networks",
IEEE/ACM Transactions on Networking, Vol. 5, No. 5, October 1997.
Comments: Not complex. Good fairness.
Frame-based Fair Queueing
References: D. Stidialis, A. Varma, "Efficient Fair Queueing
Algorithms for Packet-Switched Networks", IEEE/ACM Trasactions on Networking,
Vol. 6, No. 2, April 1998.
Comments: As simple as Self Clocked Fair Queueing, but more
fair (worst case delay the same as Weighted Fair Queueing).
Starting Potential-based Fair Queueing
References: D. Stidialis, A. Varma, "Efficient Fair Queueing
Algorithms for Packet-Switched Networks", IEEE/ACM Trasactions on Networking,
Vol. 6, No. 2, April 1998.
Comments: Similar to Worst case fair Weighted Fair Queueing
+.