Comments on bufferbloat
- 9 January 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 43 (1), 30-37
- https://doi.org/10.1145/2427036.2427041
Abstract
While there has been much buzz in the community about the large depth of queues throughout the Internet---the so-called "bufferbloat" problem---there has been little empirical understanding of the scope of the phenomenon. Yet, the supposed problem is being used as input to engineering decisions about the evolution of protocols. While we know from wide scale measurements that bufferbloat can happen, we have no empirically-based understanding of how often bufferbloat does happen. In this paper we use passive measurements to assess the bufferbloat phenomena.Keywords
This publication has 16 references indexed in Scilit:
- Confused, timid, and unstablePublished by Association for Computing Machinery (ACM) ,2012
- Bufferbloat: Dark Buffers in the InternetQueue, 2011
- Bufferbloat: Dark Buffers in the InternetIEEE Internet Computing, 2011
- Bro: a system for detecting network intruders in real-timeComputer Networks, 1999
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- End-to-end routing behavior in the InternetPublished by Association for Computing Machinery (ACM) ,1996
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- TCP Extensions for High Performance1992
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- Improving round-trip time estimates in reliable transport protocolsPublished by Association for Computing Machinery (ACM) ,1987