✦ LIBER ✦

QoS-based routing algorithms for ATM networks

✍ Scribed by Li Layuan; Li Chunling

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 217 KB
Volume: 24
Category: Article
ISSN: 0140-3664
DOI: 10.1016/s0140-3664(00)00231-0

No coin nor oath required. For personal study only.

✦ Synopsis

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 adaptive and iterative path search approach and takes advantage of the PNNI hierarchical network structure to reduce path computation complexity and maximize network throughput. The performances of the PRA and HRA are evaluated by simulations. The simulation results show that the PRA can provide the best performance while the complexity is acceptable and the HRA can reduce processing time and improve network utilization, and both are suited for QoS requirements of ATM networks' routing.

📜 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

Efficient hierarchical QoS routing in AT

Efficient hierarchical QoS routing in ATM networks

✍ Ben-Jye Chang; Ren-Hung Hwang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 233 KB

For reducing network information to achieve scalability in large ATM networks, ATM Private Network-to-Network Interface (PNNI) adopts hierarchical routing. Consequently, although routing complexity is signi®cantly reduced, numerous issues in PNNI routing require further study to achieve more ef®cien

Adaptive crankback schemes for hierarchi

Adaptive crankback schemes for hierarchical QoS routing in ATM networks

✍ Ben-Jye Chang; Hsien-Kang Chung; Ren-Hung Hwang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 386 KB

To reduce routing information and achieve scalability in large ATM networks, ATM Private Network-to-Network Interface (PNNI) adopts hierarchical routing. For ef®cient routing, a large ATM network is decomposed into subnetworks called Peer Groups (PG), which advertise aggregated routing information o

UPC/NPC algorithm for guaranteed QoS in

UPC/NPC algorithm for guaranteed QoS in ATM networks

✍ Y.J. Kim; S.C. Chang; C.K. Un; B.C. Shin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A linear-based trunk reservation routing

A linear-based trunk reservation routing algorithm for ATM networks

✍ Antonios F. Atlasis; Evangelos D. Baltatzis; George I. Stassinopoulos; Iakovos S 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 1 views

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

QoS routing based on multi-class nodes f

QoS routing based on multi-class nodes for mobile ad hoc networks

✍ Xiaojiang Du 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 564 KB

In this paper, we present a new quality of service (QoS) routing protocol for mobile ad hoc networks (MANETs). Most of the existing routing protocols assume homogeneous nodes in MANETs, i.e., all nodes have the same communication capabilities and characteristics. However, in many ad hoc networks, no