On Routing with QOS Constraints in ATM Networks
Dirceu Cavendish, Mário Gerla · 1997
Multimedia applications require guaranteed QOS, which will be provided by multimedia networks, such as ATM, by resource reservation. The complexity of routing and allocating resources for ATM applications vary according with applications end-to-end constraints, and essentially range from P to NP complete problems (Wang et al (1995)). In this paper, we expand the class of known P type, constrained routing problems, by including two applications of significance in ATM, namely loss sensitive ABR traffic, and delay sensitive VBR traffic. For such routing problems, we present a O (N 4) polynomial time algorithm, prove its correctness, and illustrate its effectiveness with simulation experiments.