A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion

In this paper, a survivable routing algorithm is proposed for shared segment protection (SSP), called optimal self-healing loop allocation (OSHLA), which dynamically allocates spare capacity for a given working lightpath in mesh wavelength-division-multiplexing (WDM) networks with partial wavelength conversion capability. Two novel graph transformation approaches, namely graph of cycles and wavelength graph of paths, are introduced to solve this problem, in which the task of survivable routing is formulated as a series of shortest path searching processes. In addition to an analysis on the computation complexity, a suite of experiments is conducted to verify OSHLA on four networks with different topologies and traffic loads. We find that the blocking probability and computation complexity are dominated by the upper bound on the length of the working and protection segments. Comparison is made between OSHLA and four other reported schemes in terms of blocking probability. The results show that OSHLA can achieve the lowest blocking probability under the network environment of interest. We conclude that OSHLA provides a generalized framework of survivable routing for an efficient implementation of SSP in mesh WDM partial wavelength convertible networks. With OSHLA, a compromise is initiated by manipulating the upper bound on the length of working and protection segments such that the best performance-computation complexity gain can be achieved.     

Efficient routing and wavelength assignment for multicast in WDMnetworks

The next generation multimedia applications such as video conferencing and HDTV have raised tremendous challenges on the network design, both in bandwidth and service. As wavelength-division-multiplexing (WDM) networks have emerged as a promising candidate for future networks with large bandwidth, supporting efficient multicast in WDM networks becomes eminent. Different from the IP layer, the cost of multicast at the WDM layer involves not only bandwidth (wavelength) cost, but also wavelength conversion cost and light splitting cost. It is well known that the optimal multicast problem in WDM networks is NP-hard. In this paper, we develop an efficient approximation algorithm consisting of two separate but integrated steps: multicast routing and wavelength assignment. We prove that the problem of optimal wavelength assignment on a multicast tree is not NP-hard; in fact, an optimal wavelength assignment algorithm with complexity of O(NW) is presented. Simulation results have revealed that the optimal wavelength assignment beats greedy algorithms by a large margin in networks using many wavelengths on each link such as dense wavelength-division-multiplexing (DWDM) networks. Our proposed heuristic multicast routing algorithm takes into account both the cost of using wavelength on links and the cost of wavelength conversion. The resulting multicast tree is derived from the optimal lightpaths used for unicast     

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.     

Operation of WDM networks with different wavelength conversioncapabilities

We study the impact of wavelength conversion capability on wavelength routing WDM networks with fixed shortest-path routing. We propose a method for implementing wavelength routing in a WDM network with partial wavelength conversion capability. Simulation results show that such partial wavelength conversion networks provide a performance in between that of wavelength continuous networks and those with full conversion capability. In addition, it can be seen that only limited wavelength conversion capability is enough to provide a performance close to that of a network with full conversion. Analytical and simulation bounding results for the full and no conversion cases have also been provided     

On-line integrated routing in dynamic multifiber IP/WDM networks

This paper focuses on dynamic integrated routing in multifiber Internet protocol/wavelength-division multiplexing (IP/WDM) networks, which can be implemented through either one-step routing (OSR) or two-step routing (TSR) approach. Based on an extended layered-graph, two resource assignment strategies, termed channel-level balance (CLB) and link-level balance (LLB), are proposed to balance the traffic in the network at different levels. To further improve the performance, a parameter K is introduced to make a dynamic tradeoff between the logical-layer links and the optical-layer links. Simulation studies are carried out for various topologies. The results show that LLB is better than CLB in most cases, and LLB combined with OSR has the optimal performance. Also, we find that the routing approach and the resource assignment strategy individually play different roles with different values of r/sub l/ that is introduced to indicate the resource richness of the network. As a multifiber network is functionally equivalent to a single-fiber network with limited wavelength conversion, we investigate the effects of wavelength conversion by studying the multifiber IP/WDM networks. The analysis shows that, when the granularity of each connection request is much smaller than the wavelength granularity, wavelength conversion may increase the request blocking probability in the network.     

Implementation of depth‐based routing and its enhancement in AquaSim–Next Generation for underwater wireless sensor networks

In the last decade, underwater wireless sensor networks have been widely studied because of their peculiar aspects that distinguish them from common terrestrial wireless networks. Their applications range from environmental monitoring to military defense. The definition of efficient routing protocols in underwater sensor networks is a challenging topic of research because of the intrinsic characteristics of these networks, such as the need of handling the node mobility and the difficulty in balancing the energy consumed by the nodes. Depth‐based routing protocol is an opportunistic routing protocol for underwater sensor networks, which provides good performance both under high and low node mobility scenarios. The main contribution of our work is presenting a novel simulator for studying depth‐based routing protocol and its variants as well as novel routing protocols. Our simulator is based on AquaSim–Next Generation, which is a specialized tool for studying underwater networks. With our work, we improve the state of the art of underwater routing protocol simulators by implementing, among other features, a detailed cross‐layer communication and an accurate model of the operational modes of acoustic modem and their energy consumption. The simulator is open source and freely downloadable. Moreover, we propose a novel and completely distributed routing protocol, named residual energy–depth‐based routing. It takes into account the residual energy at the nodes' batteries to select the forwarder nodes and improve the network lifetime by providing a more uniform energy consumption among them. We compare its performance with that of depth‐based routing protocol and a receiver‐based routing protocol implementing a probabilistic opportunistic forwarding scheme.     

A Novel Distributed Protocol for Path Selection in Dynamic Wavelength-Routed WDM Networks

This paper solves the problem of path selection for WDM mesh networks with a special focus on the implementation in middle-sized networks, such as metropolitan-area networks (MANs). A novel routing and signaling protocol, called asynchronous criticality avoidance (ACA), is proposed to improve the network performance. With the ACA protocol, a specific set of wavelength channels are defined as critical links between a node pair according to dynamic link-state. Criticality information is defined as the critical links and the associated information, which is coordinated and disseminated by each source node to every other source node as an inter-arrival critical coordination. Routing and wavelength assignment is performed along with the criticality avoidance mechanism, in which path selection process is devised to take the criticality information into consideration. Simulation is conducted in 22- and 30-node networks to examine the proposed approach. The simulation results show that the ACA protocol significantly outperforms the fixed-path least-congested (FPLC) and adaptive dynamic routing (ADR) schemes under the fixed alternate routing architecture.     

Segment shared protection in WDM networks with partial wavelength conversion

In this paper, we propose a novel approach of survivable routing for segment shared protection (SSP) in mesh wavelength division multiplexing networks with partial wavelength conversion capability, with which spare capacity is allocated dynamically for a given working lightpath. The survivable routing process is formulated into a shortest path searching problem on the transferred graph of cycles (TGC) and wavelength graph of paths (WGP).     

Flow Routing and its Performance Analysis in Optical IP Networks

Optical packet-switching networks deploying buffering, wavelength conversion and multi-path routing have been extensively studied in recent years to provide high capacity transport for Internet traffic. However due to packet-based routing and switching, such a network could result in significant disorder and delay variation of packets when they are received by end users, thus increasing the burstiness of the Internet traffic and causing higher-layer protocol to malfunction. This paper addresses a novel routing and switching method for optical IP networks — flow routing, and its facilitating protocol. Flow routing deals with packet-flows to reduce flow corruption due to packet out-of-order, delay variation and packet loss, without using complicate control mechanism. Detailed performance analysis is given for output-buffered optical routers adopting flow routing. Two flow-oriented discarding techniques, i.e., flow discard (FD) and early flow discard (EFD), are discussed. Compared with optical packet-switching routers, a remarkable improvement of good-throughput is obtained in the optical flow-routers, especially under high congestion periods. We conclude that EFD behaves as a robust technique, which is more tolerant than FD to the change of traffic and transmission system factors.     

A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion

In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

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

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

On wavelength-converted optical routers employing flow routing

Optical networks have been extensively investigated in recent years to provide high capacity for the Internet traffic. Among them the optical packet-switching network deploying buffering, wavelength conversion and multipath routing could be the most suitable one. It cannot only provide high capacity transport for Internet traffic but also achieve high utilization of the network resources. However due to the packet-oriented routing and switching, such a network can result in a large amount of packets out-of-order, packet loss and/or with various delays upon arriving at end systems, causing TCP flows that comprise those packets corrupted. Large amount of corrupted flows can increase the burstiness of the Internet traffic and cause higher-layer protocol to malfunction. This paper presents a novel routing and switching method for optical IP networks-flow routing. Without using a complicate control mechanism flow routing deals with packet-flows to reduce the amount of corrupted flows. The performance of the wavelength-converted optical flow router is investigated, based on a novel analytical model. A performance metric, i.e., good-throughput, is used, measuring the ratio of the amount of packets comprised in the noncorrupted flows to total amount of packets. Comparing with optical packet-switching routers, a remarkable improvement of good-throughput can be obtained by using optical flow routers. More important, using wavelength conversion can greatly improve the good-throughput of optical flow routers.     

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency and scalability, and avoids the burden—GPS support.     

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     

MERIT: A Scalable Approach for Protocol Assessment

MERIT is a framework that can be used to assess routing protocols in mobile ad hoc networks (manets). It uses the novel concept of a shortest mobile path (SMP) in a mobile graph, a generalization of the shortest path problem for mobile environments. As a measure for routing protocol assessment, we propose the mean ratio of the cost of the route used by a protocol to the cost of the optimal mobile path for the same network history. The cost reflects that the route used in a session can change over time because of network dynamics such as topology changes. The aim is for the ratio to be an abstract, inherent measure of the protocol that is as implementation-independent as possible. The MERIT spectrum, which is the ratio expressed as the function of some parameters of interest, is a characterization of protocol effectiveness. MERIT, for MEan Real vs. Ideal cosT, provides a scalable assessment framework: rather than comparing performance measures of different protocols directly, we compare a protocol to the optimal solution. That is, rather than forcing the comparison to be in the same system, it is done once for each protocol in its own environment. Furthermore, we show that there is an efficient algorithm to solve the underlying SMP problem for important cases, making the approach practically feasible. We also investigate generalizations of and extensions within the MERIT framework. We show that the MERIT framework is rich, with much wider generality and potential applicability than assessing routing protocols.     

A novel distributed control protocol in dynamic wavelength-routed optical networks

Path selection has long been one of the most important issues in the network design and management, which is also referred to as routing and wavelength assignment in the optical network domain. In this article we investigate the RWA problem for dynamic wavelength-routed mesh networks in a fully distributed controlled environment. We present a novel routing and signaling protocol called Asynchronous Criticality Avoidance (ACA), which is devised to reduce the mutual interference between lightpaths launched by different source-destination pairs to improve network performance in terms of blocking probability. With the fixed alternate routing architecture, the ACA protocol dynamically marks a set of wavelength channels as critical if the occupancy of the channels causes a bottleneck between an S-D pair with a width equal to or narrower than a predefined threshold. To support a distributed control environment, a suite of signaling processes is devised to realize the criticality avoidance mechanism, with which a two-stage routing and wavelength assignment (or criticality avoidance routing) is performed. The ACA protocol has been shown by simulations to be capable of better performance than existing schemes.     

WDM protocol-transparent distance extension using R2 remodulation

In computer networks using wavelength-division multiplexing (WDM), it is often necessary to extend the length of a given WDM path beyond that of a single segment whose length Is limited by the link budget. While wavelength-flattened optical amplifiers are the most obvious solution, this paper calls attention to a simple (albeit less efficient) alternative that works for any number of wavelength channels, but only a modest number of segments and modest bit rates. This scheme substitutes for each optical amplifier stage a multiwavelength 2R remodulator consisting of a WDM demultiplexor, followed by wavelength-by-wavelength zero-crossing detectors, then remodulation wavelength by wavelength, and finally wavelength-division multiplexing back onto a single fiber. Theory and experimental results confirm the usefulness of this primitive technique, which can also be used for add-and-drop links, for wavelength routing or wavelength conversion in scalable wavelength routing networks, for internetwork gateways, and for other applications     

OPERA: an optical packet experimental routing architecture withlabel swapping capability

This paper describes experimental and simulation results of the optical packet experimental routing architecture (OPERA) project. The OPERA network is based on a novel optical network interface router design that is optically regenerative and supports optical Internet protocol related functions including label swapping, packet routing and forwarding operations and wavelength reuse. Routing is based on subcarrier multiplexed header addressing, packet-rate wavelength conversion, and arrayed waveguide router technology. The routers are cascadable and use a unique double stage wavelength converter that supports header regeneration/replacement and maintains the payload extinction ratio. This approach overcomes dispersion limitations normally encountered using double sideband subcarrier multiplexing across a network. A discrete time simulation of the physical transport in an 8-hop network is reported. Multihop routing is experimentally demonstrated between two all-optical nodes and three input-output (I-O) ports of a waveguide grating array router. Packet-rate subcarrier header processing and wavelength conversion between six wavelengths is shown with high signal-to-noise ratio (SNR) of recovered payload and headers at each hop     

A Tabu search algorithm for static routing and wavelength assignment problem

Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength usage (MWU). Existing solution methodologies for the MWU problem are usually based on a two-step approach, where routing and wavelength assignment are done independently. Though this approach can reduce computational cost, the optimality of the solution is compromised. We propose a novel tabu search (TS) algorithm, which considers routing and wavelength assignment jointly without increasing the computational complexity. The performance of the proposed TS algorithm is compared with the integer linear programming (ILP) method, which is known to solve the MWU to optimality. The results for both small and large networks show that our proposed TS algorithm works almost as well as the ILP solution and is much more computationally efficient.