光网络中的波带交换技术

波分复用光网络已成为广域骨干网最可行的体系解决方案.波带交换(WBS)因其能减小光交叉连接器的端口数、控制复杂性和连接费用等,引起了广泛的关注.文章指出了WBS和传统波长路由的不同之处,对WBS的两种多粒度光交叉连接器结构进行了分析.文中还提出了基于WBS的各种方案和光路成组策略,讨论了WBS网络中的波带转换和故障恢复问题.     

Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath traffic-grooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.     

A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks

This paper addresses the two-layer dynamic traffic grooming problem in wavelength-division-multiplexed (WDM) mesh optical networks subject to resource constraints and the generalized wavelength continuity (GWC) constraint. The GWC constraint is a relaxed wavelength continuity constraint which incorporates various kinds of wavelength conversion capabilities that exist in optical networks. As an improvement over the existing layered auxiliary graph (layered-AG) approach which represents each wavelength separately in the auxiliary graph, we introduce a largely simplified link bundled auxiliary graph (LBAG) model and propose the SAG-LB method to find paths and assign wavelengths for new lightpaths subject to the GWC constraint. We propose the constrained integrated grooming algorithm (CIGA) based on the LBAG model. A grooming policy influences the resource utilization by determining the weight function of the auxiliary graph. We propose the least resource path first (LR) grooming policy, which is an improvement over the existing grooming policies in the literature, by integrating the wavelength and transceiver metrics together. Simulation results show that the LBAG model achieves a comparable blocking performance with the layered-AG approach while using a significantly less amount of running time. We also present the worst case time complexity analysis of the CIGA grooming algorithm and evaluate the performance of the LR grooming policy by simulation.     

基于GMPLS的动态分布式WDM网状网路由选择算法研究

研究了在基于GMPLS的WDM网络中,当节点不具备波长变换能力并且配备有限个光收发器对时,如何为到达的业务请求建立标记交换路径(LSP)的问题。提出一种以跳数和带宽碎片要求为权重,合理分配带宽资源的新算法。仿真结果表明,该算法在保证用户业务可靠性要求的同时,能够更有效地提高全网资源的利用率,并大大降低网络阻塞的可能性。     

基于OOC的WDM+OCDMA系统性能研究

基于光正交码,研究了WDM+OCDMA系统的性能。采用4个波长信道和3个码字的光正交码OOC(37,4,1),对12个用户的WDMA+OCDMA进行了系统仿真,用户数据速率为1Gbit/s,单模光纤长为50km,色散补偿光纤长为5km。如需增加WDMA+OCDMA的用户数,可以通过增加波长信道数或码字容量来实现。分析了色散效应对WDMA+OCDMA系统性能的影响,研究了用户之间相对延时对多址干扰和系统性能的影响。     

Dynamic Routing in WDM Grooming Networks

Traffic grooming in optical networks has gained significant importance in recent years due to the prevailing sub-wavelength traffic requirement of end-users. In this paper, a methodology for dynamic routing of fractional-wavelength traffic in WDM grooming networks is developed. To evaluate the performance of routing algorithms, a new performance metric that reflects the network utilization is also proposed. The performances of shortest-widest path, widest-shortest path, and available shortest path routing algorithms are evaluated on a class of WDM grooming networks by considering traffic of different capacity requirements. The effect of dispersity routing, where higher capacity requests are broken into multiple unit capacity requests, is also investigated. The most interesting counter-intuitive result that is observed is that increasing the grooming capability in a network could result in degrading the performance of the widest-shortest path algorithm.     

多接口多信道无线网状网的信道动态切换研究

首先介绍了目前常见的信道动态切换方法,并分别分析了他们的优缺点.然后针对他们的通信节点之间需要同步而难以实现或各个节点需要一个公共控制信道来解决数据信道的争用而影响网络吞吐率等缺点,提出了一种基于信道队列的信道动态切换方法.该方法不需同步机制和公共控制信道,每个接口通过信道队列的队头元素产生下次新的切换信道,较好的确保了各信道传输的公平性;QDSAC能使网络中各节点的信道切换序列独立生成,计算代价也小,较好的保证了信道切换序列生成的实时性,从而提高网络吞吐率.     

Signaling Schemes for Distributed Connection Management in Wavelength-Routed Optical Mesh Networks

The next-generation optical transport network will evolve from point-to-point connectivity to mesh networking, which can provide fast and automatic provisioning with enhanced flexibility and survivability. Signaling is used to support connection setup, maintenance, and teardown in such a network. In this paper, we study the performance of two hop-by-hop and one parallel signaling schemes in wavelength-routed optical mesh networks. Based on the sequence between optical crossconnect (OXC) switching and signaling message processing, we classify hop-by-hop signaling into two types that comply with the requirements of GMPLS signaling protocols. These two types are forward before switching configuration (FBSC) and forward after switching configuration (FASC). Also, we propose a parallel signaling scheme that is different from the existing hop-by-hop GMPLS signaling protocols. Considering OXC architectures and traffic patterns, we compare the FBSC, FASC, and parallel signaling schemes using simulation experiments, in terms of network blocking probability and reservation time. The simulation data reveal that the performance of a signaling scheme depends on the nature of the signaling as well as the network setting (e.g., the OXC architecture and traffic pattern). We analyze reasons for this result and discuss tradeoffs between these signaling schemes. This work offers some insight into designing an efficient signaling protocol for wavelength-routed optical mesh networks.     

网状波分复用网络的保护倒换时间分析

保护倒换时间是评估网状波分复用网络保护方法性能的一项重要指标,本文就专门路径保护、共享路径保护以及共享链路保护三种保护方法,分别建立了各自对应的保护倒换时间计算模型,然后分析了影响保护倒换时间的主要因素,并在此基础上提出了相应的优化策略和解决方案,本文结果对于正确选择保护方法具有一定的参考价值.     

WDM网络动态组播业务共享保护算法

该文研究了WDM网络中动态组播业务的保护.为提高网络资源的利用率,降低连接请求阻塞率,和单播业务的共享保护方案类似,组播连接之间也可以共享保护波长.本文提出了一种动态组播业务共享保护算法,并对算法的性能进行了仿真,同时和组播业务专有保护算法进行了比较.仿真结果表明,共享保护算法比专有保护算法使用了更少的波长资源,具有更低的连接阻塞率.     

基于P环的恢复机制在WDM网状网中的应用

目前波分复用(WDM)网状网中所采用的恢复机制的恢复速度较慢,不能满足某些业务的需求。利用空闲容量建立的p环(pmcmtfigured cycles)具有环形网的速度和网状网的容量效率。它的操作方法简单,使用灵活,可以应用于WDM网和IP网等不同的网络。本文详细介绍了p环的基本原理、构造过程及优化方法或讨论了多故障的情形,并对一些新的研究方向作了评述,可供网络设计者参考。     

基于波分复用的智能光网节点管理模型

分析了基于波分复用(WDM)技术的下一代智能光网络中节点管理系统的功能模型和管理任务,给出了一种综合考虑业务分级和支持多径路由的算法,可在WDM光网中实现基于性能分析的资源动态配置管理。采用自行开发的资源动态配置软件进行了仿真实验,给出了仿真结果。     

皮秒脉冲在级联光纤光栅中的传输特性研究

基于波分复用(WDM)系统中级联光纤光栅色散特性,研究了皮秒脉冲宽度以及光纤光栅长度和耦合系数等参数对脉冲压缩的影响;以高斯脉冲为例,运用等效色散的方法数值模拟了皮秒脉冲经过常规光纤和级联光纤光栅的演化过程.结果表明,选择合适的参数,级联光纤光栅可以对在普通光纤中色散展宽的脉冲进行色散补偿.还发现,进一步增加光栅长度,可使脉冲得到有效压缩.     

A Multilayer Optical Packet Switching Network Based on the Kautz Graph and Optical Passive Star Couplers

The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility.     

Reconfiguration and Dynamic Load Balancing in Broadcast WDM Networks*

In optical WDM networks, an assignment of transceivers to channels implies an allocation of the bandwidth to the various network nodes. Intuition suggests, and our recent study has confirmed, that if the traffic load is not well balanced across the available channels, the result is poor network performance. Hence, the time-varying conditions expected in this type of environment call for mechanisms that periodically adjust the bandwidth allocation to ensure that each channel carries an almost equal share of the corresponding offered load. In this paper we study the problem of dynamic load balancing in broadcast WDM networks by retuning a subset of transceivers in response to changes in the overall traffic pattern. Assuming an existing wavelength assignment and some information regarding the new traffic demands, we present two approaches to obtaining a new wavelength assignment such that (a) the new traffic load is balanced across the channels, and (b) the number of transceivers that need to be retuned is minimized. The latter objective is motivated by the fact that tunable transceivers take a non-negligible amount of time to switch between wavelengths during which parts of the network are unavailable for normal operation. Furthermore, this variation in traffic is expected to take place over larger time scales (i.e., retuning will be a relatively infrequent event), making slowly tunable devices a cost effective solution. Our main contribution is a new approximation algorithm for the load balancing problem that provides for tradeoff selection, using a single parameter, between two conflicting goals, namely, the degree of load balancing and the number of transceivers that need to be retuned. This algorithm leads to a scalable approach to reconfiguring the network since, in addition to providing guarantees in terms of load balancing, the expected number of retunings scales with the number of channels, not the number of nodes in the network.     

Virtual Source Based Multicast Routing in WDM Optical Networks

Wavelength-division multiplexed (WDM) networks using wavelength-routing are considered to be potential candidates for the next generation wide-area backbone networks. Multicasting is the ability to transmit information from a single source node to multiple destination nodes and is becoming an important requirement in high-speed networks. As WDM technology matures and multicast applications become increasingly popular, supporting multicast routing at the WDM layer becomes an important and yet a challenging topic. This paper concerns with the problem of optical multicast routing in WDM networks. A few nodes in the network may have wavelength conversion and/or splitting capabilities. In this paper, a new multicast tree construction algorithm is proposed. This algorithm is based on a concept called virtual source. A virtual source is a node having both the splitting and wavelength conversion capabilities. By exploiting the presence of virtual source nodes, the proposed algorithm achieves improved performance. To further improve the performance, the algorithm assigns priorities to nodes based on their capabilities. The effectiveness of the proposed algorithm is verified through extensive simulation experiments.     

WDM网状网中的基于平面构造的业务量疏导算法

将多个低于一个波长带宽的低速业务流复用到一个波长上传输的业务量疏导已经得到越来越多 的研究。WDM/SDH环网中的业务量疏导已得到大量研究,WDM网状网中的业务流疏导问题研究相对较少。该文研究静态环境下波长数目受限的业务量疏导问题,提出了一种基于平面构造的启发式业务量疏导算法。仿真结果表明该算法比已知的算法具有更好的性能。     

多播格状WDM光网络中流量疏导的一种启发性算法

波分复用技术的开发应用及网络业务信息的多样化促进了多播技术的应用和发展.由于网络中波长带宽与节点间业务信息需求之间的巨大反差,使流量疏导成为必要,以节约网络资源和成本.但多播的出现使流量疏导算法变得更复杂多样.本文提出了对多播格状网络中的静态流量进行有效疏导的一种启发性算法,并取得较为优化的结果.     

IP over WDM网中的综合选路算法

研究了IP over WDM网中,当节点不具备波长变换能力并且配备有限光收发器对时,如何利用综合选路(IR)算法为到达业务请求建立标签交换路径(LSP)。提出一种新颖的辅助图模型(AGM)表示网络的当前状态,基于AGM提出一种动态IR算法-最小光收发器对法(MTA)。MTA总是选择占用光收发器对最少的通路来建立LSP,仿真结果表明：与已有算法相比,MTA可以降低全网的阻塞率,从而提高业务通过率,并且有利于减少业务连接所经光／电变换的次数。     

Dynamic Establishment of Segmented Protection Paths in Single and Multi-Fiber WDM Mesh Networks

Wavelength division multiplexed (WDM) networks are matured to provide, scalable data centric infrastructure, capable of delivering flexible, value added, high speed and high bandwidth services directly from the optical (WDM) layer. But, providing fault-tolerance at an acceptable level of overhead in these networks has become a critical problem. This is due to the size of the current and future networks and diverse quality of service (QoS) requirements for multimedia and mission critical applications. Several distributed real-time applications require communication services with fault-tolerance apart from guaranteed timeliness at acceptable levels of overhead. Several methods exist in the literature which attempt to guarantee recovery in a timely and resource efficient manner. These methods are centered around a priori reservation of network resources called spare resources along a protection path. This protection path is usually routed from source to destination along a totally link disjoint path from primary path. This paper considers the problem of routing and wavelength assignment (RWA) in wavelength routed WDM optical networks. In particular, we propose an efficient algorithm to select routes and wavelengths to establish dependable connections (D-connections), called segmented protection paths. Our algorithm does not insist on the existence of totally disjoint paths to provide full protection. We present experimental results which suggest that our scheme is attractive enough in terms of average call acceptance ratio, spare wavelength utilization, and number of requests that can be satisfied for a given number of wavelengths assuming that the requests come one at time, and wavelengths are assigned according to fixed ordering. Furthermore, the results suggest that our scheme is practically applicable for medium and large sized networks, which improves number of requests that can be satisfied and helps in providing better QoS guarantees such as bounded failure recovery time and propagation delays without any compromise on the level of fault-tolerance for a given number of wavelengths and fibers. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed scheme on different networks and compare with existing methods.This work was supported by the Department of Science and Technology, New Delhi, India. An earlier version of this paper was presented at Opticomm 2002 conference, July 29-August 2, Boston, USA.