A QoS-based routing algorithm for PNNI ATM networks

Authors:
Chen-Khong Tham;Jianning Mai;Lawrence Wc Wong
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260;Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260;Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260
Venue:
Computer Communications
Year:
2002

Citing 7
Cited 0

On routing in ATM networks

Routing in communications networks
Optimal PNNI complex node representations for restrictive costs and minimal path computation time

IEEE/ACM Transactions on Networking (TON)
Spanning tree method for link state aggregation in large communication networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Competitive routing of virtual circuits in ATM networks

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Routing subject to quality of service constraints in integrated communication networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

Although the ATM Forum has proposed the Private Network-Network Interface (PNNI) specification 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 routing framework and does not standardize on a method of finding an appropriate path. In this paper, we propose a heuristic routing algorithm called the Backward Hierarchical Routing Algorithm (BHRA) for ATM networks, which is compliant with the PNNI protocol. BHRA uses an adaptive and iterative path search approach and takes advantage of the PNNI hierarchical network structure. It consists of three components: (1) a path selection algorithm, (2) a rerouting mechanism, and (3) inter-class resource sharing. The BHRA has been simulated using the BONeS network simulation tool and the simulation results show that call setup time is significantly reduced, and the computational overhead and call blocking probability are lower, compared to other PNNI routing algorithms. Network throughput is also improved by evenly distributing the traffic among several eligible paths. A multicast routing extension to BHRA is also presented.