In this paper, we prove a general result on the impact of sense of direction. We show that, in arbitrary graphs, any sense of direction has a dramatic effect on the communication complexity of several important distributed problems: Broadcast, Depth First Traversal, Election, and Spanning Tree Construction. In systems with n nodes and e communication links, the solution for the Depth First Traversal and the Broadcast problems require Ω(e) messages with arbitrary labelings; we show that, with any sense of direction, they can be solved exchanging only Θ(n) messages, even if the system is anonymous. The problems of Election and of Spanning Tree Construction require Ω(e + n log n) messages with arbitrary labelings; on the other hand, we show that they can be solved with Θ(n) messages with any sense of direction. The results presented here completely explain and generalize the existing results which now follow as corollaries for specific labelings.
|Number of pages||9|
|Journal||Information Processing Letters|
|Publication status||Published - 14 Jul 1997|
- Distributed algorithms
- Graph algorithms