JOURNAL ARTICLE

Greedy randomized path-ranking virtual optical network embedding onto EON-based substrate networks

Abstract

Optical Network Virtualization has gained attention in recent years mainly from industry due to its direct application to Optical Data Centers. One of the main challenges involved in optical virtualization deals with the efficient mapping of virtual resources onto physical resources, specially when considering the intrinsic constraints of the elastic optical layer based on O-OFDM such as optical spectrum continuity and contiguity. In this paper, we propose a greedy randomized heuristic algorithm based on Path-Ranking on the link mapping stage, aiming to improve the acceptance ratio in terms of allocated Virtual Optical Networks. In order to evaluate our proposal, we implement a baseline algorithm frequently used in virtual network embedding problems. Results shown that our mapping approach outperforms the baseline algorithm in terms of blocking probability and load balancing.

Keywords:
Computer science Virtualization Network virtualization Greedy algorithm Contiguity Ranking (information retrieval) Distributed computing Heuristic Computer network Path (computing) Baseline (sea) Blocking (statistics) Algorithm Artificial intelligence Cloud computing

Metrics

11
Cited By
1.42
FWCI (Field Weighted Citation Impact)
19
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Software-Defined Networks and 5G
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Optical Network Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Advanced Photonic Communication Systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.