Building alternate multitasking trees in MPLS networks

An algorithm for computing alternate multicast trees in packet transport networks is proposed in this paper. The algorithm efficiently computes multiple sub-optimal tree candidates for a given multicast service request. The algorithm builds on the widely used computation of K ordered loopless shortest paths and can be applied to any connected network topology. Simulation experiments obtained for a multiprotocol label switching (MPLS) network are presented to evaluate the effectiveness and performance of the algorithm.