Comparison of multipath algorithms for load balancing in a MPLS network

  • Authors:
  • Kyeongja Lee;Armand Toguyeni;Aurelien Noce;Ahmed Rahmani

  • Affiliations:
  • LAGIS, UMR CNRS 8146, Ecole centrale de Lille, Villeneuve d'ASCQ, France;LAGIS, UMR CNRS 8146, Ecole centrale de Lille, Villeneuve d'ASCQ, France;LAGIS, UMR CNRS 8146, Ecole centrale de Lille, Villeneuve d'ASCQ, France;LAGIS, UMR CNRS 8146, Ecole centrale de Lille, Villeneuve d'ASCQ, France

  • Venue:
  • ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traffic Engineering aims to optimize the operational performance of a network. This paper focuses on multipath routing for traffic engineering that routes the demand on multiple paths simultaneously for balancing the load in the network. According to the schematic approach of multipath routing that we propose in this paper, a multipath routing algorithm selects candidate paths using multicriteria simultaneously and then distributes the traffic demand among selected paths. Among multipath routing algorithms, we select four algorithms which fit our expectations in terms of architecture: WDP, MATE, multipath-AIMD and LDM. We focused exclusively on technologies designed for MPLS networks. Each algorithm is compared with respect to complexity and stability of two stages: the computation of multiple paths and the traffic splitting among multiple paths.