Cost-Aware VNF Decomposition for VNF Forwarding Graph Embedding
Bibliographic record
Abstract
To implement a Network Service (NS) within a Network Function Virtualization (NFV) environment, it is essential to create a sequence of connected Virtual Network Functions (VNFs), known as a VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. The emergence of VNF decomposition as a new functional architecture allows VNFs to be broken down into smaller sub-functions, offering enhanced flexibility, resource sharing, and scalability. VNF decomposition can significantly reduce VNF embedding costs since different sub-functions can be efficiently reused by multiple network requests. However, when VNFs are decomposed into multiple sub-functions, selecting the appropriate decomposition option for each VNF and constructing the VNF-FG to embed onto the substrate network poses a significant challenge in NFV resource allocation (NFV-RA). A key challenge is identifying the optimal decomposition option among all possible choices for VNF embedding. In this paper, we introduce a cost-aware algorithm designed to address the topological decomposition of VNF-FGs, focusing on minimizing embedding costs while meeting specified service requirements. We formulate the VNF topology decomposition problem using Integer Linear Programming (ILP) to select the best decomposition option and minimize the embedding cost. Furthermore, we propose four efficient heuristics for different topologies to identify the optimal decomposition options for network embedding. Simulation results demonstrate that our proposed algorithm outperforms existing benchmarks in terms of embedding costs and achieves execution times that are up to 95% better than the SE approach.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".