Routing Schemes for Hybrid Communication Networks

TL;DR

This paper presents a deterministic routing scheme in the hybrid communication model for unit-disc-graphs with radio holes, achieving efficient routing with small labels and tables, improving over previous polynomial-time solutions.

Contribution

The authors develop a new deterministic routing scheme for unit-disc-graphs with radio holes in the hybrid model, surpassing previous polynomial lower bounds.

Findings

Routing scheme runs in O(|H|^2 + log n) time

Labels are of size O(log n)

Routing tables size is O(|H|^2 * log n)

Abstract

We consider the problem of computing routing schemes in the $\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables that allow for efficient routing of messages in the local network, which typically offers the majority of the throughput. Recent work has shown that using the $\mathsf{HYBRID}$ model admits a significant speed-up compared to what would be possible if either communication mode were used in isolation. Nonetheless, if general graphs are used as the input graph the computation of routing schemes still takes polynomial rounds in the $\mathsf{HYBRID}$ model. We bypass this lower bound by restricting the local graph to unit-disc-graphs and solve the problem deterministically with running time $O(|\mathcal H|^2 \!+\! \log n)$, label size $O(\log n)$, and size of routing tables $O(|\mathcal H|^2 \!\cdot\! \log n)$ where $|\mathcal H|$ is the number of ``radio holes'' in the network. Our work builds on recent work by Coy et al., who obtain this result in the much simpler setting where the input graph has no radio holes. We develop new techniques to achieve this, including a decomposition of the local graph into path-convex regions, where each region contains a shortest path for any pair of nodes in it.