Goodput Improvement for MPTCP Based on Controlling the Difference of Delay

Abstract

Abstract

Research of Wireless Congestion Control Algorithm Based on EKF

“…KF can effectively deal with the linear filtering problem of discrete data; that is, it can estimate and correct the current state of the system and also predict the state of the system at a certain time in the future. A delay estimation based on Kalman filtering was proposed in [22], and congestion control was performed accordingly to improve the system throughput. Different bandwidth estimation methods based on Kalman filtering were proposed and applied to different scenarios in [23][24][25][26][27][28][29][30][31][32][33][34][35], however, these algorithms were all based on linear systems, while most of the actual networks were nonlinear systems.…”

“…Since the cross traffic has a certain effect on the sequence of the probe packets, the function between the input interval of the probe packets and the cross traffic can be obtained by analyzing the changes in the interval of the probe packets. Then, the bandwidth of the bottleneck link is subtracted from the cross traffic to obtain the available bandwidth of the link [22]. The algorithm defines the available bandwidth ( ) A t as shown in Equation (6).…”

“…When two adjacent probe packets P1 and P2 arrive at the router one after the other, and there are data packets queued in the router [22], g out satisfies Equation (7).…”

“…Whenever the sender receives an Acknowledge (ACK), it needs to record the congestion window size cwnd and the round-trip delay Rtt at the current moment. In addition, the minimum round-trip delay is stored by Rtt min , and the definition of the optimal transmission rate V opti is shown in Equation (22).…”