A dynamic traffic re-assignment algorithm targeted for MPLS networks

The label switched paths of Multi-Protocol Label Switching (MPLS) makes it an Internet technology that can facilitate Traffic Engineering. This research evaluates the performance of a dynamic Traffic Re-assignment algorithm targeted for Multi-Protocol Label Switching networks. It extends the concepts of Multi-path Adaptive Traffic Engineering (MATE) and Fast Acting Traffic Engineering (FATE) mechanisms. We present a stochastic framework for partitioning an aggregate flow of Expedited Forwarding (EF) traffic and Assured Forwarding (AF) traffic unto alternate label switched paths when a path is experiencing congestion. This algorithm aims to reduce delay and packet loss in the MPLS domain by temporarily shifting individual traffic to alternate under-utilized paths.; The performance of the proposed algorithm was compared to the MATE algorithm. The performance measures of response time, delay and loss were used. The simulation results demonstrate the advantages of using the Traffic Re-assignment algorithm over the MATE algorithm.