Packet Duplication for URLLC in 5G: Architectural Enhancements and Performance Analysis
Bibliographic record
Abstract
URLLC use cases demand a new paradigm in cellular networks to contend with the extreme requirements with complex trade-offs. In general, it is exceptionally challenging and, resource usage-wise, prohibitively expensive to satisfy the URLLC requirements using the existing approaches in LTE. To address these challenges 3GPP has recently agreed to adopt PD of both UP and CP packets as a fundamental technique in 5G NR. This article investigates the theoretic framework behind PD and provides a primer on the recent enhancements applied in the NR RAN architecture for supporting URLLC. It is shown that PD enables jointly satisfying the latency and reliability requirements without increasing the complexity in the RAN. With dynamic control capability, PD can be used not only for URLLC but also to increase the transmission robustness during mobility and against radio link failures. The article also provides numerical results comparing the performance of PD in various deployment scenarios. The numerical results reveal that in certain scenarios, performing PD over multiple links results in lower usage of radio resources than using a single highly reliable link. It is also found that to improve radio resource utilization while satisfying URLLC requirements, enabling PD in scenarios such as cell edge is crucial where the average SNR of the best (primary) link and the variation in SNR between all accessible links is typically low. In essence, the PD technique provides a cost-effective solution for satisfying the URLLC requirements without requiring major modifications to the RAN deployments.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".