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.
[1]
Qing Zhu,et al.
An iterative algorithm for delay-constrained minimum-cost multicasting
,
1998,
TNET.
[2]
Li Layuan.
A routing algorithm for distributed optimal double loop computer networks
,
1987
.
[3]
Wanlei Zhou,et al.
Efficient algorithm for mobile multicast using anycast group
,
2001
.
[4]
Duan-Shin Lee,et al.
ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking (Special Issue on Multimedia on Demand)
,
1996
.
[5]
L. Layuan,et al.
A routing protocol for dynamic and large computer networks with clustering topology
,
2000
.
[6]
John Moy,et al.
Multicast routing extensions for OSPF
,
1994,
CACM.