Survivability In Multi-domain Optical Networks Research Articles

Survivability Issues in Optical Wavalength Division Multiplexing (WDM) Network

This paper provides a survey on existing survivability related problems and include the new algorithm based on existing algorithms. Survivability has become an important issue and topical subject in WDM networks. This paper reviewed the literature on survivability against multi-domain or link failures to ensure reliability in WDM networks. Survivability in multi-domain optical networks is very important, only few studies have been proposed in literature. The paper is related to protection technique in inter-domain link of multi-domain network combining the p-cycle and wavelength assignment.

A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks

With the large-scale deployment of optical network equipments, the problems of separated domains management and the multi-domain-based survivability have become the primary challenge in new generation intelligent optical networks. Aimed at resisting multi-link failures in multi-domain optical networks (MDON), a heuristic multi-link fault-tolerant (MLFT) algorithm for survivability in MDON is proposed in this article, which applied Hamiltonian cycle protection and segment-shared protection to establish a novel survivability strategy for either intra-domain's or inter-domain's multiple links, respectively. Furthermore, a new virtual-link mapping scheme and link-cost formulas are presented to encourage the appropriate routing selection and load balancing, which can also contributed to better resource utilization ratio and blocking ratio. Simulation results show that MLFT realizes the multi-link fault-tolerant survivability at a lower cost with better performances in redundancy ratio, blocking ratio, and computation complexity.

Multicast protection algorithms based on aggregated logical topology in survivable multi-domain optical networks

Since the optical network carries a lot of traffic, the survivability is an important issue to ensure the service continuity. At the same time, with the network scale increasing, the optical network has been divided into multi-domains each of which is managed by a unique network provider. Therefore, the survivability in multi-domain optical networks has got more attention in recent years. However, current works mostly addressed the unicast survivability and few or no solved the multicast survivability in multi-domain optical networks. Therefore, in this paper we propose two heuristic algorithms called Multicast Multi-domain Dedicated Protection (MMDP) and Multicast Multi-domain Shared Protection (MMSP) to provide the survivability in multicast multi-domain optical networks. In MMDP and MMSP, to provide the intra-domain protection, we use the modified Minimal-cost Path Heuristic (MPH) algorithm to compute the intra-domain survivable multicast tree. To provide the inter-domain protection, based on multi-domain logical topology, we firstly use the MPH algorithm to compute the inter-domain logical multicast tree and then use the Dijkstra algorithm to compute the inter-domain logical backup sub-path for each inter-link on this logical multicast tree. Simulation results show that MMSP has better resource utilization efficiency and lower blocking probability.

Graph Partitioning for Survivability in Multi-Domain Optical Networks

As optical networking deployments increase, multi-domain provisioning and survivability are becoming major concerns. A key challenge in multi-domain survivability is the scalability problem. To address this concern, various solutions have already been proposed based upon topology aggregation schemes. However, these mechanisms do not scale well with increasing domain counts and further investigation is required to develop more scalable alternatives. Along these lines, in this paper we propose to use graph partitioning techniques to solve the scalability problem in multi-domain optical networks. To demonstrate the efficiency of our method, we also extend the p-cycle concept to multi-domain settings. Overall simulation results show the efficiency of our proposed solution in terms of resource utilization and the number of p-cycle structures.

A survey of survivability in multi-domain optical networks

Network survivability is becoming an important issue and a topical subject in WDM optical mesh networks. Many works have studied network survivability. However, few works have focused on survivability in multi-domain optical networks. This paper reviews the literature on survivability against failures in multi-domain optical networks. The main objective of this study is to evaluate and analyze existing solutions and to compare their performance in terms of different criteria: resource utilization, ratio of rejected connections and recovery time.

Survivability in multi-domain optical networks using p-cycles

Survivability is becoming an important issue in optical networks due to the huge bandwidth offered by optical technology. Many works have studied network survivability. The majority of these works are destined for single-domain networks. In this work, we address the survivability of multi-domain optical networks. This paper provides a classification of the existing protection solutions proposed for multi-domain networks and analyses their advantages and limitations. We propose a new solution for multi-domain optical networks based on p-cycles (pre-configured cycles). For scalability and security reasons, we also propose a topology aggregation model adapted to p-cycle computations. This aggregation model allows our proposed solution to find a trade-off between two competing goals: efficient use of backup resources and short running time. Simulation results show that the proposed solution is a good trade-off between resource utilization and running time compared to existing solutions.

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks

In this paper, we propose a novel differentiated domain protection (DDP) scheme to address survivability in multi-domain optical networks. Survivable routing in multi-domain networks is a challenging algorithmic problem because it requires choosing links that provide adequate protection both between domains and within domains that may offer different protection services. To satisfy the survivability requirements of different domains, DDP considers differentiated protection schemes, i.e., dedicated protection, shared protection, or no protection in different domains. In order to respect the principle of transparent management in multiple domains, DDP abstracts a multi-domain optical network to a virtual topology graph (VTG) for solving routing between domains. Simulation results show that DDP, unlike traditional schemes, can provide trade-off between protection methods and also allows better resource utilization.

New insights on survivability in multi-domain optical networks

With the development of intelligent optical networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP network and optical network is no longer be a dream but a practical reality. Similar to the Internet, current optical networks have been divided into multiple domains each of which has its own network provider and management policy. Therefore, the development of multi-domain optical networks will be the trend of new-generation intelligent optical networks, and GMPLS-based survivability for multi-domain optical networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical networks.