Congestion control is an effective method to solve network congestion. Traditional loss-based congestion control algorithms consider loss as a sign of network congestion. In 2016, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) congestion control algorithm. This is a congestion-based congestion control algorithm which can achieve low latency while maintaining high throughput. However, periodic probing bandwidth phase of BBR suffers from slow convergence and high retransmission in practice. The BBR-APG algorithm proposed in this paper can solve the above problems by adaptively adjusting the pacing gain according to the bottleneck buffer size and network congestion. Experimental results show that BBR-APG improves the convergence speed by 21% and reduces retransmission by up to 73% compared with BBR.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Improved Convergence and Low Retransmission of BBR Congestion Control Algorithm Based on Adaptive Pacing Gain


    Contributors:
    Li, Qi (author) / Zheng, Quan (author) / Yang, Feng (author) / Shi, Qianbao (author)


    Publication date :

    2022-11-24


    Size :

    1903258 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    An Improved Retransmission Timeout Forecasting Algorithm for Vehicular Networks

    Auxilius Jude, M Joseph / Diniesh, V C / K, Prathap Kumar et al. | IEEE | 2022




    Algorithm improved congestion propagation analysis method

    GAO YUCHAO / ZHAO ZEYUAN / ZHANG XING et al. | European Patent Office | 2022

    Free access