自相似业务在WDM环网中的动态性能分析

对自相似业务在WDM环网中的动态路由波长分配(RMA)问题进行了研究,以16节点格环网为例对自相似业务在不同波长路由分配策略下的动态性能进行了仿真。分析了单纤和多纤环境下阻塞率随自相似突发度H变化的规律。同时又以性能差异比例函数为依据,比较了不同路由算法间阻塞率的差异,并与相同条件下的泊松模型进行了对比。     

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

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

一种WDM疏导网络动态组播路由算法

对无波长变换能力的波分复用（WDM）疏导网络中的组播路由和波长分配（MRWA）问题进行了研究，提出了动态组播流量疏导算法（DMTGA）。这种算法根据当前网络资源使用情况，结合流量疏导和负载均衡，对链路权重进行动态配置，构建满足组播业务请求带宽需求的组播树。在不同的网络负载下对算法进行仿真，对比分析了DMTGA对业务请求接入率、平均网络资源利用率和全网负载分布的影响。     

WDM网络中的动态路由波长分配

本文对 WDM全光网中的路由波长分配 (RWA )问题进行了分析和研究 ,详细阐述了面向各类业务的路由波长分配策略以及各种动态路由波长算法的设计思想 ,并对各种算法的性能以及时间复杂度等参数进行了分析 ,并在典型拓扑上进行了仿真     

智能光网络中RWA问题的研究

在ASON中,路由和波长分配（RWA）算法是其中一个关键问题。由于当前网络中业务增长迅速,而网络中可用资源有限,因此要使用合理的RWA算法来优化网络资源。分别阐述了静态RWA、动态RwA以及RWA算法中的其它问题,并主要对路由和波长问题进行了分析和研究。     

WDM网络中的动态路由波长分配

本文对WDM全光网中的路由波长分配(RWA)问题进行了分析和研究，详细阐述了面向各类业务的路由波长分配策略以及各种动态路由波长算法的设计思想，并对各种算法的性能以及时间复杂度等参数进行了分析，并在典型拓扑上进行了仿真。     

智能光网络中RWA问题的研究

在ASON中．路由和波长分配（RWA）算法是其中一个关键问题。由于当前网络中业务增长迅速．而网络中可用资源有限．因此要使用合理的RWA算法来优化网络资源。本文分别阐述了静态RWA、动态RWA以及RWA算法中的其他问题．并主要对路由和波长问题进行了分析和研究。     

动态业务条件多颗粒度交换光网络性能研究

本文研究了动态业务条件下基于波带、波长两级交换的多颗粒度光交叉连接节点(MG-OXC)的优化设计,并提出了一种适用于多颗粒度交换光网络(MG-ON)的动态路由、波长分配和业务分组(Traffic Grouping)算法.利用实际网络拓扑对上述MG-ON方案进行了数值仿真实验,比较研究了MG-ON与传统OXC节点构成的波长路由光网络(WRON)的动态业务阻塞率性能,结果表明MG-ON的网络性能可以满足动态业务的要求.     

波分复用全光网络路由和波长分配算法

本文根据波分复用全光网络路由和波长分配（ＲＷＡ）实现过程的不同把算法划分为两大类;路由和波长分配分解法和路由和波长分配并行法。对这两类分别讨论了动态和静态ＲＷＡ算法。     

一种波长转换范围受限全光网中的波长分配算法

本文研究了波长转换范围受限全光网中的动态路由和波长分配问题,提出了一种固定备选路由条件下新的路由和波长分配算法.算法引入了波长相关性的概念,用波长关联权值定量描述了各路由的前后链路上不同波长之间的相互依赖关系.在建立连接时首先使用那些依赖性强,对其他路由影响小的波长,从全局的角度出发选择最优的路由和波长分配方案.计算机仿真表明,本文算法能够适用于稀疏网络和网状网,在均匀业务强度或者大部分业务量来自于长跳路由的情况下,本文算法能够显著降低网络阻塞概率和使用的波长转换器数目,有效提高系统性能.     

自相似业务在波长变换全光网络的动态性能分析

本文对自相似业务在波长变换光网络的动态性能进行了研究。通过在不同的九节点格型网上进行仿真,分析了拓扑类型对动态性能产生的影响,并与相同条件下的泊松业务进行了对比。     

自相似业务下共享通道保护WDM网络性能分析

该文利用随机中点置换-分形高斯噪声(RMD-FGN)方法生成自相似业务,并且利用分层图方法来记录WDM网络状态,提出了一种链路状态描述模型。对自相似业务下55 Mesh_Torus共享通道保护WDM网络性能进行了仿真。结果表明:当业务的自相似系数或方差变大时,也就是说业务的突发程度变大时,阻塞率变大,网络的性能下降。增加单纤波长数,可以降低阻塞率,提高网络性能。     

Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

In this article we investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. Due to the huge amount of traffic a WDM backbone network can support and the large geographic area it can cover, constructing and upgrading such an optical WDM network can be costly. Hence, it is extremely important for network operators to apply traffic engineering strategies to cost-effectively support different bandwidth granularity services using only the appropriate amount of network resources. This requires an optical WDM network to have multigranularity switching capability, and such a network tends to be a multivendor heterogeneous network. However, WDM network heterogeneity increases the difficulty and challenge of efficient traffic provisioning. In this article we present different TE issues that need to be carefully considered in such an optical WDM network, and propose possible solutions and extensions for the generalized multiprotocol label switching optical network control plane. We extend an existing generic graph model to perform efficient traffic grooming and achieve different TE objectives through simple shortest path computation algorithms. We show that our approach is very practical and very suitable for traffic engineering in a heterogeneous multigranularity optical WDM mesh network.     

Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic

In this paper, we consider the problem of designing virtual topologies for multihop optical WDM networks when the traffic is self-similar in nature. Studies over the last few years suggest that the network traffic is bursty and can be much better modeled using self similar process instead of Poisson process. We examine buffer sizes of a network and observe that, even with reasonably low buffer overflow probability, the maximum buffer size requirement for self-similar traffic can be very large. Therefore, a self-similar traffic model has an impact on the queuing delay which is usually much higher than that obtained with the Poisson model. We investigate the problem of constructing the virtual topology with these two types of traffic and solve it with two algorithmic approaches: Greedy (Heuristic) algorithm and Evolutionary algorithm. While the greedy algorithm performs a least-cost search on the total delay along paths for routing traffic in a multihop fashion, the evolutionary algorithm uses genetic methods to optimize the average delay in a network. We analyze and compare our proposed algorithms with an existing algorithm via different performance parameters. Interestingly, with both the proposed algorithms the difference in the queuing delays, caused by self-similar and Poisson traffic, results in different multihop virtual topologies.     

Traffic grooming in mesh WDM optical networks - performance analysis

Traffic grooming is an important task in interworking between the wavelength-division multiplexing (WDM) optical network that supplies "pipes" at the wavelength granularity, and the attached client networks that usually require connections of subwavelength granularity. The focus of this paper is to conduct performance analysis of grooming dynamic client traffic in WDM optical networks with a mesh topology. This paper first briefly introduces the traffic grooming problem in WDM optical networks and the issues related to performance analysis. It then develops two link blocking models, an exact model based on the stochastic knapsack problem and an approximation model based on an approximate continuous time Markov chain (CTMC). The end-to-end performance analysis is conducted using the reduced load approximation. The result obtained from analysis is shown to be accurate compared with the numerical result obtained from simulation.     

Investigations on combined XPM and FWM effects on optical pulse propagation in dynamic IP traffic over WDM networks

The influence of IP bursty traffic on combined nonlinear effects of XPM (cross phase modulation) and FWM (four-wave mixing) in IP over WDM networks are investigated and calculated by solving the nonlinear Schrodinger equation (NLSE) using a novel method under two conditions: on–off Poisson distributed IP traffic and self-similar traffic. Different eye diagrams are obtained under various IP traffic types and input optical powers. When the input power of a single channel is larger than 3 dBm, the effect of IP bursty traffic will deteriorate eye diagrams dramatically in a 40-channel WDM network. We also calculate the FWM powers and interchannel power distribution under different IP traffic loads. Based on the interchannel power distribution, we could find out which channels affect the probe channel seriously by the FWM effect. All these numerical results are useful for the Quality-of-Service (QoS) design, traffic grooming, lightpath routing, and wavelength assignment of IP over WDM networks.     

基于层叠模型的动态组播业务疏导算法

流量疏导对于提高波分复用网络的利用率具有重要的意义.文章基于层叠模型的IP over WDM网络结构,研究了动态组播业务疏导问题,给出了两种动态组播业务疏导方法.仿真结果显示,在IP层和光层都计算最短路径来选取最短路径组建组播树的算法能够获得更低的阻塞率.     

Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks

The bandwidth of a wavelength channel in WDM optical networks is very high compared to the user’s requirements for various applications. Therefore, there is a scope for better utilization of channel bandwidth by traffic grooming, in which several user’s channels are multiplexed for transmission over a single channel. Several research works have been reported on traffic grooming routing and wavelength assignment (GRWA) for static and dynamic traffic pattern under centralized environment. Distributed dynamic grooming routing and wavelength assignment (DDGRWA) is a new and quite unexplored area in WDM optical mesh networks. This article introduces the concept of distributed traffic grooming in WDM mesh networks which also includes virtual topology construction, reconfiguration, routing and wavelength assignment in the distributed environment assuming incoming traffic to be dynamic in nature. We have also presented simulation results of our algorithm on dynamically generated traffic under various network topologies.     

Output power and SNR swings in cascades of EDFAs for circuit- andpacket-switched optical networks

A simple dynamic model of the erbium-doped fiber amplifier (EDFA) that includes self-saturation by amplified spontaneous emission (ASE) is used to analyze the power and signal-to-noise ratio (SNR) transients in wavelength division multiplexed (WDM) optical networks in which signals cross chains of EDFAs from source to destination. The model, which consists of solving sequentially one ordinary differential equation per amplifier, is used to (1) determine power and SNR excursions in the surviving channels along a chain of 35 EDFAs during isolated add-drop events in a 16-channel WDM circuit switching scenario and (2) run Monte Carlo simulations of the first five EDFAs of the same chain fed by burst-mode packet switching traffic on each of the 16 channels. Each packet source is modeled as an ON-OFF asynchronous transfer mode (ATM) source, with ON and OFF times having a heavy-tailed Pareto distribution. The aggregate source model is asymptotically self-similar, and well describes multimedia packet communications. The results are used to examine the influence of average network utilization and source ON-OFF time variance on the probability density function of signal power and SNR at each EDFA output. We demonstrate that self-similar traffic generates sizable power and SNR swings, especially at low network utilization. The simulations also indicate sizable broadening of the power and SNR density functions along the cascade of EDFAs, reaching levels in excess of 9 dBm and 4 dB for the power and SNR swings, respectively, at the 5th EDFA. The effect becomes more pronounced for longer EDFA chains. Such a large broadening may imply serious system impairments in burst-mode WDM packet networks     

IP over WDM网络联合恢复策略的研究

文章对动态自相似业务在多纤IP over WDM 网中的联合恢复问题进行了系统的研究,提出了3种联合恢复策略,算法的实现基于一种扩展的多纤分层图模型.通过大量的动态仿真实验,以业务中断率和恢复效率为性能指标,研究了上述3种恢复策略在不同自相似参数(突发度、均值和方差)中的性能,最后通过分析和比较得出联合通道恢复策略是最优的.