Packet duplication for URLLC in 5G dual connectivity architecture
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.
Bibliographic record
Abstract
This paper addresses the problem of satisfying the extreme requirements related to Ultra-Reliable Low Latency Communications (URLLC) in 5G Radio Access Network (RAN). Complementary to the existing Physical (PHY) layer techniques, this paper focuses primarily on higher layer solutions, particularly, on Packet Duplication (PD) as a practical and low complexity technique for URLLC. The theoretic framework behind PD is investigated and the recent enhancements made in the 5G Dual Connectivity (DC) architecture for supporting PD are discussed. For improving the radio resource utilization and to dynamically control the activation of PD, an optimization problem subject to URLLC constraints is formulated and solved heuristically to give the resource configuration in terms of MCS and PRB allocation over multiple links. Following this, it is shown numerically that performing PD in various deployment scenarios results in better utilization of radio resources compared to using a single highly reliable link while effectively satisfying the URLLC requirements.
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 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.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 it