
		Weighted Fair Queueing Implementation

We implemented WFQ as a sample ALTQ implementation.  So, don't expect
too much.

The basic mechasim is close to SFQ[McKenney90] but without
hash-function switching.

			Hiroshi Kyusojin,  Keio University
			(kyu@mt.cs.keio.ac.jp)

References:

J. Nagle.
On Packet Switches with Infinite Storage.
IEEE Trans. on Communications, vol.35, No.4, April 1987, pp.435-438

A. Demers, S. Keshav, and S. Shenker,
Analysis and Simulation of a Fair Queueing Algorithm.
Proc. SIGCOMM '89, 19(4):1-12, September 1989.

S. Keshav,
On the Efficient Implementation of Fair Queueing
In Internetworking: Research and Experience Vol.2. 157-173,
September 1991.
<ftp://tenet.berkeley.edu/pub/tenet/Papers/Keshav91b.ps>

P. E. McKenney, 
"Stochastic Fairness Queueing," 
in Proceedings of the Conference on Computer Communications (IEEE Infocom),
(San Francisco, California), IEEE, June 1990. 

M. Shreedhar, and G. Varghese,
Efficient Fair Queueing using Deficit Round Robin.
in Proc. SIGCOMM '95, August 1995, p.231-242.

