Virtual network mapping algorithm with robustness in network virtualization
Huanyan Chen, Guochu Shou, Yihong Hu, Zhigang Guo · 2012
As a key technology for realizing future networks (FNs), network virtualization has attracted worldwide attention. However, how to construct a suitable virtual network (VN) requires effective techniques for VN mapping. In this paper, we present a new VN mapping algorithm that can guarantee the network robustness. It uses both node resources and connected link resources as the metric of available node resources in node mapping. It chooses link betweenness sensitivity as the cost of a link when using k-shortest-path algorithm in link mapping. Our simulation results show that the proposed algorithm guarantees the network robustness while increasing the acceptance ratio.