Open Access
A distributed algorithm for constructing minimal spanning trees in computer-communication networks
Yogen K. Dalal
- Vol. 77, pp 27283
TLDR
In this paper, a distributed algorithm for constructing minimal spanning trees in computer-communication networks is presented, which can be executed concurrently and asynchronously by the different computers of the network.Abstract:
This paper presents a distributed algorithm for constructing minimal spanning trees in computer-communication networks. The algorithm can be executed concurrently and asynchronously by the different computers of the network. This algorithm is also suitable for constructing minimal spanning trees using a multiprocessor computer system. There are many reasons for constructing minimal spanning trees in computer-communication networks since minimal spanning tree routing is useful in distributed operating systems for performing broadcast, in adaptive routing algorithms for transmitting delay estimates, and in other networks like the Packet Radio Network.read more
Citations
More filters
Journal ArticleDOI
Communication Issues in the Design and Analysis of Parallel Algorithms
B. Lint,T. Agerwala +1 more
TL;DR: Several models of synchronous and asynchronous parallel computation and their use in analyzing algorithms and the importance of interprocessor communication in parallel processing is demonstrated.
Proceedings ArticleDOI
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
TL;DR: The results contradict the "folk theorem" noted in Awerbuch, et.al.
Proceedings ArticleDOI
Reliability and scaling issues in multicast communication
TL;DR: This paper shows that internet multicasting algorithms based on reverse path forwarding are inherently unreliable and present a source-tree-based reliable multicasting scheme, and presents a scheme for partial multicasting and introduces a new network level operation, called gather.
Journal ArticleDOI
The Steiner problem in distributed computing systems
TL;DR: A distributed algorithm is presented for constructing a nearly optimal Steiner tree in an asynchronous network represented by a weighted communication graph G = (V, E, c) where G is the subset of nodes of G to be connected.
Proceedings ArticleDOI
Fast and compact self stabilizing verification, computation, and fault detection of an MST
TL;DR: This paper presents algorithms that are both time and space efficient for constructing an MST, for verifying it, and for detecting the location of the faults, and introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the memory size complexity, while obtaining time efficiency too.
References
More filters
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
ReportDOI
A Distributed Algorithm for Minimum Weight Spanning Trees. Revision
TL;DR: In this paper, a distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights, where a processor exists at each node of the graph, knowing initially only the weights of the adjacent edges.
Journal ArticleDOI
Reverse path forwarding of broadcast packets
TL;DR: Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks which can be implemented in existing networks with less complexity than that required for the known alternatives.
Journal ArticleDOI
Finding Minimum Spanning Trees
TL;DR: This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem.