A conventional model to determine network coding (NC) aware minimum cost routes, for employing 1+1 protection in scenarios with two sources and a common destination (2
S-
D), was addressed. When the common destination’s node degree is only two, NC cannot be employed, because failure of an adjacent link carrying original data restricts recovery operation at the destination. This letter presents a mathematical model for optimum NC aware 1+1 protection routing in 2
S-
D scenarios with destination’s node degree ≥2. Numerical results observe that our presented model achieves 5.5% of resource saving, compared to the conventional model, in our examined networks.
View full abstract