论文信息 - BBR: Congestion-Based Congestion Control

BBR: Congestion-Based Congestion Control

When bottleneck buffers are large, loss-based congestion control keeps them full, causing bufferbloat. When bottleneck buffers are small, loss-based congestion control misinterprets loss as a signal of congestion, leading to low throughput. Fixing these problems requires an alternative to loss-based congestion control. Finding this alternative requires an understanding of where and how network congestion originates.

[1] Larry L. Peterson,et al. TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[2] Jeffrey M. Jaffe,et al. Flow Control Power is Nondecentralizable , 1981, IEEE Trans. Commun..

[3] Matthew Mathis,et al. The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[4] Joel Cartwright,et al. Practical experience with TCP over GPRS , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5] Min Zhu,et al. B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[6] Leonard Kleinrock,et al. Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[7] Injong Rhee,et al. CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[8] Injong Rhee,et al. Taming the elephants: New TCP slow start , 2011, Comput. Networks.

[9] Geert Jan Olsder,et al. Max Plus at Work: Modeling and Analysis of Synchronized Systems: A Course on Max-Plus Algebra and Its Applications , 2005 .

[10] J Gettys,et al. Bufferbloat: Dark Buffers in the Internet , 2011, IEEE Internet Computing.

[11] Ramesh Govindan,et al. An Internet-Wide Analysis of Traffic Policing , 2016, SIGCOMM.

[12] Dennis Abts,et al. A Guided Tour through Data-center Networking , 2012, ACM Queue.

[13] V. Jacobson,et al. Congestion avoidance and control , 1988, CCRV.