一种基于临近原则的虚拟网络映射算法  

A Virtual Network Mapping Algorithm Based on Approaching Principle

作　　者：黄胜[1] 吴川川[1] 杨晓非[1] 王辉[1] 张卫[1] 

机构地区：[1]重庆邮电大学光纤通信技术重点实验室,重庆400065

出　　处：《电信科学》2013年第12期38-44,共7页Telecommunications Science

基　　金：国家重点基础研究发展计划("973"计划)基金资助项目(No.2012CB315803);国家自然科学基金资助项目(No.61071117;No.61171158;No.61275077);重庆市科委自然科学基金资助项目(No.2010BB2413;No.2010BB2409);重庆市教委自然科学基金资助项目(No.KJ110519;No.KJ110527)

摘　　要：在两阶段虚拟网络映射算法的基础上,针对现有的贪婪策略对节点映射存在盲目性的缺点,提出了一种基于临近原则的虚拟网络映射算法。该算法对节点映射阶段做了优化和改进,在节点映射阶段充分考虑其对链路映射带来的影响,使节点映射到相对集中的区域,降低链路映射阶段的求解难度。仿真结果表明,所提出的算法与已有的算法相比,在虚拟网络请求接受率、平均时间收益和收益开销比等方面均有明显提高。On the basis of two stages virtual network mapping algorithm, pointing at the defects of the blind node mapping of existing greedy strategy, a virtual network mapping algorithm based on approaching principle was proposed. The algorithm optimized and improved the node mapping stage, and it took a full consideration of the impact on link mapping in the node mapping stage, which made the nodes map to the area of relatively concentrated and reduced the difficulty of solving the link mapping stage. Simulation results show that compared with the existing algorithms, the proposed algorithm improves the virtual network request acceptance ratio, average time revenue and revenue/cost （r/c） ratio.

关 键 词：虚拟网络映射 临近原则 接受率 收益开销比 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]