p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs)

Abstractp-Cycle survivable network design under the single link failure assumption has been studied extensively. Shared risk link group (SRLG) is a concept that better reflects the nature of network failures. An SRLG is a set of links that may fail simultaneously because of a common risk they share. The capability of dealing with SRLG failures is essential to network survivability. In this paper, we extend the p-cycle survivable network design from the single link failure model to the single SRLG failure model. An integer linear programming (ILP) formulation that minimizes spare capacity requirement is provided. To avoid enumerating all cycles of a network, we also provide a polynomial-time algorithm to generate a basic candidate p-cycle set that guarantees 100% restorability in case of any single SRLG failure given enough spare capacities. Moreover, we present the SRLG failure detection problem that prevents fast restoration upon an SRLG failure. To solve this problem, we introduce the concept of SRLG-independent restorability, which enables the restoration of each link in a failed SRLG to start immediately without knowing which SRLG has failed. We present an approach to optimal p-cycle design with SRLG-independent restorability and show that it is NP-hard to generate a candidate p-cycle set such that each link can be SRLG-independently restored by at least one cycle in the set.

[1]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[2]  Dominic A. Schupke.  Multiple failure survivability in WDM networks with p-cycles , 2003, ISCAS.

[3]  Achim Autenrieth,et al.  Optimal configuration of p-cycles in WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[4]  Chang Liu,et al.  Finding good candidate cycles for efficient p-cycle network design , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[5]  Wayne D. Grover,et al.  Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

[6]  Dominic A. Schupke,et al.  The tradeoff between the number of deployed p-cycles and the survivability to dual fiber duct failures , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[7]  Dimitri Papadimitriou,et al.  Inference of Shared Risk Link Groups , 2001 .

[8]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

[9]  Dominic A. Schupke,et al.  Multiple failure survivability in WDM networks with p-cycles , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[10]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[11]  Oliver W. W. Yang,et al.  Finding protection cycles in DWDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[13]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[14]  Wayne D. Grover,et al.  Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).