Priority-Based Search for the Virtual Network Embedding Problem Article Swipe
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.1609/icaps.v33i1.27227
The Virtual Network Embedding (VNE) problem is a constrained optimization problem. It arises in the context of allocating resources on heterogeneous physical networks to provide end-to-end computing services. In this paper, we introduce a new solver, called VNE-PBS, that uses priority-based search (PBS) for solving the VNE problem. VNE-PBS uses a prioritized heuristic search algorithm that explores the space of all possible priority orderings using a systematic depth-first search. The solver is inspired by the success of PBS for the Multi-Agent Path Finding (MAPF) problem and the similarities between the VNE and MAPF problems. We show that VNE-PBS significantly outperforms competing methods on various benchmark instances for both the offline and online versions of the VNE problem.
Related Topics To Compare & Contrast
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1609/icaps.v33i1.27227
- https://ojs.aaai.org/index.php/ICAPS/article/download/27227/27000
- OA Status
- diamond
- Cited By
- 1
- References
- 24
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4382890541