DeepViNE: Virtual Network Embedding with Deep Reinforcement Learning
Bibliographic record
Abstract
Virtual Network Embedding (VNE) is a crucial problem in network virtualization. Prior work on VNE is mainly focused on optimization-based solutions that are carefully constructed and tuned under specific assumptions about resource demands brought by virtual networks. Recently, a few works have appeared on automating the design of VNE solutions that work well under general virtual resource demands using Deep Reinforcement Learning (DRL). These works, however, still rely on manual selection of relevant problem features required in the DRL approach. In this work, we develop a DRL-based VNE solution called DeepViNE, which automates the selection of problem features required in the DRL approach. The key idea is to encode physical and virtual networks as two-dimensional images, which are then perceivable by a convolutional deep neural network. To speed up learning and algorithm convergence, we also design a strategy to limit the number of actions required by the learning agent, while still allowing suitable exploration of the solution space. We evaluate the convergence and performance of DeepViNE using simulations, and compare it with several existing algorithms. The results show that DeepViNE learns an embedding policy that improves upon the performance of other simulated algorithms by at least 11%.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".