Instantaneous recovery scheme with optimal traffic splitting using network coding

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 total network resource utilization. A demand is equally split into K disjoint paths, and K+1th path carries encoded traffic for instantaneous recovery upon failure.