Packets distribution over asymmetric paths using concurrent multipath transfer

Concurrent multipath transfer (CMT) is a transport layer protocol used for transferring data over multiple paths concurrently. In the case of asymmetric paths, the dissimilarity of delay, bandwidth, and loss rate among paths leads to challenges such as out‐of‐order packets, receiver buffer blocking, and throughput reduction. A framework that uses the end‐to‐end delay of paths to distribute the packets over asymmetric paths in ordering policy is proposed. The proposed framework detects network congestion in the assigned path and reduces the congestion window. Furthermore, the proposed framework predicts receiver buffer blocking and deactivates the highest delay path that causes this problem. The simulation results show that the proposed framework achieves highest throughput, lower entropy and lower average application end‐to‐end delay than the previous algorithms. A framework that uses the end‐to‐end delay of paths to distribute the packets over asymmetric paths in ordering policy is proposed. The proposed framework detects network congestion in the assigned path and reduces the congestion window. Furthermore, the proposed framework predicts receiver buffer blocking and deactivates the highest delay path that causes this problem.