MODIFIED LEAST LOADED ROUTING IN VIRTUAL PATH BASED ATM NETWORKS

We consider a Virtual Path (VP) based ATM network supporting multiple traffic classes with heterogeneous traffic characteristics. Using simp le FIFO scheduling policy at the ATM multiplexer, we assume that all t raffic require identical end-to-end quality of service (QoS) requireme nt. The concept of effective bandwidth is used to determine the requir ed bandwidth to guarantee the specified QoS requirement. We study the problem of using dynamic routing to VP-based ATM networks by transform ing it into an equivalent multi-rate circuit-switched network problem. To further simplify the analysis, we restrict the choice of path to s ingle-link and two-link routes. We propose a dynamic routing algorithm based on the Least Loaded Routing (LLR) with packing. Simulation resu lts are used to compare the performance of this algorithm with other d ynamic routing schemes.