A Performance Study of CPRI over Ethernet with IEEE 802.1Qbu and 802.1Qbv Enhancements
Bibliographic record
Abstract
There has been a debate on whether or not Ethernet, a highly cost effective technology, could meet the stringent latency and jitter requirements imposed by CPRI. To facilitate the discussion, we conducted simulations to understand how Ethernet performs when carrying CPRI traffic with the two Ethernet enhancements, currently being standardized by IEEE, namely frame preemption (802.1Qbu) and scheduled traffic (802.1Qbv). Our simulation results led to two conclusions: 1) Ethernet networks with or without frame preemption, regardless of being shared or dedicated to CPRI traffic, can not meet the CPRI jitter requirement of 8:138 ns, confirming a widely hold belief; 2) Ethernet with the enhancement of scheduled traffic in conjunction with a well defined scheduling algorithm could significantly lower or even completely remove jitter thus could meet CPRI jitter requirement. To the best of our knowledge, this paper is among the first to study the performance of Ethernet with IEEE 802.1Qbu and 802.1Qbv enhancements and to demonstrate by simulation that Ethernet with scheduled traffic could meet CPRI jitter requirement.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".