Control and management of large and dynamic networks
Control and management of large and dynamic networks
An Adaptive Hierarchical Routing Protocol
IEEE Transactions on Computers
The Compilation of Regular Expressions into Integrated Circuits
Journal of the ACM (JACM)
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks
IEEE Transactions on Parallel and Distributed Systems
A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks
IEEE Transactions on Parallel and Distributed Systems
Concurrent Communication in High-Speed Wide Area Networks
IEEE Transactions on Parallel and Distributed Systems
Reverse shortest path for dataflow optimization of hierarchically structure data networks
WSEAS TRANSACTIONS on COMMUNICATIONS
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 14.98 |
A distributed algorithm is presented that can be used to solve the single-destination shortest path (SDSP) problem or the all-pairs shortest path (APSP) problem for a class of clustered data networks. The network graph is assumed to be characterized with a balanced hierarchically clustered (BHC) topology. The BHC topology is introduced in this paper and is shown to be a realistic characterization for a large class of interconnected data networks. For certain types of BHC topologies, the SDSP problem can be solved with computation and communication time complexities of O(log n), assuming one processor is available at each of the n number of nodes. Assuming p processors are available at each node, computation and communication time complexities of O((n/p) log n) and O(n log n) are achievable, respectively, for solving the APSP problem. It is also shown that the algorithm converges in an asynchronous environment.