网络虚拟化环境中面向服务聚合的映射算法  

Mapping Algorithm for Service Aggregation in Network Virtualization

作　　者：江逸茗[1] 兰巨龙[1] 程东年[1] 王志明[1] 

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

出　　处：《软件学报》2014年第6期1328-1338,共11页Journal of Software

基　　金：国家重点基础研究发展计划(973)(2012CB315901;2013CB329104);国家自然科学基金(61309019;61372121);国家高技术研究发展计划(863)(2013AA013505;2011AA01A103)

摘　　要：可重构信息通信基础网络通过构建宏电路实现针对特定服务的传输质量优化.由于该网络架构加入了对网络虚拟化技术的支持,因此在对服务请求进行映射时,若将类型相同的服务映射到同一组底层设备上,则能够有效提升宏电路的优化效果.针对该需求,提出了一种面向服务聚合的虚拟网映射算法,该算法综合考虑了底层设备的剩余资源和服务承载情况,使得服务可被优先映射到承载同类型服务较多的底层设备上.此外,为了对算法的运行时间进行优化,还提出了一种基于跳数约束的候选节点选取策略.实验结果表明,该算法不但在请求接收率和资源占用率等评价指标上有着较好表现,而且还能有效提高映射后服务的聚合程度.Reconfigurable Fundamental Information Communication Network achieves optimum transmission quality for special services by establishing Omnibus Circuits. Due to the support of network virtualization in this architecture, optimum efficiency of Omnibus Circuits can be promoted by mapping services of the same type to one group of substrate devices. For this requirement, this paper designs a virtual network mapping algorithm for service aggregation. Because this algorithm has a comprehensive consideration of surplus resources and situation of mapped services, the services tend to be mapped on the substrate devices which host numerous services of the same type. Furthermore, a node selection strategy with hop constraint is proposed for reducing the running time of the algorithm. Simulation experiments show that this algorithm not only has a better performance in the acceptance ratio and the resource occupancy rate, but also substantially increases the degree of service aggregation.

关 键 词：网络虚拟化 宏电路 服务聚合 映射算法 

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