Kathleen Nichols
Abstract
Nearly three decades after it was first diagnosed, the "persistently full buffer problem" recently exposed as part of "bufferbloat", is still with us and made increasingly critical by two trends. First, cheap memory and a "more is better" mentality have led to the inflation and proliferation of buffers. Second, dynamically varying path characteristics are much more common today and are the norm at the consumer Internet edge. Reasonably sized buffers become extremely oversized when link rates and path delays fall below nominal values.
- Braden, R., et al. 1998. Recommendations on queue management and congestion avoidance inthe Internet. RFC 2309. Google Scholar
Digital Library
- Bufferbloat Project; http://www.bufferbloat.net.Google Scholar
- CeroWrt Project; http://www.bufferbloat.net/projects/cerowrt.Google Scholar
- Dischinger, M., et. al. 2007. Characterizing residential broadband networks. In Proceedings of the Internet Measurement Conference, San Diego, CA. Google ScholarDigital Library
- Floyd, S., Jacobson, V. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking. Google ScholarDigital Library
- Gettys, J. 2011. Bufferbloat: dark buffers in the Internet. Backspace Column, IEEE InternetComputing 15(3):95-96. Google ScholarDigital Library
- J. Gettys and K. Nichols. 2011. Bufferbloat: dark buffers in the Internet. Communications of theACM 9(11):57-65. Google ScholarDigital Library
- Jacobson, V. 1988. Congestion avoidance and control. Proceedings of SIGCOMM '88, Stanford, CA. Google ScholarDigital Library
- Jacobson, V. 1989. Reported in Minutes of the Performance Working Group. Proceedings ofthe Cocoa Beach Internet Engineering Task Force, Reston, VA. Corporation for National ResearchInitiatives.Google Scholar
- Jacobson, V. 1998. Notes on using RED for queue management and congestion avoidance. Talk presented at NANOG 13 (North American Network Operators' Group); ftp://ftp.ee.lbl.gov/talks/vj-nanog-red.pdf.Google Scholar
- Jacobson, V. 2006. A rant on queues. A talk presented at MIT Lincoln Labs, Lexington, MA;http://www.pollere.net/Pdfdocs/QrantJul06.pdf.Google Scholar
- Jacobson, V., Nichols, K., Poduri, K. 1999. RED in a different light; http://www.cnaf.infn.it/~ferrari/papers/ispn/red_light_9_30.pdf.Google Scholar
- Kreibich, C., et. al. 2010. Netalyzr: illuminating the edge network. In Proceedings of the InternetMeasurement Conference, Melbourne, Australia. Google ScholarDigital Library
- Li, T., Leith, D. 2008. Adaptive buffer sizing for TCP flows in 802.11e WLANs. In Proceedings ofCommunications and Networking in China.Google ScholarCross Ref
- Mankin, A. 1990. Random drop congestion control. In Proceedings of SIGCOMM '90. Google ScholarDigital Library
- Mathis, M., Semke, J., Mahdavi, J. 1997. The macroscopic behavior of the TCP congestionavoidance algorithm. ACM SIGCOMM Computer Communication Review 27(3). Google ScholarDigital Library
- Nagle, J. 1984. Congestion control in IP/TCP internetworks. RFC 896; http://www.ietf.org/rfc/rfc896.txt,. Google ScholarDigital Library
- Network Simulator - ns-2; http://nsnam.isi.edu/nsnam/index.php/User_Information.Google Scholar
- http://www.pollere.net/CoDel.html.Google Scholar
- Vu-Brugier, G., et. al. 2007. A critique of recently proposed buffer-sizing strategies. ACMSIGCOMM Computer Communication Review 37(1). Google ScholarDigital Library
- Weigle, M. C. 2002. Web traffic generation in ns-2 with PackMime-HTTP; http://www.cs.odu.edu/~mweigle/research/packmime.Google Scholar
- Feng, W., et. al. 2002. The BLUE Active Queue Management Algorithm. In IEEE/ACM Transactionson Networking, 10(4): 513-528. Google ScholarDigital Library
Index Terms
- Controlling Queue Delay: A modern AQM is just one piece of the solution to bufferbloat.
Recommendations
Queue delay estimation and its application to TCP Vegas
This paper proposes a modified Vegas algorithm, which can be adjusted to take a fair share of the bandwidth compared to other transmission control protocols (TCPs). In order to do this, we investigate the maximum round-trip time (RTT) achievable in ...
Delay Analysis for the Fixed-Cycle Traffic-Light Queue
We consider the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive at an intersection controlled by a traffic light and form a queue. The traffic-light signal alternates between green and red periods, and delayed vehicles are assumed to ...
Comments