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

2017 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    16
    References
    6
    Citations
    NaN
    KQI
    []