Intent-Based Radio Scheduler for RAN Slicing: Learning to Deal With Different Network Scenarios

This is the authors' abstract. We don't add key points for this paper.

The future mobile network schedulers have the complex mission of distributing radio resources among various applications with different requirements. The radio access network (RAN) slicing enables the creation of different logical networks by using dedicated resources for each group of applications. In this scenario, the radio resource scheduling (RRS) is responsible for distributing the radio resources among the slices to fulfill their requirements. Several recent studies have proposed advances in machine learning-based RRS. However, these works often evaluate their models under limited scenarios and with minimal slice diversity, raising concerns about their real-world applicability. The generalization capabilities of these models remain uncertain without rigorous testing across diverse network conditions and slice configurations, which may hinder their effectiveness upon deployment in operational networks. This paper proposes an intent-based RRS using multi-agent reinforcement learning in a RAN slicing context. The proposed method protects high-priority slices when the available radio resources are insufficient, using transfer learning to reduce the number of required training steps. The proposed method and baselines are evaluated in different network scenarios that comprehend combinations of different slice types, channel trajectories, number of active slices and users' equipment (UEs), and UE characteristics. The proposed method outperformed the baselines in protecting slices with higher priority, obtaining an improvement of 40% and, when considering all the slices, obtaining an improvement of 20% in relation to the baselines.