Performance Evaluation on a Hybrid Algorithm for Computing Constrained Shortest Paths

Abstract

Finding a delay constrained least-cost path in a directed graph is a fundamental issue for quality of service provisioning in communication networks. Recently Feng and Turkay proposed a hybrid algorithm which uses a heuristic approach to boost the average performance of a well known approximation algorithm. In this paper we provide extensive simulation results to show that the hybrid algorithm runs significantly faster than the approximation algorithm, often by one or two orders of magnitude.