Efficient Virtual Network Embedding with Node Ranking and Intelligent Link Mapping
Bibliographic record
Abstract
Network virtualization (NV) is emerged as a key enabler for the success of the future virtualized networks (e.g. 5G networks and smart Internet of Things (IoT)). Virtual Network Embedding (VNE) that addresses the embedding problems of heterogeneous virtual networks (VNs) onto a physical infrastructure is a main challenge in NV. Network topology attributes and network resource-considered (NTANRC) algorithm is a virtual node mapping mechanism that considers essential network features and global network resources for ranking both substrate and virtual nodes prior to embedding each given virtual network request (VNR). In this paper, we propose NTANRC combined with a distributed parallel Genetic Algorithm (GA) for virtual link mapping, namely NTANRC-GA, to solve online VNE problem. Extensive evaluation results show that our proposed solution not only achieves better performance compared to state-of-the-art VNE algorithms, but also challenges the rapid speed of shortest path (SP) method. NTANRC algorithm and the parallel GA-based algorithm are reverse compliments of each other to achieve an efficient VNE solution.
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.000 | 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".