vChainNet: Accurate and Scalable End-to-End Slice Modeling for 5G and Beyond Networks
Bibliographic record
Abstract
The need for accurate and scalable modeling of 5G and beyond networks has recently emerged, driven by the reliance on virtual network functions (VNFs) and network slicing. Unfortunately, traditional network modeling approaches fail to capture 5G network behavior since they disregard the domainspecific challenges of modeling 5G networks. We propose vChainNet, the first end-to-end network modeling framework that provides accurate, scalable, and generalizable per-VNF and slice-level modeling for 5G and beyond networks. vChainNet introduces a modular, sequence-to-sequence deep learning architecture that models each VNF independently and composes the per-VNF models for end-to-end slice delay prediction. Our system design overcomes key domain-specific challenges in modeling 5G networks, including the functional variability of VNFs, VNFs' stochastic behavior, and the scale introduced by network densification. To address these challenges, vChainNet tunes a lightweight model composed of over$\mathbf{9 5 \%}$fewer parameters than state-of-the-art models, fuses domain-specific manually-engineered features with automatic feature extraction, and optimizes a distribution-based loss function during model training. Our results show that vChainNet achieves an accuracy improvement up to 10.86 % compared to state-of-the-art traditional network models, while providing a speedup of up to 53.33 times over common packet-level simulators. Furthermore, vChainNet's reliance on tuning a lightweight model allows it to generalize to unseen VNF types without extra hyperparameter tuning efforts. These results demonstrate the accuracy, scalability, and generalization ability of vChainNet for modeling 5G and beyond networks.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 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".