虚拟网络可生存的启发式可靠映射算法  

Reliable heuristic mapping method for survivable virtual network

作　　者：朱强[1] 王慧强[1] 马春光[1] 冯光升[1] 吕宏武[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《通信学报》2015年第7期109-119,共11页Journal on Communications

基　　金：国家自然科学基金资助项目(61370212;61402127);教育部博士点优先发展基金资助项目(20122304130002);黑龙江省自然科学重点基金资助项目(ZD201102);中央高校基本科研业务费专项基金资助项目(HEUCF100601;HEUCFZ1213)~~

摘　　要：针对虚拟网络可靠映射问题,引入虚拟网络可生存约束条件,确保在底层网络单节点失效情况下,被映射虚拟网络剩余部分仍保持连通,最大程度确保虚拟网络的完整性和服务的连续性。以最小化底层网络映射开销为目标函数,建立虚拟网络可靠映射的整数线性规划模型,提出一种虚拟网络可生存的启发式可靠映射算法RHM-SVN并进行求解。实验结果表明,该算法能够有效降低资源平均利用率,提高映射成功率、底层网络平均收益和虚拟网络恢复成功率。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.

关 键 词：云计算 虚拟网络可生存 虚拟网络可靠映射 整数线性规划 蚁群算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]