EON中针对提前预留业务的碎片感知RSA算法

为了减少弹性光网络(EON)中的频谱和时间碎片,针对提前预留(AR)业务提出一种碎片感知路由与频谱分配(RSA)算法。在选路阶段,该算法采用K最短路径算法,综合考虑路径距离、跳数、频谱资源消耗和邻接链路数等因素影响来挑选侯选路径集;在资源分配阶段,则采用局部影响因子统计可能产生的频谱和时间碎片,以降低候选资源块周围的频谱、时间资源碎片化程度,并利用整体影响因子尽可能将占用资源集中在频率轴边界处,以增加中间空闲资源连续性,同时还引入时域资源使用度因子以避免过度占用资源。仿真结果表明,该算法进一步改善了带宽阻塞率性能,提高了资源利用率。     

一种基于能量感知的弹性光网络RSA算法

弹性光网络具有高频谱效率和灵活性等优点,是光网络发展的主要方向。路由和频谱分配是弹性光网络的核心技术之一。文章提出了一种改进的基于能量感知的弹性光网络RSA(路由和频谱分配)算法,在进行选路和频谱分配时,同时考虑了网络中的能耗和可用频谱资源情况。理论分析和仿真结果表明,与传统RSA算法相比,改进算法可以提高能量效率,降低业务阻塞率。     

弹性光网络基于区分降级服务和自适应调制的动态路由与频谱分配算法

面对高速发展的互联网应用,传统的路由与频谱分配(RSA)问题迎来新的挑战。融合降级服务(DS)技术的弹性光网络无疑为降低业务阻塞率,提高用户体验质量(QoE)提供了新方向。该文首先针对频谱资源的低效利用和DS导致的业务收益下降问题,建立以最小化频谱消耗和最小化DS等级、频次为联合优化目标的RSA问题的混合整数线性规划模型。随后,提出一种基于区分DS和自适应调制的动态RSA算法。该算法考虑业务等级的差异化,并整合自适应调制和DS技术。同时,设计区分业务等级的DS损失函数及DS窗口选择策略,为即将受阻业务分配理想的频谱位置和资源。此外,设计考虑频谱与收益均衡关系的网络收益函数,达到频谱资源高效利用,减少降级影响,提升网络收益的目的。最后,仿真验证了所提算法在业务阻塞率和网络收益等方面的优势。     

IP/MPLS over WDM网中考虑链路 负载平衡的保护设计

利用网络链路资源被占用的部分信息实现保护资源共享,可以极大地改善网络对业务的丢弃性能.这对采用多协议标记交换(MPLS,Multiprotocol Label Switching)技术的IP over WDM网络来说,并不需要太大的代价.基于此,本文提出了在IP over WDM网中考虑通路保护的动态路由算法.对工作通路的选取,算法对选路成本和路由长度作了折衷考虑;而对于保护通路,则对其共享能力和路由长度作了权衡.仿真结果表明,本文算法不管是对业务的丢弃性能,还是对网络的链路负载平衡度,均取得了较满意的结果.     

物理损伤感知的多芯光纤网络动态路由资源分配方法

针对多芯光纤空分复用弹性光网络中物理损伤导致网络的频谱利用率低与带宽阻塞率高的问题,提出一种物理损伤感知的业务动态路由和资源分配方法.在路由阶段,设计考虑路径跳数、可用资源和路径上链路资源利用率的动态路径资源评判公式,选择负载均衡和资源占用较少的候选路径.在频谱和纤芯分配阶段,设计满足业务串扰和非线性阈值的纤芯和频谱分...     

SD-EON业务安全等级感知的低时延路由频谱分配算法

光网络中普遍存在着普通业务和安全业务,为了将安全业务配置到安全链路进行传输,规避普通业务占用安全链路,降低业务请求光路建立时延,提出了业务安全等级感知的低时延路由频谱分配算法.算法将网络物理拓扑分为安全虚拟拓扑和普通虚拟拓扑,充分考虑了业务安全类别和链路差别,通过运用安全虚拟拓扑将安全业务配置到安全链路进行传输,回避E...     

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

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

基于无色无向无冲突可重构光分插复用器节点的全光IP组播能效调度

为了提高无色无向无冲突灵活的可重构光分插复用器(CDC-F ROADM)节点的弹性光网络IP组播频谱-能耗效率,该文提出一种全光组播能效调度算法(AMEESA)。在算法路由阶段,考虑能耗和链路频谱资源使用情况设计链路代价函数,构建最小代价光树算法组播光树。在频谱分配阶段,设计基于高效光谱分辨率(HSR)光树中间节点频谱转换方法,选择节能频谱转换方案为组播光树分配频谱块资源。仿真分析表明,所提算法能有效提升网络能效,降低IP组播带宽阻塞率。     

弹性光网络中基于DRL的RMSA算法

为了更好地解决弹性光网络(EON)的路由、调制格式与频谱分配(RMSA)问题,进一步降低网络阻塞率,提出一种基于深度强化学习(DRL)的RMSA算法。该算法在奖励设计中将考虑影响RMSA决策的资源占用度和频谱邻接度这2个指标,以鼓励智能体优先选择资源占用度低、频谱邻接度高的路径来建立光路,并对比该算法与其它算法在不同网络中的性能。仿真结果表明：与几种典型的DRL算法相比,所提算法的网络阻塞率更低。     

卫星光网络中基于DQN的匹配度感知波长路由算法

为了进一步降低卫星光网络的业务阻塞率,提出了一种基于深度Q网络(DQN)的匹配度感知波长路由算法。该算法首先设计了路径波长匹配度因子,用以反映当前路径与下一跳节点之间链路的共同空闲波长情况。随后,算法综合考虑了路径波长匹配度、相邻链路时延以及下一跳节点到目的节点的最短跳数等多个因素,以此为基础来构造奖励函数。在分配波长时,为了后续业务请求在相邻链路上有更多的空闲波长,设计了相邻链路波长匹配度指标,用于描述该路径与其相邻链路之间的空闲波长对齐情况。仿真结果表明,该算法可以降低网络阻塞率和时延,提高波长利用率。     

Resource efficiency improved approach for shared path protection in EONs

For improving the resource efficiency of dynamic shared path protection in elastic optical networks, a survivable RSA (SRSA)-based heuristic algorithm is proposed in the paper. In SRSA, an adaptive adjustment link cost function is devised to effectively select working and protection paths. The cost function sufficiently considers available spectrum resources and the length of light paths for both working and protection paths. In order to achieve high resource efficiency, a spectrum allocation strategy named minimal cost stable set is proposed to allocate spectrum for protection paths with respect to the resource efficiency in the link cost function. And the graph coloring algorithm is introduced to select the shared protection path with the highest resource efficiency for the request. Compared with the shared path protection and dynamic load balancing shared path protection, simulation results show that the proposed SRSA decreases bandwidth blocking probability and achieves high resource efficiency.     

Design of programmable logic device based on electro-optic effect of lithium-niobate-based Mach–Zehnder interferometers

Elastic optical network (EON) technology is considered as a very promising candidate for future high-speed networks due to its intrinsic flexibility and high efficiency in allocating the optical spectrum resources. The key issue that has to be addressed in EON is the routing and spectrum allocation (RSA) problem. RSA is NP-hard problem that has to be solved in an efficient manner. It is a highly challenging task particularly in the case of large problem instances. In this paper, we applied the bee colony optimization (BCO) metaheuristic approach to solve the RSA problem in EON with static traffic demands. The objective of the proposed BCO–RSA algorithm is to minimize both the network spectrum utilization and the average path length criterions. The results of numerous experimental studies show that our BCO–RSA algorithm performs superior compared to some benchmark greedy heuristics as well as to differential evolution (DE) metaheuristic algorithm recently proposed in the literature. The algorithm is evaluated in different realistic size optical networks, such as the NSFnet, two European optical networks (EON-19 and EON-28) and the USA network topology. Simulation results demonstrate that considerable spectrum savings could be achieved with our BCO–RSA algorithm compared to other considered approaches. In addition, we analyzed the efficiency of the BCO–RSA algorithm and compare it with the competitive DE approach according to the required CPU time and the convergence speed.     

弹性光网络双重故障下的自适应保护级别算法

为了降低弹性光网络中双链路故障保护下的业务及带宽阻塞率、均衡带宽资源分配,提出了一种双重故障下的自适应保护级别算法。该算法综合考虑传输距离、调制格式等因素,根据链路频谱资源使用状态动态地更新链路惩罚系数,选取最佳路径进行传输,同时根据请求类型及网络空闲资源状态自适应地选择保护方法,为业务提供最大限度的保护。仿真结果表明,在双链路故障下,算法在阻塞率方面取得了较好的性能,同时均衡了网络中各链路上的资源使用。     

Group-based spectrum assignment in dynamic flex-grid optical networks

Traditional wavelength switched optical network employing wavelength-division-multiplexing (WDM) technology, allocates constant spectrum band to different kinds of services, which lacks flexibility in spectrum provisioning and thus reduces the resource utilization efficiency. Flex-grid technology, which introduces a finer spectrum granularity and allocates spectrum to different services flexibly according to their required bandwidth, is considered a promising candidate solution to improve the resource utilization efficiency of an optical network. However, since multiple contiguous spectrum granularities are usually assigned to a single service in such flex-grid optical network, the spectrum continuity and contiguity constraints should always be guaranteed, which may induce spectrum fragmentation. With the accumulation of spectrum fragmentation, available spectrum resources decrease, and this will greatly worsen the performance of the whole network, especially in networking. Therefore, spectrum fragmentation is considered a serious problem in flex-grid optical networks and many schemes have been proposed to solve it. These existing schemes, known as defragmentation, can reduce spectrum fragmentation either by rerouting the lightpath or by reallocating the spectrum for a service, which re-optimizes the spectrum resources. However, in the rerouting or reallocation procedure, existing traffic may be disrupted or extra resources, such as alternative spectrum or expensive spectrum convertors, are needed. None of these schemes can solve spectrum fragmentation with both no disrupted traffic and extra resources. It is because all these schemes utilize remedial methods to solve fragmentation problem and either disrupted traffic or extra resources are the cost when they cope with the defragmented spectrum. Different from all the above schemes, we propose a precautionary method to solve fragmentation problem in this paper. By introducing group-based spectrum assignment algorithm into flex-grid optical networks, spectrum resources are sorted into groups and each spectrum group only accommodates one specific kind of services. Since released spectrum can always be reused by the services of the same kind, spectrum fragmentation is prevented from its generation. Simulation results demonstrate that the proposed algorithm induces no spectrum fragmentations and is suitable to accommodate high-speed services.     

ACO-based routing and spectrum allocation in flexible bandwidth networks

Optical networks with flexible bandwidth provisioning are a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, we focus on the dynamic routing and spectrum allocation (RSA) problem which emerges in such networks and propose a novel dynamic RSA algorithm by means of ant colony optimization (ACO). In our proposed algorithm, ants are launched to modify the routing table according to the length and the spectrum fragmentation information along the path. A simulation study is performed considering five algorithms in terms of blocking probability: WDM-based RWA approach, KSP-based RSA approach, Slot-based RSA algorithm, and our proposed ACO-based RSA approach. We then compare the deterioration degree of blocking probability by adding more types of line rate. Simulation results indicate that our proposed ACO-based RSA approach achieves lower blocking probability, complexity, and higher adaptability to more line rates mixture.     

可重构服务承载网主动保护算法研究

基于可重构柔性网络(RFNet,reconfigurable flexible network)构建可重构服务承载网(RSCN,reconfigurableservice carrying network)能够为终端用户提供满足业务特性需求的通信服务,有效地解决了传统互联网体系结构面临的困境。鉴于网络故障造成的负面影响,针对RSCN主动保护问题进行了数学建模和理论分析。为了尽量避免重要资源故障给网络带来的影响,设计了资源紧迫度感知的主路径构建子算法RSF-awareMLCA;为了提高RSCN的运行成功率并降低网络链路故障损失,设计了RSCN保护链路构建子算法RPLCA;结合2个子算法,设计了RSCN主动保护构建算法RAPA。最后,分析了算法的复杂度,从RSCN成功运行率、主链路利用率和平均网络链路故障损失3个方面验证了RAPA的优越性。     

基于拓扑感知的可重构服务承载网动态重构算法

可重构信息通信基础网络通过构建服务承载网的方式为业务提供自适应的承载服务。针对高效利用有限底层资源的问题,提出一种基于资源关键度进行动态映射的服务承载网构建算法。算法将通过节点或链路的最短路径数作为资源关键度的衡量指标,区别对待底层资源;并实时动态感知关键资源的使用状况,依据不同业务需求对服务承载网进行自适应调整。仿真结果表明,算法在构建成功率、收益花费比和资源均衡度等方面均具有良好性能。