By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kim, Young-Tak ; Department of Information & Communication Engineering, Yeungnam University, KyungSan, Korea ; Koo, Soo-Yong

In this paper, we propose a parallel and distributed routing algorithm for the ATM/B-ISDN transport networks. In the proposed routing algorithm, a hierarchical connection management architecture is used where each subnetwork has its own connection management functions to find the shortest path for the requested subnetwork connections and the routing information is merged by the upper-level domain subnetwork to find the shortest path in the merged domain of upper-level. 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 and connection setup time in a large-scale network, such as a public B-ISDN.

Published in:

Communications and Networks, Journal of  (Volume:1 ,  Issue: 4 )