Publication Details
Title: Comments on Bufferbloat
Author: M. Allman
Group: Networking
Date: January 2013
PDF: https://www.icsi.berkeley.edu/pubs/networking/commentsbufferbloat12.pdf
Overview:
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.
Bibliographic Information:
ACM SIGCOMM Computer Communications, Vol. 3, No. 1, pp. 30-37
Bibliographic Reference:
M. Allman. Comments on Bufferbloat. ACM SIGCOMM Computer Communications, Vol. 3, No. 1, pp. 30-37, January 2013
Author: M. Allman
Group: Networking
Date: January 2013
PDF: https://www.icsi.berkeley.edu/pubs/networking/commentsbufferbloat12.pdf
Overview:
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.
Bibliographic Information:
ACM SIGCOMM Computer Communications, Vol. 3, No. 1, pp. 30-37
Bibliographic Reference:
M. Allman. Comments on Bufferbloat. ACM SIGCOMM Computer Communications, Vol. 3, No. 1, pp. 30-37, January 2013