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.
View full abstract