Analysis of end-to-end recovery algorithms with preemptive priority in GMPLS networks

Abstract

To provide high resilience against failures, optical networks must have an ability to maintain an acceptable level of service during network failures. This paper proposes a new enhanced end-to-end recovery algorithm that guarantees fast and dynamic utilization of network resources in Wavelength Division Multiplexing (WDM) based Generalized Multi-protocol Label Switching (GMPLS) networks. The proposed algorithm guarantees the maximum availability with less burden in finding as many disjointed paths. This paper also has developed an analytical model and performed analysis for the proposed algorithm in terms of two performance factors: mean system time and blocking probability.