A New Preemption Algorithm for Diffserv-Aware Traffic Engineering in MPLS Networks

The preemption policy with three main preemption optimization criteria is proposed in many literatures and the choice of LSPs to be preempted is an NP-complete problem. We propose a heuristic algorithm called B-PREPT to solve the problem. Simulation results indicate that our algorithm has higher choice accuracy than the well-known heuristic algorithm recently cited by many other papers. Moreover, the computational complexity of our algorithm is acceptable for router's online computing in large scale networks.