๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A linear-based trunk reservation routing algorithm for ATM networks

โœ Scribed by Antonios F. Atlasis; Evangelos D. Baltatzis; George I. Stassinopoulos; Iakovos S. Venieris

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
175 KB
Volume
12
Category
Article
ISSN
1074-5351

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A QoS-based routing algorithm for PNNI A
A QoS-based routing algorithm for PNNI ATM networks
โœ Chen-Khong Tham; Jianning Mai; Lawrence WC Wong ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

Although the ATM Forum has proposed the Private NetworkยฑNetwork Interface (PNNI) speciยฎcation to facilitate routing in ATM networks, path selection or routing algorithms that guarantee users' multiple Quality of Service (QoS) requirements remain an open issue since the PNNI protocol only provides a

QoS-based routing algorithms for ATM net
QoS-based routing algorithms for ATM networks
โœ Li Layuan; Li Chunling ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI speciยฎcation from the ATM Forum. It uses an adaptiv

A learning algorithm for multilayered ne
A learning algorithm for multilayered neural networks based on linear least squares problems
โœ Friedrich Biegler-Kรถnig; Frank Bรคrmann ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

An algorithm ./or the training of mtdtilayered neural networks solely based on linear algebraic methods is presented. Its convergence speed up to a certain limit t~flearning accura~3' is orders o./magnitude better than that of the classical back propagation. Furthermore. its learning aptitude increa