Cost Optimization of FlexEthernet Over Elastic Optical Network Fronthaul Design
Bibliographic record
Abstract
Without network slicing supports, traditional Fronthaul architectures struggle to meet the demanding requirements of 5G networks, such as the ultra-low latency and high bit rate specified by the enhanced common public radio interface (eCPRI). In this paper, we design a novel Fronthaul architecture that leverages FlexEthernet (FlexE) over elastic optical network (EON) to enable Fronthaul slicing meeting 5G Fronthaul requirements. Our Fronthaul design is optimized by an integer linear programming (ILP) model, named eFFP, that minimizes the total cost of ownership (TCO). While eFFP meets the strict Fronthaul requirements by provisioning network resources based on worst-case traffic load, it tends to overestimate required bit rate as a result of the inherent uncertainty and variability in real-world traffic. To tackle this challenge, we introduce uFFP, a stochastic Fronthaul provisioning strategy tailored to accommodate uncertain traffic demands and mitigate expenditure wastage. Relying on historical data, uFFP assesses statistical characteristics of traffic patterns to better estimate Fronthaul bit rate. Subsequently, we employ chance-constrained optimization to reformulate the uFFP problem, which is approximately solved using a convex relaxation approach known as uFFPA, and optimally solved using a deep reinforcement learning (DRL) approach called uFFPL. Simulation results demonstrate that our proposed solutions achieve significant cost savings, reducing TCO by 39.79% compared to the baseline.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".