A New Realistic Platform for Benchmarking and Performance Evaluation of DRL-Driven and Reconfigurable SFC Provisioning Solutions
Bibliographic record
Abstract
Service Function Chain (SFC) provisioning stands as a pivotal technology in the realm of 5G and future networks. Its essence lies in orchestrating VNFs (Virtual Network Functions) in a specified sequence for different types of SFC requests. Efficient SFC provisioning requires fast, reliable, and automatic VNFs’ placements, especially in a network where massive amounts of SFC requests are generated having ultrareliable and low latency communication (URLLC) requirements. Although much research has been done in this area, including Artificial Intelligence (AI) and Machine Learning (ML)-based solutions, this work presents an advanced Deep Reinforcement Learning (DRL)-based simulation model for SFC provisioning that illustrates a realistic environment. The proposed simulation platform can handle massive heterogeneous SFC requests having different characteristics in terms of VNFs chain, bandwidth, and latency constraints. Also, the model is flexible to apply to networks having different configurations in terms of the number of data centers (DCs), logical connections among DCs, and service demands. The simulation model components and the workflow of processing VNFs in the SFC requests are described in detail. Numerical results demonstrate that using this simulation setup and proposed algorithm, a realistic SFC provisioning can be achieved with an optimal SFC acceptance ratio while minimizing the E2E latency and resource consumption.
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.002 |
| 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.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.004 | 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".