CAJ | 학술논문

当前互联网不断“僵化”，网络架构难以满足一些新颖应用的需求。光网络虚拟化是克服僵化问题的重要途径之一。在WDM光网络中，如何合理将虚拟网络映射到物理网络是网络虚拟化的核心问题。文中利用虚拟网络映射模型提出了一个整数线性规划( ILP)。然而，面对规划中的众多约束条件，使得目标求解的问题通常是NP复杂的，所以文中在此基础上主要研究了两种快速，但性能次优的启发式算法，即最大映射和最小映射。算法中主要分析的是节点映射和链路映射的两个子问题。仿真实验结果表明，相比于前者，在流量疏导方面，最小映射算法使用了更少的波长链路数，其性能更接近ILP推出的最优结果。
당전호련망불단“강화”，망락가구난이만족일사신영응용적수구。광망락허의화시극복강화문제적중요도경지일。재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 u-sually NP-hard. Based on the ILP,two major fast heuristic algorithms with sub-optimal performance,the maximum mapping and mini-mum 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.