Energy‐efficient BBU pool virtualisation for C‐RAN with quality of service guarantees
Bibliographic record
Abstract
Cloud radio access network (C‐RAN) has been introduced as a promising network paradigm for improving the spectral and energy efficiency of next‐generation mobile systems. In C‐RAN, the computation resources of the centralised baseband units (BBUs) can be virtualised and dynamically shared among cells for energy‐efficient BBU pool utilisation. In this study, a BBU virtualisation scheme is proposed to minimise the total power consumption in the BBU pool subject to constraints on users’ quality of service in terms of real‐time requirements, individual fronthaul capacity and BBU capacity. As the BBU processing time and transmission delay for each user data can be compromised to meet the user's real‐time requirements while minimising the BBU power consumption, a priori user association phase is proposed and formulated as an optimisation problem to maximise the users’ transmission rate, and hence minimising their transmission delay. Then, the BBU processing allocation phase is formulated as a bin‐packing problem to minimise the overall power consumption in the BBU pool. Since this problem is combinatorial, a heuristic algorithm is proposed based on best‐fit‐decreasing algorithm to solve it. Extensive simulations show that the proposed scheme outperforms the comparable ones in terms of power consumption with reduction up to 33%.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 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".