A parallel and distributed routing algorithm with a hierarchical connection management architecture for ATM/B-ISDN

We propose a parallel and distributed routing algorithm with a hierarchical connection management architecture for the ATM/B-ISDN transport networks. In the proposed routing algorithm, a hierarchical connection management architecture is assumed where each subnetwork has its own routing functions to find the shortest route for the request subnetwork connections, and the routing information is merged by the upper-level domain subnetwork to find shortest path in the domain. This subnetwork routing is performed in each subnetwork in hierarchy, providing maximized parallel and distributed processing capability. The proposed parallel and distributed routing algorithm can reduce the routing time in a large network, such as a public B-ISDN.