scholarly journals Performance of TCP CUBIC and TCP BBR on IEEE802.11s Mesh Network

2020 ◽  
pp. 639-645
Author(s):  
Katsuya Atsuta ◽  
◽  
Satoshi Kouya ◽  
Naoshi Sakamoto
Keyword(s):  
Congestion Control ◽  
Bit Error Rate ◽  
Error Rate ◽  
Control Algorithm ◽  
Loss Probability ◽  
Mesh Network ◽  
Propagation Time ◽  
Round Trip ◽  
Communication Performance ◽  
Congestion Control Algorithm

In this study, IEEE802.11s mesh networking was formulated as it expected to be widely used because of its convenience. The properties of IEEE802.11s mesh networking were investigated and the results revealed its faulty communication performance in a multi-hop network. This could be explained based on Mathis’s theory for loss-based TCP congestion control algorithm that suggests that with an increase in delay, the loss probability decreases the communication performance. Recently, Google proposed TCP Bottleneck Bandwidth and Round-trip propagation time (BBR), both of which may tolerate a high bit error rate. This algorithm does not follow Mathis’s model. In this study, we measure the performance of TCP CUBIC and TCP BBR on a mesh network, followed by an evaluation of the properties of this mesh network.

scholarly journals Improved RTT Fairness of BBR Congestion Control Algorithm Based on Adaptive Congestion Window

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 615
Author(s):  
Wansu Pan ◽  
Haibo Tan ◽  
Xiru Li ◽  
Xiaofeng Li
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Delivery Rate ◽  
Propagation Time ◽  
Network Simulator ◽  
Round Trip ◽  
Congestion Window ◽  
Queuing Delay ◽  
Congestion Control Algorithm ◽  
Tcp Congestion Control

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.

scholarly journals Improvement of RTT Fairness Problem in BBR Congestion Control Algorithm by Gamma Correction

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4128
Author(s):  
Wansu Pan ◽  
Xiaofeng Li ◽  
Haibo Tan ◽  
Jinlin Xu ◽  
Xiru Li
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Path Model ◽  
Correction Function ◽  
Propagation Time ◽  
Network Simulator ◽  
Gamma Correction ◽  
Round Trip ◽  
Feedback Information ◽  
Congestion Control Algorithm

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.

An Analysis to Improve Congestion Algorithm of TCP

2010 ◽  
Vol 171-172 ◽  
pp. 756-759
Author(s):  
Kun Shang ◽  
Zhi Hua Zhai
Keyword(s):  
Congestion Control ◽  
Data Transmission ◽  
Control Algorithm ◽  
Round Trip Time ◽  
Round Trip ◽  
Trip Time ◽  
Congestion Control Algorithm ◽  
End To End

Congestion is an important issue in the research of end-to-end congestion control. The congestion issue in transmission with TCP is studied. Under the situation of different round trip time and multiple congested gateways, ECC (Explicit Congestion Control) algorithm is proposed to solve the congestion problem of TCP. The basic idea is to explicitly improve Congestion by adding mechanism at both end systems and gateways. Then study the tile congestion of Internet data transmission. Internet data transmission relies on end system mechanisms to keep Congestion. As the number of the users has been very large, this scheme has become vulnerable. It is required to deploy some congestion mechanism at gateways.

scholarly journals Understanding of BBRv2: Evaluation and Comparison with BBRv1 Congestion Control Algorithm

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yeong-Jun Song ◽  
Geon-Hwan Kim ◽  
Imtiaz Mahmud ◽  
Won-Kyeong Seo ◽  
You-Ze Cho
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Congestion Control Algorithm

An approach to ensure joint illumination & communication performance of a forward error corrected indoor visible light communication (VLC) system in presence of ambient light interference

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Sourish Chatterjee ◽  
Biswanath Roy
Keyword(s):  
Visible Light ◽  
Bit Error Rate ◽  
Error Rate ◽  
Light Emitting Diode ◽  
Visible Light Communication ◽  
Ambient Light ◽  
Ambient Illumination ◽  
Communication Performance ◽  
Light Interference ◽  
Forward Error

AbstractIn recent time of looming radio frequency (RF) spectrum crisis, visible light communication using lighting infrastructure emerged as a potential alternative at an indoor environment. This paper addresses the setback associated with ambient light interference in an indoor Visible Light Communication (VLC) system to ensure joint communication and illumination performance inside an office room. A novel VLC architecture with suitable white light emitting diode (WLED) luminaire arrangement is presented to minimize the dispersion of signal to interference plus noise ratio (SINR) across the room. Luminaires are categorized in two groups viz. data transmitting illuminants and illuminants for lighting purpose. The first group is dedicated to transmit data as well as serves the purpose of illumination. The other set creates only ambient illumination to achieve quality lighting attributes. The proposed forward error corrected receiver configuration discards the ambient light noise originated by the illuminants that serve the ambient illumination. Tail biting convolutional encoder and viterbi decoder are used at the encoding section of the transmitter and decoding section of the receiver respectively to improve bit error rate. Results obtained through MATLAB simulation shows better average bit error rate (BER) in the order of 10−8 measured at uniformly distributed 25 grid points over the working plane. At the same time achieved average horizontal illuminance with good uniformity comply with ISO recommendation.

scholarly journals Load Early Detection (LED): A Congestion Control Algorithm Based on Routers' Traffic Load

2006 ◽  
Vol 2 ◽  
pp. 94-107 ◽  
Author(s):  
Arjan Durresi ◽  
Leonard Barolli ◽  
Mukundan Sridharan ◽  
Sriram Chellappan ◽  
Raj Jain
Keyword(s):  
Early Detection ◽  
Congestion Control ◽  
Control Algorithm ◽  
Traffic Load ◽  
Congestion Control Algorithm
Sign in / Sign up

Export Citation Format

Share Document