Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures

Abstract

In this paper we assess the benefits of using statistical techniques to ascertain the shareability of protection channels when computing shared mesh restored lightpaths. Current deterministic approaches require a detailed level of information proportional to the number of active lightpaths, and do not scale well as traffic demands and network grow. With the proposed approach we show that less information, independent of the amount of traffic demand, is sufficient to determine the shareability of protection channels with remarkable accuracy. Experiments also demonstrate that our approach yields faster computation times with no significant penalty in terms of capacity usage.

Practical issues for the implementation of survivability and recovery techniques in optical networks

“…A probabilistic approach was proposed in [33] as a possible solution to this problem that only requires the dissemination of summarized information (e.g., the limited information can comprise of the number of times each SRG is protected by a channel in the edge, rather than the exact information of SRGs protected by each channel as required by the deterministic approach). Even though performance results in [33] validated this approach, this issue requires further investigation for the practical implementation of shared mesh protection techniques.…”

“…Even though performance results in [33] validated this approach, this issue requires further investigation for the practical implementation of shared mesh protection techniques.…”

Distributed Computation of Shared Backup Path in Mesh Optical Networks Using Probabilistic Methods

“…In order to guarantee service persistence in such circumstances it is common for a carrier to reserve spare bandwidth on alternate paths, so that a service affected by a failure along its primary lightpath can be rapidly restored using the reserved bandwidth. Among the possible schemes for provisioning backup paths, dedicated mesh protection and shared mesh restoration seem to be the most appropriate approaches in the context of DWDM networks [2], [3], [4], [5], [6].…”

Fast approximate dimensioning and performance analysis of mesh optical networks

“…In the experiments, the networks were loaded with uniform demand, until one of the nodes reached capacity and five percents of new demands got blocked 9 . The network characteristics and the usage 10 achieved at the point where 5% of the uniform demand gets blocked are shown in Table I, for both dedicated and shared mesh routing.…”

“…In this paper, we assume that routing computation is done with access to the complete network information, and that a k-shortest path approach is used for both the primary and backup paths. See [8], [9], [10] for comparison of routing efficiency when only partial information is available.…”