No abstract

Abstract:We propose a network coding aware instantaneous recovery scheme based on optimal traffic splitting that determines a set of K + 1 disjoint paths which minimizes the total cost of network resource utilization. A traffic demand is equally split into K equal parts and sent along K disjoint paths, and the K + 1th path is provided to carry simultaneously the network coded traffic of all the equally divided traffic for instantaneous recovery upon occurrence of failure.

Abstract:The 1+1 protection provides instantaneous receiverinitiated 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.

No abstract

No abstract