Computing Shortest Paths and Diameter in the Hybrid Network Model

by   Fabian Kuhn, et al.

The 𝖧𝖸𝖡𝖱𝖨𝖣 model, introduced in [Augustine et al., SODA '20], provides a theoretical foundation for networks that allow multiple communication modes. The model follows the principles of synchronous message passing, whereas nodes are allowed to use two fundamentally different communication modes. First, a local mode where nodes may exchange arbitrary information per round over edges of a local communication graph G (akin to the 𝖫𝖮𝖢𝖠𝖫 model). Second, a global mode where every node may exchange O(log n) messages of size O(log n) bits per round with arbitrary nodes in the network. The 𝖧𝖸𝖡𝖱𝖨𝖣 model intends to reflect the conditions of many real hybrid networks, where high-bandwidth but inherently local communication is combined with highly flexible global communication with restricted bandwidth. We continue to explore the power and limitations of the 𝖧𝖸𝖡𝖱𝖨𝖣 model by investigating the complexity of computing shortest paths and diameter of the local communication graph G. We improve on the known upper bound for the exact all pairs shortest paths problem (APSP) from [Augustine et al., SODA '20] and provide algorithms to approximate solutions for the k source shortest paths problem (k-SSSP). We demonstrate that our results for APSP and k-SSP are almost tight (up to poly-logarithmic factors). Furthermore, we give an improved algorithm for the exact single source shortest paths problem for graphs with large diameter. For the problem of approximating the diameter of the local communication network we give the first non-trivial upper bound. This upper bound is complemented by a lower bound for the exact diameter problem.



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, ...

Shortest Paths in a Hybrid Network Model

We introduce a communication model for hybrid networks, where nodes have...

Distance Computations in the Hybrid Network Model via Oracle Simulations

The Hybrid network model was introduced in [Augustine et al., SODA '20] ...

Near-Shortest Path Routing in Hybrid Communication Networks

Hybrid networks, i.e., networks that leverage different means of communi...

Routing Schemes and Distance Oracles in the Hybrid Model

The 𝖧𝖸𝖡𝖱𝖨𝖣 model was introduced as a means for theoretical study of dist...

Energy Complexity of Distance Computation in Multi-hop Networks

Energy efficiency is a critical issue for wireless devices operated unde...

Exponentially Faster Shortest Paths in the Congested Clique

We present improved deterministic algorithms for approximating shortest ...
This week in AI

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