On-demand scheduling for concurrent multipath transfer under delay-based disparity

This paper proposes a new scheduling algorithm for concurrent multipath transfer (CMT) called the on-demand scheduler (ODS). Unlike previous algorithms, ODS waits for a transmission opportunity before making a scheduling decision. We showed ODS can outperform previous scheduling algorithms for CMT under various network scenarios. Moreover, this paper offers new insight into the effects of congestion and flow control on the receive buffer blocking problem associated with CMT.