Bufferbloat¶
Gettys, J., & Nichols, K. (2012). Bufferbloat: Dark Buffers in the Internet. Communications of the ACM, 55(1), 57-65.
Cited by¶
6 citations across 6 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Buffering
- The Bufferbloat problem, named and characterized by Gettys and Nichols (2011), arises when oversized buffers mask congestion signals, creating tail latency and poor interactive performance.
This sourceDefines and characterizes bufferbloat: oversized network buffers mask congestion signals and inflate latency, demonstrating that buffer sizing has a sharp upper bound beyond which performance degrades.
- The Bufferbloat problem, named and characterized by Gettys and Nichols (2011), arises when oversized buffers mask congestion signals, creating tail latency and poor interactive performance.
Mechanisms¶
- Asynchronous Decision Queue
- A queue drained too slowly or held too long adds latency to everything, so the genuinely time-critical item waits behind a hundred trivial ones — the same pathology as an oversized network buffer that makes a fast link feel sluggish even though no packet is dropped.
This sourceShows that oversized full buffers create severe queueing delay and make fast links feel sluggish even without obvious packet loss.
- A queue drained too slowly or held too long adds latency to everything, so the genuinely time-critical item waits behind a hundred trivial ones — the same pathology as an oversized network buffer that makes a fast link feel sluggish even though no packet is dropped.
- Bounded Mailbox or Queue
- A deep buffer is the classic latency trap — bufferbloat — where messages technically aren't lost but arrive too late to matter.
This sourceIdentifies bufferbloat as excessive latency produced by oversized, persistently full buffers installed to avoid packet loss, with delays severe enough to make applications fail.
- A deep buffer is the classic latency trap — bufferbloat — where messages technically aren't lost but arrive too late to matter.
- Burst Buffer
- Overflow Queue
- Over-buffering adds latency that helps no one — capacity you can't use, just delay you can't see.
This sourceShows that oversized, persistently full buffers add severe hidden latency without improving bottleneck throughput.
- Over-buffering adds latency that helps no one — capacity you can't use, just delay you can't see.
- QoS Scheduler
- Over-deep buffers create bufferbloat — packets piling up in oversized queues until latency balloons for everyone, the opposite of what the scheduler was for.
This sourceExplains bufferbloat as excessive packet queueing in oversized buffers that produces high latency for shared traffic.
- Over-deep buffers create bufferbloat — packets piling up in oversized queues until latency balloons for everyone, the opposite of what the scheduler was for.
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? Not recorded. Neither this nor any other of the 6 citations of this work carries a recorded support check.
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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:aebed727cf08 · see in the full table