Comments on Bufferbloat
Title | Comments on Bufferbloat |
Publication Type | Journal Article |
Year of Publication | 2013 |
Authors | Allman, M. |
Published in | ACM SIGCOMM Computer Communication Review |
Volume | 3 |
Issue | 1 |
Page(s) | 30-37 |
Other Numbers | 3409 |
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. |
Acknowledgment | This work was partially supported by funding provided to ICSI through National Science Foundation grant CNS-1213157. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation. |
URL | https://www.icsi.berkeley.edu/pubs/networking/commentsbufferbloat12.pdf |
Bibliographic Notes | ACM SIGCOMM Computer Communication Review, Vol. 3, No. 1, pp. 30-37 |
Abbreviated Authors | M. Allman |
ICSI Research Group | Networking and Security |
ICSI Publication Type | Article in journal or magazine |