Fair Queuing (English "fair incorporating") is a common technology, in order to avoid data back-up and/or overload in transmission components such as a routing.
The primary goal with the fair Queuing is the fair treatments of the sources of a transmission component. Therefore the procedure" fair "is also called.
Fair Queuing functions according to the following principle: On each outlet line of the transmission component its own queue is assigned to each data flow (and thus each source of the transmission component). The packages of the queues are taken and dispatched after the Round Robin procedure. In this way each source of the transmission component becomes on the same part of the overall bandwidth of the outlet line limits.
A problem of fair Queuing is that those transmitters are preferred, which long packages send, since dispatching larger packages takes more time up. To be solved this problem can by an extension of the fair Queuings: "Fair Queuing with byte by byte Round Robin".
A second problem is that fair Queuing does not consider the priority of data flows (of each source there is data flow). Some sources have a higher priority as other and/or some data flows to need a higher range than others. A solution for this problem is the extension of the fair Queuings to the Weighted fair Queuing.
We found here 5 articles.
F» Fair Queuing» Federal Office for security in the information technology » Firewall » Flooding (computer science) » Frame Relay |
We found here 5 related websites.
Index | Privacy | Terms Of Use | Sitemap | Feedback