Instantaneous recovery route design scheme using multiple coding-aware protection scenarios

Abstract

This paper proposes an instantaneous recovery route design scheme using multiple coding-aware link protection scenarios to achieve higher link cost reduction in the network. In this scheme, two protection scenarios, namely, (i) traffic splitting (T S), and (ii) two sources and a common destination (2S D) are used to integrate multiple sources and a common destination. The proposed scheme consists of two phases. In the first phase, the proposed scheme determines routes for 2S D and T S scenarios of all possible sourcedestination pairs to minimize the total link cost. In this phase, the network coding is applied to the common path within each scenario, individually. In the second phase, network coding is applied to the common path between two scenarios (or a scenario pair) in order to enhance the resource saving. This phase develops conditions that select the most appropriate combination of scenario pairs, such as T S-T S, 2S D-2S D, and 2S D-T S for network coding, including their proofs. Using these conditions, a heuristic algorithm is introduced in order to select the most appropriate combination of scenario pairs for further enhancing of resource saving. Simulation results show that the proposed scheme outperforms the conventional 1 + 1 protection scheme, the T S scenario, and the 2S D scenario in terms of link cost reduction in the network.