Updating the Theory of Buffer Sizing

@article{Spang2021UpdatingTT,
  title={Updating the Theory of Buffer Sizing},
  author={Bruce Spang and Serhat Arslan and Nick McKeown},
  journal={Perform. Evaluation},
  year={2021},
  volume={151},
  pages={102232}
}
Routers have packet buffers to reduce packet drops during times of congestion. It is important to correctly size the buffer: make it too small, and packets are dropped unnecessarily and the link may be underutilized; make it too big, and packets may wait for a long time, and the router itself may be more expensive to build. Despite its importance, there are few guidelines for picking the buffer size. The two most well-known rules only apply to long-lived TCP Reno flows; either for a network… Expand

References

SHOWING 1-10 OF 71 REFERENCES
Sizing router buffers
TLDR
It is shown that a link with n flows requires no more than B = (overlineRTT x C) √n, for long-lived or short-lived TCP flows, because of the large number of flows multiplexed together on a single backbone link. Expand
Sizing router buffers (redux)
TLDR
This paper revisited the existing rule of thumb that a buffer should hold one bandwidth-delay product of packets, and explained where it has succeeded and failed to affect how buffers are sized. Expand
Routers with Very Small Buffers
TLDR
It is argued that if the TCP sources are not overly bursty, then fewer than twenty packet buffers are sufficient for high throughput, and it is concluded that buffers can be made small enough for all-optical routers with small integrated optical buffers. Expand
Perspectives on router buffer sizing: recent results and open problems
TLDR
This paper provides a synopsis of the recently proposed buffer sizing strategies and broadly classifies them according to their desired objective: link utilisation, and per-flow performance, and discusses the pros and cons of these different approaches. Expand
Buffer sizing for congested Internet links
TLDR
The minimum buffer requirement for a drop-tail link is derived, given constraints on the minimum utilization, maximum loss rate, and maximum queueing delay, when it is feasible to achieve all three constraints. Expand
Open issues in router buffer sizing
TLDR
It is shown that the use of such small buffers can lead to excessively high loss rates in congested access links that carry many flows, and even if the link is fully utilized, small buffers lead to lower throughput for most large TCP flows and significant variability in the per-flow throughput and transfer latency. Expand
Experimental study of router buffer sizing
During the past four years, several papers have proposed rules for sizing buffers in Internet core routers. Appenzeller et al. suggest that a link needs a buffer of size O(C/√N), where C is the… Expand
Analysis of Random Drop for Gateway Congestion Control
TLDR
Network simulation was used to illustrate the character of Internet congestion and its causes and a modification of Random Drop to do congestion avoidance by applying the policy early was proposed, which has the advantage of avoiding the high drop rate of buffer overflow. Expand
Loss synchronization and router buffer sizing with high-speed versions of TCP
TLDR
The preliminary findings suggest that high-speed versions of TCP do yield higher levels of synchronization, and in spite of a strong drop synchronization, such TCP versions can achieve both high goodput and link utilization, as long as enough buffering is provided. Expand
Unifying Buffer Sizing Results Through Fairness
Buffer sizing in Internet routers is a fundamental problem that has major consequences in design, implementation, and the economy of the routers, as well as on the performance observed by the end… Expand
...
1
2
3
4
5
...