Converging Towards Open Radio Access Networks – A Comprehensive Review
Bibliographic record
Abstract
Radio Access Networks (RAN) have been an integral part of the cellular mobile communication systems since the deployment of Global System for Mobile Communication (GSM) networks and later for the legacy Universal Mobile Telecommunication Systems (UMTS) and Long Term Evolution (LTE) networks. However, due to increasing demands of the users, throughput, ultra-lower latency, virtualization of the network and to cater the seamless connectivity of millions of wireless devices with the cellular networks, the advent of RAN needs to be brought under consideration. In this paper the traditional RANs are discussed with the necessity for their transition into the Open RAN (ORAN), considering all its essential parameters. The constraints of the legacy RAN architectures are explored with an overview of the RAN intelligent controllers, ORAN and its types. This paper additionally examines the function of artificial intelligence in Common Public Radio Interface (CPRI), enhanched CPRI, and xApps in terms of use cases along with the challenges associated with their deployment. The paper also present challenges and future of ORAN.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".