License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2018.37
URN: urn:nbn:de:0030-drops-98263
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9826/
Go to the corresponding LIPIcs Volume Portal

Mashreghi, Ali ; King, Valerie

Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model

pdf-format:
LIPIcs-DISC-2018-37.pdf (0.5 MB)

Abstract

We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with o(m) bits of communication, in a sufficiently dense graph with n nodes and m edges. For decades, it was believed that Omega(m) bits of communication are required for any algorithm that constructs a broadcast tree. In 2015, King, Kutten and Thorup showed that in the KT1 model where nodes have initial knowledge of their neighbors' identities it is possible to construct MST in O~(n) messages in the synchronous CONGEST model. In the CONGEST model messages are of size O(log n). However, no algorithm with o(m) messages were known for the asynchronous case. Here, we provide an algorithm that uses O(n^{3/2} log^{3/2} n) messages to find MST in the asynchronous CONGEST model. Our algorithm is randomized Monte Carlo and outputs MST with high probability. We will provide an algorithm for computing a spanning tree with O(n^{3/2} log^{3/2} n) messages. Given a spanning tree, we can compute MST with O~(n) messages.

BibTeX - Entry

@InProceedings{mashreghi_et_al:LIPIcs:2018:9826,
  author =	{Ali Mashreghi and Valerie King},
  title =	{{Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model}},
  booktitle =	{32nd International Symposium on Distributed Computing  (DISC 2018)},
  pages =	{37:1--37:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Ulrich Schmid and Josef Widder},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9826},
  URN =		{urn:nbn:de:0030-drops-98263},
  doi =		{10.4230/LIPIcs.DISC.2018.37},
  annote =	{Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree}
}

Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree
Collection: 32nd International Symposium on Distributed Computing (DISC 2018)
Issue Date: 2018
Date of publication: 04.10.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI