An Enhanced Exploration GRASP-Based Algorithm for Virtual Network Embedding

With the rise of distributed clouds and Virtualized functions, Virtual Network Embedding (VNE) has become a key challenge in enabling network slicing. Several approaches exist in the literature to tackle such a problem; some of them (e.g., heuristics) converge quickly to a local minimum, while others are not explainable and, therefore, do not provide the necessary guarantees for their deployment in a real network (e.g., artificial intelligence-based techniques). In this paper, we propose an enhanced GRASP-based algorithm that efficiently explores the solution space using a broader candidate selection and deeper local search. The simulation results show the potential of the proposed method for solving services’ placement problems and its superiority over some heuristics in terms of placement success rate and the Revenue to the Cost (R/C) metric.

Institutions

Publication Details

Published
2025-10-27
DOI
https://doi.org/10.1109/isncc66965.2025.11250437
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Enhanced Exploration GRASP-Based Algorithm for Virtual Network Embedding

Software-Defined Networks and 5G
article

An Enhanced Exploration GRASP-Based Algorithm for Virtual Network Embedding

article en

Abstract

With the rise of distributed clouds and Virtualized functions, Virtual Network Embedding (VNE) has become a key challenge in enabling network slicing. Several approaches exist in the literature to tackle such a problem; some of them (e.g., heuristics) converge quickly to a local minimum, while others are not explainable and, therefore, do not provide the necessary guarantees for their deployment in a real network (e.g., artificial intelligence-based techniques). In this paper, we propose an enhanced GRASP-based algorithm that efficiently explores the solution space using a broader candidate selection and deeper local search. The simulation results show the potential of the proposed method for solving services’ placement problems and its superiority over some heuristics in terms of placement success rate and the Revenue to the Cost (R/C) metric.

Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Institut de Recherche en Informatique et Systèmes Aléatoires (FR), Université de Rennes (FR)
Openalex Percentile: Top 40%
Software-Defined Networks and 5G
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.