A new and improved algorithm for dynamic survivable routing in optical WDM networks

doi:10.1016/j.comcom.2007.01.007

Computer Communications

Volume 30, Issue 6, 26 March 2007, Pages 1419-1423

https://doi.org/10.1016/j.comcom.2007.01.007 Get rights and content

Abstract

The survivability in optical WDM networks is an important issue and has been studied for many years. This paper addresses the protection for the single-link failure in optical WDM networks and proposes a new and improved algorithm called Near Optimal Routing (NOR). For each connection request, the previous algorithm first computes one primary path and follows to compute one link–disjoint backup path. In our proposed algorithm, NOR can obtain the near optimal solutions by re-computing the primary or backup paths based on the rerouting policy. Simulation results show that the performances of NOR can be significantly improved compared to the previous algorithm.

Introduction

In recent years, the internet is growing faster than ever, and the explosions of related services are creating a huge demand of the bandwidth in optical WDM networks where each wavelength channel has the transmission rate over several gigabits per second. The very high transmission rate may lead to a lot of services to be blocked if the fiber link fails. Therefore, the survivability has emerged as one of the important issues in the design of optical WDM networks [1], [2], [3], [4], [5], [6]. The goal of survivable routing is to ensure the networks with services continuity by preplanning the backup resources for primary resources. In previous works [7], [8], each service or connection is assigned to one primary path and one link–disjoint backup path. Once the primary path is interrupted by any unexpected failure, the primary traffic can be switched to the corresponding backup path such that the service can be protected. This paper will focus on the protection design for the single-link failure since this failure scenario is dominant in many real-world optical WDM networks.

In order to protect the single-link failure in the worst case, the previous algorithm called shared-path routing (SPR) [7], [8] assigns one primary path and one link–disjoint backup path to each connection request. In SPR, the backup resources can be shared by different backup paths if the corresponding primary paths are link–disjoint, and thus the resources utilization of SPR is better than other algorithms, e.g., dedicated routing algorithm, segment-shared routing algorithm, etc. However, SPR is a simple algorithm that first computes the primary path and follows to compute the backup path, so that it has the flaw that cannot find the optimal solution. Therefore, SPR may consume many redundant resources and lead to high blocking probability since there are only a few free resources to be used for the following connection requests.

In this paper, the main contribution is to overcome the flaw of SPR and to improve the resource utilization. We propose a new and improved survivable routing algorithm called Near Optimal Routing (NOR) to protect the single-link failure in optical WDM networks. For each connection request, NOR can obtain the solution with near optimal resource utilization by re-computing the primary or backup paths based on the rerouting policy. Simulation results show that the performances of NOR can be significantly improved compared to SPR.

The rest of this paper is organized as follows. Section 2presents the survivable routing in SPR and NOR. Section 3 describes the network model and the process of NOR. Section 4 presents the simulation results and analysis. Section 5 concludes this paper.

Section snippets

Routing in SPR

To survive the single-link failure, for each connection request SPR first computes the least-cost primary path by the shortest path algorithm (e.g., Dijkstra’s algorithm), second fixes the primary path and computes the least-cost backup path. However, the flaw of SPR is that it may consume many redundant resources. An illustration is given in Fig. 1. Fig. 1(a) is the network topology where each link has two wavelengths. We assume that the bandwidth of each connection request is one wavelength

Network model

Assume the network has V nodes and L links, and each link has W wavelengths. Assume each connection request arrives at the network orderly, and there is only a connection request arrives at a time. Assume the bandwidth of each connection request is one wavelength channel. The shortest path algorithm, i.e., Dijskare’s algorithm, is applied to compute the routes. The following notations are introduced.

j: Bi-directional fiber link.
f_j: Numbers of free wavelengths on link j.
p_j: Numbers of primary

Simulations and analysis

We simulate a dynamic network environment with the assumptions that connection requests arrive according to an independent Poisson process with arrival rate β and that the connections’ holding times are negatively exponentially distributed, 1/μ; that is, the network load is β/μ Erlang. We assume μ = 1 and the bandwidth of each connection request is one wavelength channel. If the connection request fails to be established, the network abandons it immediately; i.e., there are no waiting queues. The

Conclusions

In this paper, we have studied the survivability in optical WDM networks and proposed a new and improved algorithm called NOR to protect the single-link failure. NOR can obtain the near optimal solution by re-computing the primary or backup paths based on the rerouting policy. Simulation results show that the performances of NOR can be significantly improved compared to the previous algorithm.

Acknowledgements

The authors thank the reviewers for their valuable comments. This work was supported in part by the 985 project in NEU.

Lei Guo was born in Sichuan, China, in 1980. He received the Ph.D. degree in communication and information system from School of Communication and Information Engineering, University of Electronic Science and Technology of China, Chengdu, China, in 2006. He is currently an Associate Professor in College of Information Science and Engineering, Northeastern University, Shenyang, China. His research interests include survivability and GMPLS/WDM network technology. Dr. Guo is a member of IEEE and a

References (8)

S. Ngo et al.
Ant-based survivable routing in dynamic WDM networks with shared backup paths
J. Supercomput.
(2006)
S. Varma et al.
Protection in multigranular waveband networks
J. Opt. Network.
(2006)
G. Maier et al.
Optical network survivability: protection techniques in WDM layer
Photon. Netw. Commun.
(2002)
D. Zhou et al.
Survivability in optical networks
IEEE Network
(2000)

There are more references available in the full text version of this article.

Cited by (16)

Survivable provisioning for multicast service oriented virtual network requests in cloud-based data centers
2014, Optical Switching and Networking
Citation Excerpt :
In cloud computing, multiple geographically separated servers or server clusters interconnected by a physical network constitute the cloud infrastructure (data centers). Optical network works as the best choice for the physical network because of its advantages of high speed, transparent transmission and abundant bandwidth resources [2,3]. Users can access applications or services and infrastructure resources provisioned by cloud-based data centers using thin clients without knowing the actual location and characteristics of the resources, or how they are delivered.
Network virtualization technology plays an important role in cloud-based data centers that serve as an effective method for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications. Although there has been some work on efficient mapping of unicast service oriented virtual networks there has been very limited work on addressing the problem of efficient mapping of multicast oriented virtual networks. Furthermore, how to guarantee survivability of multicast service oriented virtual network request has not been studied.
In this work, we investigate the survivable multicast service oriented virtual network mapping (SMVNM) problem and propose an efficient algorithm for solving this problem. We first formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. We then design an efficient algorithm to solve this problem since it is NP-hard. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. The simulation results show that our approach outperforms existing solutions.
Survivable integrated grooming in multi-granularity optical networks
2012, Optical Fiber Technology
Citation Excerpt :
On the other hand, fiber failures may affect a large volume of traffic since each wavelength channel in fiber link carries a lot of data. Therefore, survivability is critical for optical networks [1–3]. Survivable traffic grooming that addresses both grooming provisioning and survivability [4] seeks to provide survivable capability for connections and minimize the consumption of spare capacity in the network.
Survivability is an important issue to ensure the service continuity in optical network. At the same time, with the granularity of traffic demands ranging from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in order to utilize resources effectively. Therefore, multi-granularity grooming is proposed to save the cost and reduce the number of switching ports in Optical-Cross Connects (OXCs). However, current works mostly addressed the survivable wavelength or waveband grooming. Therefore, in this paper, we propose three heuristic algorithms called Multi-granularity Dedicated Protection Grooming (MDPG), Multi-granularity Shared Protection Grooming (MSPG) and Multi-granularity Mixed Protection Grooming (MMPG), respectively. All of them are performed based on the Survivable Multi-granularity Integrated Auxiliary Graph (SMIAG) that includes one Wavelength Integrated Auxiliary Graph (WIAG) for wavelength protection and one waveBand Integrated Auxiliary Graph (BIAG) for waveband protection. Numerical results show that MMPG has the lowest average port-cost, the best resource utilization ratio and the lowest blocking probability among these three algorithms. Compared with MDPG, MSPG has lower average port-cost, better resource utilization ratio and lower blocking probability.
Network survivability modeling
2009, Computer Networks
Citation Excerpt :
Survivability is the system’s ability to continuously deliver services in compliance with the given requirements in the presence of failures and other undesired events. In the literature we find that the services are everything from unspecified [15,16], very general like “mission” [14], to more specific such as “connected logical links” [17,18]. The requirements are very general like “fulfill its mission, in a timely manner” [14], “complies with its survivability specification” [12], “committed QoS continuously” [13], “provide service continuity” [15], very unclear “essential functions are still available” [19], or closely linked to the application area “logical links remain connected” [17].
Critical services in a telecommunication network should be continuously provided even when undesirable events like sabotage, natural disasters, or network failures happen. It is essential to provide virtual connections between peering nodes with certain performance guarantees such as minimum throughput, maximum delay or loss. The design, construction and management of virtual connections, network infrastructures and service platforms aim at meeting such requirements.
In this paper we consider the network’s ability to survive major and minor failures in network infrastructure and service platforms that are caused by undesired events that might be external or internal. Survive means that the services provided comply with the requirement also in presence of failures. The network survivability is quantified as defined by the ANSI T1A1.2 committee which is the transient performance from the instant an undesirable event occurs until steady state with an acceptable performance level is attained.
The assessment of the survivability of a network with virtual connections exposed to link or node failures is addressed in this paper. We have developed both simulation and analytic models to cross-validate our assumptions. In order to avoid state space explosion while addressing large networks we decompose our models first in space by studying the nodes independently and then in time by decoupling our analytic performance and recovery models which gives us a closed form solution. The modeling approaches are applied to both small and real-sized network examples. Three different scenarios have been defined, including single link failure, hurricane disaster, and instabilities in a large block of the system (transient common failure).
The results show very good correspondence between the transient loss and delay performance in our simulations and in the analytic approximations.
An improved lightpath allocation for grade of services in survivable WDM mesh networks
2008, Computer Communications
A large optical network may carry multiple traffic with different grade of services. Several previous papers suggest a preemptive multi-class routing scheme: (1) low grade of services’ primary path can share resources with high grade of services’ backup path; (2) low grade of services can be preempted by high grade of services in case of a failure. However, they just optimize the network resources without considering the high grade of services’ failure state. In this paper, we propose an improved lightpath allocation for grade of services to implement in single-link failure WDM mesh networks. The main advantages are to consider Grade 3 (the highest level) lightpath’s failure state when a link fault happens and to make the best of Grade 1(the lowest level) lightpaths working resources as the backup resources of Grade 3 lightpaths. Compared to the previous work, it can obtain better performances in resource utilization ratio, lightpath establishment and the number of average interrupted lightpaths.
Network congestion avoidance strategy with particle filter
2008, Computer Communications
Based on the property of Markov chain for network data, a new estimator with particle filter is proposed for congestion control in this paper. The proposed scheme can predict the traffic patterns by the decision-making model. Compared with previous scheme based on fuzzy neural network, the proposed scheme can adaptively adjust the network rate in real-time and reduce the cell loss rate, so that it can efficiently avoid the traffic congestion. Simulation results are shown to be promising.
A simulation approach to quantify network survivability on MANETs
2015, Proceedings - International Computer Software and Applications Conference

View all citing articles on Scopus

^☆: The preliminary work was presented at ICICT 2007.

View full text

A new and improved algorithm for dynamic survivable routing in optical WDM networks☆

Abstract

Introduction

Section snippets

Routing in SPR

Network model

Simulations and analysis

Conclusions

Acknowledgements

Ant-based survivable routing in dynamic WDM networks with shared backup paths

J. Supercomput.

Protection in multigranular waveband networks

J. Opt. Network.

Optical network survivability: protection techniques in WDM layer

Photon. Netw. Commun.

Survivability in optical networks

IEEE Network