Journal ArticleDOI
A fast distributed shortest path algorithm for a class of hierarchically clustered data networks
TLDR
The BHC topology is introduced in this paper and is shown to be a realistic characterization for a large class of interconnected data networks.Abstract:
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. >read more
Citations
More filters
Posted Content
Distributed Approximation Algorithms for Weighted Shortest Paths
TL;DR: In this paper, the authors presented an algorithm for computing both single-source shortest paths (sssp) and all-pairs shortest paths in the weighted case with a running time of O(1+o(1)).
Proceedings ArticleDOI
Distributed approximation algorithms for weighted shortest paths
TL;DR: The time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n) bandwidth restriction on edges is studied to find a sublinear-time algorithm with almost optimal solution.
Proceedings ArticleDOI
Efficient distributed source detection with limited bandwidth
Christoph Lenzen,David Peleg +1 more
TL;DR: This work gives a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most O(log ) bits, and demonstrates its utility for various routing problems, exact and approximate diameter computation, and spanner construction.
Book ChapterDOI
Distributed algorithms for network diameter and girth
TL;DR: A distributed algorithm that computes the diameter of the network in O(n) rounds and two distributed approximation algorithms that almost match their lower bounds for constant diameter and for constant girth.
Journal ArticleDOI
A recurrent neural network for solving the shortest path problem
TL;DR: The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation and to be able to generate optimal solutions to the shortest Path problem.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.