Loop-free path restoration with QoS and label constraints in MPLS networks

Abstract

In this paper we investigate traffic engineering for fault restoration techniques in Multiprotocol Label Switching networks carrying QoS and best effort traffic. We consider off-line computation of the working and backup paths for the QoS traffic as well as the paths for the best effort traffic. Two cases of 1+1 and 1:1 path protection are considered. Our algorithms allow for control on the size of the label space for each router in the network and ensures that the created routes are loop free. In addition, explicit routes can be accommodated supporting both node and link affinity.