GH Kim, YJ Song, I Mahmud… - … conference on ubiquitous …, 2019 - ieeexplore.ieee.org
Google has proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) as a new congestion control algorithm. The difference between it and the existing congestion …
H Tian, X Liao, C Zeng, D Sun… - … /ACM Transactions on …, 2023 - ieeexplore.ieee.org
Previous congestion control (CC) algorithms based on deep reinforcement learning (DRL) directly adjust flow sending rate to respond to dynamic bandwidth change, resulting in high …
Previous congestion control (CC) algorithms based on deep reinforcement learning (DRL) directly adjust flow sending rate to respond to dynamic bandwidth change, resulting in high …
Load factor based congestion control schemes have shown to enhance network performance, in terms of utilization, packet loss and delay. In these schemes, using more …
Congestion control algorithms are crucial in achieving high utilization while preventing overloading the network. Over the years, many different congestion control algorithms have …
Y Tao, J Jiang, S Ma, L Wang… - 2018 IEEE global …, 2018 - ieeexplore.ieee.org
BBR is a congestion-based congestion control algorithm recently proposed by Google. It proactively measures the bottleneck bandwidth and round trip times (RTTs) of a connection …
M Yang, P Yang, C Wen, Q Liu… - 2019 IEEE Wireless …, 2019 - ieeexplore.ieee.org
Traditional loss-based congestion control protocols interpret packet loss as network congestion. Recently, Google proposed BBR, which is a congestion-based congestion …
To overcome weaknesses in traditional loss-based congestion control algorithms (CCAs), researchers have developed and deployed several delay-bounding CCAs that achieve high …
A Zapletal, F Kuipers - Proceedings of the 22nd ACM Workshop on Hot …, 2023 - dl.acm.org
The conventional definition of fairness in congestion control is flow rate fairness. However, Internet users typically care about flow completion times (FCTs) and flow rate fairness does …