Scheduling Algorithms for Primary LSPs with n-to-m Protection in MPLS Networks

Abstract

The protection mechanism is very important in networks when working paths fall failure. In this paper, we propose a scheduling mechanism with n-to-m protection (n is the number of primary LSPs (Label Switching Path), m is the number of backup LSPs) in MPLS (Multi-Protocol Label Switching) networks. Two scheduling algorithms are proposed: the flrst algorithm is MMMSA (maximize mixing metric scheduling algorithm), aiming at maximize the mixing metrics of backup LSPs by calculating the proportion of each ∞ow that transferred from primary LSPs to backup LSPs with linear programming; the second algorithm is AHP-WSA (analytic hierarchy process-weight scheduling algorithm), considering multi-metrics (bandwidth, delay, package error rate) of backup LSPs separately and making pairwise comparison of the alternatives, then flnding out each backup LSP’s weight to a speciflc primary LSP and scheduling the ∞ows with theses weights. Simulation results show that these algorithms can achieve e‐cient and high performance scheduling.