Time-Optimal Construction of Overlay Networks

by   Thorsten Götte, et al.

We show how to construct an overlay network of constant degree and diameter O(log n) in time O(log n) starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of, and new connections can be established by sending node identifiers. If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only O(log n) messages in each round in time O(log n), w.h.p., which beats the currently best O(log^3/2 n) time algorithm of [Götte et al., SIROCCO'19]. Since the problem cannot be solved faster than by using pointer jumping for O(log n) rounds (which would even require each node to communicate Ω(n) bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in hybrid networks [Augustine et al., SODA'20]. Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the initial edges is unrestricted, whereas only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution. For an (undirected) graph G with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time O(log n), w.h.p. Furthermore, we show how to compute an MIS in time O(log d + loglog n), w.h.p., where d is the initial degree of G.



page 1

page 2

page 3

page 4


Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

We consider the problem of computing shortest paths in hybrid networks, ...

Communication Costs in a Geometric Communication Network

A communication network is a graph in which each node has only local inf...

Consensus in Networks Prone to Link Failures

We consider deterministic distributed algorithms solving Consensus in sy...

Distributed Computation and Reconfiguration in Actively Dynamic Networks

In this paper, we study systems of distributed entities that can activel...

Self-Stabilizing Construction of a Minimal Weakly 𝒮𝒯-Reachable Directed Acyclic Graph

We propose a self-stabilizing algorithm to construct a minimal weakly 𝒮𝒯...

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

We consider the fundamental problems of size discovery and topology reco...

Always be Two Steps Ahead of Your Enemy

We investigate the maintenance of overlay networks under massive churn, ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.