A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering

Abstract

The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress–egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright © 2011 John Wiley & Sons, Ltd.