Dynamic routing algorithms in VP-based ATM networks
Tsang, Danny H.K.
|Source||Conference Record / IEEE Global Telecommunications Conference, v. 2, 1995, p. 1364-1368|
|Summary||We consider a VP-based ATM network supporting multiple traffic classes with different traffic characteristics but with identical end-to-end quality of service (QoS) requirement. The concept of effective bandwidth is used to determine the required bandwidth to guarantee the QoS requirement of each traffic class. We study the problem of using dynamic routing to VP-based ATM networks by transforming it into an equivalent multi-rate circuit-switched network problem. To further simplify the analysis, we restrict the choice of path to single-link and two-link routes. We propose a dynamic routing algorithm based on the Least Loaded Routing (LLR) with packing. Simulation results are used to compare the performance of this algorithm with other dynamic routing schemes such as LLR.|
|Rights||© 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
View full-text via Scopus
View full-text via Web of Science
Files in this item: