Abstract
Path selection under multiple additive QoS constraints in high‐speed networks is an NP‐complete problem. Most of the algorithms proposed for QoS routing suffer from either excessive computational complexities or low performance. In this paper, we propose two practical heuristic algorithms that are based on iterative shortest‐path computations with a dynamic cost function. The cost function comprises a combination of several QoS constraints and a single optimization metric. A simulation program evaluates the performance of the algorithms. The simulation results indicate that our algorithms give very high performance and fast running time.