Weighted fair queuing

Weighted fair queuing

Weighted fair queuing (WFQ) is a data packet scheduling technique allowing different scheduling priorities to statistically multiplexed data flows.

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 R, at any given time the N active data flows (the ones with non-empty queues) are serviced simultaneously, each at an average data rate of R/N. 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.

Contrary to FQ, WFQ allows different sessions to have different service shares. If N data flows currently are active, with weights w_1, w_2 ... w_N, data flow number i will achieve an average data rate of

frac{Rw_i}{(w_1+w_2+...+w_N)} It can be proved [cite journal |title=Latency-rate servers: a general model for analysis of traffic scheduling algorithms | author=Stiliadis, D. and Varma, A. |journal=IEEE/ACM Transactions on Networking (TON) | volume=6 | issue=5 | pages=611–624 | date=1998 | publisher=IEEE Press Piscataway, NJ, USA] 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. 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 w_i=1/c_i, where c_i is the cost per data bit of data flow i. For example in CDMA spread spectrum cellular networks, the cost may be the required energy (the interference level), and in 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.

References

See also

* Statistical multiplexing
* Computing scheduling disciplines
* Scheduling algorithm
* Deficit round robin
* Weighted round robin
* Fair Queuing
* Max-min fairness
* Proportional fairness


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Weighted-Fair-Queuing — (WFQ, engl. „gewichtetes faires Einreihen“) ist eine geläufige Technik, um Datenstaus in Warteschlangen, wie sie unter anderem in Routern eingesetzt werden, zu vermeiden. Das primäre Ziel beim Weighted Fair Queuing ist auch wie beim Fair Queuing… …   Deutsch Wikipedia

  • Fair queuing — is a scheduling algorithm used in computer and telecommunications networks to allow multiple packet flows to fairly share the link capacity. The advantage over conventional first in first out (FIFO) queuing is that a high data rate flow,… …   Wikipedia

  • Fair-Queuing — (engl. faires Einreihen ) ist eine geläufige Technik, um Datenstaus bzw. Überlast in Übertragungskomponenten wie Routern zu vermeiden. Das primäre Ziel beim Fair Queuing ist die faire Behandlungen der Quellen einer Übertragungskomponente. Deshalb …   Deutsch Wikipedia

  • Credit-based fair queuing — Example IEEE 802.1Qav traffic shaping Credit based fair queuing is a computationally efficient alternative to fair queueing. Credit is accumulated to queues as they wait for service. Credit is spent by queues while they are being serviced. Queues …   Wikipedia

  • Weighted round robin — (WRR) is a best effort connection scheduling discipline. Each packet flow or connection has its own packet queue in a network interface card. It is the simplest emulation of generalized processor sharing (GPS) discipline. While GPS serves… …   Wikipedia

  • Proportionally fair — Proportional fair is a compromise based scheduling algorithm. It s based upon maintaining a balance between two competing interests: Trying to maximize total wireless network throughput while at the same time allowing all users at least a minimal …   Wikipedia

  • Completely Fair Scheduler — The Completely Fair Scheduler is the name of a task scheduler which was merged into the 2.6.23 release of the Linux kernel. It handles CPU resource allocation for executing processes, and aims to maximize overall CPU utilization while also… …   Wikipedia

  • WFQ — Weighted Fair Queuing (WFQ, engl. gewichtetes faires Einreihen ) ist eine geläufige Technik, um Datenstaus bzw. Überlast in Übertragungskomponenten wie Routern zu vermeiden. Das primäre Ziel beim Weighted Fair Queuing ist auch wie beim Fair… …   Deutsch Wikipedia

  • WFQ — Weighted Fair Queuing (Computing » Telecom) Weighted Fair Queuing (Computing » Networking) …   Abbreviations dictionary

  • WFQF — * Weighted Fair Queuing based on Flow timestamps (Computing » Networking) …   Abbreviations dictionary

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”