Survivable Communication Networks Research Articles

Migrating From Legacy to Software Defined Networks: A Network Reliability Perspective

Designing survivable communication networks to achieve carrier-grade five-nines reliability is of paramount importance for the network operators. This article addresses service reliability and its related aspects such as nodal reachability, network connectivity, and edge-disjoint routing in both traditional networks and software defined networks (SDNs). The proposed roadmap is based on two phases: Fundamental analytical phase and performance evaluation phase. In the first phase, a graph operator is defined to analyze the characteristics of the reliability metric and its associated reachability feature. This phase will focus on both the macro- and micro-level properties of reliability. In the second phase, we exploit the analysis in the former phase to get an insight into the performance evaluation of traditional and SDN-based networks against the reliability metric, and then calculate the statistical significance of the mean difference of their reliability values. Reliability under edge-disjoint paths to avoid resource competition is also investigated. Various types of topologies are utilized to test the service reliability of both architecture designs. Extensive simulation results show that SDN-based networks have comparable performance to its legacy counterpart against the operational reliability metric. Our findings not only shed light on enhancing reliability using edge-disjoint paths under link failure scenarios but also expected to benefit the operators to achieve their service level objectives while migrating from legacy to SDN-based platform.

Hybrid algorithm for two-terminal reliability evaluation in communication networks

<span>Network reliability is valuable in establishing a survivable communication network. Reliability evaluation algorithms are used in the design stage and during the network deployment. This work presents a new multistage hybrid technique for two-terminal reliability evaluation problem. It is based on a combination of graph reduction techniques and tie-set method. A new approach has been introduced for deducing tie-sets in a network containing both unidirectional and bi-directional edges. The proposed algorithm can be applied for both simple and complex networks without restrictions. The results confirm that new algorithm evaluates network's reliability with decreasing computing time compared to classical algorithms. The results for a case study of a 20-node network have demonstrated that the required time for reliability evaluation is decreased from (t>1 hour) in the case of using a classical algorithm, to (t<1 second) for the new algorithm.</span>

A Holistic Survey on Disaster and Disruption in Optical Communication Network

Background: This paper is a review of optical fiber communications and also presents the different types of disasters and different protection schemes to combat these disasters. In the optical communication network, the failure of a network caused by disasters (e.g. predictable disaster, unpredictable disaster, Intentional attacks) leads to the failure of several optical communication channels and huge data loss. Most of the previous works on optical network survivability assume that the failures are going to occur in future, and the network is made survivable to ensure connectivity in events of failures. With the advancements in technology, the predictions of tornados, cyclone and landslides are becoming more accurate by using some early warning systems. Objective: Significant improvement in optical communication network survivability can be achieved using our proposed protection scheme in the event of a major earthquake, cloud burst and landslides. Conclusion: The review concludes that a large amount of data could be lost even if there is a very short disruption in the optical backbone network.

Fault isolation technique for decentralized survivable communication network systems via regions and paths

<p>The rapid continuous growth of communication networks in size, complexity and dependencies, makes them extremely challenging to maintain the survivability of the complete large network. The complexity may be due to advance voice and video services like IP TVs, IP telephony, video streaming which demands high reliability and survivability. Network management has become a great challenge as Faults are expected only in these complex networks. Once a failure is detected, the next step in the diagnosis is fault isolation which locates the source of that failure. The necessitate of decentralized diagnosis is justified by various applications, like spacecrafts. This article presents model based fault isolation technique using a graph theoretical concepts, regions and paths for decentralized communication networks.</p>

Fault isolation technique for decentralized survivable communication network systems via regions and paths

Fault isolation technique for decentralized survivable communication network systems via regions and paths

Lightweight QoE Driven and Invulnerability Guarantee Opportunistic Control Scheme for Wireless Sensor Networks

This paper proposed the lightweight QoE driven adaptive invulnerability wireless communication control method, including the wireless communication terminal equipment with invulnerability antenna. According to the quality of wireless network channel quality, the lightweight QoE driven scheme was developed. According to user needs, the quality of the network, survivable ability of wireless communication terminal and wireless communication survivability requirements, we proposed three matching rules by considering the wireless hop number, data size and life cycle. The experiments demonstrated that the proposed scheme can optimize wireless communication terminal equipment and wireless opportunistic communication network construction, guarantee the user experience quality and improve wireless communication network survivability.

Allocation of network error correction flow on disjoint paths

The diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from the source node to the destination node. Specifically, we propose an algorithm of allocating the path-flows to support the given rate with minimum cost. Our analysis shows that the asymptotic time complexity of this algorithm is linearithmic, and this algorithm is optimal in general.

Survivable Path Sets: A New Approach to Survivability in Multilayer Networks

We consider the problem of survivability in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source–destination pair. However, this approach cannot be directly applied to layered networks where risk-disjoint paths may not always exist. In this paper, we take a new approach, which is based on finding a set of paths that may not be disjoint but together will survive any single risk. We start with two-layered communication networks, where the risks are fiber failures. We prove that in general, finding the minimum survivable path set (MSPS) is NP-hard, whereas if we restrict the length of paths the problem can be solved in polynomial time. We formulate the problem as an integer linear program (ILP), and use this formulation to develop heuristics and approximation algorithms. Moreover, we study the minimum cost survivable path set problem, where the cost is the number of fibers used, and thus, nonadditive. Finally, we generalize the survivability problem to the networks with more than two layers. By applying our algorithms for survivable path set, we assess the survivability of communication networks that operate relying on power from a power grid.

Complexity of column generation in network design with path‐based survivability mechanisms

AbstractThis survey deals with computational complexity of column generation problems arising in the design of survivable communication networks. Such problems are often modeled as linear programs based on noncompact multicommodity flow network formulations. These formulations involve an exponential number of path‐flow variables, and therefore require column generation to be solved to optimality. We consider several path‐based protection and restoration mechanisms and present results, both known and new, on the complexity of the corresponding column generation (also called pricing) problems. We discuss results for the case of single link or single node failures scenarios, and extend the considerations to multiple link failures. Further, we classify the design problems corresponding to different survivability mechanisms according to the structure of their pricing problem. Eventually, we show that almost all the encountered pricing problems are hard to solve for scenarios admitting multiple failures, while a great deal of them are \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb} \pagestyle{empty} \begin{document} \begin{align*}\mathcal{NP}\end{align*} \end{document} ‐hard already for single failure scenarios. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012

Mathematical models for failure reconfiguration of telecommunication networks: Part 1

This article proposes various mathematical modelling of networks for failure recovery. We consider a survivable communication network which is designed to carry different types of services under service level agreements (SLAs) between the network provider and the network users. Two different approaches for dynamical reconfiguration of networks are presented: with and without penalization. The approach without penalization does not require to consider the status of SLAs during the process of network reconfiguration. The second approach considers the status of the SLAs in the network and the corresponding re-optimization model for network reconfiguration is more complicated as the dimension of the linear programming problem in this case is higher than one for the problem of optimization without penalization. Some mathematical models and solution methodologies for this network operation problem are presented and an extensive implementation result has been provided.

Bounding component sizes of two-connected Steiner networks

We consider the problem of constructing a shortest Euclidean 2-connected Steiner network in the plane (SMN) for a set of n terminals. This problem has natural applications in the design of survivable communication networks. In [P. Winter, M. Zachariasen, Two-connected Steiner networks: Structural properties, OR Letters 33 (2005) 395–402] we proved that all cycles in SMNs with Steiner points must have pairs of consecutive terminals of degree 2. We use this result and the notion of reduced block-bridge trees suggested by Luebke [E.L. Luebke, k-connected Steiner network problems, PhD thesis, University of North Carolina, USA, 2002] to show that no full Steiner tree in a SMN spans more than ⌊ n / 3 ⌋ + 1 terminals.

Properties of optimal survivable paths in a graph

We introduce the concept of a survivable path in an undirected graph G. A survivable path between a pair of vertices in G is a pair of edge-disjoint paths consisting of a working path and a redundant protection path. Protection paths share edges in such a manner as to provide guaranteed recovery upon the failure of any single edge. Survivable paths play an important role in the design of survivable communication networks. We demonstrate several results on the properties of the optimal set of survivable paths.

Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks

This paper discusses a design of a hybrid ring–mesh network in a survivable communication network. Given a set of traffic demands, the problem is to assign each traffic demand to rings and mesh such that the cost of add–drop multiplexer (ADM) and digital cross-connect system (DCS) equipment required is minimized. This assignment problem can be considered together with the fibre routing of nodes on rings and mesh. As a solution procedure, a tabu search is developed with recency-based short-term and frequency-based long-term memory structures. In computational experiments, the proposed tabu search is compared with the solutions obtained by the branch and bound procedure of CPLEX. We see that the tabu search provides a nearly optimal solution within sufficiently short time periods for all test problems with a gap of approximately 1–4% from the lower bound.

Analysis and evaluation of survivability of various configured communication networks

In this paper a new approach is proposed for analysing and comparatively evaluating communication network survivability under extreme conditions of the network elements. The approach is based not on the probability of network connectivity but on mathematical expectation of the number of survived connections. As the survivability of the network depends on its structural configuration (topology), the present work results in expressions for the calculation of mathematical expectation of the survived part of connections for various network configurations. © 1998 John Wiley & Sons, Ltd.

A framework for characterizing disaster-based network survivability

This paper formulates a general framework that includes and extends the existing definitions for network survivability. Based on this framework, network survivability is characterized by a survivability function rather than a single-value survivability measure, and various quantities of interest can be derived from the function. Examples are the expected survivability, the worst-case survivability, the r-percentile survivability, and the probability of zero survivability. The survivability function is especially useful for the study of large-scale disasters. For illustration, the authors derive the survivability function in closed form for a simple ring network under link failures. They also discuss the general procedure for finding survivability functions for complex networks, and show that the survivability function reveals useful information about a network. This framework provides a unified and practical approach to analyzing and designing highly survivable communications networks. >

An Integer Polytope Related to the Design of Survivable Communication Networks

The problem of designing communication networks that can survive the loss of any single link is studied. Such problems can be formulated as minimum cost 2-edge connected subgraph problems in a complete graph. The linear programming cutting plane approach has been used effectively for related problems in [Schwerpunktprogramm der Deutschen Forschungsgemeinschaft, Anwendungsbezogene Optimierung and Steuerung, Report No. 188, 1989], where problem-specific cutting planes that define facets of the underlying integer polyhedra are used. This paper introduces a new class of valid inequalities for the polytope associated with the minimum cost 2-edge connected subgraph problem, and necessary and sufficient conditions for these inequalities to be facet-inducing for this polytope are given.

Link enhancement using constrained range and reduced candidate set searches

A communication network's survivability and routability are primarily based on the degree of interconnection between the existing nodes of the network. Enhancement of these characteristics can be obtained by adding direct communication links between nodes of the network. This process is generally subject to a budget constraint. We show that the link enhancement problem, for a given investment, is NP-complete. Explanation of the proposed heuristic, for near-optimal solution, is presented with several examples. Improvements on previous work using constrained range and reduced candidate set searches are introduced and clarified. A review of pertinent previous work, problem formulation, algorithm presentation, and discussion of computational issues are also provided.

Design of survivable communications networks under performance constraints : Kris T. Newport and Pramod K. Varshney. IEEE Trans. Reliab.40(4), 433 (October 1991)

Design of survivable communications networks under performance constraints : Kris T. Newport and Pramod K. Varshney. IEEE Trans. Reliab.40(4), 433 (October 1991)

Estimation of survivability of communication networks

Communication networks may lose their end-to-end connectivity as a result of events that affect large portions of their topology. Survivability analysis of networks is used to determine this connectivity loss in view of the spatial dependency of damaging events. In the Letter, a dependent damage model and an extension of reliability algorithms are used systematically with Monte Carlo simulation for the survivability estimation of communications networks.

Design of survivable communications networks under performance constraints

The authors describe a network design algorithm that uses a set of deterministic connectivity measures which result in topologically survivable network designs that also meet processing and performance requirements. The authors briefly describe some applicable graph theoretic concepts and recently developed connectivity measures. They describe systematic procedures for improving the topological survivability of a network, and the overall network design process. A design example is presented. >