Single-path and multi-path label switched path allocation algorithms with quality-of-service constraints: performance analysis and implementation in NS2

Abstract

The choice of the path computation algorithm is a key factor to design efficient traffic engineering strategies in multi-protocol label switching networks and different approaches have been proposed in the literature. The effectiveness of a path computation algorithm should be evaluated against its ability to optimise the utilisation of network resources as well as to satisfy both current and future label switched paths allocation requests. Although powerful and flexible simulation tools might be useful to assist a network manager in the selection of proper algorithms, state-of-the-art simulators and network planning tools do not currently offer a suitable support. This study deals with the design and performance evaluation of multi-constraints path computation algorithms. To this aim, ad hoc software modules have been developed and integrated within the MTENS simulator. New single-path and multi-path computation algorithms have been proposed and compared in terms of number of accepted requests, success probability, network resources utilisation and execution time. Finally, some guidelines and recommendations for the selection of path computation algorithms have also been provided.