Multi-Variate Time Series Prediction of Traffic and Users for Dynamic RRH-BBU Mapping in C-RAN
Bibliographic record
Abstract
Cellular operators face significant challenges in cutting operating expenses while maintaining the quality of service (QoS) for users due to growing network traffic and dynamic user connections. These challenges are addressed by the cloud radio access network (C-RAN) architecture, which includes a centralized pool of baseband units (BBUs) and distributes them from remote radio heads (RRHs). The key to improving C-RAN performance is to dynamically allocate large-scale RRHs to different BBUs in real time. In this paper, we propose a user behavior-aware RRH-BBU mapping framework to improve the performance of large-scale C-RANs by predicting RRH traffic and users in advance. First, we propose a Multivariate RRH time series Prediction Model (MRPM) that captures the spatio-temporal patterns in the data to predict the traffic volume and the number of users of RRHs, which represents key indicators of RRH connection states. Second, we formulate the RRH-BBU mapping as a Markov decision process problem to optimize cost and QoS by considering BBU utilization, BBU energy consumption, RRH migration frequency, and BBU load balancing. Third, we propose a prediction-based RRH-BBU mapping scheme (PB-RBM) to find the optimal RRH-BBU mapping strategy by leveraging the prediction information of MRPM. In the PB-RBM algorithm, we employ an A3C algorithm to learn the mapping policy and group the RRHs based on a defined popularity metric to reduce the state and action space of the reinforcement learning algorithm. Finally, extensive experiments are conducted on a real-world dataset, and our algorithm is compared with several matching algorithms, such as ACKTR, heuristic, etc., to demonstrate its superiority, especially reducing 17.5% in RMSE compared to the best-performing baseline.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".