WDM波长路由光网络的波长分配算法

由于WDM网络中的传输和交换是以波长为粒度进行的。因此波长分配算法就成为光网络的研究热点。有效的算法可大大提高波长的利用率，并可充分挖掘WDM的带宽资源。介绍了WDM全光网络中静态和动态波长分配算法，尤其是结合大型网孔网络详述了几种动态波长分配算法。针对波长变换器在全光网络中的应用。提出了一种可以解决任意类型光网络的分层图算法，它可以一次性解决路由选择和波长分配问题，大大提高了该算法的效率。是未来光网络中非常有前景的一种波长分配算法。     

波长共享的WDM无源光网络

提出了波长共享的WDM无源光网络的系统结构及其媒质接入协议.这种方案结合了波长路由和功率分割,控制信道采用随机接入,并使用先到先服务的调度策略有效地分配上行带宽.分析了系统中的分组延时,数值计算表明系统具有良好的延时特性.     

WDM光网络安全生存机制研究

针对WDM光网络安全生存性问题的故障的发现、定位和恢复三个重要环节之中的恢复问题,提出了一种WDM光层中的安全保护与恢复方案。采用了恢复路由选择算法和恢复波长分配算法,提出了一种混合的多层恢复机制,从而构建了一种从故障的发现、定位到故障恢复的覆盖各环节的连续性光网络安全生存机制,并在理论上进行了性能比较。     

考虑非线性效应的路由与波长分配算法

本文研究了在波长路由的智能光网络中选择路由与波长分配(RWA)过程中如何考虑非线性效应的影响.在简要分析了考虑非线性效应影响的必要性后,以交叉相位调制为例推导出了一种简单的计算非线性效应引起的光功率代价计算公式,并讨论了如何将其引入路由与波长分配算法中.仿真结果表明非线性效应确实对RWA的优化结果产生一定的影响,其程度与物理拓扑、业务需求和具体的网络传输参量有关.     

自相似业务下WDM光网的动态阻塞性能

研究了在自相似业务下,WDM光网的动态路由和波长分配问题以阻塞率为判据,通过大量的数字仿真试验分析了WDM光网在不同路由策略下,相对于自相似业务的Hurst参量和标准偏差参量的动态性能此外,对在泊松业务和自相似业务下的WDM光网的动态性能做了比较。     

全光通信网的计算机仿真设计

为了规范、设计、仿真和优化全光通信网,开发一套功能强大的光网用计算机辅助设计软件(OCAD)是十分必要的.在本文里,我们总结了两种用来设计、优化WDM全光网O-CAD的方法:频域分析法(FDA)和时域分析法(TDA).最后基于SHAONET全光通信试验平台,开展了初步的OCAD设计工作,结果表明它对于设计和分析全光网的性能是十分有用和有效的.     

光传送网中结合传输损伤的路由和波长分配

在波长路由光网优化设计的过程中考虑了物理传输损伤造成的限制,提出了一种联合优化思路.将光信号在传输过程中的物理损伤作为问题公式的另一维约束,给出了相应的启发式算法,并按照由粗到细的机制对所提出的思路做了相应的评估,同时对负荷平衡问题作了初步的分析.数值结果表明这种算法可以获得与优化值相近的波长需求解,并且能够保证网络的传输性能,其业务分布随着备选路径的增加而趋向均衡.     

基于相向工作方式下交叉增益调制型波长转换器特性的研究

全光波长转换器是密集波分复用系统中的关键光电子器件,也是混合WDM/OTDM光网络实用化的关键部分。从脉冲传输方程和载流子密度方程出发,详细分析了相向工作方式下交叉增益调制型波长转换器转换后光的消光比和啁啾特性。在分段动态模型中考虑了剩余端面反射和自发辐射噪声的影响,模拟结果为交叉增益调制型波长转换器的性能优化提供理论依据。     

可编程控制的全光磁调谐多路上／下载复用器

研制了一种新型的用于WDM全光网的全光型上/下载复用器，由一对相同的光纤环行器、串接其间的可调谐光纤Bragg光源、WDM复用器和解复用器构成。其中光纤Bragg光栅是用紫外光直写方式在普通单模光纤上制成。讨论了该利用器的工作原理、结构设计、性能和特点。利用磁极间磁场力使光纤光栅产生显著的波长偏移。用可编程磁 极调控光栅的波第偏移。其信道波长调谐速度快，装置无需外加能源即可保持信道波长的偏移。给出了其性能测试结果。信道波长间隔0.8nm，上/下载信道插入损耗1.5dB，通过信道插入损耗2.0dB，上/下端口隔离度30dB，串扰小于-30dB，可调谐信道波长范围6.0nm。其特点是结构简单，可靠。可实现信道波长再利用，从而提高网络的灵活性。     

用于解决大规模波长路由光网中路由和波长分配问题的新启发式算法

本文提出了一种新的启发式算法,它将路由和波长分配问题分解为两个子问题分别进行优化求解,并以最小化波长需求作为目标函数。在不同通信负荷的情况下,我们以NSF网为例,分析了波长通道(WP)和虚波长通道(VWP)路由方案之间在波长需求方面的差别。同时还研究了网络波长重用度的问题。数值结果表明所提出的算法可有效地应用于大规模波长路由光网。     

Fault-tolerant routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we investigate the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We propose a mechanism, which is used to combat multiple link failures. A routing and wavelength assignment algorithm has been proposed with the name of fault-tolerant routing and wavelength assignment algorithm. The comparison of this algorithm has also been made with the best-fit and first-fit algorithms. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

全光网络中动态业务下的阻塞性能分析

通过对自适应路由和动态备选路由算法的性能分析,研究了波长选择和波长交换这两种类型的全光网络在动态业务下的阻塞性能,并提出了将动态波长分配与自适应路由选择相结合的算法.数值结果表明:1)相比波长交换网络而言,多纤波长选择网络是更为经济且切实可行的选择;2)动态备选路由算法可以获得与自适应路由算法相似的性能,并且文中所提出的算法能够更好的提高网络的阻塞性能.分析表明:不同算法的性能与网络拓扑的连接度以及备选路由的数目密切相关.     

Routing and wavelength assignment in WDM networks with dynamic link weight assignment

We consider the routing and wavelength assignment problem on wavelength division multiplexing networks without wavelength conversion. When the physical network and required connections are given, routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. In this paper, we have proposed three dynamic link weight assignment strategies that change the link weight according to the traffic. The performance of the existing trend and the proposed strategies is shown in terms of blocking probability. The simulation results show that all the proposed strategies perform better than the existing trend.     

Routing and wavelength assignment algorithms for multiclass WDM optical networks

In this paper dynamic routing and wavelength assignment strategies have been proposed for multiclass WDM optical networks. Multiclass optical networks provide multiple classes of services to the subscriber according to the requirement, which in turn increase operational profitability. Each class of service could be characterized by parameters like number of wavelengths, expected call holding time and average arrival rate of request. The proposed strategies have been analyzed and compared with existing strategies on the basis of blocking probabilities for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategies “Fixed shortest/alternate shortest path routing with wavelength reservation (FSASWR)” and “Fixed alternate shortest path routing with least priority wavelength assignment (FASPL)” are much better as compared to existing strategies. Proposed strategies minimize blocking probability of the multiclass network using limited number of wavelengths.     

Translucent Optical Networks Design for Static Traffic

A routing and wavelength assignment algorithm is proposed to minimize the number of wavelengths and transceivers required simultaneously under static traffic in translucent optical networks design.     

Optical Communications Research Activities at COM RD1 Siemens S.A.

This article summarizes the research activities carried out by the R&D Optical Networks Communications group (COM RD1), at Siemens S.A., in collaboration with both universities and other research institutes. These activities cover various aspects of advanced modulation formats, all optical wavelength conversion, optical quality of signal monitoring in transparent WDM networks, routing, and wavelength assignment in optical networks.     

Static and dynamic routing and wavelength assignment algorithms for future transport networks

In this paper, two static and three dynamic routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment (RWA) algorithms reduce the blocking probability to maximize the utilization of network. For dynamic algorithms, first a model with no weights assignments is presented and then three algorithms are proposed and analysed with weight assignment resulting in reduction of blocking probability. All these algorithms are analysed and compared with four wavelength assignment schemes which are first-fit, random, most used and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability. For dynamic routing, it has been shown that our proposed algorithm “less weight to maximum empty and nearest” gives the least blocking probability as compared to the other dynamic routing algorithms for random, most used and least used wavelength assignment strategies.     

Survivable routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we have investigated the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.