New methods for shortest path selection for multimedia traffic with two delay constraints
Path selection based on two criteria, propagation delay and maximum delay jitter, is often a requirement in high-speed networks carrying multimedia traffic. Shortest path selection with multiple additive or multiplicative criteria is a NP-complete problem. Simply adding propagation and jitter delay bounds into a single delay criterion is shown to eliminate from consideration a large number of otherwise acceptable path choices. In this paper, four new solutions for polynomial-time, two-criteria path selection are presented. The first solution is a two-pass modified Bellman-Ford algorithm. The other solutions are based on a weighted single-criterion path search and are described via a novel geometric construction of the path selection problem. The new solutions are mathematically proved and their effectiveness demonstrated with a simulation experiment. Applications of the new solutions to ATM PNNI and IP routing are described. (C) 1999 Elsevier Science B.V. All rights reserved.
routing quality of service multiple-criteria path-selection asynchronous transfer mode private network-network interface internet protocol