Construct · 1 fields · 1 citations

fair queuing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer networking

a packet scheduling discipline that serves flows in round-robin fashion by bit so that each flow receives an equal share of link bandwidth.

In computer networking, fair queuing refers to a packet scheduling discipline that serves flows in round-robin fashion by bit so that each flow receives an equal share of link bandwidth. This meaning comes from Demers (1989) in Symposium proceedings on Communications architectures & protocols.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how fair queuing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

bandwidth3 fields · 4 citationsjingle · one word, three quantities deficit round robin1 fields · 1 citationsanchor · a standalone construct discipline4 fields · 5 citationsjingle · one word, four constructs

References

Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. Symposium proceedings on Communications architectures & protocols. https://doi.org/10.1145/75246.75248

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct