A linear-based trunk reservation routing algorithm for ATM networks
In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the...
Saved in:
| Published in | International journal of communication systems Vol. 12; no. 2; pp. 125 - 141 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Chichester, UK
John Wiley & Sons, Ltd
01.03.1999
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1074-5351 1099-1131 |
| DOI | 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E |
Cover
| Summary: | In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the load‐balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real‐time application render it as an efficient routing algorithm for ATM networks. Copyright © 1999 John Wiley & Sons, Ltd. |
|---|---|
| Bibliography: | ArticleID:DAC390 istex:2C6CF98C3CA71413EC9E821296708407328EF883 ark:/67375/WNG-3WNBFNPV-3 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1074-5351 1099-1131 |
| DOI: | 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E |