skip to main content
research-article
Free Access

Bufferbloat: Dark Buffers in the Internet: Networks without effective AQM may again be vulnerable to congestion collapse.

Published:29 November 2011Publication History
Skip Abstract Section

Abstract

Today’s networks are suffering from unnecessary latency and poor system performance. The culprit is bufferbloat, the existence of excessively large and frequently full buffers inside the network. Large buffers have been inserted all over the Internet without sufficient thought or testing. They damage or defeat the fundamental congestion-avoidance algorithms of the Internet’s most common transport protocol. Long delays from bufferbloat are frequently attributed incorrectly to network congestion, and this misinterpretation of the problem leads to the wrong solutions being proposed.

References

  1. Appenzeller, G., Keslassy, I., McKeown, N. 2004. Sizing router buffers. ACM SIGCOMM, Portland,OR, (August). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Braden, R., et al., 1998. Recommendations on queue management and congestion avoidance inthe Internet, RFC2309 (April). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cheshire, S. 1996. It's the latency, stupid; http://rescomp.stanford.edu/~cheshire/rants/Latency.html.Google ScholarGoogle Scholar
  4. Dischinger, M., et al. 2007. Characterizing residential broadband networks. Internet MeasurementConference (IMC), San Diego, CA (October 24-27). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Floyd, S., Jacobson, V. 1993. Random Early Detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking (August). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jacobson, V. 1998. Notes on using RED for queue management and congestion avoidance. Talk atNANOG (North American Network Operators' Group) 13; ftp://ftp.ee.lbl.gov/talks/vj-nanog-red.pdf.Google ScholarGoogle Scholar
  7. Kreibich, C., et al. 2010. Netalyzr: illuminating the edge network. Internet MeasurementConference (IMC), Melbourne, Australia (November 1-3). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Nagle, J. 1985. On packet switches with infinite storage. Network Working Group RFC 970(December); http://www.ietf.org/rfc/rfc970.txt. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Reed, D. P. 2009. Congestion collapse definition; thread at http://mailman.postel.org/pipermail/end2end-interest/2009-September/007769.html.Google ScholarGoogle Scholar
  10. Reed, D.P. 2009. What's wrong with this picture; thread at http://mailman.postel.org/pipermail/end2end-interest/2009-September/007742.html.Google ScholarGoogle Scholar
  11. Rhee, I., Xu, L. 2008. CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS 42 (5). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Villamizar, C., Song, C. 1994. High-performance TCP in ANSNET. Computer CommunicationsReview 24(5): 45-60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. V. Jacobson and M. Karels, Congestion Avoidance and Control, Proceedings of SIGCOMM '88,August 1988 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. Jacobson, Notes on Using RED for Queue Management and Congestion Avoidance, talk atNANOG 13, ftp://ftp.ee.lbl.gov/talks/vj-nanog-red.pdf, see also http://www.nanog.org/mtg-9806/agen0698.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. Bufferbloat: Dark Buffers in the Internet: Networks without effective AQM may again be vulnerable to congestion collapse.

        Recommendations

        Comments

        Login options

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

        Sign in

        Full Access

        • Published in

          cover image Queue
          Queue  Volume 9, Issue 11
          Virtualization
          November 2011
          53 pages
          ISSN:1542-7730
          EISSN:1542-7749
          DOI:10.1145/2063166
          Issue’s Table of Contents

          Copyright © 2011 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 November 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Popular
          • Editor picked

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format