The QoS-based routing algorithms for high-speed networks

As B-ISDN standards and high-speed networks emerge, modern networks are expected to provide a wide range of services and guarantee various end-to-end quality of service (QoS). The QoS requirement and the complex trade-off among them make it difficult to define a single routing metric. There is also the problem of routing in a dynamic environment due to fluctuations in traffic load, link failures and topology changes. The paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM-based high-speed networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI (private network-network interface) specification from the ATM Forum and can reduce path computational 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