Space efficient and time optimal distributed BFS tree construction

Authors:
Christian Boulinier;Ajoy K. Datta;Lawrence L. Larmore;Franck Petit
Affiliations:
LaRIA CNRS, Université de Picardie Jules Verne, France;School of Computer Science, University of Nevada Las Vegas, USA;School of Computer Science, University of Nevada Las Vegas, USA;LaRIA CNRS, Université de Picardie Jules Verne, France
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

Complexity of network synchronization

Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Distributed Algorithms

Distributed Algorithms
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Network decomposition and locality in distributed computation

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Network synchronization with polylogarithmic overhead

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we give a simple distributed algorithm for constructing a BFS spanning tree in an almost anonymous, asynchronous, rooted network. The proposed algorithm is an improved version of an algorithm by Aspnes. The time complexity of the algorithm is optimal for this problem, i.e., O(diam), where diam is the diameter of the network, and the space complexity of each process is O(@d"P) for each process P, where @d"P is the degree of P. The message complexity is O(diam@?|E|), where E is the set of links, and the size of each message is O(1).