A Framework for Joint Wireless Network Virtualization and Cloud Radio Access Networks for Next Generation Wireless Networks
Bibliographic record
Abstract
Wireless network virtualization (WNV) and cloud radio access networks (CRANs) are promising technologies with the potential to be game changing for the fifth generation (5G) wireless networks. In particular, these technologies may have significant impact on the capital expenditure, quality of service provisioning, as well as spectral efficiency in 5G networks. These two technologies are mostly considered separately in previous works. This paper, however, investigates both the gains and requirements of integrating WNV with CRAN. In this paper, we propose WNV schemes for CRAN, where the objective is to maximize the overall system throughput and minimize delay. The proposed schemes are designed to maintain a high level of isolation between mobile network operators (MNOs), which allows the deployment of different scheduling polices by different MNOs, and managing intercell interference, which may lead to significant throughput gain. Overall, the results presented in this paper reveal that a joint CRAN-WNV architecture can be highly efficient when MNOs have unbalanced loads, because MNOs with high loads can seamlessly access the underutilized resources of underloaded MNOs. The throughput gain in unbalanced loads can be as much as 50% using optimal sharing schemes when compared with static sharing, and about 18% when compared with the WNV without CRAN. The resource allocation problem in the joint CRAN-WNV is formulated, and both optimal and low complexity suboptimal solutions are derived. The obtained results show that integrating the two technologies in a joint architecture can significantly improve the network performance. However, reducing the complexity by adopting efficient sharing techniques may have tangible impact on the throughput when compared with optimal sharing.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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 source (direct Gemma or distilled Codex), 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".