Energy-Aware and Location-Constrained Virtual Network Embedding in Enterprise Network
Network virtualization can integrate the servers and computers from different locations in the large enterprises. Most of prior studies on the network virtualization execute on the cloud platform and they are not suit for the enterprise network. Therefore, the problem of the energy-aware and location-constrained virtual network embedding (EL-VNE) in the enterprise network is proposed and solved in this paper. Firstly, both the computing capability and bandwidth capability are unified by adopting the complex number theory and their corresponding capabilities of nodes, including physical and virtual nodes are determined. Then EL-VNE model is presented and proved to be a NP-complete problem, so as to make the virtual network embedding process only need node mapping without link mapping. Finally, a heuristic algorithm is presented to minimize the energy consumption on the condition of location constraint of nodes. The experiments show that the proposed EL-VNE can get less energy consumption compared with EAD, and simultaneously have better performance compared with GLC.
KeywordsEnergy aware Location constraint VNE Enterprise network
This work is partially supported by The National Natural Science Foundation of China (No. 61602227, 61702241); The Foundation of the Education Department of Liaoning Province (No. LJYL019); The Doctoral Starting up Foundation of Science Project of Liaoning Province (No. 201601365); National Key Research and Development Program of China(No. 2016QY01W0200); The Foundation of Liaoning Educational Committee (No. LJYL019).
- 9.Elijorde, F., Lee, J.: Attaining reliability and energy efficiency in cloud data centers through workload profiling and SLA-aware VM assignment. Int. J. Soft Comput. Appl. 7(1), 41–58 (2015)Google Scholar
- 15.Wang, M., Meng, X., Zhang, L.: Consolidating virtual machines with dynamic bandwidth demand in data centers. In: INFOCOM, 2011 Proceedings IEEE, pp. 71–75 (2011)Google Scholar
- 16.Garey, M.R., Johnson, D.S.: Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1990). 210, problem ND17Google Scholar
- 17.Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM, Proceedings IEEE, vol. 2, pp. 594–602. IEEE (1996)Google Scholar