QoS-based routing algorithms for ATM networks

Authors:
Li Layuan;Li Chunling
Affiliations:
Department of Computer Science and Technology, Wuhan Transportation University, Wuhan 430063, People's Republic of China;Department of Computer Science and Technology, Wuhan Transportation University, Wuhan 430063, People's Republic of China
Venue:
Computer Communications
Year:
2001

Citing 3
Cited 7

Multicast routing extensions for OSPF

Communications of the ACM
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
A routing protocol for dynamic and large computer networks with clustering topology

Computer Communications

A QoS multicast routing protocol for dynamic group topology

Information Sciences: an International Journal
Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process

Computers and Operations Research
An Energy Level Based Routing Protocol in Ad Hoc Networks

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
A QoS multicast routing protocol for clustering mobile ad hoc networks

Computer Communications
Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process

Computers and Operations Research
Genetic algorithm-based QoS multicast routing for uncertainty in network parameters

APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
A distributed broadcast algorithm for wireless mobile ad hoc networks

MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II

Quantified Score

Hi-index	0.24

Visualization

Abstract

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 specification 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.