Spare capacity allocation using shared backup path protection for dual link failures

This paper extends the spare capacity allocation (SCA) problem from single link failure [1] to dual link failures on mesh-like IP or WDM networks. The SCA problem pre-plans traffic flows with mutually disjoint one working and two backup paths using the shared backup path protection (SBPP) scheme. The aggregated spare provision matrix (SPM) is used to capture the spare capacity sharing for dual link failures. Comparing to a previous work by He and Somani [2], this method has better scalability and flexibility. The SCA problem is formulated in a non-linear integer programming model and partitioned into two sequential linear sub-models: one finds all primary backup paths first, and the other finds all secondary backup paths next. The results on five networks show that the network redundancy using dedicated 1+1+1 is in the range of 313-400%. It drops to 96-181% in 1:1:1 without loss of dual-link resiliency, but with the trade-off of using the complicated share capacity sharing among backup paths. The hybrid 1+1:1 provides intermediate redundancy ratio at 187-310% with a moderate complexity. We also compare the passive/active approaches which consider spare capacity sharing after/during the backup path routing process. The active sharing approaches always achieve lower redundancy values than the passive ones. These reduction percentages are about 12% for 1+1:1 and 25% for 1:1:1 respectively

Link failure protection and restoration in WDM optical networks

In a wavelength-division-multiplexing (WDM) optical network, the failure of fiber links may cause the failure of multiple optical channels, thereby leading to large data loss. Therefore the survivable WDM optical networks where the affected traffic under link failure can be restored, have been a matter of much concern. On the other hand, network operators want options that are more than just survivable, but more flexible and more efficient in the use of capacity. In this thesis, we propose our cost-effective approaches to survive link failures in WDM optical networks. Dynamic establishment of restorable connections in WDM networks is an important problem that has received much study. Existing algorithms use either path-based method or link-based method to protect a dynamic connection; the former suffers slow restoration speed while the latter requires complicated online backup path computation. We propose a new dynamic restorable connection establishment algorithm using p-cycle protection. For a given connection request, our algorithm first computes a working path and then computes a set of p-cycles to protect the links on the working path so that the connection can survive any single link failure. The key advantage of the proposed algorithm over the link-based method is that it enables faster failure restoration while requires much simpler online computation for connection establishment. Tree-based schemes offer several advantages such as scalability, failure impact restriction and distributed processing. We present a new tree-based link protection scheme to improve the hierarchical protection tree (p-tree) scheme [31] for single link failure in mesh networks, which achieves 100% restorability in an arbitrary 2-connected network. To minimize the total spare capacity for single link failure protection, an integer linear programming (ILP) formulation is provided. We also develop a fast double-link failure restoration scheme by message signaling to take advantage of the scalable and distributed processing capability of tree structure

Multiple Failure Survivability in WDM Mesh Networks

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foundation (NSF) / ANI 01-21662 ITR and ACI 99-84492 CAREE

Survivability and resilience mechanisms in modern optical fibre systems

Optical fibre networks play an increasingly prominent role in communications. As networks grow in size and complexity, the probability and impact of failures increase. In this dissertation, different optical network concepts, survivability and resilience methods are considered. Link and Path failures are discussed and Static Path Protection (SPP), Shared Backup Path Protection (SBPP), as well as Path Restoration (PR) are investigated. A Shared Backup Path Protection model and simulation tool is designed and implemented. This implementation is compared with other studies. Dual-link failures are considered under specific network topologies. Shortest Path algorithms are used to reprovision optimal routes for backup protection. Results and conclusions are discussed in detail, giving valuable insight into resilience methods. Availability and protectability are discussed and evaluated as measures of resilience and network survivability. Results vary between compromising little availability and bringing a significant improvement in availability. It is concluded that the implementation of SBPP is a necessity in highly-meshed networks with high availability needs, but doesn’t necessarily provide the best solution for sparsely-connected networks. The additional cost involved in the implementation needs to be considered carefully.Dissertation (MEng)--University of Pretoria, 2007.Electrical, Electronic and Computer Engineeringunrestricte