Routing with Traffic Splitting based on Erasure Correcting Code for Instantaneous Recovery

摘要

In order to achieve instantaneous recovery from any single link failure, this paper proposes a heuristic routing algorithm for designing a set of working and protection routes for all possible source destination pairs. The proposed algorithm employs erasure correcting code based instantaneous recovery technique with traffic splitting. When the links in a network have finite capacities, routing for one pair affects the routing for the remaining pairs. In the worst case, one need to check routing for exponential number of traffic splitting number combinations. If the number of combinations to be considered becomes large no routing solution is possible in a reasonable time. In order to achieve a routing solution within a reasonable time, our proposed heuristic algorithm gives highest priority to the pair either with the largest cost or with the largest resource saving effect. Numerical results observe that by designing routes with the proposed algorithm almost 20 of resource saving, as compared to the conventional 1+1 protection, was achieved in our examined networks.