Performance And Complexity Evaluation Of Multi-Path Routing Algorithms For Mpls-Te

This paper discusses and evaluates the behaviour of a DS-TE algorithm (DiffSev aware MPLS traffic Engineering) called PEMS, and a dynamic multipath routing algorithm for load balancing (LBWDP), applied on a huge topology that correspond to real network. To clarify network topologies and routing algorithms that are suitable for MPLS Traffic Engineering, we evaluate them from the viewpoint of network scalability and end-to-end quality. We characterize typical network topologies and practical routing algorithms. Using a network topology generated by BRITE, that has many alternative paths, can provide a real simulation of the internet and a good evaluation for the end-to-end quality and the network use. In this paper, we first review MPLS-TE, DiffServ and load balancing. We then discuss the general issues of designing for a lot of DS-TE and load balancing algorithms. Based on our works, a generic procedure for deploying and simulating these algorithms is proposed. We also discuss the results and a comparison between the algorithms. Putting these together, we present a practical issue of Traffic Engineering, load balancing and a working solution for DS-TE in the Internet.