Damon Wischik
Nick McKeown
Abstract
In this article we describe recent work on buffer sizing for core Internet routers. This work suggests that the widely-used rule of thumb leads to buffers which are much larger than they need to be. For example, the buffer in a backbone router could be reduced from 1,000,000 packets to 10,000 without loss in performance. It could be reduced even further, perhaps to 10-20 packets, at the cost of a small amount of bandwidth utilization. This tradeoff is worth considering, for example for a possible future all-optical router.
- A. Aggarwal, S. Savage, and T. Anderson. Understanding the performance of TCP pacing. In IEEE Infocom, 2000.Google Scholar
Cross Ref
- G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. In SIGCOMM, 2004. Extended version available as Stanford HPNG Technical Report TR04-HPNG-060800. Google ScholarDigital Library
- J. Cao and K. Ramanan. A Poisson limit for buffer overflow probabilities. In IEEE Infocom, 2002.Google ScholarCross Ref
- A. Dhamdhere, H. Jiang, and C. Dovrolis. Buffer sizing for congested Internet links. In IEEE Infocom, 2005.Google ScholarCross Ref
- M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and T. Roughgarden. Part III: Routers with very small buffers. ACM/SIGCOMM CCR, 2005. Google ScholarDigital Library
- V. Firoiu, J.-Y. L. Boudec, D. Towsley, and Z.-L. Zhang. Theories and models for Internet quality of service. Proceedings of the IEEE, 2002.Google ScholarCross Ref
- F.P. Kelly. Models for a self-managed Internet. Phil. Trans. of the Royal Society, A358, 2000.Google Scholar
- T. Kelly. On engineering a stable and scalable TCP variant. Technical Report CUED/F-INFENG/TR. 435, Cambridge University Engineering Department, 2002.Google Scholar
- M. Mathis, J. Semke, J. Mahdavi, and T. Ott. The macroscopic behavior of the TCP congestion avoidance algorithm. ACM/SIGCOMM CCR, 1997. Google ScholarDigital Library
- V. Paxson and S. Floyd. Wide-area traffic: the failure of Poisson modeling. ACM/SIGCOMM CCR, 24:257--268, 1994. Google ScholarDigital Library
- G. Raina, D. Towsley, and D. Wischik. Part II: Control theory for buffer sizing. ACM/SIGCOMM CCR, 2005. Google ScholarDigital Library
- G. Raina and D. Wischik. Buffer sizes for large multiplexers: TCP queueing theory and instability analysis. In EuroNGI, 2005. Extended version to appear in Queueing Systems.Google ScholarCross Ref
Index Terms
- Part I: buffer sizes for core routers
Recommendations
Part II: control theory for buffer sizing
This article describes how control theory has been used to address the question of how to size the buffers in core Internet routers. Control theory aims to predict whether the is stable, i.e. whether TCP flows are desynchronized. If flows are ...
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or all-optical buffering. Unfortunately, a widely used rule-...
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP's congestion control algorithm. In particular, the goal is to make sure that when a link is congested, ...
Comments