A Machine Learning-Based Framework for Dynamic Selection of Congestion Control Algorithms

Abstract

Most congestion control algorithms (CCAs) are designed for specific network environments. As such, there is no known algorithm that achieves uniformly good performance in all scenarios for all flows. Rather than devising a one-size-fitsall algorithm (which is a likely impossible task), we propose a system to dynamically switch between the most suitable CCAs for specific flows in specific environments. This raises a number of challenges, which we address through the design and implementation of Antelope, a system that can dynamically reconfigure the stack to use the most suitable CCA for individual flows. We build a machine learning model to learn which algorithm works best for individual conditions and implement kernellevel support for dynamically switching between CCAs. The framework also takes application requirements of performance into consideration to fine-tune the selection based on applicationlayer needs. Moreover, to reduce the overhead introduced by machine learning on individual front-end servers, we (optionally) implement the CCA selection process in the cloud, which allows the share of models and the selection among front-end servers. We have implemented Antelope in Linux, and evaluated it in both emulated and production networks. The results demonstrate the effectiveness of Antelope via dynamic adjusting the CCAs for individual flows. Specifically, Antelope achieves an average 16% improvement in throughput compared with BBR, and an average 19% improvement in throughput and 10% reduction in delay compared with CUBIC.

TC-RAN: A Programmable Traffic Control Service Model for 5G/6G SD-RAN

“…On the other hand, other solutions try to tackle the problem before the slowest link in the path (e.g., FQ-CoDel), as they can gather key information to optimize the pacing rate and reduce the sojourn time. Either way, the question of the best location remains open with new proposed solutions continuously emerging [56] [32] [57].…”