MétaCan
Menu
Back to cohort
Record W3018217961 · doi:10.1109/mwc.001.2000010

A Hierarchical Soft RAN Slicing Framework for Differentiated Service Provisioning

2020· article· en· W3018217961 on OpenAlex
Junling Li, Weisen Shi, Peng Yang, Qiang Ye, Xuemin Shen, Xu Li, Jaya Rao

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Wireless Communications · 2020
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsHuawei Technologies (Canada)University of Waterloo
Fundersnot available
KeywordsComputer scienceSlicingProvisioningComputer networkQuality of serviceDistributed computingKey (lock)Shared resourceService (business)Computer security

Abstract

fetched live from OpenAlex

Network slicing is a key technology to allow resource sharing among heterogeneous operators/ services, which achieves QoS isolation for service provisioning in future communication networks. In this article, a comprehensive hierarchical soft-slicing framework is proposed to enable software-defined radio access networks supporting differentiated services with diverse QoS requirements. The proposed framework consists of network-level slicing and gNodeB-level slicing. In the network level, radio RBs are pre-allocated to each gNodeB in a large time scale, while in the gNodeB level, the pre-allocated RBs are dynamically scheduled to the services in response to the small time scale (mini-slot-level) RB request variations. The proposed framework allows the accommodation of time-varying traffic loads of differentiated services over multiple gNodeBs, while enabling dynamic inter-gNodeB RB sharing to increase the resource multiplexing gain. A case study is presented to demonstrate the effectiveness of the proposed framework, followed by a discussion on open research issues.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.977
Threshold uncertainty score0.747

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0030.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.061
GPT teacher head0.297
Teacher spread0.237 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it