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, consisting of large or many data packets, cannot take more than its fair share of the link capacity. Fair queuing can be interpreted as a packet approximation of generalized processor sharing (GPS). It was proposed by John Nagle in 1985 and has since been one of the most studied scheduling algorithms.
Read more about Fair Queuing: Properties, Algorithm
Famous quotes containing the word fair:
“While I believe that with a fair election in the South, our electoral vote would reach two hundred, and that we should have a large popular majority, I am yet anxious, as you are, that in the canvassing of results there should be no taint of dishonesty.”
—Rutherford Birchard Hayes (1822–1893)