|
|
| Line 1: |
Line 1: |
| '''Weighted fair queuing''' (WFQ) is a [[data packet]] [[scheduling (computing)|scheduling]] technique allowing different scheduling priorities to [[statistical multiplexing|statistically multiplexed]] data [[Flow (computer networking)|flows]]. | | Hi there, I am Felicidad Oquendo. To perform croquet is something that I've carried out for years. My home is now in Kansas. Bookkeeping is what he does.<br><br>Here is my web page ... extended auto warranty - [http://www.Carelion.com/UserProfile/tabid/61/userId/107768/Default.aspx see this] - |
| | |
| WFQ is a generalization of [[fair queuing]] (FQ). Both in WFQ and FQ, each data flow has a separate [[FIFO]] queue. In FQ, with a link data rate of <math>R</math>, at any given time the <math>N</math> active data flows (the ones with non-empty queues) are serviced simultaneously, each at an average data rate of <math>R/N</math>. Since each data flow has its own queue, an ill-behaved flow (who has sent larger packets or more packets per second than the others since it became active) will only punish itself and not other sessions.
| |
| | |
| As opposed to FQ, WFQ allows different sessions to have different service shares. If <math>N</math> data flows currently are active, with weights <math>w_1, w_2 ... w_N,</math> data flow number <math>i</math> will achieve an average data rate of
| |
| | |
| :<math>\frac{Rw_i}{(w_1+w_2+...+w_N)}</math>
| |
|
| |
| It can be proven that when using a network with WFQ switches and a data flow that is [[leaky bucket]] constrained, an end-to-end delay bound can be guaranteed.<ref>{{cite doi|10.1109/90.731196}}</ref> By regulating the WFQ weights dynamically, WFQ can be utilized for controlling the [[quality of service]], for example to achieve guaranteed data rate.
| |
| | |
| [[Proportional fairness]] can be achieved by setting the weights to <math>w_i=1/c_i</math>, where <math>c_i</math> is the cost per data bit of data flow <math>i</math>. For example in [[CDMA]] spread spectrum cellular networks, the cost may be the required energy (the interference level), and in [[channel allocation schemes|dynamic channel allocation]] systems, the cost may be the number of nearby base station sites that can not use the same frequency channel, in view to avoid co-channel interference.
| |
|
| |
| == See also ==
| |
| * [[Statistical multiplexing]]
| |
| * Computing [[scheduling disciplines]]
| |
| * [[Scheduling algorithm]]
| |
| * [[Deficit round robin]]
| |
| * [[Weighted round robin]]
| |
| * [[Fair Queuing]]
| |
| * [[Max-min fairness]]
| |
| * [[Proportional fairness]]
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| | |
| [[Category:Scheduling algorithms]]
| |
| [[Category:Routing algorithms]]
| |
Hi there, I am Felicidad Oquendo. To perform croquet is something that I've carried out for years. My home is now in Kansas. Bookkeeping is what he does.
Here is my web page ... extended auto warranty - see this -