Performance and Complexity Evaluation of Multi-path Routing Algorithms for MPLS-TE Applied on Large Scales Topologies

Khodor Abboud (1) , Armand Toguyeni (2) , Ahmed Rahmani (3)

1 LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
2 STF - Systèmes Tolérants aux Fautes
3 LAGIS-MOCIS

This paper discusses and evaluates the behaviour o fa 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. Using a network topology generated by BRITE that has many alternative paths can provide a real simulation of the Internet and gives 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.

Domaines: Automatique

Khodor Abboud, Armand Toguyeni, Ahmed Rahmani. Performance and Complexity Evaluation of Multi-path Routing Algorithms for MPLS-TE Applied on Large Scales Topologies. Second International Conference on Sensor Technologies and Applications, 2008., Aug 2008, Cap Esterel, France. pp.782 - 787. ⟨hal-00801602⟩