Journal on Communications ›› 2015, Vol. 36 ›› Issue (7): 109-119.doi: 10.11959/j.issn.1000-436x.2015177

• Academic paper • Previous Articles     Next Articles

Reliable heuristic mapping method for survivable virtual network

Qiang ZHU,Hui-qiang WANG,Chun-guang MA,Guang-sheng FENG,Hong-wu LV   

  1. College of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China
  • Online:2015-07-25 Published:2015-07-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Research Foundation for the Doctoral Program of Higher Education of China;The Natural Science Foundation of Heilongjiang Province;The Fundamental Research Funds for the Central Universities;The Fundamental Research Funds for the Central Universities

Abstract:

For reliable virtual network mapping problem,virtual network survivability constraints are introduced to ensure that the rest of the mapped virtual network remains connected under a single node failure condition in the substrate network,which makes sure the completeness of the virtual network and continuity of services.In order to reduce cost of the substrate network,the reliable heuristic mapping problem is considered as an integer linear programming model and a reliable heuristic mapping method for survivable virtual network is proposed to solve the problem.The simulation results show that average usage of links is reduced and the success rate,average revenue of mapping,recovery success rate of virtual network are increased compared with the existing reliable mapping algorithms.

Key words: cloud computing, survivable virtual network, network virtualization embedding, integer linear programming, colony optimization algorithm

No Suggested Reading articles found!