逼近理想排序的虚拟网均衡节能重构算法  

Balanced energy-saving virtual network reconfiguration based on technique for order preference by similarity to ideal solution

作　　者：王博[1] 陈庶樵[1] 王志明[1] 王文钊[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机应用研究》2015年第7期2083-2086,共4页Application Research of Computers

基　　金：国家"973"计划资助项目(2012CB315901)

摘　　要：针对虚拟网请求结束时底层网络节能重构问题,提出一种虚拟网均衡节能重构算法。算法首先基于逼近理想排序法选择底层物理节点的相关信息作为方案属性,找到面对重构需求的最佳重构节点;然后优先进行节能重构,再对工作状态的网络拓扑进行均衡重构以改善底层网络映射状态。仿真结果表明,该方法改善了底层网络的负载均衡情况和能耗水平,提升了映射接收率和收益能耗比。Aiming at improving energy-saving reconfiguration of substrate network when virtual network require ends, this paper proposed a balance-energy scheme. Based on technique for order preference by similarity to ideal solution, it selected some information of substrate nodes as the attribute of project, and rank nodes by the requirement of energy-saving or load-balance. After energy-saving reconfiguration, the method implemented load-balance reconfiguration aim at the worked network. The simulation results show that this scheme decreases the energy consumption and improves the situation of load imbalance, while inereasing the request accept ratio and revenue-cost ratio.

关 键 词：虚拟网映射 均衡重构 节能重构 逼近理想排序法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]