IEEE Computer and Communications Societies, Annual Joint Conference of the (1997)
Apr. 9, 1997 to Apr. 11, 1997
Subhash Suri , Washington University in St. Louis
George Varghese , Washington University in St. Louis
Girish Chandranmenon , Washington University in St. Louis
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log log N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the classical virtual clock and the Self-Clocked Fair Queuing schemes can be thought of as special cases of our scheme, by setting the leap forward parameter appropriately.
S. Suri, G. Varghese and G. Chandranmenon, "Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness," IEEE Computer and Communications Societies, Annual Joint Conference of the(INFOCOM), Kobe, Japan, 1997, pp. 557.