Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1364654.1364674acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

Router buffer sizing revisited: the role of the output/input capacity ratio

Published: 10 December 2007 Publication History

Abstract

The issue of router buffer sizing is still open and significant. Previous work either considers open-loop traffic or only analyzes persistent TCP flows. This paper differs in two ways. First, it considers the more realistic case of non-persistent TCP flows with heavy-tailed size distribution. Second, instead of only looking at link metrics, we focus on the impact of buffer sizing on TCP performance. Specifically, our goal is to find the buffer size that maximizes the average per-flow TCP throughput. Through a combination of testbed experiments, simulation, and analysis, we reach the following conclusions. The output/input capacity ratio at a network link largely determines the required buffer size. If that ratio is larger than one, the loss rate drops exponentially with the buffer size and the optimal buffer size is close to zero. Otherwise, if the output/input capacity ratio is lower than one, the loss rate follows a power-law reduction with the buffer size and significant buffering is needed, especially with flows that are mostly in congestion-avoidance. Smaller transfers, which are mostly in slow-start, require significantly smaller buffers. We conclude by revisiting the ongoing debate on "small versus large" buffers from a new perspective.

References

[1]
G. Appenzeller, I. Keslassy, and N. McKeown. Sizing Router Buffers. In ACM Sigcomm, 2004.
[2]
A. Berger and Y. Kogan. Dimensioning Bandwidth for Elastic Traffic in High-Speed Data Networks. IEEE/ACM Transactions on Networking, 8(5):643--654, 2000.
[3]
G. Bolch, S. Greiner, H. Meer, and K. S. Trivedi. Queueing Networks and Markov Chains. John Wiley and Sons, 1999.
[4]
M. Carson and D. Santay. NIST Net - A Linux-based Network Emulation Tool. ACM CCR, 33(3):111--126, 2003.
[5]
T. Daniels and C. Blondia. Tail Transitions in Queues with Long Range Dependent Input. In IFIP Networking, 2000.
[6]
A. Dhamdhere and C. Dovrolis. Buffer Sizing for Congested Internet Links. In IEEE Infocom, 2005.
[7]
A. Dhamdhere and C. Dovrolis. Open Issues in Router Buffer Sizing. ACM CCR, 36(1):87--92, 2006.
[8]
M. Enachescu, Y. Ganjali, A. Goel, T. Roughgarden, and N. McKeown. Part III: Routers with Very Small Buffers. ACM CCR, 35(3):83--90, 2005.
[9]
Y. Ganjali and N. McKeown. Update on Buffer Sizing in Internet Routers. ACM CCR, 36(5):67--70, 2006.
[10]
H. Jiang and C. Dovrolis. Why is the Internet traffic bursty in short (sub-RTT) time scales? In ACM Sigmetrics, 2005.
[11]
H. S. Kim and N. B. Shroff. Loss Probability Calculations and Asymptotic Analysis for Finite Buffer Multiplexers. IEEE/ACM Transactions on Networking, 9(6):755--768, 2001.
[12]
W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking, 2(1):1--15, Feb. 1994.
[13]
M. Mathis, J. Semke, J. Madhavi, and T. Ott. The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. ACM CCR, 27(3):67--82, 1997.
[14]
M. Mellia, I. Stocia, and H. Zhang. TCP Model for Short Lived Flows. IEEE Communications Letters, 6(2):85--87, 2002.
[15]
R. Morris. TCP Behavior with Many Flows. In IEEE ICNP, 1997.
[16]
R. Morris. Scalable TCP Congestion Control. In IEEE Infocom, 2000.
[17]
R. S. Prasad and C. Dovrolis. Beyond the model of persistent tcp flows: Open-loop vs closed-loop arrivals of non-persistent flows. Technical Report GT-CS-07-07, Georgia Tech, 2007.
[18]
R. S. Prasad, C. Dovrolis, and M. Thottan. Router Buffer Sizing Revisited: The Role of the Output/Input Capacity Ratio. http://www.cc.gatech.edu/~ravi/buffer_report.pdf.
[19]
G. Raina, D. Towsley, and D. Wischik. Part II: Control Theory for Buffer Sizing. ACM CCR, 35(3):79--82, 2005.
[20]
B. Schroeder, A. Wierman, and M. Harchol-Balter. Closed Versus Open: A Cautionary Tale. In USENIX NSDI, 2006.
[21]
J. Sommers and P. Barford. Self-Configuring Network Traffic Generation. In ACM/USENIX IMC, 2004.
[22]
C. Villamizar and C. Song. High Performance TCP in ANSNET. ACM CCR, 24(5):45--60, 1994.
[23]
G. Vu-Brugier, R. Stanojevic, D. Leith, and R. Shorten. A Critique of Recently Proposed Buffer Sizing Strategies. ACM CCR, 37(1):43--48, 2007.
[24]
W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson. Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level. In ACM Sigcomm, 1995.
[25]
D. Wischik and N. McKeown. Part I: Buffer Sizes for Core Routers. ACM CCR, 35(3):75--78, 2005.

Cited By

View all
  • (2024)P4BS: Leveraging Passive Measurements From P4 Switches to Dynamically Modify a Router’s Buffer SizeIEEE Transactions on Network and Service Management10.1109/TNSM.2023.330633521:1(1082-1099)Online publication date: Feb-2024
  • (2018)The unfairness of UDP traffic in routers with different buffer unitsJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-018-1024-8Online publication date: 4-Sep-2018
  • (2018)DATM: a dynamic attribute trust model for efficient collaborative routingAnnals of Operations Research10.1007/s10479-018-2864-5Online publication date: 25-Apr-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '07: Proceedings of the 2007 ACM CoNEXT conference
December 2007
448 pages
ISBN:9781595937704
DOI:10.1145/1364654
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 December 2007

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Upcoming Conference

CoNEXT '24

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)P4BS: Leveraging Passive Measurements From P4 Switches to Dynamically Modify a Router’s Buffer SizeIEEE Transactions on Network and Service Management10.1109/TNSM.2023.330633521:1(1082-1099)Online publication date: Feb-2024
  • (2018)The unfairness of UDP traffic in routers with different buffer unitsJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-018-1024-8Online publication date: 4-Sep-2018
  • (2018)DATM: a dynamic attribute trust model for efficient collaborative routingAnnals of Operations Research10.1007/s10479-018-2864-5Online publication date: 25-Apr-2018
  • (2016)A Reliability-Based Trust Model for Efficient Collaborative Routing in Wireless NetworksProceedings of the 11th International Conference on Queueing Theory and Network Applications10.1145/3016032.3016057(1-7)Online publication date: 13-Dec-2016
  • (2015)PCCProceedings of the 12th USENIX Conference on Networked Systems Design and Implementation10.5555/2789770.2789798(395-408)Online publication date: 4-May-2015
  • (2015)Comparing edge and host traffic pacing in small buffer networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.11.02177:C(103-116)Online publication date: 11-Feb-2015
  • (2014)Comparative study of high-speed Linux TCP variants over high-BDP networksJournal of Network and Computer Applications10.1016/j.jnca.2014.04.00743(66-75)Online publication date: Aug-2014
  • (2013)GENEVA: Streaming Control Algorithm Using Generalized Multiplicative-increase/additive-decreaseJournal of Information Processing10.2197/ipsjjip.21.10921:1(109-121)Online publication date: 2013
  • (2011)Operating a network link at 100%Proceedings of the 12th international conference on Passive and active measurement10.5555/1987510.1987511(1-10)Online publication date: 20-Mar-2011
  • (2011)On the impact of the flow size distribution's tail index on network performance with TCP connectionsACM SIGMETRICS Performance Evaluation Review10.1145/2034832.203484939:2(62-64)Online publication date: 15-Sep-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media