New distributed shortest path algorithm for hierarchically clustered data networks

Research output: Contribution to journalConference article

4 Citations (Scopus)

Abstract

This paper presents new efficient shortest path algorithms 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.

Original languageEnglish
Pages (from-to)2031-2035
Number of pages5
JournalProceedings of the American Control Conference
Volume3
Publication statusPublished - 1 Jan 1995
Externally publishedYes

Fingerprint

Telecommunication links

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

New distributed shortest path algorithm for hierarchically clustered data networks. / Huang, Garng Morton; Zhu, Shan.

In: Proceedings of the American Control Conference, Vol. 3, 01.01.1995, p. 2031-2035.

Research output: Contribution to journalConference article

@article{daf40fe8c55f4a2999620b0e0fc3eede,
title = "New distributed shortest path algorithm for hierarchically clustered data networks",
abstract = "This paper presents new efficient shortest path algorithms 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.",
author = "Huang, {Garng Morton} and Shan Zhu",
year = "1995",
month = "1",
day = "1",
language = "English",
volume = "3",
pages = "2031--2035",
journal = "Proceedings of the American Control Conference",
issn = "0743-1619",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - New distributed shortest path algorithm for hierarchically clustered data networks

AU - Huang, Garng Morton

AU - Zhu, Shan

PY - 1995/1/1

Y1 - 1995/1/1

N2 - This paper presents new efficient shortest path algorithms 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.

AB - This paper presents new efficient shortest path algorithms 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.

UR - http://www.scopus.com/inward/record.url?scp=0029200830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029200830&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029200830

VL - 3

SP - 2031

EP - 2035

JO - Proceedings of the American Control Conference

JF - Proceedings of the American Control Conference

SN - 0743-1619

ER -