基于WDM光网络虚拟化的启发式映射算法  

Heuristic Mapping Algorithm Based on WDM Optical Network Virtualization

作　　者：吕立尧 侯韶华[1] 

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210003

出　　处：《计算机技术与发展》2015年第6期44-47,55,共5页Computer Technology and Development

基　　金：国家"973"重点基础研究发展计划项目(2013CB329005);国家科技重大专项(2012ZX03001008-003;2011ZX03005-004-03);江苏省自然科学基金重点专项(江苏"973")(BK2011027)

摘　　要：当前互联网不断"僵化",网络架构难以满足一些新颖应用的需求。光网络虚拟化是克服僵化问题的重要途径之一。在WDM光网络中,如何合理将虚拟网络映射到物理网络是网络虚拟化的核心问题。文中利用虚拟网络映射模型提出了一个整数线性规划(ILP)。然而,面对规划中的众多约束条件,使得目标求解的问题通常是NP复杂的,所以文中在此基础上主要研究了两种快速,但性能次优的启发式算法,即最大映射和最小映射。算法中主要分析的是节点映射和链路映射的两个子问题。仿真实验结果表明,相比于前者,在流量疏导方面,最小映射算法使用了更少的波长链路数,其性能更接近ILP推出的最优结果。The current Internet is constantly rigid,so the network architecture is difficult to meet some of the needs of new applications. Optical network virtualization is an important way to overcome the rigid problem. In WDM optical networks, how the virtual network maps to the physical network reasonably is the core issue of network virtualization. An Integer Linear Program （ ILP） is proposed in this paper employing the virtual network mapping model. However,faced with the planning of numerous constraints,the problem solving is usually NP-hard. Based on the ILP,two major fast heuristic algorithms with sub-optimal performance,the maximum mapping and minimum mapping,are presented. The algorithm mainly analyzes two sub-problems of node mapping and link mapping. Simulation results show that compared with the former,in terms of traffic grooming,the minimum mapping algorithm uses fewer numbers of wavelength link,and its performance is closer to the optimal results of ILP.

关 键 词：波分复用 网络虚拟化 整数线性规划 映射算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]