A mathematical model for routing in 1+1 protection with network coding for instantaneous recovery

Abstract

The 1+1 protection provides instantaneous receiver-initiated recovery from any single link failure by using at least double network resources. This letter presents an Integer Quadratic Programming (IQP) model to determine an optimum set of routes that minimizes the required network resources for 1+1 protection using the network coding (NC) technique while maintaining the capability of instantaneous recovery. The cost obtained from our developed IQP model is compared with that of the conventional minimal-cost routing policy, where both approaches include the NC effect. Numerical results show that the IQP model achieves almost double resource saving effect in our examined networks.