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

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

WDM光网络中基于传输损伤的公平RWA算法

在WDM光网络中,物理层上存在使信号传输质量恶化的因素,当信号质量劣化到一定程度会导致连接失败,因此有必要在选路和波长分配RWA（Routing and Wavelength Assignment）算法中考虑物理层的传输损伤。连接公平性问题是指网络中长路径连接请求的阻塞率表现比短路径差,文中分析传输损伤约束的引入对连接公平性的影响,提出基于传输损伤的动态RWA算法：固定波长配额FWQ（Fixed Wavelength Quota）算法和非固定波长配额UFWQ（UnFixed Wavelength Quota）算法。     

波分复用光网络中的波长路由分配策略

路由选择和波长分配是WDM光传输网中非常重要的问题.本文结合交叉连接节点,提出了一种基于最短路径的动态路由选择方案;然后利用这种动态的路由选择策略,以网络的阻塞性能为优化目标分配波长,达到充分利用网络资源的目的.计算机仿真结果表明,无论在单纤或者多纤WDM光传输网络中,利用这种策略的RWA算法优于传统的固定路由和单纯动态路由算法     

WDM中一种基于动态RWA算法的改进

随着掺铒光纤放大器（EDFA）的出现及其迅速商用化的发展，使得波分复用（WDM）技术日益成熟，而路由和波长分配（RWA）问题是WDM网络中的一个重要问题。通过对RWA基本问题的探讨，对EDFA出现的增益饱和现象的分析，找到了FAR算法中所存在的弊端并进行了改进。在文中所提出的新算法中，主要是根据光纤到光纤链路中输入EDFA光信号功率的基础上寻找备选路由，此种算法能够大大降低WDM传输网中的阻塞率。     

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

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

光网络中一种考虑信号损伤限制和服务质量区分的动态RWA算法

在光网络中,光信号沿着路由与波长分配(RWA)算法选定的光通路传输的过程中会受到各种信号损伤的影响而导致信号质量的不断下降,严重影响着业务的服务质量(QoS).而光网络中多样化的客户层业务往往有着不同的QoS的需求,因此有必要根据不同的业务QoS需求对光信号损伤的影响进行不同程度的控制.针对这一问题,提出了一种能同时考虑信号损伤限制和服务质量区分的动态RWA算法,并通过计算机仿真的方法对其性能进行了分析和验证.结果表明:该算法既能克服光网络中信号损伤的影响又能为不同级别的业务提供不同的QoS保证,更贴近实际需求.     

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

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

全光网络中感知信号损伤的RWA算法

在全光网络中，信号沿着光通路在非理想介质中传输时，会引起质量恶化。当达到一定程度时。该光通路不可用。物理层的传输损伤引起连接阻塞。为了提供高质量的连接，路由和波长分配算法需要考虑信号质量。光信噪比和极化模式色散被认为是主要的限制因素。有两种感知损伤的RWA算法：最优路径算法，最先符合算法。     

WDM网络分布式物理损伤感知RWA算法

随着传输速率的不断升级,在透明传送过程中,各种损伤的积累会对光信号的质量造成严重影响,因而不能保证高QoS(服务质量)地传输信号.文章提出一种物理损伤感知的分布式RWA(波长路由分配)算法,将物理层传输质量评估分布在中继段路由和波长信道中,分别由损伤感知路由、波长通道传输质量排序和按优先级分配3部分构成.仿真实例证明了...     

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

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

Impact of transmission impairments on the teletraffic performanceof wavelength-routed optical networks

In a wavelength-routed optical network, a transmitted signal remains in the optical domain over the entire route (lightpath) assigned to it between its source and destination nodes. The optical signal may have to traverse a number of crossconnect switches (XCSs), fiber segments, and optical amplifiers, e.g., erbium-doped fiber amplifiers (EDFAs). Thus, while propagating through the network, the signal may degrade in quality as it encounters crosstalk at the XCSs and also picks up amplified spontaneous emission (ASE) noise at the EDFAs. Since these impairments continue to degrade the signal quality as it progresses toward its destination, the received bit error rate (BER) at the destination node might become unacceptably high. Previous work on the lightpath routing and wavelength assignment (RWA) problem assumed an ideal physical layer and ignored these transmission impairments. The main contribution of our work is to incorporate the role of the physical layer in setting up lightpaths by employing appropriate models of multiwavelength optical devices (XCSs and EDFAs) such that the BER of a candidate lightpath can be computed, in advance, to determine if this lightpath should be used for the call. Features from existing RWA algorithms are integrated with our on-line BER calculation mechanism. Our simulation studies indicate that employing BER-based call-admission algorithms has a significant impact on the performance of realistic networks     

FWM aware evolutionary programming algorithm for transparent optical networks

This paper proposes and evaluates a four-wave mixing (FWM) aware evolutionary programming algorithm for dynamically setting up lightpaths in an optical wavelength division multiplexed network (WDM network). The proposed algorithm also considers the effect of amplified spontaneous emission noise (ASE noise) on a lightpath during propagation of the optical signal from any source to the intended destination. As crosstalk due to FWM and ASE noise are two transmission impairments that degrade the quality of optical signal even at low to medium data rates, it is mandatory for an algorithm for dynamic routing and wavelength assignment in a WDM network to consider the effect of these two impairments on the lightpath to be established. The distinguishing feature of the proposed algorithm is that it is based on an initial population of a single individual and uses a fitness function that is expressed in terms of the number of hops, path cost, variance contributions due to FWM crosstalk, amplifier noise, and different beat noises at the receiver. The performance of a newly introduced FWM aware priority-based wavelength assignment technique is compared with few of the existing wavelength assignment techniques in the present work.     

OSNR comprehensive-awareness model based lightpath control scheme in an OpenFlow controlled all-optical network

To enhance the communication quality of OpenFlow controlled all-optical networks, an optical signal-to-noise ratio comprehensive-awareness (OSNR-CA) model based lightpath control scheme is proposed. This approach transforms main physical-layer optical impairments into OSNR value, and takes this comprehensive OSNR value of the optical signal along the lightpath into consideration, when establishing the lightpath for the connection request using OpenFlow protocol. Moreover, the proposed scheme makes full advantages of the OSNR monitoring function in each node, and assigns the lightpath according to the comprehensive-OSNR value by extending messages of OpenFlow protocol, in order to guarantee the reliable establishment of the lightpath. The simulation results show that the proposed scheme has better performance in terms of packet loss rate and lightpath establishment time.     

Dynamic Routing and Wavelength Assignment in Optical Networks by Means of Genetic Algorithms

We propose a novel genetic algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in wavelength-routed optical networks. The algorithm not only obtains low call blocking probability, but it also employs a very short computation time. Moreover, it is capable of providing fairness among connections, that is, to offer approximately the same quality of service (in terms of blocking probability) for all source-destination node pairs. Since requirements on optical network availability are highly severe, we also propose an extension of the algorithm to provide fault-tolerance capability at the optical layer. It is achieved by means of protection, where each optical connection request is provided with a pair of lightpaths (a primary and a backup lightpath). Again, the genetic algorithm proves to be highly efficient, in this case, at performing routing and wavelength assignment of pairs of lightpaths.     

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

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

自动交换光网络中恢复路径提供机制的研究

为了获得高效的网络生存性能,基于自动交换光网络(ASON)的框架,该文提出了一种新型的可恢复路径选择算法-联合可变权重可恢复路径(JVWR)选择算法,并进行了数值仿真分析,仿真结果表明,此恢复路径选择算法具有明显的业务量均衡能力,并降低了动态连接请求的阻塞概率,同时具有良好的带宽利用率和恢复资源共享效率。该文还对mesh网络业务路径和恢复路径的建立机制进行了讨论,在ASON功能框架之内,基于通用多协议标记交换提出了并行mesh共享恢复路径建立机制,从而较系统地对分布式恢复路径动态建立机制进行了研究。     

QoS aware traffic grooming and integrated routing on IP over WDM networks

In this article, we consider traffic grooming and integrated routing in IP over WDM networks. The challenges of this problem come from jointly considering traffic grooming, IP routing, and lightpath routing and wavelength assignment (RWA). Due to the high bandwidth of optical fiber, there exists a mismatch between the capacity needed by an IP flow and that provided by a single lightpath. Traffic grooming is therefore used to increase the network utilization by aggregating multiple IP flows in a single lightpath. However, traffic grooming incurs additional delays that might violate Quality-of-Service (QoS) requirements of IP users. In this work, the tradeoff between traffic grooming and IP QoS routing is well-formulated as a mixed integer and linear optimization problem, in which the revenue from successfully provisioning IP paths is to be maximized. Problem constraints include IP QoS, routing, optical RWA, and the WDM network capacity. We propose a novel Lagrangean relaxation (LGR) algorithm to perform constraint relaxation and derive a set of subproblems. The Lagrangean multipliers are used in the proposed algorithm to obtain a solution in consideration of grooming advantage and resource constraints simultaneously. Through numerical experiments and comparisons between the proposed algorithm and a two-phase approach, LGR outperforms the two-phase approach under all experimental cases. In particular, the improvement ratio becomes even more significant when the ratio of IP flow to the wavelength capacity is smaller.     

A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion

In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied.     

Distributed Dijkstra sparse placement routing algorithm for translucent optical networks

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed Dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.