WDM网络中基于负载平衡的动态波长路由算法

在WDM网络中，路由和波长分配（RWA）算法是一个焦点问题．当前的RWA算法多是考虑路径跳数或全网拥塞程度，并没有分析各个链路的具体情况．文中提出一种WDM网络中能实现负载平衡的路由算法——最大波长跳数比值（MWHR）算法。基本思想是：根据各备选路径的跳数和其经过的各链路上的可用波长数信息。计算该路径的优先选取权值，优先选取权值最大的路径．仿真表明，该算法在保证较低的阻塞率情况下，能有效的将业务负载均衡分布在网络中的所有链路上．     

WDM光网络中固定路由的优化算法

通过研究WDM光网络中固定路由策略的选取对网络性能的影响，提出了一种新的用于优化固定路由的算法-综合代价法。该算法综合考虑了链路负载和路由跳数这两个因素，以综合代价为策略进行路由优化。计算机仿真结果表明，针对不同的网络负载情况，综合代价法能够有效地降低网络的阻塞率，提高网络的性能。     

WRON中基于波长相关性的波长分配算法

基于节约网络资源和降低网络的阻塞率和波长分配代价的思想,在WRON网络的动态路由波长分配算法中考虑波长相关性.根据波长之间转换度变化,详细定义波长转换器的可转换波长之间的波长转换度,并定义了一个利用二进制数表示的空闲波长指示参数,利用该参数对链路上的空闲波长进行表示,用蚁群系统的蚁群波长信息素更新的计算公式来更新这个指示参数,简化波长分配的过程.通过仿真,证明本算法能够达到节约波长资源,降低网络的阻塞率和波长分配代价的目的.     

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

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

基于链路质量的WSN代价均衡路由选择算法

该文针对无线传感器网络中不可靠链路通信耗能过大的问题,基于链路质量进行路由代价函数构建,并为各条路径分配适当的选择概率,采用最小跳数转发策略设计了代价均衡的路由选择算法CBLQ;为了进一步降低和均衡路由代价,分析同跳节点的备选转发条件,又扩展形成了新的路由选择算法CBLQ-E。仿真实验结果证明,两种算法均使网络的能量利用率得到有效提高,同时还降低了网络的数据传输时延。     

DWDM波长路由网络光链路负载均衡的波长路由算法

提出了一种应用于密集波分复用(DWDM)波长路由网络(WRON)中光链路负荷均衡的思想,并将其应用于优化Dijkstra算法的权值,同时将优化Dijkstra算法用于遗传算法求得了在不同的负荷条件下波长下限的网络所需波长数目。并将优化前后的算法分别对美国自然科学基金(NSF)网络的最优波长分配进行数值分析,发现基于负荷均衡思想的优化Dijkstra算法能够对网络的性能有很大提高：当遗传代数为20代时,采用优化Dijkstra算法阻塞率降低了约36％;当波长使用数为7个时,降低网络阻塞率10％。     

一种新型的动态路由和波长分配算法

本文讨论了WDM光网中，在动态业务流量和有限范围波长变换情况下的动态路由和波长分配（RWA）问题，基于Moone-Dijkstra算法，考虑到动态波长变换的可能和限制，提出了一种新型的、可实现动态最小代价路由和最佳虚波长通道的综合启发式算法（DMC－OVMP）。该算法对路由子问题和波长分配子问题既相互独立，又相互结合，优化了RWA，保证了网络信息传输的安全性。对中国教育和科研计算机网（CERNET）基于本算法进行了计算机仿真，实现了低的网络阻塞率。     

基于强化学习的光传送网路由波长优化

针对光传送网中动态业务的路由和波长问题,提出一种基于强化学习的深度路由波长分配算法DeepRWA。算法基于软件定义网络架构,通过强化学习灵活地调整控制光传送网,实现光网络路由波长分配策略优化。针对路由选择问题,结合链路上的波长使用情况,使用A3C算法选择合适的路由,使得阻塞率最小;针对波长分配问题,使用首次命中算法选择波长。考虑阻塞率、资源利用率、策略熵、价值损失、运行时间及收敛速度等多个指标,利用14节点NSFNET网络拓扑仿真实验。结果表明:当信道中包含18个波长时,与传统KSP-FF算法相比,所提出的路由波长分配算法的阻塞率降低了0.06,资源利用率提高了0.02,但运行时间有增加;在波长数超过45以后,与传统KSP-FF算法相比,所提算法保持阻塞率和资源利用率的同时,运行时间开始降低;当信道中包含波长数为58时,与传统KSP-FF算法相比,所提算法运行时间减少了0.07 ms。由此可见,提出的算法使路由选择和波长分配得到了优化。     

基于关键链路预测的动态路由和波长分配算法

 光网络中的路由和波长分配 （RWA）算法是NP难问题. 目前的解决方案大多是基于启发式算法或图论的,其计算复杂度往往随着网络规模的增加呈指数增长,而且链路阻塞概率建模也十分困难. 本文提出了一种基于“关键链路”预测机制的RWA算法,并综合考虑跳数和空闲波长数的因素,不仅通过链路层面,而且也从网络层面来解决RWA问题. 实验结果表明我们的算法可以实现很好的流量负载均衡和低的阻塞率,具有较小的计算复杂度.     

光网络中一种快速动态负荷均衡的波长路由算法

针对波长路由网络中动态光链路建立问题,提出了一种快速动态波长路由算法(RWA)。在路由子问题上,通过动态改进最短路径算法(Dijistra算法)权值的设置,使之符合光网络中动态流量分布,并适时更新路由信息表来适时调整网络的流量分布,减轻网络负荷,实现一种负荷均衡的路径查找。在波长分配子问题上,提出一种通过动态调节变异和交叉算子的遗传算法(VMCR-GA),可以实现快速波长搜索和分配。通过在几个网络上的仿真分析,比采用普通遗传和D算法的波长路由算法性能优越,网络阻塞率可以降低10%,波长分配效率提高30%~50%,算法的收敛性也大大提高。     

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks

Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstras shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability.     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

A Node-Level Blocking Probability Analysis for WRONs

This work presents the blocking performance of a single node with (full or limited) wavelength conversion in wavelength routed optical networks (WRON) based on the theory of probability. A blocking probability model is proposed. Particularly, we pay more attention to investigate wavelength routing node performance improvement by using the more feasible case of limited wavelength conversion. Based on our analytical model, we calculate the blocking probability for a single wavelength routing node and then make a simulation to validate it. It is shown that a node with low conversion degrees having a small number of fiber link ports and a large number of wavelengths per link is a more realistic choice.     

波分复用波长路由节点的阻塞特性分析

利用概率统计理论的方法，从节点层次上定量分析了节点规模、复用波长数目以及波长转换对波分复用(WDM)波长路由网络中波长路由节点的影响。提出了基于概率统计的节点阻塞模型。数值结果突出表明波长转换能力越强的全光节点，其性能越优。为了提高网络资源的使用效率并增强全光网络的灵活性，必须实现全光网络中的虚波长路由波长转换器。通过数值计算找到了阻塞性能和代价的折中，研究中发现配置较低波长转换能力波长转换器的波长路由节点将会具备更强的性价比优势，当前在构建光通信系统时使用弱波长转换能力的光节点更可行。     

Routing and Wavelength Assignment in Optical Networks Using Logical Link Representation and Efficient Bitwise Computation

In this paper, we propose and evaluate a new approach for implementing efficient routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks. In our method, the state of a fiber is given by the set of free wavelengths in this fiber and is efficiently represented as a compact bitmap. The state of a multiple-fiber link is also represented by a compact bitmap computed as the logical union of the individual bitmaps of the fibers in this link. Likewise, the state of a lightpath is represented by a similar bitmap computed as the logical intersection of the individual bitmaps of the links in this path. The count of the number of 1-valued bits in the bitmap of the route from source to destination is used as the primary reward function in route selection. A modified Dijkstra algorithm is developed for dynamic routing based on the bitmap representation. The algorithm uses bitwise logical operations and is quite efficient. A first-fit channel assignment algorithm is developed using a simple computation on the bitmap of the selected route. The resulting bitwise routing algorithm combines the benefits of least loaded routing algorithms and shortest path routing algorithms. Our extensive simulation tests have shown that the bitwise RWA approach has small storage overhead, is computationally fast, and reduces the network-wide blocking probability. The blocking performance of our RWA method compares very favorably with three routing methods: fixed alternate routing, shortest path using flooding, and Dijkstra’s algorithm using mathematical operations. Our simulation experiments have also evaluated the performance gain obtained when the network access stations are equipped with finite buffers to temporarily hold blocked connection requests.     

部分共享波长转换光网络动态路由的改进算法

提出了一种应用于部分共享波长转换（PWC）的波长路由光网络（WRON）中的基于节点阻塞的动态路由算法,它不需要共享复杂的波长转换信息,而是将各节点的阻塞特性考虑到路由过程中。为评价算法性能,在14节点的国家科学基金网（NSFNET）拓扑中进行了仿真。结果表明,新的路由算法显著改善了网络的阻塞性能和建路失败的概率,尤其是随着网络负载的降低,网络性能的改善更显著。     

一种快速动态分布式光链路建立方法

提出一种改进的波长分配算法,用于波长路由光网络中快速动态分布式光链路的建立。该算法采用提前释放和超时释放两种波长和链路释放机制,减少了网络拥塞,更适合波长路由网络的实际运行规则。通过在美国自然科学基金网(NSF)上的仿真计算,与以前的研究结果相比,该算法可以减少网络的阻塞率8％,同时缩短了光链路建立的时间。     

An Ant-Based Approach for Dynamic RWA in Optical WDM Networks

In this paper, we propose a new ant-based algorithm for the dynamic routing and wavelength assignment (RWA) problem in optical WDM networks under the wavelength continuity constraint. Unlike conventional approaches, which usually require centralized global network information, our new RWA algorithm constructs the routing solution in a distributed manner by means of cooperative ants. To facilitate the ants’ foraging task, we adopt in our algorithm a probabilistic routing table structure for route selection. The new algorithm is highly adaptive in that it always keeps a suitable number of ants in the network to cooperatively explore the network states and continuously update the routing tables, so that the route for a connection request can be determined promptly by the current states of routing tables with only a small setup delay. Some new schemes for path scoring and path searching are also proposed to enhance the performance of our ant-based algorithm. Extensive simulation results upon three typical network topologies indicate that the proposed algorithm has a very good adaptability to traffic variations and it outperforms both the fixed routing algorithm and the promising fixed–alternate routing algorithm in terms of blocking probability. The ability to guarantee both a low blocking probability and a small setup delay makes the new ant-based routing algorithm very attractive for both the optical circuit switching networks and future optical burst switching networks