Routing Schemes and Distance Oracles in the Hybrid Model

TL;DR

This paper studies the computation of routing schemes and distance oracles in the hybrid communication model, achieving near-optimal algorithms for exact and approximate solutions while establishing fundamental lower bounds.

Contribution

It introduces algorithms for exact and approximate distance oracles in the hybrid model with optimal round complexity and label size, and provides new lower bounds for these problems.

Findings

Exact solutions in rac{1}{3} rounds with rac{2}{3} labels

Constant stretch approximations with log n labels in same time

Lower bounds show certain solutions require rac{1}{3} rounds even with large labels

Abstract

The $\mathsf{HYBRID}$ model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each round each node can send large messages to all its neighbors in a local network (a graph), and a global communication mode, where each node is allotted limited (polylogarithmic) bandwidth per round which it can use to communicate with any node in the network. Prior work has often focused on shortest paths problems in the local network, as their global nature makes these an interesting case study how combining communication modes in the $\mathsf{HYBRID}$ model can overcome the individual lower bounds of either mode. In this work we consider a similar problem, namely computation of distance oracles and routing schemes. In the former, all nodes have to compute local tables, which allows them to look up the distance (estimates) to any target node in the local network when provided with the label of the target. In the latter, it suffices that nodes give the next node on an (approximately) shortest path to the target. Our goal is to compute these local tables as fast as possible with labels as small as possible. We show that this can be done exactly in $\widetilde O(n^{1/3})$ communication rounds and labels of size $\Theta(n^{2/3})$ bits. For constant stretch approximations we achieve labels of size $O(\log n)$ in the same time. Further, as our main technical contribution, we provide computational lower bounds for a variety of problem parameters. For instance, we show that computing solutions with stretch below a certain constant takes $\widetilde \Omega(n^{1/3})$ rounds even for labels of size $O(n^{2/3})$.