一种基于自适应蚁群算法的动态RWA算法

动态RWA(路由与波长分配)问题是智能光网络的核心问题,以蚁群算法为代表的启发式算法是解决此类问题的优选方案之一。文章提出一种基于ADACO(自适应蚁群优化)算法的RWA机制,针对信息素挥发系数ρ采取自适应策略,实现了对全局信息素更新态调节。理论分析和数值仿真结果表明,与Dijkstra+FF(首次命中)算法相比,改进的ADACO+FF算法可以有效地降低网络阻塞率,规则型Mesh网络和NSFNET(国家科学基金会网络)的阻塞率最高分别降低了0.3和0.2。     

一种基于改进蚁群算法的光网络动态RWA机制

动态RWA(路由与波长分配)问题是智能光网络的核心问题.文章提出一种解决动态RWA问题的改进蚁群算法,在转移概率中加入了链路的空闲率作为约束条件,同时还引入了随机扰动防止搜索过早收敛于局部最优路径.仿真结果表明,改进算法与传统Dijkstra+ FF(首次命中)算法相比,可以显著降低阻塞率,提高资源利用率.     

基于D*思想的动态RWA算法研究

文章提出一种基于D*(D-Star)思想的启发式算法,求解波分复用(WDM)光网络中动态路由和波长分配(RWA)问题.将网络中各边代价与当前波长使用情况综合考虑,建立D*算法的估价函数,实现了WDM光网络中动态业务的高效分配.仿真结果表明,该算法能有效降低阻塞率,促进波长资源的合理分配,同时,其快速和智能特性也提高了网络故障环境下的生存性.     

基于改进蚁群算法的卫星光网络波长分配方法

路由与波长分配是下一代光网络的需要解决的核心问题之一。本文采用智能蚁群算法,研究了卫星光网络的路由与波长分配问题,为通信请求寻找最优的数据传输光路径。基于请求区域受限策略(Restricted Request Area,RRA)和链路波长负载平衡策略,建立了考虑传输延迟和波长连续性约束的双主星分布式星群节点结构光网络系统模型。利用智能蚁群路由和波长分配(Smart Ant Colony Routing AndWavelength Assignment,SAC-RWA)算法求解系统模型,以找到具有稀疏波长转换的卫星光网络中最小成本波长路径。所提出的算法允许单个蚂蚁同时完成路由和波长分配,仿真结果表明,RRA能够明显改进卫星光网络的性能,以略微增加拥塞率的代价显著降低了计算复杂度。     

路由与波长分配的RWA算法应用于光通信网络

随着科学技术的不断发展,光通信网络成为了网络技术的主要发展趋势,逐渐在通信网络中发挥出显著作用.现阶段,光通信网络中的光网络主要采用基于密集波分复用技术组成,一旦波分数量增加,光网络中的路由选择与波长分配问题就难以解决.本文详细阐述了分层图模型的概念,提出波长可变光网络中的动态RWA算法,并在此基础上分析了动态RWA算法的数值模拟,以在提高波长资源利用率的同时,降低网络阻塞率.     

WDM光网络中动态RWA算法仿真的实现

在WDM光网络中，在给定一组连接请求后，需要为之建立路由并分配波长，这被称为路由和波长分配问题（RWA）。由于当前光网络中的业务呈现爆炸式的增长，而光网络中的可用资源却是有限的，因此如何使用合理的RWA算法来优化网络资源的利用就显得尤为重要。目前已有很多文献提出了基于各种优化目标的RWA算法，也都通计算机仿真的方法测试和评估了算法的性能。计算机仿真是进行算法性能评估的主要手段，但是关于算法仿真的实现，—般的文献都涉及的很少，本文主要研究了WDM光网络中动态RWA算法计算机枋真的实现。     

一种基于改进蚁群算法的光网络波长路由分配算法

路由与波长分配(RWA)是下一代光网络的需要解决的核心问题之一。论文提出了一种基于改进蚁群算法的光网络RWA算法SA-DRWA算法。算法在转移概率中加入了链路的空闲率作为约束条件,同时还引入了随机扰动以防止传统蚁群算法中迭代次数较少时就过早收敛于局部最优路径的缺点。理论分析表明,SA-DRWA算法可以有效地实现光网络中的负载均衡。对不同网络拓扑中算法的性能进行了仿真,结果表明,SA-DRWA算法比传统Dijkstra+FF算法在阻塞率及资源利用率等方面有明显改进,在规则网格型网络中阻塞率和资源利用率分别改善了0.23。     

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

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

波长路由网络选路时的光信号质量限制研究

光网络中,路由与波长分配(RWA)算法是最优化网络性能的核心问题之一,传统的RWA算法都假设光网络的物理层状态是理想的,即不存在光信号传输损伤的问题.通过对这个缺陷的分析,将光信号的传输损伤问题充分考虑到路由与波长分配算法中,从算法的角度来实现对光信号的传输保护,这样做不仅能有效防止业务的物理损伤阻塞,还能极大地提高光网络的性能.     

一种提高光网络攻击容忍性的RWA算法研究

通过研究光网络中带内串扰攻击及其传播原理,在基于串扰攻击有限传播的模型之上,提出了一种限制串扰攻击传播的波长路由分配(Routing and Wavelength Assignment,RWA)算法.该算法把分配后能产生最小串扰攻击传播最大值(Crosstalk Attack Propagation Maximum,CAPM)的波长路由分配给新的光路请求,从而减少全网的潜在的攻击传播范围.仿真结果显示,与常用的首次命中(Fist-fit)RWA算法相比,该算法能显著降低全网的串扰攻击传播最大值,从而提高光网络的攻击容忍性.     

Virtual-node-based multicast routing and wavelength assignment in sparse-splitting optical networks

This paper investigates several problems associated with optical multicast routing and wavelength assignment in sparse-splitting optical networks for interactive real-time media distribution. Unfortunately, the constrained multicast routing with optimized wavelength assignment leads to NP-complete condition. Thus, in this paper, a virtual-node-based multicast routing algorithm is first proposed to satisfy the requirements of interactive real-time multicasting as well as the constraints from underlying optical networks. For the constructed multicast tree, we then associate an effective wavelength assignment algorithm. The experimental results show that the proposed algorithm combination performs well in terms of (1) the wavelength channel cost, (2) the maximum variation of inter-destination node delays, (3) the signal quality, and (4) the number of wavelength conversions.     

Adaptive wavelength routing in all-optical networks

We consider routing and wavelength assignment in wavelength-routed all-optical networks (WAN) with circuit switching. The conventional approaches to address this issue consider the two aspects of the problem disjointly by first finding a route from a predetermined set of candidate paths and then searching for an appropriate wavelength assignment. We adopt a more general approach in which we consider all paths between a source-destination (s-d) pair and incorporate network state information into the routing decision. This approach performs routing and wavelength assignment jointly and adaptively, and outperforms fixed routing techniques. We present adaptive routing and wavelength assignment algorithms and evaluate their blocking performance. We obtain an analytical technique to compute approximate blocking probabilities for networks employing fixed and alternate routing. The analysis can also accommodate networks with multiple fibers per link. The blocking performance of the proposed adaptive routing algorithms are compared along with their computational complexity     

WDM网络中支持QoS的路由与波长分配算法

针对波分复用(wDM)网络中的路由与波长分配问题。提出了一种支持服务质量(QoS)的约束搜索算法。基于多目标规划模型,这种搜索算法可为网络各节点创建路由表,根据路由表信息求出非支配路径集合,从而一次性完成寻找路由和分配波长两项任务。仿真实例证明了该算法的有效性。     

An effective method for blocking performance analysis of WDM all-optical networks

We propose a rational approximation (RA)-based algorithm to perform the blocking analysis of circuit-switched all-optical networks. Our algorithm can be applied to large networks with various topologies and routing and wavelength assignment algorithms. It can be applied to optical networks with either full, sparse, or no wavelength conversion. We also propose fixed-path wavelength assignment algorithms for networks with balanced and unbalanced traffic.     

一种稀疏分光配置约束下的WDM网络多播RWA算法

在波长路由WDM网络中,波长路由和波长分配是RWA算法提高光网络阻塞性能的两个重要阶段和关键技术。文章针对现有的稀疏分光配置约束下的光网络多播RWA算法复杂度高、代价高的问题,提出了一种新的稀疏分光器配置的RWA多播算法。该算法摒弃传统RWA算法在波长路由阶段就考虑稀疏分光约束能力的惯性思维,论文首次提出在波长分配阶段,才通过多播长转换器实现满足稀疏分光约束条件的分光能力传递。仿真结果表明,所提算法在平均代价和所需波长数目方面都获得了较优的性能。     

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

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

波长路由光网络中RWA算法的设计分析

文章通过对波长路由光网络中路由与波长分配(RWA)问题的研究,介绍了求解路由子问题和波长分配子问题的常用方法,总结了3种类型的RWA问题的优化解决方法,最后对目前RWA算法设计中存在的问题进行了分析并阐述了解决此类问题的重要性.     

Design of the optical path layer in multiwavelength cross-connectednetworks

We discuss the wavelength requirement for optical networks based on wavelength-division multiplexing (WDM). A mathematical model, to represent the routing and wavelength assignment in optical networks with or without wavelength conversion, is described, and metrics are defined to express the performance. A new heuristic for routing and wavelength assignment is proposed and compared with the Dijkstra algorithm and with a solution based on integer linear programming. The different techniques are applied to a variety of network examples with different traffic loads     

Efficient routing and wavelength assignment for multicast in WDMnetworks

The next generation multimedia applications such as video conferencing and HDTV have raised tremendous challenges on the network design, both in bandwidth and service. As wavelength-division-multiplexing (WDM) networks have emerged as a promising candidate for future networks with large bandwidth, supporting efficient multicast in WDM networks becomes eminent. Different from the IP layer, the cost of multicast at the WDM layer involves not only bandwidth (wavelength) cost, but also wavelength conversion cost and light splitting cost. It is well known that the optimal multicast problem in WDM networks is NP-hard. In this paper, we develop an efficient approximation algorithm consisting of two separate but integrated steps: multicast routing and wavelength assignment. We prove that the problem of optimal wavelength assignment on a multicast tree is not NP-hard; in fact, an optimal wavelength assignment algorithm with complexity of O(NW) is presented. Simulation results have revealed that the optimal wavelength assignment beats greedy algorithms by a large margin in networks using many wavelengths on each link such as dense wavelength-division-multiplexing (DWDM) networks. Our proposed heuristic multicast routing algorithm takes into account both the cost of using wavelength on links and the cost of wavelength conversion. The resulting multicast tree is derived from the optimal lightpaths used for unicast     

Routing and Wavelength Assignment in Multi-Segment WDM Optical Networks using Clustering Techniques

This paper studies the routing and wavelength assignment (RWA) problem in multi-segment optical networks. The notion of network segment is referred to any part of the network that requires special consideration of wavelength routing such as separate administrative domains in a large scale optical network, sub-networks run by various service providers, etc. In multi-segment optical networks, each segment has different resource availability or hardware characteristics. The differences between multi-segment optical networks and homogeneous optical networks are discussed. We then present a resource abstraction technique called blocking island and define a multi-segment blocking island graph (BIG) network model. Using a minimum splitting routing heuristic introduced in the context of the blocking island paradigm in conjunction with the multi-segment BIG model, we propose a general RWA algorithm that takes a combined view of the network resource to integrate routing, wavelength assignment and gateway selection in a single routing framework. In the simulation, we demonstrate the effectiveness of our proposed algorithm by comparing it with other state-of-the-art heuristics in this area.