An Optimum Mathematical Programming Model for Network-Coding Based Routing with 1+1 Path Protection

This paper presents a mathematical programming model to determine an optimum set of routes that minimizes the required network resources in 1+1 protection using network coding, which in turn accommodates more traffic to be injected into the network. The 1+1 protection technique provides quick proactive recovery from any single link failure. However, provisioning of this technique demands at least double network resources. So it is desirable to reduce the cost for 1+1 protection scheme. The network coding technique, where intermediate nodes along a path can process the incoming data, provides high throughput using less network resources. In this research work, our developed mathematical model is formulated as a Non Linear Integer Programming (NLIP) problem. The cost obtained from our developed model is compared with that of a conventional minimal-cost routing policy, where both approaches include the network coding effect. Numerical results show that our model achieves almost double resource saving effect in the examined networks.