A heuristic survivable virtual network mapping algorithm
- 111 Downloads
Network virtualization is a promising solution to attack Internet ossification. Virtual network mapping (or embedding) problem is the core of it and is proved to be NP-hard. In this paper, virtual network mapping problem with survivability is formulated and solved with a heuristic algorithm. Firstly, network link resources are divided into primary flow resources and secondary flow resources. The former are used under normal network operation, whereas the latter are used as backup resources once the networks fail. Secondly, we introduce a novel metric named global resource capacity (GRC) which is recently proposed for measuring node mapping capacity to improve network load balance. At last, a heuristic survivable virtual network embedding algorithm (GRC-SVNE) is proposed. In node mapping phase, we calculate the mapping capacity of all nodes and then some nodes are selected as candidate nodes for virtual network embedding and the goal is to improve mapping successful ratio. After that, link mapping is performed with Dijkstra algorithm. Simulation results show that GRC-SVNE outperforms the traditional greedy algorithm (GREEDY), randomized algorithm (R-ViNE) as well as deterministic algorithm (D-ViNE) and demonstrates desirable results in terms of acceptance ratio, network load balance and network revenue.
KeywordsHeuristic algorithm Network failure Survivability Load balance
This study was funded by the National Natural Science Foundation of China (61373149, 61672329) and Shandong Provincial Natural Science Foundation for Young Scholars of China (Grant No. ZR2017QF008).
Compliance with ethical standards
Conflict of interest
There is no conflict of interest.
Human participants or animals
This article does not contain any studies with human participants or animals performed by any of the authors.
- Butt NF, Chowdhury M, Boutaba R (2010) Topology-awareness and reoptimization mechanism for virtual network embedding. International conference on research in networking. Springer, Berlin, Heidelberg, pp 27–39Google Scholar
- Fajjari I, Aitsaadi N, Pujolle G (2011) Vnr algorithm: a greedy approach for virtual networks reconfigurations. In: Global Telecommunications Conference (GLOBECOM 2011). IEEE, pp 1–6Google Scholar
- Gong L, Wen Y, Zhu Z (2014) Toward profit-seeking virtual network embedding algorithm via global resource capacity. In: Proceedings of the 2014 INFOCOM. IEEE, pp 1–9Google Scholar
- Hu Q, Wang Y, Cao X (2013) Resolve the virtual network embedding problem: a column generation approach. In: Proceedings of the 2013 INFOCOM. IEEE, pp 410–414Google Scholar
- Lischka J, Karl H (2009) A virtual network mapping algorithm based on subgraph isomorphism detection. In: Proceedings of the ACM workshop on virtualized infrastructure systems and architectures. ACM, pp 81–88Google Scholar
- Luo J, Chen L, Li RF (2012) A heuristic resource allocation algorithm for virtual network embedding. Sci Sin Inf 42(8):960–973Google Scholar
- Qiao C, Guo B, Huang S (2011) A novel two-step approach to surviving facility failures. In: Proceedings of optical fiber communication conference and exposition (OFC/NFOEC), pp 1–3Google Scholar
- Rahman MR, Aib I, Boutaba R (2010) Survivable virtual network embedding. Networking 6091:40–52Google Scholar
- Soualah O, Fajjari I, Aitsaadi N (2014) A reliable virtual network embedding algorithm based on game theory within cloud’s backbone. In: IEEE international conference on communications, pp 2975–2981Google Scholar
- Zheng XW, Liu H, Wang XG (2013) A virtual network embedding algorithm incorporating biogeography based optimization. In: Proceedings of the joint international conference on pervasive computing and the networked world. Springer, Cham, pp 810–818Google Scholar
- Zhu Y, Ammar MH (2006) Algorithms for assigning substrate network resources to virtual network components. In: Proceedings of the 2006 INFOCOM, vol 1200. IEEE, pp 1–12Google Scholar