Failure propagation in GMPLS optical rings: CTMC model and performance analysis

Abstract

a b s t r a c tNetwork reliability and resilience has become a key design parameter for network operators and Internet ∧ service providers. These often seek ways to have their networks fully operational for at least 99.999% of the time, regardless of the number and ∧ type of failures that may occur in their networks.This article presents a ∧ continuous-time Markov chain model to characterise the propagation of failures in optical GMPLS rings. Two types of failures are considered depending on whether they affect only the control plane, or both the control and data planes of the node. Additionally, it is assumed that control failures propagate along the ring infecting neighbouring nodes, as stated by the Susceptible-Infected-Disabled (SID) propagation model taken from epidemic-based propagation models. A few numerical examples are performed to demonstrate that the CTMC model provides a set of guidelines for selecting the appropriate repair rates in order to attain specific availability requirements, both in the control plane and the data plane.

Resolving epidemic network failures through differentiated repair times

“…In our paper, we consider decoupled control and DPs, meaning that the CP can also fail independently of the DP. CP failures have been far less investigated than DP failures, but a few examples can be found in [15][16][17][18][19][20][21].…”

A reversible CTMC model for availability analysis of shared mesh restoration schemes for WDM networks

“…It is also possible to find alternative solutions to calculate the availability of shared protection schemes based on two approaches: adopting an alternative CTMC model [13,14,16] or using approximate heuristics together with RBD [17]. A possible strategy to simplify the model considers the working and backup paths as a single entity with known rates of failure and repair [16].…”

“…The CTMC has also been used to model more complex network states. In [13], the authors characterize the propagation of failures in GMPLS optical rings, where the control plane and the data plane can fail independently. In order to employ RBD, the authors in [17] calculate an equivalent unavailability for the links, which represents the expected traffic loss in a connection when a certain link fails together with any other link.…”

“…Solving the linear system by direct methods results in the complexity indicated in (11), while solving it by iterative methods results in the complexity given by (12). The proposed approach uses Eqs (7) and (9), resulting in an algorithm with computational complexity given by (13) and (14), respectively:…”

Classification of link-breaking and link-creation updating rules in susceptible-infected-susceptible epidemics on adaptive networks

“…One of the simplest, nontrivial dynamical processes on networks is the susceptibleinfected-susceptible (SIS) model [1]. Epidemic models like the SIS model describe a wide variety of diffusive processes, including epidemics [2,3], opinion spreading [4], computer viruses [5], brain data transfers [6], fake news spreading [7], failure propagation [8], and internet packet routing [9]. Most studies have either addressed the dynamics of the network or the dynamics on the network.…”