Wansu Pan

Ms. Wansu Pan

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 March 2021 in Electronics
Verified
Journal Article
Open access
PDF file
WPWansu Pan
Wansu Pan
HTHaibo Tan
Haibo Tan
LXLi Xiru
Li Xiru
XLXiaofeng Li
Xiaofeng Li
To alleviate the lower performance of Transmission Control Protocol (TCP) congestion control over complex network, especially the high latency and packet loss scenario, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) congestion control algorithm. In contrast with other TCP congestion control algorithms, BBR adjusted transfer data by maximizing delivery rate and minimizing delay. However, some evaluation experiments have shown that the persistent queues formation and retransmissions in the bottleneck can lead to serious fairness issues between BBR flows with different round-trip times (RTTs). They pointed out that small RTT differences cause unfairness in the throughput of BBR flows and flows with longer RTT can obtain higher bandwidth when competing with the shorter RTT flows. In order to solve this fairness problem, an adaptive congestion window of BBR is proposed, which adjusts the congestion window gain of each BBR flow in network load. The proposed algorithms alleviate the RTT fairness issue by controlling the upper limit of congestion window according to the delivery rate and queue status. In the Network Simulator 3 (NS3) simulation experiment, it shows that the adaptive congestion window of BBR (BBR-ACW) congestion control algorithm improves the fairness by more than 50% and reduces the queuing delay by 54%, compared with that of the original BBR in different buffer sizes.

16 June 2021 in Sensors
Verified
Journal Article
Open access
PDF file
WPWansu Pan
Wansu Pan
XLXiaofeng Li
Xiaofeng Li
HTHaibo Tan
Haibo Tan
JXJinlin Xu
Jinlin Xu
LXLi Xiru
Li Xiru
Google proposed the bottleneck bandwidth and round-trip propagation time (BBR), which is a new congestion control algorithm. BBR creates a network path model by measuring the available bottleneck bandwidth and the minimum round-trip time (RTT) to maximize delivery rate and minimize latency. However, some studies have shown that there are serious RTT fairness problems in the BBR algorithm. The flow with longer RTT will consume more bandwidth and the flows with shorter RTT will be severely squeezed or even starved to death. Moreover, these studies pointed out that even small RTT differences will lead to the throughput of BBR flows being unfair. In order to solve the problem of RTT fairness, an improved algorithm BBR-gamma correction (BBR-GC) is proposed. BBR-GC algorithm takes RTT as feedback information, and then uses the gamma correction function to fit the adaptive pacing gain. This approach can make different RTT flows compete for bandwidth more fairly, thus alleviating the RTT fairness issue. The simulation results of Network Simulator 3 (NS3) show that that BBR-GC algorithm cannot only ensure the channel utilization, but also alleviate the RTT fairness problem of BBR flow in different periods. Through the BBR-GC algorithm, RTT fairness is improved by 50% and the retransmission rate is reduced by more than 26%, compared with that of the original BBR in different buffer sizes.

7 May 2022 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
WPWansu Pan
Wansu Pan
HTHaibo Tan
Haibo Tan
XLXiaofeng Li
Xiaofeng Li
JXJinlin Xu
Jinlin Xu
XLXiru Li
Xiru Li
Google proposed a new congestion control algorithm (CCA) based on bottleneck bandwidth and round-trip propagation time (BBR), which is considered to open a new era of congestion control. BBR creates a network path model by measuring the available bottleneck bandwidth and the minimum round-trip time (RTT) to maximize delivery rate and minimize latency. The BBR v2 algorithm is a recently updated version by Google, which aims to improve some of the problems in the original BBR (BBRv1) algorithm, such as interprotocol fairness issues, RTT fairness issues, and excessive retransmissions. The BBRv2 evaluation results show that it can improve the coexistence with the loss_based algorithm and alleviate some of the shortcomings in BBRv1. However, when multiple BBRv2 flows enter the same link at different times, fair convergence cannot be achieved, and RTT fairness still exists. Based on these problems, we analyze the root cause and proposed an improved algorithm BBRv2+, which uses flow-aware explicit congestion notification (ECN) to quantify queue information and feedback on the accurate congestion degree. BBRv2+ algorithm can avoid blind window constraints and selectively mark packets so that different flows can converge to fairness. In the simulation experiment of Network Simulator 3 (NS3), the results show that the BBRv2+ algorithm can improve intraprotocol fairness and RTT fairness and ensure bandwidth utilization and interprotocol fairness.

30 April 2023 in Sensors
Verified
Journal Article
Open access
PDF file
SYShuang Yang
Shuang Yang
YTYuquan Tang
Yuquan Tang
WPWansu Pan
Wansu Pan
HWHuadong Wang
Huadong Wang
DRDandan Rong
Dandan Rong
ZHANG ZhirongZHANG Zhirong
ZHANG Zhirong
In 2016, Google proposed a congestion control algorithm based on bottleneck bandwidth and round-trip propagation time (BBR). The BBR congestion control algorithm measures the network bottleneck bandwidth and minimum delay in real-time to calculate the bandwidth delay product (BDP) and then adjusts the transmission rate to maximize throughput and minimize latency. However, relevant research reveals that BBR still has issues such as RTT unfairness, high packet loss rate, and deep buffer performance degradation. This article focuses on its most prominent RTT fairness issue as a starting point for optimization research. Using fluid models to describe the data transmission process in BBR congestion control, a fairness optimization strategy based on pacing gain is proposed. Triangular functions, inverse proportional functions, and gamma correction functions are analyzed and selected to construct the pacing gain model, forming three different adjustment functions for adaptive adjustment of the transmission rate. Simulation and real experiments show that the three optimization algorithms significantly improve the fairness and network transmission performance of the original BBR algorithm. In particular, the optimization algorithm that employs the gamma correction function as the gain model exhibits the best stability.

25 October 2024 in Future Internet
Verified
Journal Article
Open access
PDF file
JXJinlin Xu
Jinlin Xu
WPWansu Pan
Wansu Pan
HTHaibo Tan
Haibo Tan
LCLongle Cheng
Longle Cheng
LXLi Xiru
Li Xiru
XLXiaofeng Li
Xiaofeng Li
Wireless networks, especially 5G and WiFi networks, have made great strides in increasing network bandwidth and coverage over the past decades. However, the mobility and channel conditions inherent to wireless networks have the potential to impair the performance of traditional Transmission Control Protocol (TCP) congestion control algorithms (CCAs). Google proposed a novel TCP CCA based on Bottleneck Bandwidth and Round-Trip propagation time (BBR), which is capable of achieving high transmission rates and low latency through the estimation of the available bottleneck capacity. Nevertheless, some studies have revealed that BBR exhibits deficiencies in fairness among flows with disparate Round-Trip Times (RTTs) and also displays inter-protocol unfairness. In high-speed wireless networks, ensuring fairness is of paramount importance to guarantee equitable bandwidth allocation among diverse traffic types and to enhance overall network utilization. To address this issue, this paper proposes a BBR–Pacing Gain (BBR–PG) algorithm. By deriving the pacing rate control model, the impact of pacing gain on BBR fairness is revealed. Adjusting the pacing gain according to the RTT can improve BBR’s performance. Simulations and real network experiments have shown that the BBR–PG algorithm retains the throughput advantages of the original BBR algorithm while significantly enhancing fairness. In our simulation experiments, RTT fairness and intra-protocol fairness were improved by 50% and 46%, respectively.

26 September 2023 in Research Square
Verified
Preprint
Open access
PDF file
WPWansu Pan
Wansu Pan
JXJinlin Xu
Jinlin Xu
HTHaibo Tan
Haibo Tan
LCLongle Cheng
Longle Cheng
XLXiru Li
Xiru Li
XLXiaofeng Li
Xiaofeng Li
Google proposed a new TCP congestion control algorithm based on Bottleneck Bandwidth and Round-trip propagation time (BBR). BBR achieves high transmission rate and low latency by estimating the available bottleneck capacity. Compared with the traditional loss-based congestion control algorithms such as CUBIC, BBR has obvious advantages in throughput. However, some studies have found that BBR has poor fairness among flows with different Round Trip Times (RTTs), inter-protocol unfairness and high packet loss rate in shallow buffer. BBR is already used in some cases, so its fairness and practicability improvements become very important. In this paper, the fairness of BBR is taken as the breakthrough point to deeply analyze the bandwidth probe mechanism. The pacing rate control model is derived and the effect of pacing gain on BBR performance is revealed. Furthermore, This paper proposes a BBR-PG algorithm, which adjusts pacing gain based on RTT to improve BBR. Simulation and real network experiments show that the proposed algorithm improves RTT fairness and inter-protocol fairness, reduces the retransmission rate,while retaining the throughput advantage of the original BBR.