Title :
Virtual network mapping algorithm with robustness in network virtualization
Author :
Huanyan Chen ; Guochu Shou ; Yihong Hu ; Zhigang Guo
Author_Institution :
Beijing Lab. of Network Syst. Archit. & Convergence, Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
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.
Keywords :
telecommunication network topology; virtualisation; VN mapping techniques; connected link resources; k-shortest-path algorithm; network virtualization; node mapping; node resources; substrate network topology; virtual network mapping algorithm; Algorithm design and analysis; Bandwidth; Robustness; Sensitivity; Simulation; Substrates; Virtualization; Network robustness; Network virtualization; Virtual network mapping;
Conference_Titel :
Network Infrastructure and Digital Content (IC-NIDC), 2012 3rd IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-2201-0
DOI :
10.1109/ICNIDC.2012.6418767
