IEICE Communications Express
Online ISSN : 2187-0136
ISSN-L : 2187-0136
A mathematical model for network coding aware optimum routing in 1+1 protection for instantaneous recovery with relaxing destination’s node degree constraint
Abu Hena Al MuktadirPham Vu PhongEiji Oki
Author information

2013 Volume 2 Issue 12 Pages 512-517


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 (2S-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 2S-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.

Related papers from these authors
© 2013 The Institute of Electronics, Information and Communication Engineers
Previous article Next article