Reshma Prasad

The evolution toward open, programmable O-RAN and AI-RAN 6G networks creates unprecedented opportunities for Intent-Based Networking (IBN) to dynamically optimize RAN[...]. However, applying IBN effectively to the RAN scheduler [...] remains a significant challenge. Current approaches predominantly rely on coarse-grained network slicing, lacking the granularity for dynamic adaptation to individual user conditions and traffic patterns. Despite the existence of a vast body of scheduling algorithms [...], their practical utilization is hindered by implementation heterogeneity, insufficient systematic evaluation in production environments, and the complexity of developing high-performance scheduler implementations.[...] To address these limitations, we propose ALLSTaR (Automated LLm-driven Scheduler generation and Testing for intent-based RAN), a novel framework leveraging LLMs for automated, intent-driven scheduler design, implementation, and evaluation. ALLSTaR interprets NL intents, automatically generates functional scheduler code from the research literature using OCR and LLMs, and intelligently matches operator intents to the most suitable scheduler(s). Our implementation deploys these schedulers as O-RAN dApps, enabling on-the-fly deployment and testing on a production-grade, 5G-compliant testbed. This approach has enabled the largest-scale OTA experimental comparison of 18 scheduling algorithms automatically synthesized from the academic literature. The resulting performance profiles serve as the input for our Intent-Based Scheduling (IBS) framework, which dynamically selects and deploys appropriate schedulers that optimally satisfy operator intents. We validate our approach through multiple use cases unattainable with current slicing-based optimization techniques, demonstrating fine-grained control based on buffer status, physical layer conditions, and heterogeneous traffic types

Network slicing is a 5G paradigm that enables the creation of on-demand logical networks over shared physical infrastructure. In this paper, we present a framework that allows users to make advance slice reservations with the End-to-End Orchestrator (EEO). Our reservation mechanism enables the EEO to make admission decisions instantly upon request arrival, providing guarantees as to when the request can be enabled. We then proceed to address a relevant revenue maximization problem through an optimal solution, which has factorial time complexity. We also propose a low-complexity algorithm that can efficiently allocate resources for the online version of the problem. We conduct evaluations that demonstrate how the reservation mechanism can potentially improve EEO’s revenue. Additionally, we conduct a study on scenarios where the arrival rates of slice requests exhibit a positive correlation with reservation discounts provided by EEO.