Novel disjoint-LSP selection scheme with SRLG in GMPLS-based networks

In order to enhance the survivability of networks, network community must provide efficient recovery techniques to guarantee service continuity. In future generalized multi-protocol label switching (GMPLS)-based networks, several kinds of protection and restoration (P&R) mechanisms are provisioned. Finding physically disjoint label switched paths (LSPs) with shared risk link group (SRLG) is a crucial factor for all P&R mechanisms in GMPLS-based networks. The purpose of this paper is to propose an efficient disjoint-LSP selection scheme with SRLG (DLSSWS) in GMPLS-based networks. The proposed scheme can utilize SRLG information correctly and efficiently. Most important, it provides a common framework for conventional disjoint-path selection algorithms to find SRLG disjoint LSPs in GMPLS-based networks. In addition, the proposed scheme has lower cost than that of others (E. Oki, et al, 2002).