By Topic

A new distributed shortest path algorithm for hierarchically clustered data networks

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)
Huang, G. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Zhu, S.

This paper presents new efficient shortest path algorithm to solve single origin shortest path problems (SOSP problems) and multiple origins shortest path problems (MOSP problems) for a class of hierarchically clustered data networks with n nodes. The distributed version of our SOSP algorithm has the time complexity of O(log(n)), which is less than the time complexity of O (log2(n)) achieved by the best existing algorithm, for SOSP problems. Our MOSP algorithm minimizes the needed computation resources, which include computation processors and communication links, for each shortest path computation so that we can achieve massive parallelization. The parallel time complexity of our MOSP algorithm is O (mlog(n)), which is much less than the time complexity of (Mlog2 (n)) of the best existing algorithm. Here, M is the number of the shortest paths to be computed and m is a positive number related to the network situations and is usually much smaller than M. We observe that m is almost a constant when the network size increases

Published in:

American Control Conference, Proceedings of the 1995  (Volume:3 )

Date of Conference:

21-23 Jun 1995