Modern cellular networks adopt a software-based and disaggregated approach to support diverse requirements and mission-critical reliability needs. While softwarization introduces flexibility, it also increases the complexity of the network architectures, which calls for robust automation frameworks that can deliver efficient and fully-autonomous configuration, scalability, and multi-vendor integration. This paper presents AutoRAN, an automated, intent-driven framework for zero-touch provisioning of open, programmable cellular networks. Leveraging cloud-native principles, AutoRAN employs virtualization, declarative infrastructure-as-code templates, and disaggregated micro-services to abstract physical resources and protocol stacks. Its orchestration engine integrates Large Language Models (LLMs) to translate high-level intents into machine-readable configurations, enabling closed-loop control via telemetry-driven observability. Implemented on a multi-architecture OpenShift cluster with heterogeneous compute (x86/ARM CPUs, NVIDIA GPUs) and multi-vendor Radio Access Network (RAN) hardware (Foxconn, NI), AutoRAN automates deployment of O-RANcompliant stacks-including OpenAirInterface, NVIDIA ARC RAN, Open5GS core, and O-RAN Software Community (OSC) RIC components-using Continuous Integration and Continuous Delivery/Deployment (CI/CD) pipelines. Experimental results demonstrate that AutoRAN is capable of deploying an end-toend Private 5G network in less than 60 seconds with 1.6 Gbps throughput, validating its ability to streamline configuration, accelerate testing, and reduce manual intervention with similar performance than non cloud-based implementations. With its novel LLM-assisted intent translation mechanism, and performanceoptimized automation workflow for multi-vendor environments, AutoRAN has the potential of advancing the robustness of nextgeneration cellular supply chains through reproducible, intentbased provisioning across public and private deployments.

Although the integration between Unmanned Aerial Vehicles (UAVs) and Radio Access Network (RAN) applications is envisioned to enable a variety of new use cases and services, several practical aspects related to autonomous operations over cellular systems are still largely unexplored due to difficulties in testing and validating such integration in the real world. In this paper, we bridge the gap between simulation and real-world applications by introducing a new framework that combines real-world robotic controllers and 5th generation (5G) cellular stacks with channel and flight simulation. We consider a holistic approach where we use ArduPilot as the flight controller and OpenAirInterface (OAI) and srsRAN as the 5G cellular stacks to provide a unified solution for developing and experimenting with UAV s for cellular applications. We utilize ArduPilot Software-in-the-Loop (SITL) to simulate and control the mobility of UAVs, while OAI-RFSim and srsRAN are used to model channel conditions. Our framework is particularly useful for developing data-driven solutions that require (i) a large amount of data collected under realistic operational conditions to learn effective control policies; and (ii) a sandbox and safe testing environment that enables exploration of the action space. By addressing a UAV coverage problem and developing a greedy heuristic, we demonstrate how our framework can be used to create and test algorithms in a simulated environment, showcasing its potential as a bridge to real-world applications.

In 5G networks, physical resources can be virtualized and allocated to separate virtual networks (or network slices), with distinct requirements. The Virtual Network Embedding (VNE) problem consists in finding the optimal mapping of virtual resources (virtual links and nodes) onto a physical infrastructure. A recent trend consists in virtualizing 5G networks using Kubernates (K8s), a popular virtualization technology.In this paper we perform an experimental study to show the limit of using the standard K8s deployment strategy when dealing with dynamically arriving slices in a heavy loaded setting. By deploying the virtual components of a slice one by one, standard K8s is prone to wasting resources and energy due to partially deploying slices that, at the end, are found to be infeasible, due to lack of available resources. We propose an alternative K8s deployment strategy that first solves VNE via a Genetic Algorithm and then, for each slice, deploys either all its components or none. Our experimental results show a notable improvement in slice acceptance, energy efficiency and deployment time. Our work shows that it is necessary to adapt cloud native technologies to the specific requirements of telecommunication scenarios, as they are different from the cloud ones for which such technologies were originally developed.

Thanks to resource virtualization, Physical Network Operators (PNOs) can share their 5G network to multiple Mobile Virtual Network Operators (MVNOs) which can leverage the shared physical infrastructure to deploy their services up to the edge. This allows much more flexibility with respect to the previous generation of cellular networks: MVNO software components can be placed at different locations, can be allocated a certain amount of virtual resources (e.g., bandwidth, CPU cycles), and be reachable via different paths. To the best of our knowledge, strategies to minimize energy consumption while satisfying Service Level Agreements (SLAs) between the PNO and the MVNOs are still largely missing, particularly if it is required to take the nonlinearity of delays into account. To fill this gap, we formulate the problem of joint placement of software components, routing of user requests and resource dimensioning. SLAs are represented in terms of latency and reliability constraints. Via Column Generation, we obtain exact solutions in real-sized networks. Our numerical results show that we can save up to 50% energy in networks with up to 30 nodes compared to the state-of-the-art algorithms, which are focused on placement or resource minimization.

Energy consumption represents a major part of the operating expenses of mobile network operators. With the densification foreseen with 5G and beyond, energy optimization has become a problem of crucial importance. While energy optimization is widely studied in the literature, there are limited insights and algorithms for energy-saving techniques for Integrated Access and Backhaul (IAB), a self-backhauling architecture that ease deployment of dense cellular networks reducing the number of fiber drops. This paper proposes a novel optimization model for dynamic joint routing and energy optimization in IAB networks. We leverage the closed-loop control framework introduced by the Open Radio Access Network (O-RAN) architecture to minimize the number of active IAB nodes while maintaining a minimum capacity per User Equipment (UE). The proposed approach formulates the problem as a binary nonlinear program, which is transformed into an equivalent binary linear program and solved using the Gurobi solver. The approach is evaluated on a scenario built upon open data of two months of traffic collected by network operators in the city of Milan, Italy. Results show that the proposed optimization model reduces the RAN energy consumption by 47%, while guaranteeing a minimum capacity for each UE.

Network slicing in the upcoming Telecom generation is a fundamental feature which is deployed to satisfy the various demands in term of data rate and latency. On the other hand, it is seen as a topic that imposes other questions such as the coexistence of physical and virtual functions. In this context, we consider the resource management problem for 5G networks slicing since the solution searches to optimally allocate multiple Virtual Network Requests (VNRs) on a substrate virtualized physical network. In this demo, we present an integrated framework that uses an agile service platform (Kube5G) to deploy one of the VNE proposed solutions with zero-touch configuration. The aim of this integration is to validate the proposed solution and to practically study the performance differences among multiple algorithms that will be conducted later as well. The overview of the process is shown in steps as exposing the resources’ availability of the Physical Nodes (PN), which will be the input of the orchestration algorithm. Successively, the last takes the suitable decision to deploy VNRs on a substrate network, based on the VNRs’ demands such as CPU and radio resources and PNs’ availability. Afterwards, the decision will be sent to the platform to host the virtual nodes on the chosen physical machines. Bearing in mind that the essential objective of this algorithm is to achieve a better resource usage and increase the VNR acceptance ratio on the physical nodes with respect to the constraints that might affect the performance.

The 5G telecommunication ecosystem is expected to dynamically support new and various applications from the industrial and the service sectors that are very heterogeneous in terms of QoS and resources’ requirements. In this context, a promising important concept for network resource management is emerging, denoted by Network Slicing. It involves decisions on embedding and managing several virtual networks on the same physical resources. This problem in its simplified form can be modeled by the Virtual Network Embedding (VNE) problem. In this paper, we propose a new resolution method, in which we first reduce the set of admitted routes and then solve an integer program. Our proposed approach is then compared to the optimal solution and to a method from the state of the art. Obtained results show that our approach provides good result in terms of slice acceptance ratio and resource consumption while reducing the overall complexity and runtime.

In this paper, we consider the Virtual Network Embedding (VNE) problem for 5G networks slicing. This consists in optimally allocating multiple Virtual Networks (VN) on a substrate virtualized physical network while maximizing among others, resource utilization, maximum number of placed VNs and network operator's benefit. We solve the online version of the problem where slices arrive over time. We propose the use of the Nested Rollout Policy Adaptation (NRPA) algorithm, a variant of the well known Monte Carlo Tree Search (MCTS). Both algorithms learn by randomly simulating the embedding, but NRPA also learns how to perform better simulations over time. Performance analysis with different scenarios, show that NRPA improves acceptance and reward ratios (by up to 69% and 65%). We also show how a smart initialization of the learning process can help improve the results furthermore (up to a 12.5% increase of acceptance ratio).