Analysis and Simulation of a Fair Queueing Algorithm.

Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and Simulation of a Fair Queueing Algorithm. ACM SIGCOMM Computer Communication Review, 19(4), 1-12.

Type

Conference paper

Intellectual base

Primary research

Year

1989

Volume

19

Issue

4

Pages

1-12

DOI

10.1145/75246.75248

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/75246.75248

Cited from

computer_science

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Interference and Contention
  • Fairness concerns the equitable or just treatment of competing claimants—whether each receives a proportional share, equal share, or according to need, the allocation principle Demers, Keshav, and Shenker (1989) operationalize as weighted fair queueing in packet-scheduling systems.

    This sourceFoundational fair-queueing paper: operationalizes fairness as proportional-share allocation orthogonal to total contention cost.

    Supported in partVerified against the publisher's abstract

    The source's own abstract proposes 'a fair queueing algorithm' giving fair bandwidth allocation and protection from ill-behaved sources, but never says 'weighted fair queueing' nor mentions equal or need-based shares.

    “We find that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.”

    Read by an automated reader; not a human review. How support was checked

• Starvation
  • The pattern ports further. Network quality-of-service into representation: traffic-shaping ideas such as a guaranteed minimum bandwidth per class transfer into discussions of guaranteed minimum representation for under-served groups, with the same liveness argument that some nonzero service per cycle prevents perpetual deferral.

    This sourceIntroduces fair queueing, which protects low-bandwidth flows from greedy ones (a guaranteed share per flow), the canonical starvation-avoidance / guaranteed-minimum mechanism in networking.

    Supported in partVerified against the publisher's abstract

    The abstract supports only the networking half: fair queueing guarantees each flow a fair share of bandwidth and shields low-rate flows from ill-behaved sources; it says nothing about representation or under-served groups.

    “fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.”

    Read by an automated reader; not a human review. How support was checked

Domain-specific

• Network scheduler
  • Network scheduler is a packet-queue arbiter that selects the transmission or reception order of network packets according to a queueing discipline.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 2 of 3 citations: 2 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:46ae5a33d46f · see in the full table