Control and management of large and dynamic networks
Control and management of large and dynamic networks
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks
IEEE Transactions on Computers
A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks
IEEE Transactions on Parallel and Distributed Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Dynamic Programming
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Hi-index | 0.02 |
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 hierarchically clustered data networks. To solve an SOSP problem for a network with n nodes, the distributed version of our algorithm reaches the time complexity of O(log(n)), which is less than the time complexity of O(log2(n)) achieved by the best existing algorithm [1]. To solve an MOSP problem, our algorithm minimizes the needed computation resources, including computation processors and communication links for the computation of each shortest path so that we can achieve massive parallelization. The time complexity of our algorithm for an MOSP problem is O(mlog(n)), which is much less than the time complexity of O(Mlog2(n)) of the best previous algorithm. Here, M is the number of the shortest paths to be computed and m is a positive number related to the network topology and the distribution of the nodes incurring communications. m is usually much smaller than M. Our experiment shows that m is almost a constant when the network size increases. Accordingly, our algorithm is significantly faster than the best previous algorithms to solve MOSP problems for large data networks.