Computer Science

Computer Science ›› 2020, Vol. 47 ›› Issue (9): 270-274.doi: 10.11896/jsjkx.190700162

• Computer Network • Previous Articles     Next Articles

Energy Efficient Virtual Network Mapping Algorithms Based on Node Topology Awareness

ZHU Guo-hui, ZHANG Yin, LIU Xiu-xia, SUN Tian-ao   

  1. School of Communications and Information Engineering,Xi’an University of Posts & Telecommunications,Xi’an 710121,China
  • Received:2019-07-23 Published:2020-09-10
  • About author:ZHU Guo-hui,born in 1969,Ph.D,associate professor,postgraduate supervisor.His main research interests include the next generation mobile Internet,network survivability,and complex network routing algorithm.
    ZHANG Yin,born in 1995,postgra-duate.Her main research interests include energy-efficient virtual network mapping,and network virtualization.
  • Supported by:
    National Natural Science Foundation of China (61371087).

PDF (PC)

755

Abstract: Aiming at the problem of over-saturation of existing network resources,this paper proposes an efficient and energy-saving virtual network mapping algorithm based on node topology awareness.In the node mapping stage,the proposed algorithm quantifies the cost of node mapping and considers the topological attributes.It evaluates the candidate physical nodes of each virtual node through the improved node sorting algorithm,and calculates the best mapping nodes.In the link mapping stage,the Dijkstra algorithm is used to redefine the link by considering the maximum link residual bandwidth resources,the maximum path node residual resources and hops.In order to achieve the goal of energy-saving and high efficiency,the ranking value is used to obtain the effective link with the lowest energy cost.The simulation results show that the proposed sorting method can effectively reduce the energy cost and significantly improve the parameters such as request acceptance rate and revenue-cost ratio of virtual networks.

Key words: Energy efficient, Network virtualization, Node ranking, Topology-aware, Virtual network embedding

CLC Number: 

  • TP393
[1] FISHER W,SUCHARA M,REXFORD J.Greening Backbone Networks:Reducing Energy Consumption by Shutting Off Cables in Bundled Links[C]//Acm Sigcomm Workshop on Green Networking.DBLP,2010:29-34.
[2] ABU SHARKH M,JAMMAL M,SHAMI A,et al.Resource allocation in a network-based cloud computing environment:design challenges[J].IEEE Communications Magazine,2013,51(11):46-52.
[3] DRUTSKOY D,KELLER E,REXFORD J.Scalable networkvirtualization in software-defined networks[J].IEEE Internet Computing,2013,17(2):20-27.
[4] FISCHER A,BOTERO J F,BECK M T,et al.Virtual Network Embedding:A Survey[J].IEEE Communications Surveys & Tutorials,2013,15(4):1888-1906.
[5] LIRA V,TAVARES E,OLIVEIRA M,et al.Virtual network mapping considering energy consumption and availability[J].Computing,2018(2):1-31.
[6] HAERI S,TRAJKOVIC L.Virtual Network Embedding viaMonte Carlo Tree Search[J].IEEE Transactions on Cyberne-tics,2017,28(2):1-12.
[7] AMALDI E,CONIGLIO S,et al.On the computational com-plexity of the virtual network embedding problem[J].ElectronicNotes in Discrete Mathematics,2016,52:213-220.
[8] YU M,YI Y,REXFORD J,et al.Rethinking virtual networkembedding:substrate support for path splitting and migration[J].Acm Sigcomm Computer Communication Review,2008,38(2):17-29.
[9] JIA S,JIANG G,HE P,et al.Efficient algorithm for energy-aware virtual network embedding[J].Tsinghua Science & Technology,2016,21(4):407-414.
[10] GONG S,CHEN J,YIN X,et al.Energy-efficient virtual network embedding for heterogeneous networks[C]//IEEE International Conference on Computer Communication & the Internet.2016:85-90.
[11] CHENG X,SU S,ZHANG Z,et al.Virtual network embedding through topology-aware node ranking[J].ACM SIGCOMM Computer Communication Review,2011,41(2):38-47.
[12] PENG L M.Virtual network mapping algorithm based on bread-first search[J].Journal of Sichuan University,2015,47(2):117-122.
[13] XU P,LIU X,CAO H,et al.An efficient energy aware virtual network migration based on genetic algorithm[J].Frontiers of Computer Science,2019(2):440-442.
[14] WANG D,ZHANG W,HE H,et al.Node-Fusion:Topology-aware virtual network embedding algorithm for repeatable virtual network mapping over substrate nodes[J].Concurrency and Computation:Practice and Experience,2018,10:102-113.
[15] ZHANG Z,SU S,ZHANG J,et al.Energy aware virtual net-work embedding with dynamic demands:online and offline[J].Computer Networks,2015,93(24):448-459.
[16] CHEN X,LI C,JIANG Y.Optimization Model and Algorithm for Energy Efficient Virtual Node Embedding[J].IEEE Communications Letters,2015,19(8):1327-1330.
[17] ZHAO Z Y,MENG X R,SU Y Z,et al.Virtual Network Mapping Algorithms Based on Node Proximity Perception and Route Comprehensive Evaluation[J].Journal of Electronic and Information Science,2017,39(8):1979-1985.
[18] BOTERO J F,HESSELBACH X,DUELLI M,et al.Energy Efficient Virtual Network Embedding[J].IEEE Communications Letters,2012,16(5):756-759.
[19] XIANG C,SU S,ZHANG Z,et al.Virtual network embedding through topology-aware node ranking[J].Acm Sigcomm Computer Communication Review,2011,41(2):38-47.
[20] CAO H,YANG L,ZHU H.Embedding virtual networks using a novel node-ranking approach via exploiting topology attributes and global network resources[C]//2017 9th International Conference on Wireless Communications and Signal Processing (WCSP).IEEE,2017:1-6.
[21] BARROSO L A,CLIDARAS J,HOLZLE U.The Data center as A Computer:An Introduction to the Design of Warehouse-scale Machines[M].San Rafael,CA,USA,Morgan & Claypool Publishers,2013:1-154.
[22] JIA S,JIANG G,HE P,et al.Efficient algorithm for energy-aware virtual network embedding[J].Tsinghua Science & Technology,2016,21(4):407-414.
[1] SHI Chao-wei, MENG Xiang-ru, MA Zhi-qiang, HAN Xiao-yang. Virtual Network Embedding Algorithm Based on Topology Comprehensive Evaluation and Weight Adaptation [J]. Computer Science, 2020, 47(7): 236-242.
[2] GENG Hai-jun, ZHANG Wen-xiang, YIN Xia. Intra-domain Energy Efficient Routing Algorithm Based on Algebraic Connectivity [J]. Computer Science, 2020, 47(4): 238-242.
[3] LI Zhen-tao, MENG Xiang-ru , ZHAO Zhi-yuan, SU Yu-ze. Virtual Network Reconfiguration Algorithm for Nodes Load Balancing [J]. Computer Science, 2018, 45(7): 95-98.
[4] WU Guo, FANG Li-guo and XU Xiao-hui. Node Reusable Virtual Network Embedding Algorithm Based on Network Shrinking [J]. Computer Science, 2017, 44(6): 91-93.
[5] MA Chen-ming, WANG Wan-liang and HONG Zhen. Improved Energy Efficient Data Gathering Protocol in Wireless Sensor Network [J]. Computer Science, 2015, 42(2): 65-69.
[6] GUO He-bin. Virtual Network Mapping Optimization Algorithm Based on Virtual Network Node Migration [J]. Computer Science, 2014, 41(Z11): 224-227.
[7] CAO Jie and ZENG Guo-sun. Scheduling Method for Parallel Task of Dynamic Energy-aware of Computing Resources in Cloud Environment [J]. Computer Science, 2013, 40(10): 39-44.
[8] . Analysis Model for the Efficient of the TDMA MAC for Wireless Sensor Network [J]. Computer Science, 2012, 39(Z6): 151-153.
[9] YIN Dong, MU De-jun ,DAI Guan-zhong. Optimized User Mode Virtual Router [J]. Computer Science, 2011, 38(8): 38-41.
[10] YANG Bing,LI Guo-hui,XU Hua-Jie,DU Jian-qiang. Candidate-based Cluster Routing Protocol in WSN [J]. Computer Science, 2010, 37(11): 50-54.
[11] CHENG Lu, CHENG Geng-min. Distributed Weight-clustering Algorithm in Wireless Sensor Networks [J]. Computer Science, 2009, 36(9): 59-62.
[12] HAO Ju-tao,ZHAO Jing-jing,LI Ming-lu. Energy Level and Link State-based AODV Route Request Forwarding Scheme Study [J]. Computer Science, 2009, 36(7): 68-70.
[13] LI Xiao-ya Huang Dao-ping SUN Zong-hai （Automation College of Science and Technology, South China University of Technology, Guangzhou 510640, China）. [J]. Computer Science, 2008, 35(5): 60-63.
[14] . [J]. Computer Science, 2008, 35(11): 8-12.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.