Wavelength Conversion in WDM Optical Networks: Strategies and Algorithms for Limiting the Number of Converters in the Optical Cross-Connects

This paper considers the problem of wavelength conversion in optical networks using wavelength division multiplexing technique. In the previous literature, two main wavelength routing and assignment strategies have been introduced: wavelength path (WP) and virtual wavelength path (VWP), depending on whether the signal stays on the same wavelength or is converted to another during its travel throughout the network. While the former method does not require any wavelength conversion, the latter needs wavelength conversion in each optical node and, in particular, a wavelength converter per each signal handled by the node itself. From the previous literature emerged that the VWP leads to optical cross-connect (OXC) with lower dimensions compared to the ones required by the WP scheme, and that the difference between the WP and VWP schemes increases as the number of wavelengths carried by each fiber increases. In this paper a new strategy is introduced, named partial virtual wavelength path (PVWP), with the related wavelength routing and assignment algorithm, which makes limited use of wavelength conversion compared to the VWP scheme, and allows the same advantages of VWP to be attained with lower OXC dimensions. The paper reports a comparative analysis among the different strategies, considering both the cases of a network without failures and a network with the possibility of failure restoration. The main result is that the proposed PVWP strategy allows the same advantages of the VWP scheme with a strongly reduced number of wavelength converters (around 5% of the number required by VWP scheme). This figure does not vary appreciably if failure restoration is considered. The new strategy can be adopted by using an opportune OXC architecture, as illustrated in the paper, which allow a limited number of converters to be shared among all the channels as a common pool.     

Optical path cross-connect system scale evaluation using pathaccommodation design for restricted wavelength multiplexing

The optical path (OP) technology, which employs both wavelength-division multiplexing and wavelength routing, will be the key to enhanced network integrity and an ubiquitous broadband integrated services digital network (B-ISDN) in the future. To construct the OP network, path accommodation design that can solve simultaneously the problems of path routing and wavelength assignment must be established. Since optical wavelengths are scarce resources, even with state-of-the-art technologies, the available number of wavelengths that can be multiplexed into a fiber is restricted to a relatively small number. This entails space division multiplexing with multiple fibers in the link in order to accommodate the large number of paths within a link. This paper proposes novel OP accommodation design algorithms that can heuristically establish wavelength paths (WPs) or virtual wavelength paths (VWPs) in the network, where each link is composed of multiple fibers. These algorithms minimize the average number of fibers (in other words, cross-connect ports) handled at the WP/VWP cross-connect nodes and enable us to obtain the required OP cross-connect (OPXC) system scale at each node in WP/VWP networks. Algorithms that consider failure restoration are also proposed. Some WP/VWP accommodation designs over a polygrid network are simulated using the proposed algorithms. The difference between the WP and VWP schemes in terms of the required OPXC system scale with and without considering failure restoration is quantitatively evaluated for the first time     

Network performance and integrity enhancement with optical pathlayer technologies

Path layer technologies will play a key role in the development of a powerful and failure resilient B-ISDN. So far, they have been based on electrical technologies. This paper highlights WDM/FDM techniques and demonstrates that optical paths can greatly enhance the path layer capability and, therefore, the network performance. It is also shown that effective network failure restoration can be achieved with optical paths. The applicability of the wavelength path (WP) technique to global area networks is revealed by comparing different optical path realization techniques. WPs are applied to the national backbone network example to evaluate the required number of wavelengths, and to identify optical cross-connect node requirements. It then proposes a new optical path concept: the virtual wavelength path (VWP). In the VWP scheme, wavelengths are assigned on a link-by-link basis. In other words, the wavelength assigned to a wavelength path has only local significance. Significant benefits of the VWP such as the simplified path accommodation design within a transmission facility network and the reduced number of wavelengths needed, are elucidated. An optical cross-connect node architecture that enables the VWPs is also proposed. The architecture allows the VWP concept to be realized with commercially available optical technologies. The optical path layer concept proposed exploits and consolidates the layered transport network architecture and optical technologies, and will open up new opportunities for creating a B-ISDN that is bandwidth abundant and has a high degree of integrity     

Photonic transport networks based on optical paths

This paper explores the technologies that will enable a further leap forward in transport network evolution. First, requirements of the future transport network are elucidated. Existing network cost is evaluated and the viable means to reduce transport network cost are identified. It is demonstrated that optical path technologies such as WP (wavelength path) and VWP (virtual wavelength path) will play a key role in this. They enhance not only transmission capacity but also cross-connect node throughput cost-effectively by capitalizing on the wavelength routeing scheme. Optical path realization technologies focusing on optical path cross-connect systems are examined. Requirements for the optical path cross-connect system are then elucidated, and a new cross-connect system architecture is evaluated. The architecture exploits PLC (planar lightwave circuit) and other commercially available technologies suitable for large-scale production. The evaluations include cross-connect node upgradability, modular growth capability, total node cost, optical loss and switching power consumption. It is proved that the architecture has significant advantages over existing switch architectures. The optical path technologies provided in this paper will pave the way for a new transport network paradigm, a ubiquitous, bandwidth-abundant and affordable broadband ISDN.     

Optical path cross-connect system architecture suitable for largescale expansion

This paper proposes, for WPs (wavelength paths) and VWPs (virtual wavelength paths), a new OPXC (optical path cross-connect) architecture suitable for constructing large scale OPXC systems. The architecture is based on the multimodule concept and uses main modules and junction modules. The proposed OPXC is shown to provide triple the throughput of the conventional OPXC (delivery and coupling switch based) assuming state-of-the-art commercially available devices. It allows traffic demand increases to be supported with less OPXC switch hardware compared to the conventional OPXC architecture. The proposed architecture also keeps the advantages of the conventional architecture: a high level of expandability with regard to incoming/outgoing links and upgradability from a WP network to a VWP network. Thus the proposed OPXC architecture is highly flexible and allows minimum investment to encourage introduction while gracefully supporting future system scale expansion with incremental growth matching the traffic demand     

Virtual wavelength path cross-connect based on optoelectronicwavelength conversion

This paper describes the system design and performance of a virtual wavelength path cross-connect (VWP-XC); we demonstrate its function of wavelength conversion, cross-connection, and transportation. We realize a feasible wavelength conversion technique using an optical receiver and a tunable DBR laser. Frequency stability of a 100 GHz-spaced wavelength-converted signal is confirmed by a multiwavelength simultaneous monitoring circuit (MSMC) to be within 100 MHz. VWP cross-connection and error free transportation over 160 km and four 120 km spans (480 km with 3 repeaters) is confirmed in a five-node VWP network     

Link-State-Based Algorithms for Dynamic Routing in All-Optical Networks with Ring Topologies

The increased usage of large bandwidth in optical networks raises the problems of efficient routing to allow these networks to deliver fast data transmission with low blocking probabilities. Due to limited optical buffering in optical switches and constraints of high switching speeds, data transmitted over optical networks must be routed without waiting queues along a path from source to destination. Moreover, in optical networks deprived of wavelength converters, it is necessary for each established path to transfer data from source to destination by using only one wavelength. To solve this NP-hard problem, many algorithms have been proposed for dynamic optical routing like Fixed-Paths Least Congested (FPLC) routing or Least Loaded Path Routing (LLR). This paper proposes two heuristic algorithms based on former algorithms to improve network throughput and reduce blocking probabilities of data transmitted in all-optical networks with regard to connection costs. We also introduce new criteria to estimate network congestion and choose better routing paths. Experimental results in ring networks show that both new algorithms achieve promising performance.     

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

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

Reliable Multi-hop Routing with Cooperative Transmissions in Energy-Constrained Networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks.     

基于改进蚁群算法的卫星光网络波长分配方法

路由与波长分配是下一代光网络的需要解决的核心问题之一。本文采用智能蚁群算法,研究了卫星光网络的路由与波长分配问题,为通信请求寻找最优的数据传输光路径。基于请求区域受限策略(Restricted Request Area,RRA)和链路波长负载平衡策略,建立了考虑传输延迟和波长连续性约束的双主星分布式星群节点结构光网络系统模型。利用智能蚁群路由和波长分配(Smart Ant Colony Routing AndWavelength Assignment,SAC-RWA)算法求解系统模型,以找到具有稀疏波长转换的卫星光网络中最小成本波长路径。所提出的算法允许单个蚂蚁同时完成路由和波长分配,仿真结果表明,RRA能够明显改进卫星光网络的性能,以略微增加拥塞率的代价显著降低了计算复杂度。     

A RWA Algorithm for Differentiated Services with QoS Guarantees in the Next Generation Internet based on DWDM Networks

A major challenge in next generation Internet (NGI) backbone networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. This paper proposes a new routing algorithm called multi-wavelength minimum interference path routing (MW-MIPR) to provide more reliable QoS guarantees by consideration of the potential future network's congestion status. This improves wavelength utilization by choosing a route that does not interfere too much with potential future connection requests. Moreover, we introduce a differentiated routing and wavelength assignment (RWA) mechanism combined with recovery strategy and the proposed MW-MIPR algorithm based on the differentiated service model in the NGI. Simulation results show that the proposed MW-MIPR algorithm achieves a smaller blocking probability than dynamic routing (DR) that yields the best performance among previous RWA algorithms. And we prove that a differentiated RWA combined with a recovery capability together with the proposed routing scheme provides satisfied QoS assurance for each service class in terms of signal quality and survivability.     

An efficient algorithm for virtual-wavelength-path routing minimizing average number of hops

We present a novel heuristic algorithm for routing and wavelength assignment in virtual-wavelength-path (VWP) routed wavelength-division multiplexed optical networks. We are the first to take up the approach of both minimizing the network cost, as well as maximizing the resource utilization. Our algorithm not only minimizes the number of wavelengths required for supporting the given traffic demand on any given topology, but also aims to minimize the mean hop length of all the lightpaths which in turn maximizes the resource utilization. The algorithm initially assigns the minimum hop path to each route and then performs efficient rerouting to reduce the number of wavelengths required while also trying to minimize the average hop length. To further reduce the network cost, we also propose a wavelength assignment procedure for VWP routed networks which minimizes the number of wavelength converters required. Our algorithm has been tested on various topologies for different types of traffic demands and has been found to give solutions much better than previous standards for this problem.     

光组播路由代价与波长使用量的联合优化方法

为解决光组播路由中组播中路由代价和波长资源消耗单一化造成的组播路树路由的代价过高问题,在分光节点约束条件下,提出了光组播路由代价与波长使用量联合优化的长路优先(LPF)方法和短路优先(SPF)方法。算法通过检查最小光组播树是否存在节点分光约束的问题,根据设置的波长使用代价控制因子,使LPF或SPF的路由代价和波长使用量最小。LPF方法首先选择组播树最长路径或新波长通道重路由受分光约束的目的节点,SPF方法先选择组播树中最短路径或新波长通道重路由受分光约束的目的节点,仿真结果表明,本文提出的两种联合优化方法都能实现路由代价较低和波长需求较少的目的。     

Dynamic Routing and Wavelength Assignment Using Cost Based Heuristics in WDM Optical Networks

Dynamic routing and wavelength assignment problem in optical networks is a two-step problem that is influenced by the choice of a successful optimal path selection and wavelength assignment. Proper selection techniques reduce the number of wavelengths required in the network and thereby improves traffic grooming. Heuristic algorithms and integer linear programming models help in selection of route and wavelength separately. Hence, the computation time is large which makes the system slow. A cost function is computed which uses independent parameters in the network for the selection of route and wavelength for a call. The heuristic reduces computation time by combining the search of route and wavelength to be assigned. In addition, the network performance is analyzed with and without alternate routing along with proposed heuristics. The selection of proper route and wavelength finding technique is very essential since it improves the grooming factor of the network thereby allowing more traffic support by the network. Our objective is to investigate and propose a cost based heuristics for dynamic traffic routing and wavelength Assignment in WDM optical networks. For this we plan to develop cost functions and heuristics to compute the route and wavelength assignment strategy. Here, our objective is to reduce the computation time for selection of route and wavelength assignment strategy by weighted cost function. The function has to include network parameters for its processing. Our work provides an overview about DRWA by applying cost based heuristics in WDM networks. This paper explains the proposed cost function and its applications in line with selection of independent parameters. The details of other functions like cost function formulation, hop-based route assignment, available wavelength based route assignment, mathematical analysis of proposed cost function are also explained. Results and discussions based on the findings are presented.

     

Adaptive routing considering the number of available wavelengths in WDM networks

In most existing studies of wavelength-division multiplexing networks, the problems of routing and wavelength assignment are generally treated separately, since it is NP-complete to produce the optimal solutions for the two problems at the same time. The four presented adaptive routing algorithms, however, consider the availability of wavelengths during the routing process. Our algorithms favor paths with the near-maximum number of available wavelengths between two nodes, resulting in improved load balancing. Simulations show that our algorithms reduce call blocking by nearly half when compared with the least-loaded and the k-fixed routing algorithms in some small networks using the first-fit wavelength assignment policy. In addition, simulation and analysis show that the path length of our algorithms is almost the same as those of the other algorithms.     

An Inter-domain Routing and Signaling Scheme for Optical Mesh Networks

An inter-domain routing and signaling scheme based on the OBGP protocol for WDM networks with a mesh topology is proposed in the paper. For mesh networks with wavelength conversion, inter-domain routing and signaling are realized by introducing a new message based on an optimal path identifier (OPI) and by establishing the corresponding message-exchange procedures. Considering the wavelength continuity constraint, a strategy called improved destination wavelength assignment (IDWA) combined with the OPI-based message is presented to establish a lightpath dynamically. The scheme is verified on the NSFNET and the CERNET by simulation. Results show that the blocking performance of a non-wavelength-conversion network is even a little lower than that of a wavelength-conversion network.     

Effects of wavelength routing and selection algorithms onwavelength conversion gain in WDM optical networks

Wavelength-division multiplexing (WDM) technology is emerging as the transmission and switching mechanism for future optical mesh networks. In these networks it is desired that a wavelength can be routed without electrical conversions. Two technologies are possible for this purpose: wavelength selective cross-connects (WSXC) and wavelength interchanging cross-connects (WIXC), which involve wavelength conversion. It is believed that wavelength converters may improve the blocking performance, but there is a mix of results in the literature on the amount of this performance enhancement. We use two metrics to quantify the wavelength conversion gain: the reduction in blocking probability and the increase in maximum utilization, compared to a network without converters. We study the effects of wavelength routing and selection algorithms on these measures for mesh networks. We use the overflow model to analyze the blocking probability for wavelength-selective (WS) mesh networks using the first-fit wavelength assignment algorithm. We propose a dynamic routing and wavelength selection algorithm, the least-loaded routing (LLR) algorithm, which jointly selects the least-loaded route-wavelength pair. In networks both with and without wavelength converters the LLR algorithm achieves much better blocking performance compared to the fixed shortest path routing algorithm. The LLR produces larger wavelength conversion gains; however, these large gains are not realized in sufficiently wide utilization regions and are diminished with the increased number of fibers     

Traffic processing algorithms for the SIGnet metropolitan areanetwork

Traffic processing algorithms are introduced for SIGnet (slotted interconnected-grid network), which is intended for local and metropolitan area backbone communication networks using multichannel optical transmission media. The design is motivated by the development of inexpensive multichannel capabilities based on dense wavelength division multiplexing (WDM) and future coherent optical systems. In SIGnet, the virtual topology is piecewise regular and permits bandwidth allocation and network evolution which is much more easily accomplished than in previous designs. SIGnet employs deflection routing to accommodate nonisochronous traffic. However, a multilink grid topology provides a closer match to the actual physical topology in many networks. This work includes an introduction to the network design and presents results obtained concerning the traffic processing algorithms which have been investigated     

Path protection WDM networks with impaired-transmission

In wavelength division multiplexing (WDM) networks, failures may imply severe loss of data due to the high transmission rates, leading to the need for employment of protective mechanisms. Transparency and switching in all-optical networks cause physical impairment, which can significantly degrade signal quality. If the signal quality along a path is below acceptable values, this path cannot be used for incoming requests in the establishment of lightpaths. Therefore, quality must be checked by the routing and wavelength assignment algorithm. The present article introduces two novel algorithms for shared path protection in WDM networks that take into consideration the Polarization Mode Dispersion, Amplifier Spontaneous Emission, and homowavelength cross-talk physical impairments during path selection. The efficiency of these algorithms is compared to that of their impairment-unaware counterparts.     

A kind of novel VPF‐based energy‐balanced routing strategy for wireless mesh network

Wireless mesh network (WMN) can sense information and realize end‐network transmission. It consists of numerous wireless sensors, the energy and communication ability of which are limited. A kind of novel VPF‐based energy‐balanced routing strategy for WMN has been presented in this paper. Most of the existing energy‐efficient routing strategy always forwards packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. We design the energy‐balanced routing strategy by setting up a mixed virtual potential field in terms of depth and energy by using the physical potential concept. The strategy can force packets to move toward the sink through the dense energy area and protect the nodes, which has relatively low residual energy. By comparing to the other energy‐efficient routing strategy in our designed scenarios, the experimental results show that energy balance and throughput can be improved. Copyright © 2014 John Wiley & Sons, Ltd.