Distributed control based routing and wavelength assignment strategy for WDM optical networks

Wavelength-division-multiplexing (WDM) is emerging as the dominant technology for the next generation optical networks. The control strategy can be either centralized or distributed. In centralized control, there is a central controller to keep track of the state of the network. It is also responsible for selecting the path for data transmission. Most of the work done in this field is based on centralized control. For large networks, distributed control is preferred over centralized control because of low control overhead. Distributed control strategy requires exchange of control messages among nodes. The distributed control generally results in the possibility of resource reservation conflicts among simultaneous path establishments and poor resource utilization. In this paper, we have proposed one distributed control based routing and wavelength assignment strategy that avoids the problem of resource reservation conflicts along with the efficient utilization of resources.     

Variable cross-correlation code construction for spectral amplitude coding optical CDMA networks

We present, for the first time, several aspects of incoherent optical code-division multiple access (OCDMA) codes, focusing on the flexible variable cross-correlation code allocation and its potential for future optical networks. We briefly present a new version of the Random Diagonal (RD) codes for Spectral-Amplitude Coding (SAC) OCDMA approaches. We then concentrate on the properties specific to such schemes allowing for its increased scalability and flexibility. The main coding properties are reviewed. The RD codes provide simple matrix constructions compared to the other SAC-OCDMA codes such as Hadamard, MQC and MFH codes. This code possesses such a numerous advantages, including the efficient and easy code construction, simple encoder/decoder design, existence for every natural number n, and variable in-phase cross-correlation and easy to implement using Fiber Bragg Gratings (FBGs). Finally, a new detection scheme called “NAND” detection is developed for the variable cross-correlation RD code.     

Restoration approach in WDM optical networks

Critical applications require proactive-based survivability strategy which provides 100% degree of survivability, low blocking probability and very low restoration time. In this paper, we have proposed an efficient proactive restoration approach for WDM optical network that efficiently utilizes the resources and reduces blocking probability as compared to existing proactive restoration approach. It gives priority to primary lightpath as compared to backup lightpath because primary lightpath should not share resources with other lightpaths in critical applications but backup lightpaths can share the resources, i.e. backup multiplexing.     

Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion

In this paper, a new algorithm for wavelength assignment has been proposed and its performance is evaluated in terms of blocking probability and fairness. It has been shown that the proposed algorithm offers the least blocking probability. The blocking performance of wavelength division multiplexing (WDM) network has been analyzed for the network having 10 nodes and for varying loads. As the load per link (in Erlangs) increases, the blocking probability increases. The result shows that the performance of first-fit algorithm is better than random algorithm whereas the proposed algorithm offers the least blocking.     

All-optical add-drop node for optical packet-switched networks

We have demonstrated all-optical packet add-drop for all-optical packet-switched networks. Intelligent all-optical add-drop of packets is performed, based on all-optical processing of packet headers. The header and payload rates are 5 and 10 Gbits/s, respectively.     

Tunable holographic components in WDM optical networks

This paper describes the applications of a multipurpose holographic device in optical networks with Coarse and Dense Wavelength Division Multiplexing (CWDM/ DWDM) technologies. In its basic structure, it can operate as a tunable wavelength filter, wavelength multiplexer or λ router. By using a more complex structure, the device works as OADM (Optical Add Drop Multiplexer) or OS (Optical Switch). Some simulations of the basic devices, from the optical transmission point of view, are made to match the transmission parameters for the application in optical networks. Performance parameters of the device, like switching time, losses, cross-talk or polarization insensitivity are analyzed and compared with other multiplexing or switching technologies. To complete the review of these components, a study of computer generated holograms (CGH) design is carried out. The results are used in the design of holographic devices to perform different applications: in Metro networks, where a design of a holographic device with wavelength conversion and routing is analyzed, or, in Access Networks like a tunable filter or demultiplexer in Fiber to the Home/Business (FTTH/FTTB) topologies.     

Impairment-aware traffic grooming in WDM optical networks

<正>A novel heuristic algorithm that considers transmission impairment(especially amplified spontaneous emission(ASE) noise) is developed for traffic grooming in wavelength division multiplexing(WDM) optical networks.Span constraints,which are determined by the impairment,are added to constrain the maximal transparent reach limit of a lightpath.Under span constraints,a series of short lightpaths will be built up explicitly to relay traffic when a single lightpath cannot meet the requirement of transmission quality.Both problem formulations and heuristic algorithms are given for impairment-aware traffic grooming.Numerical results show that the successful routing of each low-speed traffic stream is guaranteed and the efficiency of wavelength channels and lightpath usage are both improved by considering transmission impairment.     

Provisioning for restorable WDM optical networks

Restoration is a very critical issue in WDM optical networks. Provisioning also plays a great role in the networks because it deals with resource allocation. In this paper, we have presented two provisioning strategies for restorable networks: unity link weight strategy and varying link weight strategy. The strategies are implemented for critical applications which require 100% degree of survivability. The simulation is done using different proportionate of resources for working and restoration lightpaths. The simulated results show that the performance of the unity link weight strategy is much better than the varying link weight strategy in terms of resource requirement and blocking probability.     

WDM全光网络中一种分布式路由及波长分配协议

在全光网络中,光信号在全光域内传输,避免了光-电转换带来的延迟,因此全光网支持高数据率传输并提供巨大的网络容量。WDM(波分多路复用)技术的采用使得高速光传输线路与低速终端处理设备之间能够相互兼容。探讨了WDM全光网中的路由及波长分配问题,提出了一种用于WDM网络中的分布式路由及波长分配协议,具有开销小、阻塞率低以及良好的可扩展性,是一种比较实用的RWA协议。     

WDM网络中基于多核心的组播路由算法

提出了一种WDM网络中组播的分布式路由算法。该算法是一种基于核心树的算法,其关键是找到一个核心节点集,使得以该核心节点集为树根、包含组中所有节点的树满足延迟时限的要求,同时使树的成本尽量小。算法首先根据目的节点确定组中的核心节点集,并生成核心节点内部的稳定树;然后以核心节点集为树根构造包含所有目的节点的组播核心树。由于采用了分布式的方法建立核心树,并且采用的是多个核心,所以在一定程度上减少了建立组播树所需要的时间,并且有效地解决了系统在核心处的瓶颈问题。     

Delay-constrained anycast routing problem in WDM networks with wavelength conversions

Anycast routing and wavelength assignment problem has been intensively studied in wavelength-division multiplexing (WDM) networks, however, real-time application where packets have explicit expiration deadlines is not taken into consideration. In a WDM network, each link is associated with limited wavelengths available for channel connections. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay of message transmission. When the network and the set of anycast routing requests are given, the delay-constrained wavelength conversions anycast routing (DWCAR) problem is to find a set of light-paths, one for each source, for anycasting message to one member of the anycast destination group. The objective is to find a minimum number of wavelength conversions with the constraint that the sum of delays along every path must not exceed a given delay-bound. In this paper, we present a Tabu-search based delay-constrained anycast routing algorithm (TSDA) to solve this NP-complete problem, and compare it to a simple K shortest path based anycast algorithm (KSPA). Simulation results show TSDA achieves an average 40–50% improvement in required wavelength conversions.     

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

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

Wavelength assignment algorithms for WDM optical networks

In this paper, we have proposed an efficient wavelength assignment algorithm for dynamic provisioning of lightpath. This proposed algorithm is based on most-used wavelength assignment algorithm. We have also suggested a mathematical model for WDM optical networks for minimization of blocking probability. The results of proposed algorithm and suggested model are then compared with the conventional wavelength assignment algorithms such as first-fit, best-fit, random and most-used wavelength assignment algorithms. These proposed approaches are very effective for the minimization of blocking probability of optical WDM networks.     

Ultra-fast tunable optical filters for WDM networks

One missing component in the next generation optical communications link is an ultra-fast tunable filter. This is a crucial element in dense wavelength division multiplexing systems. Here, a novel fiber loop configuration is proposed, which operates as such a filter. The filter implementation is based upon currently available technologies. It is shown that with the suggested technique, optical selective elements can be generated with a tuning speed of a few nanoseconds. This is three orders of magnitude faster than other currently available filters. The filter can be designed as compact and is immunized to external instabilities. Using compound configurations, the filter can be designed with a very wide range of filter finesse and free spectral range.     

A novel hop constrained sub-path protection routing algorithm in WDM networks

The survivable design is a key issue in reliable WDM optical networks to assure the service guarantee to customers. The sub-path protection metrics can achieve shorter failure recovery time than path protection metrics for a modest sacrifice in resource utilization. Rather than the conventional equal-length sub-path protection metrics (CDR algorithm), in this paper we propose a novel heuristic dynamic hop constrained sub-path protection (HCSPP) routing algorithm to provide a more flexible way to compute the primary sub-paths and the backup sub-paths. The main idea of HCSPP is that we first compute the primary path and its end-to-end backup path, the found primary and its end-to-end backup path constitute a protection cycle, then we partition the protection cycle into several smaller protection cycles by the straddling paths we introduced, the hop count for each small protection cycle should be constrained in a threshold value and the value can be adjusted according to different network topologies or different management policy, thus we can control the tradeoff between the failure recovery time and the resource utilization ratio. Compared with the CDR [P.-H. Ho, J. Tapolcai, T. Cinkler, IEEE/ACM Trans. Networking 12 (6) (2004) 1105] algorithm, HCSPP can achieve a better compromise between the blocking probability and the failure recovery time. We evaluate the effectiveness of the HCSPP and the results are found to be promising.     

Power control of optical CDMA star networks

In this paper, we apply the power control concept to optical CDMA star networks. Two approaches are considered, namely, centralized and distributed power control. Both approaches are used to optimize the optical transmit power and to maximize network capacity in terms of the number of users satisfying a target signal to interference (SIR) ratio. Centralized algorithms result in the optimum power vector while distributed algorithms are more suitable for practical system implementation and eliminate the need for a centralized control node. Both analytical and simulation results show significant improvement in the performance of the power controlled optical CDMA system. For instance, in a network of 31 nodes, a doubling of the capacity as compared to the non power control case is obtained. Furthermore, we show in the interference-limited case that the network performance is upper bounded by the number of nodes and the correlation properties of the employed code rather than network attenuation and optical fiber lengths. The concept of network partitioning is then introduced to simplify optimum power calculations. Using network partitioning, we find in the interference-limited case that the optical fibers after the star coupler are irrelevant to the optimum power evaluation.     

Survivability strategies with backup multiplexing in WDM optical networks

In this paper, we have presented four variations of applying the same routing algorithm for primary and backup lightpaths, wavelength assignment strategy for survivability. The simulation results show that although everything is the same, yet how and when they are applied leads to variations in results in terms of number of connections accepted. The backup multiplexing technique has been incorporated to reduce the blocking probability in all the strategies. The results have been calculated both for the systems that require 100% degree of survivability, i.e. critical, and for those that do not. The variation to be used depends upon whether the application is critical or not.     

A new multi-granularity traffic grooming routing algorithm in IP over WDM networks

In IP over WDM networks, since there is a large bandwidth gap between a wavelength capacity and the actual bandwidth required by each user, it is necessary to multiplex low-rate traffic streams (LRSs) into lightpaths by traffic grooming. However, with the number of wavelengths increases, a large number of all optical (OOO) transmitting ports are consumed. Meanwhile, the multi-hop grooming with incorporating full-wavelength conversion capacity in each node requires too many optical-electrical-optical (OEO) ports inevitably. To solve theses problems, waveband switching and intra-band wavelength conversion are proposed. By integrating traffic grooming and waveband switching, this paper devises a new multi-granularity traffic grooming mechanism with the function of intra-band wavelength conversion. Based on the proposed mechanism and integrated grooming policy (IGP), a new heuristic routing algorithm called multi-granularity traffic grooming based on integrated auxiliary graph (MGIAG) is also proposed since the traffic grooming problem is NP-hard. Simulation results show that, compared to traditional integrated grooming algorithm (IGA), MGIAG can save more ports and obtain lower blocking probability. Compared to traditional single-hop traffic grooming algorithm (SHA), lower blocking probability and more savings in transmitting ports can be achieved by multi-hop grooming in MGIAG and IGA although they consume more OEO ports.     

An efficient algorithm for optimal manycast routing problem over WDM networks

In this paper, we discuss the problem of supporting resource optimization of manycasting service over wavelength division multiplexing (WDM) optical networks. Manycast is a novel group communication paradigm wherein the source is required to send data packets to a certain number of a set of pre-specified group members. Since it integrates the characteristic of multicast and anycast, manycast is attracting increasing interest from researchers over wavelength division multiplexing (WDM) optical networks. Splitter, cost, wavelength channel are three parameters which are taken into consideration for the first time in WDM. Finding a manycast tree which span the resource and selected nodes with minimum number of splitter, cost and wavelength channel is an NP-complete problem, and therefore we propose a simple and efficient heuristic solution: based-frequency manycast routing (BFM) algorithm to construct manycast trees with the aim of reducing the use of network resources. For a set of manycast requests, the simulation result shows BFM builds manycast trees with the smallest number of resources than other algorithms.     

Optimal design of virtual topology reconfiguration in WDM optical networks

Virtual topology of WDM optical networks is often designed for some specific traffic matrix to get the best network performance. When traffic demand imposed on WDM optical networks changes, the network performance may degrade and even become unacceptable. So virtual topology need to be reconfigured. In previous works, virtual topology is reconfigured to achieve the best network performance, in which a large number of lightpaths need to be set up or torn down. In this paper, we try to get a tradeoff between the network performance and traffic disruption (or implementing cost). The problem of virtual topology reconfiguration for changing traffic patterns is formulated as an optimization problem and a mixed integer linear programming (MILP) algorithm is presented. Numerical results show that a large cost reduction of reconfiguration can be achieved at the expense of network performance.