光路可靠性和频谱整合因子感知的虚拟光网络生存性映射

针对多链路故障,本文提出一种基于光路可靠性和频谱整合因子感知的空分复用弹性光网络中虚拟光网络生存性映射算法.在虚拟节点映射时,综合考虑物理节点属性的权重评估准则.在虚拟链路映射时,本文设计联合考虑频谱资源和可靠性的工作光路选择策略和基于频谱整合因子感知的工作光路频谱分区分配方法,并设计提高保护带宽共享度的保护光路选择策...     

节点重要性感知的透明虚拟光网络协同映射策略

针对透明弹性光网络环境下虚拟光链路映射过长和频谱碎片问题,该文提出一种节点重要性感知的协同映射算法。在节点映射阶段,设计节点重要性度量准则,评估未映射节点和已映射节点的邻近性,以及光路的频谱紧密度,以缓解链路频谱碎片和增强节点映射的紧凑性。同时,为了降低节点映射成功而链路映射失败的概率,提出一种节点-链路协同映射算法,当成功映射一对相邻虚拟节点时,立即映射他们之间的虚拟光链路,并分配频谱资源,最小化虚拟光链路所映射物理光路跳数。仿真结果表明,所提算法能够使用更少的频谱资源传输更多的虚拟光网络业务,且缩短了虚拟光链路映射长度。     

基于灾难预测多区域故障的虚拟光网络生存性映射

生存性虚拟光网络映射是提高光网络应对灾难故障的重要技术保障措施。为解决灾难性多区域故障导致弹性光网络的带宽容量损失问题,该文提出基于灾难预测故障模型的蚁群优化虚拟光网络映射 (DFM-ACO-VNM)算法。在该算法中,设计基于光节点资源和相邻链路的全局潜在故障概率的光节点排序映射准则,并设计启发式信息公式实现多区域故障下最小带宽容量损失的虚拟节点和虚拟链路协同映射。仿真结果表明,该文所提算法在多区域故障时能降低带宽容量损失,减少带宽阻塞率和提高频谱利用率。

     

链路可靠性感知的差异保护虚拟光网络映射

针对弹性光网络的多链路故障影响虚拟光网络映射性能问题,提出一种链路可靠性感知的差异保护虚拟光网络映射（RA-DPVONE）方法.根据光节点的资源特性与相邻链路故障概率,该方法设计了光节点重要性评估准则和优先映射方法.根据候选光路上的可用频谱资源和链路故障概率,设计虚拟链路映射的工作光路和保护光路的链路代价更新公式,仅为不满足可靠性需求的虚拟链路映射资源共享保护光路.仿真结果表明,所提方法能降低网络的带宽阻塞率,提高虚拟网络请求接受率和弹性光网络的频谱资源利用率.     

联合能耗与负载均衡的虚拟网络映射方法

为解决弹性光网络中虚拟网络映射时能耗严重、资源分配不均的问题,该文提出一种联合能耗与负载均衡的虚拟网络映射（PC-LB-VONE）方法.在虚拟节点映射时,选择相邻链路长度短、光节点计算资源多与相邻链路带宽资源多的光节点映射.在虚拟链路映射时,提出一种基于极大团的候选光路资源匹配度单路径映射策略.当单路径映射失败时,设计基于链路负载均值的多路径映射策略.仿真结果表明,所提方法能在减少弹性光网络能耗的同时均衡网络负载.     

弹性光网络中节点优先的虚拟网络映射算法

针对弹性光网络中虚拟网络映射的资源消耗问题,综合考虑节点、链路对虚拟网络映射资源需求的影响,提出了节点优先的虚拟网络映射算法。所提算法先对虚拟节点依据节点权值进行排序,然后为虚拟节点分配满足资源需求的物理节点,并采用贪心原则映射虚拟节点,最后利用协同映射方式将虚拟链路映射到长度最短的无环物理路径上,以达到减小虚拟网络资源消耗的目的。仿真结果表明,所提算法能有效减小虚拟网络资源消耗并降低网络请求阻塞率。     

基于时频联合碎片感知的资源均衡虚拟光网络映射算法

为了解决虚拟光网络映射中带宽阻塞率较高以及底层资源消耗不均匀问题,论文提出一种基于时间域-频谱域碎片感知的虚拟网络映射(FA-VNM)算法。该文综合考虑频隙在时间域和频谱域上的碎片问题,设计时频联合碎片公式最小化分配过程中的频谱碎片。进一步,为了均衡网络中的资源消耗,在FA-VNM算法基础上提出基于节点度数的负载均衡感知虚拟网络映射(LB-VNM)算法,设计物理节点平均资源承载能力的公式,优先映射物理节点平均资源承载能力大的节点;为了均衡路径上资源使用,考虑路径权重值,并根据每条路径的权重值对虚拟链路进行映射,从而降低阻塞率。仿真结果表明,所提算法能有效降低阻塞率,提高资源利用率。     

弹性光网络中基于安全性感知的差异化虚拟光网络的映射策略

针对虚拟环境下底层网络中光纤的概率性故障,传统的100%保护至少需要配置一条保护路径,造成资源冗余度高和虚拟网络请求接受率低的问题,该文提出一种基于安全性感知的差异化虚拟光网络的映射(SA-DVNM)策略,在链路发生故障时为差异化虚拟网络请求提供安全保证。在SA-DVNM策略中,设计了一个综合考虑物理节点对之间跳数和相邻带宽大小的节点权重式避免链路映射过长,并提出路径频谱资源使用均衡的链路映射机制,最小化瓶颈链路的数量。当单路径传输失败时,SA-DVNM策略设计允许路径分割的资源分配机制,为保障时延敏感业务的安全性,SA-DVNM策略在路由选择中设计了基于时延差优化的多路径路由频谱分配方法。仿真结果表明该文所提策略在概率故障环境中能够降低带宽阻塞率,提高频谱资源利用率和虚拟光网络接受率。

     

基于节点邻近感知与路径综合评估的虚拟网络映射算法

该文针对虚拟网络映射过程中节点与链路映射关联性差、虚拟邻接节点映射距离远和相邻节点链路资源消耗不均衡的问题,提出一种两阶段的基于节点邻近感知与路径综合评估的虚拟网络映射算法(NA-PVNM)。在节点映射阶段,首先对虚拟节点按照资源请求和广度优先搜索算法排序,然后对每个虚拟节点的候选物理节点考虑资源丰富度和拓扑邻近性,建立了节点适应值函数计算最佳映射节点。在链路映射阶段,采用k最短路径算法,对每条候选路径考虑可用带宽、途经物理节点资源最大值和路径跳数,通过路径适应值函数计算最佳路径。仿真结果表明算法降低了链路映射长度,提高了虚拟网络请求接受率和收益开销比。实验分析了位置约束和物理网络拓扑性质对算法性能的影响以及映射过程中物理网络资源占用情况。实验结果表明,在物理资源分布和虚拟网络请求的条件约束下,提高虚拟网络映射成功率的关键在于减少映射时的资源消耗。     

一种生存性军事虚拟网络映射新方法

针对生存性的军事虚拟网络映射问题,提出了生存性的军事虚拟网络映射需要遵循的原则。构建了虚拟网络映射模型,并采用蝙蝠算法进行求解。针对故障情况,提出了区分服务的故障恢复策略,对于高优先级虚网请求提前构建保护路径,对于低优先级虚网请求则提出基于链路可靠性的故障迁移算法,为了减少带宽消耗适当考虑了节点迁移策略。最后通过仿真验证了算法在虚拟网络运行成功率、故障修复率和链路利用率方面相比其他算法具有更好的性能。     

Physical impairments awareness based virtual network mapping strategy of elastic optical networks

As virtual networks services emerge increasingly with higher requirement of flexibility and robust, great complex challenges caused by physical-layer impairments are presented to the elastic optical networks(EON). Aimed to solve this problem, this paper proposes a physical impairment awareness based virtual network mapping stragegy of EON. The physical impairments awareness model is established, including both of linear factors and nonlinear ones. On this basis, this paper proposes a virtual network mapping strategy with detailed procedures, combined with node importance factors during the virtual network mapping procedure. Test results show that the proposed approach is able to reduce blocking rate and enhance services supporting ability of EON.     

Dynamic fragments awareness based virtual network mapping strategy of elastic optical networks

As virtual networks services emerge increasingly with higher diversification, the issue of spectrum fragments presents great challenge to the elastic optical networks (EON), especially under heaven services burdens. Aimed to solve this problem, this article proposes a dynamic fragments awareness based virtual network mapping (DFA-VNM) strategy of elastic optical network. In this proposed approach, the dynamic fragments awareness model of it is established, which takes available bandwidth demand and spectrum fragment degree into consideration. Moreover, the dynamic fragments awareness based virtual network mapping strategy makes full advantage of real-time fragments awareness result to conduct virtual network service mapping operation with less fragments and lower blocking rate. Testing results show that the proposed approach is able to improved services supporting ability of EON.     

Power-aware virtual optical network provisioning in flexible bandwidth optical networks [Invited]

Considering the virtual network infrastructure as a service, optical network virtualization can facilitate the physical infrastructure sharing among different clients and applications that require optical network resources. Obviously, mapping multiple virtual network infrastructures onto the same physical network infrastructure is one of the greatest challenges related to optical network virtualization in flexible bandwidth optical networks. In order to efficiently address the virtual optical network (VON) provisioning problem, we can first obtain the virtual links’ order and the virtual nodes’ order based on their characteristics, such as the bandwidth requirement on virtual links and computing resources on virtual nodes. We then preconfigure the primary and backup paths for all node-pairs in the physical optical network, and the auxiliary graph is constructed by preconfiguring primary and backup paths. Two VON mapping approaches that include the power-aware virtual-links mapping (PVLM) approach and the power-aware virtual-nodes mapping (PVNM) approach are developed to reduce power consumption for a given set of VONs in flexible bandwidth optical networks with the distributed data centers. Simulation results show that our proposed PVLM approach can greatly reduce power consumption and save spectrum resources compared to the PVNM approach for the single-line rate and the mixed-line rate in flexible bandwidth optical networks with the distributed data centers.     

面向节点异构的能耗感知虚拟网络映射算法

在底层网络节点异构的环境中,能耗优化的虚拟网络映射问题并不是最小化工作节点和链路数。该文针对此问题,构建底层网络节点和链路的负载能耗模型,并以能耗最优为目标,建立虚拟网络映射问题的数学模型,提出一种能耗感知虚拟网络映射算法。该算法在节点映射阶段以最小化能耗和协调链路映射为原则,将虚拟节点映射至综合资源能力最大的底层节点上,并采用改进的能耗感知k最短路径法进行链路映射。仿真结果表明,该算法显著减少虚拟网络映射的能耗,且底层网络节点异构性越大,能耗优势更为明显。     

Dynamic recovery for survivable virtual network embedding

Network virtualization is a promising way to overcome the current ossification of the Intemet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The virtual network mapping algorithm based on integer programming which was proposed months ago. But it did consider the faults of physical network resources, which is so called survivable virtual network embedding （VNE） problem. Previous strategies for enabling survivability in network virtualization focused on providing protection for the physical network or enhancing the virtual networks by providing backup physical resources in advance, and treated all the physical failures as link failures. In the article, a dynamic recovery method is proposed to solve the survivable virtual network embedding problem based on the integer programming VNE algorithm. The dynamic recovery method doesn＇t need to backup physical resources and it makes more substrate resources which can be used in the embedding. The dynamic recovery process will be activated only when physical failures occur. Different algorithms are used to recovery node and link failures. Simulations show that the method helps to recover almost all of physical failures by finding the substitute nodes and paths, and its performance is very close to that of pure VNE method without considering physical failures.     

Research on mapping algorithm of virtual network oriented to SDN

In order to solve the problem of virtual network mapping,a mapping method based on ant colony hybrid genetic algorithm was put forward under SDN environment,which established a linear programming model for virtual network mapping,and divided the mapping process into node mapping and link mapping.Firstly,the fusion algorithm was adopted,in which virtual nodes were mapped to physical nodes.Then the shortest path algorithm was used to map the virtual link to a physical link.On this basis,the acceptance ratio of virtual network requests can be improved.Simulation experiment results show that acceptance rate of virtual network requests can be increased by 10% efficiently using the ant colony hybrid genetic algorithm,compared with existing mapping algorithms D-ViNE,RW-BFS and R-ViNE.Further more,proposed method can greatly improve the average utilization rate of nodes and links and the ratio of the mapping income to cost.