OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer

  • Authors:
  • Jingyu Wang;Jianxin Liao;Tonghong Li

  • Affiliations:
  • State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, PR China;State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, PR China;Technical University of Madrid, Madrid 28660, Spain

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

One major problem of concurrent multi-path transfer (CMT) scheme in multi-homed mobile networks is that the utilization of different paths with diverse delays may cause packet reordering among packets of the same flow. In the case of TCP-like, the reordering exacerbates the problem by bringing more timeouts and unnecessary retransmissions, which eventually degrades the throughput of connections considerably. To address this issue, we first propose an Out-of-order Scheduling for In-order Arriving (OSIA), which exploits the sending time discrepancy to preserve the in-order packet arrival. Then, we formulate the optimal traffic scheduling as a constrained optimization problem and derive its closed-form solution by our proposed progressive water-filling solution. We also present an implementation to enforce the optimal scheduling scheme using cascaded leaky buckets with multiple faucets, which provides simple guidelines on maximizing the utilization of aggregate bandwidth while decreasing the probability of triggering 3 dupACKs. Compared with previous work, the proposed scheme has lower computation complexity and can also provide the possibility for dynamic network adaptability and finer-grain load balancing. Simulation results show that our scheme significantly alleviates reordering and enhances transmission performance.