article

Part II: control theory for buffer sizing

Authors:

Gaurav Raina,

Don Towsley,

Damon WischikAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 35, Issue 3

Pages 79 - 82

https://doi.org/10.1145/1070873.1070885

Published: 01 July 2005 Publication History

Get Access

Abstract

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 desynchronized then small buffers are sufficient [14 ]; the theory here shows that small buffers actually promote desynchronization--a virtuous circle.

References

[1]

F. Baccelli, D.R. McDonald, and J. Reynier. A mean-field model for multiple TCP connections through a buffer implementing RED. Performance Evaluation 2002. Available as INRIA research report RR-4449.]]

Digital Library

Google Scholar

[2]

A. Bain. Fluid limits for congestion control in networks PhD thesis, University of Cambridge, 2003.]]

Google Scholar

[3]

S. Deb and R. Srikant. Rate-based versus queue-based models of congestion control. In ACM Sigmetrics 2004.]]

Digital Library

Google Scholar

[4]

S. Floyd. HighSpeed TCP for large congestion windows, 2003. RFC 3649, Experimental.]]

Digital Library

Google Scholar

[5]

C.V. Hollot, V. Misra, D. Towsley, and W.-B. Gong. On designing improved controllers for AQM routers supporting TCP flows. In IEEE Infocom 2001.]]

Google Scholar

[6]

F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control 2003.]]

Google Scholar

[7]

T. Kelly. On engineering a stable and scalable TCP variant. Technical Report CUED/F-INFENG/TR. 435, Cambridge University Engineering Department, 2002.]]

Google Scholar

[8]

M.A. Marsan, M. Gatetto, P. Giaccone, E. Leonardi, E. Schiattarella, and A. Tarello. Using partial differential equations to model TCP mice and elephants in large IP networks. In IEEE Infocom 2004.]]

Google Scholar

[9]

V. Misra, W.-B. Gong, and D. Towsley. Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED. ACM/SIGCOMM CCR 2000.]]

Digital Library

Google Scholar

[10]

G. Raina. Control theory and instability analysis of TCP. Technical report, Statistical Laboratory, Cambridge, 2005. To appear.]]

Google Scholar

[11]

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 Scholar

[12]

R. Srikant. The Mathematics of Internet Congestion Control Birkhauser, 2004.]]

Digital Library

Google Scholar

[13]

G. Vinnicombe. On the stability of networks operating TCP-like congestion control. In Proceedings of IFAC World Congress on Automatic Control 2002.]]

Crossref

Google Scholar

[14]

D. Wischik and N. McKeown. Part I: Buffer sizes for core routers. ACM/SIGCOMM CCR 2005.]]

Digital Library

Google Scholar

Cited By

View all

Patil STahiliani M(2022)Minstrel PIEComputer Communications10.1016/j.comcom.2019.03.006139:C(16-31)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1016/j.comcom.2019.03.006
Ye JLeung KLow S(2021)Combating Bufferbloat in Multi-Bottleneck Networks: Theory and AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2021.306650529:4(1477-1493)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2021.3066505
Bommisetty L(2021)Performance Analysis of TCP Queues: Effect of Buffer Size and Round Trip Time2021 6th International Conference on Signal Processing, Computing and Control (ISPCC)10.1109/ISPCC53510.2021.9609523(631-635)Online publication date: 7-Oct-2021
https://doi.org/10.1109/ISPCC53510.2021.9609523
Show More Cited By

Index Terms

Part II: control theory for buffer sizing
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Modeling methodologies
2. Networks
  1. Network components
    1. Intermediate nodes
      1. Routers

Recommendations

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-...
Part I: buffer sizes for core routers

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 ...
Differentiated predictive fair service for TCP flows
ICNP '00: Proceedings of the 2000 International Conference on Network Protocols

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has spurred further investigations into its congestion control mechanism and its effect on ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 35, Issue 3

July 2005

90 pages

ISSN:0146-4833

DOI:10.1145/1070873

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2005

Published in SIGCOMM-CCR Volume 35, Issue 3

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

128
Total Citations
View Citations
1,290
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)3

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Patil STahiliani M(2022)Minstrel PIEComputer Communications10.1016/j.comcom.2019.03.006139:C(16-31)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1016/j.comcom.2019.03.006
Ye JLeung KLow S(2021)Combating Bufferbloat in Multi-Bottleneck Networks: Theory and AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2021.306650529:4(1477-1493)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2021.3066505
Bommisetty L(2021)Performance Analysis of TCP Queues: Effect of Buffer Size and Round Trip Time2021 6th International Conference on Signal Processing, Computing and Control (ISPCC)10.1109/ISPCC53510.2021.9609523(631-635)Online publication date: 7-Oct-2021
https://doi.org/10.1109/ISPCC53510.2021.9609523
Zhang YKoura YSu Y(2020)Asymptotic Behavior of a Predator-Prey Model with Allee Threshold Applied to Online Social Network Users’ Data ForwardingMathematical Problems in Engineering10.1155/2020/85492472020(1-10)Online publication date: 19-Mar-2020
https://doi.org/10.1155/2020/8549247
Pei LZhang HChen Y(2020)Sudden Transition from Equilibrium to Hybrid Chaos and Periodic Oscillations of the State-Dependent Round-Trip Delayed Nonsmooth Compound TCP with GRED Congestion Control System via HB-AFTComplexity10.1155/2020/59824032020Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1155/2020/5982403
Xu DZhou AZhang XWang GLiu XAn CShi YLiu LMa H(2020)Understanding Operational 5GProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405882(479-494)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405882
Pokhrel SL. Vu HCricenti A(2020)Adaptive Admission Control for IoT Applications in Home WiFi NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2019.293571919:12(2731-2742)Online publication date: 1-Dec-2020
https://doi.org/10.1109/TMC.2019.2935719
Vakilinia SElbiaze H(2020)Latency Control of ICN Enabled 5G NetworksJournal of Network and Systems Management10.1007/s10922-019-09497-w28:1(81-107)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1007/s10922-019-09497-w
McKeown NAppenzeller GKeslassy I(2019)Sizing router buffers (redux)ACM SIGCOMM Computer Communication Review10.1145/3371934.337195749:5(69-74)Online publication date: 8-Nov-2019
https://dl.acm.org/doi/10.1145/3371934.3371957
Diot C(2019)About velocity and dealing with "fake" scientific newsACM SIGCOMM Computer Communication Review10.1145/3371934.337194549:5(24-25)Online publication date: 8-Nov-2019
https://dl.acm.org/doi/10.1145/3371934.3371945
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Part III: routers with very small buffers

Part I: buffer sizes for core routers

Differentiated predictive fair service for TCP flows

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations