Service Function Chain Reconfiguration in 5G Core Networks Using Deep Learning
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Software-defined networking (SDN) and network functions virtualization (NFV) enable service providers to accommodate diversified service requests in the fifth generation (5G) core networks. Given the time-varying traffic demand of the service requests, it is crucial for service providers to embed the service function chains (SFCs) of the service requests in the network to support load balancing, and to minimize the reconfiguration overhead due to virtual network functions (VNFs) migration while satisfying their quality of service (QoS) requirements. In this paper, we study a delay-aware VNF migration problem for embedding SFCs in a network with limited processing resource capacity for NFV-enabled nodes. We formulate it as a mixed-integer nonlinear optimization problem. We decompose this problem into two subproblems for stateful VNF mapping and allocation of processing resources, where the second subproblem is a convex optimization problem. To solve the first subproblem, we propose an algorithm based on deep neural network (DNN) with attention mechanism for learning the stochastic policy of a near-optimal VNF mapping. Simulation results show that our proposed algorithm provides a solution which is very close to the optimal solution obtained by solving a mixed-integer quadratically constrained programming problem.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it