Dynamic data scheduling method in multi-path transfer protocol

Abstract

The invention discloses a dynamic data scheduling method in a multi-path transmission control protocol (MPTCP), comprising the following steps: the round-trip time RTT and the round-trip time variation RTTVAR of each path are measured; whether each path is available is judged according to the RTT and RTTVAR, the congested paths are abandoned, and the available paths are retained; the data transmission capacity of each path is estimated; and a data transmission quota is allocated for each path based on the estimated data transmission capacity and the current sending window, and a scheduler allocates transmission data according to the transmission quota. According to the scheme, the essence of a TCP Vegas algorithm is absorbed on the basis of Lowest_RTT, and improvement is made on the basis, which is equivalent to adding a congestion avoidance control function to the scheduler. The method has far-reaching significance to avoiding path congestion and enhancing the overall transmission capacity of the paths.

Description

technical field [0001] The present invention relates to data scheduling technology in multi-path parallel transmission, in particular to a dynamic data scheduling method in Multi-path Transmission Control Protocol (MPTCP, Multi-path Transmission Control Protocol). Background technique [0002] With the development and popularization of network and communication technologies, more and more network terminal devices have multi-network access capabilities. Faced with the improvement of new business requirements for data transmission, it has become a new trend to use multiple networks for multi-path parallel transmission. development trend. By accessing a variety of wired and wireless networks, the network terminal equipment uses the multi-path transmission control protocol MPTCP to distribute data to multiple paths for parallel transmission. By integrating all available paths to aggregate network transmission bandwidth, it can not only improve the effectiveness of data transmiss...

AI Technical Summary

Problems solved by technology

In addition, there is also a passive data scheduling method, Round Robin, which distributes data evenly without considering the difference in transmission quality of each path, which can easily cause out-of-order data arrival at the receiving end, causing transmission congestion, and low performance. Research test references are kept in the kernel

[0004] Obviously, the Round Robin data scheduling strategy cannot adapt to the actual environment with changing path transmission conditions, and cannot achieve the goal of multi-path parallel transmission. Although the Lowest-RTT data scheduling strategy achieves dynamic scheduling to a certain extent, it only selects the smallest path for transmission. As the only evaluation standard, although the implementation is relatively simple, it ignores other path transmission characteristics such as network bandwidth.

In addition, the scheduler and the congestion control mechanism in MPTCP work in coordination. The effect of the congestion control mechanism will affect the scheduling performance of the scheduler. However, the Lowest-RTT data scheduling strategy does not involve the congestion state. When excessive scheduling occurs, it will cause congestion. Congestion control The mechanism will reduce the sending window cwnd multiplicatively, resulting in a sharp drop in the data transmission rate of the path, and the path bandwidth cannot be fully utilized, thereby affecting the overall performance, so it cannot fully meet the expectations of MPTCP multipath transmission

[0005] Neither the traditional RTT-based data scheduling method nor the passive Round Robin data scheduling strategy can give full play to the performance of MPTCP multi-path parallel transmission, and the actual transmission efficiency cannot meet expectations, thus restricting the popularization of MPTCP applications.

Images