Traffic Digital Twin-Enabled Orchestration and Scheduling in O-RAN: A Multi-Timescale Joint Optimization Approach

Yinlin Ren, Longyu Zhou, Shaoyong Guo, Xuesong Qiu, Tony Q. S. Quek

Abstract: Open Radio Access Network (O-RAN) supports heterogeneous service coexistence through functional splitting and open interfaces, enabling traffic steering via functional orchestration and resource scheduling. However, existing studies focus on known traffic patterns and lack the ability to anticipate dynamic service demands in advance. Isolated optimization of orchestration and scheduling fails to ensure End-to-End (E2E) latency. The varying time scales and vast solution space further complicate the joint optimization. To address this, we propose a traffic twin-enabled orchestration and scheduling multi-timescale joint optimization scheme. Explicitly, we design a spatiotemporal attention-assisted Time Series Generative Adversarial Network (TimeGAN) traffic twin model (STAG-TD) to capture unknown traffic patterns. Based on twin results, we formulate a joint optimization problem and design a dual-timescale algorithm framework, including propose a Task Decomposed Dueling Double Deep Q-Network (TD3QN) algorithm to handle large-timescale orchestration, and use a Penalty-based Particle Swarm Optimization (PPSO) algorithm to manage small-timescale scheduling. Our scheme achieves a predictive joint optimization to reduce the transmission latency of services. Extensive results show our scheme outperforms state-of-the-art methods, reducing E2E latency by over 39% and increasing throughput by over 14.9%. The highly consistent results between real and twin data also demonstrate the effectiveness of the traffic twin model.

External IDs:doi:10.1109/tmc.2025.3622895