Research On MPTCP Sub-Path Data Scheduling Algorithm Based On Link Characteristics

With the rapid development of communication technologies,more and more devices have multiple network interfaces and can be equipped with multiple network addresses.However,at the same time,the user can only select one access link,resulting in a waste of network resources.Using these interfaces to achieve parallel multi-stream transmission has become a new research direction in recent years.The Internet is a complex heterogeneous network.The bandwidth,delay,packet loss rate,and other factors vary from link to link.However,MPTCP does not take this into account.By default,it treats all links in the same way,resulting in a receiver.The data was out of order,which led to a series of problems such as blocking of the team and application delay.In order to improve the network bandwidth utilization,this paper proposes two algorithms,MPTCP-DQW-I and MPTCP-DQW-?,which are mainly used to solve the problems of delay and packet loss rate.The main work of this paper is as follows:(1)In order to reduce the bandwidth utilization of the network under heterogene-ous network environment,The data scheduling algorithm based on two-stage queues and dynamic weights(MPTCP-DQW-I)is designed,which instead of the polling scheduling algorithm that comes with the MPTCP protocol(Round Robin).The algorithm uses the round-trip delay and packet loss rate as the main indicators to evaluate the path quality.After the data queue receives the data from the application layer,it divides the data queue and numbers them sequentially.The data is allocated according to the quality of each sub-path and the size of the window.Packets,sub-path queues are stored in their respective buffers waiting for transmission after receiving these data packets,so that poor quality paths do not affect the transmission performance of better-quality paths,effectively eliminating packet out-of-order and buffer congestion problem.(2)Combining Markov Model with MPTCP-DQW-I algorithm,an MPTCP-DQW-? algorithm is proposed.The algorithm can dynamically adjust the size of the congestion window of each sub-path based on the packet transmission prediction time,and allocate more outgoing data packets to the path with less data packet transmission prediction time.This ensures that the data packet is pressed as fast as possible.Order arrives at the receiving end,reducing the appearance of out-of-order packets.Data experimental results show that the bandwidth utilization and throughput of the proposed algorithm MPTCP-DQW-II are better than the algorithm MPTCP-DQW-I.