A new heuristic algorithm for effective preemption in MPLS networks

Abstract

This paper gives a description of a new algorithm for preemption to be used in MPLS networks. It enables allocation of enabled network resources for a new path at the cost of removing one or more of the existing paths. The heuristic algorithm presented here selects paths to be removed, by using topology information. The method is based on an optimization function to achieve low band-width wastage on a network scale