The QoS-based routing algorithms for high-speed networks

摘要

As B-ISDN standards and high-speed networks emerge, modernnnetworks are expected to provide a wide range of services and guaranteenvarious end-to-end quality of service (QoS). The QoS requirement and thencomplex trade-off among them make it difficult to define a singlenrouting metric. There is also the problem of routing in a dynamicnenvironment due to fluctuations in traffic load, link failures andntopology changes. The paper presents a planned routing algorithm (PRA)nand a hierarchical routing algorithm (HRA) for ATM-based high-speednnetworks. The PRA can establish the multicast tree with the presence ofnbandwidth and delay constraints. The HRA can be compliant with the PNNIn(private network-network interface) specification from the ATM Forum andncan reduce path computational complexity and maximize networknthroughput. The performances of the PRA and HRA are evaluated bynsimulations. The simulation results show that the PRA can provide thenbest performance while the complexity is acceptable and the HRA cannreduce processing time and improve network utilization