OLMS: A Flexible Online Learning Multi-Path Scheduling Framework

Abstract

Over the past decade, there has been a tremendous surge in the inter-connectivity among hosts in networks. Many multi-path transport protocols, such as MPTCP, MPQUIC, and MPRDMA, have emerged to facilitate multi-path data transmissions between pairs of hosts. However, existing packet schedulers in these protocols are quite limited as they neglect the stochastic nature inherent in heterogeneous paths, such as, round-trip time and available bandwidth. Moreover, users have diverse requirements; for instance, some prioritize low latency, while others consistently seek to achieve high bandwidth. In this paper, we propose a flexible Online Learning Multi-path Scheduling (OLMS) framework to schedule packets to multiple paths and meet various user-defined requirements by learning the dynamic characteristics of paths in various applications. Specifically, we consider two types of applications, which are 1) maxRTT constrained and 2) bandwidth constrained, and use OLMS to schedule packets to satisfy the distinct user-defined requirements. Our theoretical analysis demonstrates that OLMS achieves guarantees with sublinear regret and sublinear violation. Furthermore, we implement a prototype of OLMS in MPQUIC and conduct experiments across different scenarios. Our experiments on Mininet show that OLMS enables an 8.42%–18.71% increase in bandwidth utilization in the maxRTT constrained application and negligible violations of user-defined requirements in both applications compared to other schedulers. Additionally, OLMS reduces flow completion times by 4.22%–10.26% compared to other schedulers, all without incurring large overhead.