A QoS-based routing algorithm for PNNI ATM networks

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.

[1]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[2]  Peter Steenkiste,et al.  Supporting dynamic inter-class resource sharing: a multi-class QoS routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[4]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[5]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[6]  Whay Chiou Lee Spanning tree method for link state aggregation in large communication networks , 1995, Proceedings of INFOCOM'95.

[7]  강인혜,et al.  [서평]High-Speed Networks : TCP/IP and ATM Design Principles , 1999 .

[8]  Duan-Shin Lee,et al.  ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking (Special Issue on Multimedia on Demand) , 1996 .

[9]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Qingming Ma,et al.  Routing traffic with qualityof-service guaraxttees in integrated services networks , 1998 .

[12]  Marc Boisseau,et al.  High-speed networks , 1994, Wiley series in communication and distributed systems.

[13]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[14]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[15]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  Serge A. Plotkin Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[17]  Ilias Iliadis,et al.  Optimal PNNI complex node representations for restrictive costs and minimal path computation time , 2000, TNET.

[18]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.