NXG07-5: Computing a Backup Solution for an MPLS domain An Algorithm Minimizing the Configuration Overhead

In a multi-protocol label switching (MPLS) domain, one-to-one and facility backup are the two main local backup techniques. Research so far has only addressed the computation of single backup LSPs. However, an operator is in general in need of a backup solution, i.e. a set of backup LSPs for the whole domain. This paper presents four algorithms for computing a backup solution for the facility backup technique, three of which are extensions of well-known path computation algorithms and one of which is a novel algorithm named maximum protection first (MPF). MPF aims at minimizing the number of configuration entries and the number of backup paths. It is shown that MPF outperforms the other three algorithms with respect to these criteria.