On fast computing bypass tunnel routes in MPLS-based local restoration

We outline a mechanism for fast rerouting IP traffic around link failures using MPLS bypass tunnels. As the main component of this mechanism we propose a simplified single-pair incremental Dijkstra algorithm. We evaluate the algorithm and restoration mechanism performance when used in regular and random network topologies.