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:
“It is fair to assume that when women in the past have achieved even a second or third place in the ranks of genius they have shown far more native ability than men have needed to reach the same eminence. Not excused from the more general duties that constitute the cement of society, most women of talent have had but one hand free with which to work out their ideal conceptions.”
—Anna Garlin Spencer (1851–1931)