Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

Authors:
B. Awerbuch
Affiliations:
Department of Mathematics and Laboratory for Computer Science, MIT, Cambridge, MA
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 9
Cited 69

Complexity of network synchronization

Journal of the ACM (JACM)
Improvements in the time complexity of two message-optimal election algorithms

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reverse path forwarding of broadcast packets

Communications of the ACM
A locking protocol for resource coordination in distributed databases

SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Tight lower and upper bounds for some distributed algorithms for a complete network of processors

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A principle for resilient sharing of distributed resources

ICSE '76 Proceedings of the 2nd international conference on Software engineering
The impact of synchronous communication on the problem of electing a leader in a ring

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

A protocol to maintain a minimum spanning tree in a dynamic topology

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A lattice-structured proof of a minimum spanning

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The power of multimedia: combining point-to point and multi-access networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The APRAM: incorporating asynchrony into the PRAM model

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Calling names in nameless networks

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Randomized distributed shortest paths algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Distributed Algorithms for Network Recognition Problems

IEEE Transactions on Computers
Cost-sensitive analysis of communication protocols

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Fast distributed construction of k-dominating sets and applications

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Optimal distributed algorithm for minimum spanning trees revisited

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Distributed MST for constant diameter graphs

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Cluster based routing using a k-tree core backbone for mobile ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Spine routing in ad hoc networks

Cluster Computing
On the communication complexity of strong time-optimal distributed algorithms

Nordic Journal of Computing
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MST construction in O(log log n) communication rounds

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A faster distributed protocol for constructing a minimum spanning tree

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A distributed algorithm for constructing a minimum diameter spanning tree

Journal of Parallel and Distributed Computing
A linear-time optimal-message distributed algorithm for minimum spanning trees

Distributed Computing
A highly asynchronous minimum spanning tree protocol

Distributed Computing
Local heuristics and the emergence of spanning subgraphs in complex networks

Theoretical Computer Science - Complex networks
A faster distributed protocol for constructing a minimum spanning tree

Journal of Computer and System Sciences
Efficient detection of a locally stable predicate in a distributed system

Journal of Parallel and Distributed Computing
Local MST computation with short advice

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed network monitoring and multicommodity flows: a primal-dual approach

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A distributed approximation algorithm for the minimum degree minimum weight spanning trees

Journal of Parallel and Distributed Computing
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Fast deterministic distributed algorithms for sparse spanners

Theoretical Computer Science
On termination detection in crash-prone distributed systems with failure detectors

Journal of Parallel and Distributed Computing
Applying static network protocols to dynamic networks

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Efficient distributed approximation algorithms via probabilistic tree embeddings

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fault-tolerant computation of distributed regular path queries

Theoretical Computer Science
Distributed vision with smart pixels

Proceedings of the twenty-fifth annual symposium on Computational geometry
Fast track article: EEDTC: Energy-efficient dominating tree construction in multi-hop wireless networks

Pervasive and Mobile Computing
Practical aspects and experiences: Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems

Parallel Computing
Distributed approximation algorithms for finding 2-edge-connected subgraphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Energy-efficient dominating tree construction in wireless ad hoc and sensor networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On verifying fault tolerance of distributed protocols

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Algorithms for sensor and ad hoc networks: advanced lectures

Algorithms for sensor and ad hoc networks: advanced lectures
A minimum spanning tree algorithm for efficient P2P video streaming system

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Bounded approximate decentralised coordination via the max-sum algorithm

Artificial Intelligence
Novel algorithms for the network lifetime problem in wireless settings

Wireless Networks
Learning automata-based algorithms for solving stochastic minimum spanning tree problem

Applied Soft Computing
Distributed decision problems: the locality angle

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The complexity of data aggregation in directed networks

DISC'11 Proceedings of the 25th international conference on Distributed computing
Navigating in a Graph by Aid of Its Spanning Tree Metric

SIAM Journal on Discrete Mathematics
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

The Journal of Supercomputing
Fast deterministic distributed algorithms for sparse spanners

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Self-stabilizing leader election for single-hop wireless networks despite jamming

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Simple distributed algorithms for approximating minimum steiner trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A merging clustering algorithm for mobile ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
A practical approach of diffusion load balancing algorithms

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A fast distributed approximation algorithm for minimum spanning trees

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Centdian computation for sensor networks

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A distributed algorithm to find hamiltonian cycles in g(np) random graphs

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Real-Time video streaming in multi-hop wireless static ad hoc networks

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Distributed algorithms for the constrained routing problem in computer networks

Computer Communications
Distributed multi-source regular path queries

ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Interference-free energy efficient scheduling in wireless ad hoc networks

Ad Hoc Networks
On the complexity of universal leader election

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics

ACM Transactions on Sensor Networks (TOSN)
Learning a ring cheaply and fast

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those problems include Minimum-Weight Spanning Tree (MST), Leader Election, counting the number of network nodes, and computing a sensitive decomposable function (e.g. majority, parity, maximum, OR, AND).The main problem considered is the problem of finding the MST. This problem, which has been known for at least 9 years, is one of the most fundamental and the most studied problems in the field of distributed network algorithms.Any algorithm for any one of the problems above requires at least &OHgr;(E + VlogV) communication and &OHgr;(V) time in the general network. In this paper, we present new algorithms, which achieve those lower bounds. The best previous algorithm requires &THgr;(E + VlogV) in communication and &THgr;(V log V) in time.Our result enables to improve algorithms for many other problems in distributed computing, achieving lower bounds on their communication and time complexities.