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

DOI

10.1145/75246.75248

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.

• 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.

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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