Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

07/02/2020
βˆ™
by   Michael Feldmann, et al.
βˆ™
0
βˆ™

We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a local and a global mode. Specifically, the local edges model a fixed communication network in which O(1) messages of size O(log n) can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most O(log n) messages over global edges, which restricts the nodes to use these edges only very sparsely. We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in sparse graphs. Specifically, we present exact O(log n) time algorithms for pseudotrees (i.e., graphs that contain at most one cycle), and 3-approximations for graphs that have at most n + O(n^1/3) edges and arboricity O(log n). For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

βˆ™ 06/15/2020

Computing Shortest Paths and Diameter in the Hybrid Network Model

The 𝖧𝖸𝖑𝖱𝖨𝖣 model, introduced in [Augustine et al., SODA '20], provides a...
βˆ™ 09/08/2020

Time-Optimal Construction of Overlay Networks

We show how to construct an overlay network of constant degree and diame...
βˆ™ 09/04/2019

Shortest Paths in a Hybrid Network Model

We introduce a communication model for hybrid networks, where nodes have...
βˆ™ 02/16/2022

Near-Shortest Path Routing in Hybrid Communication Networks

Hybrid networks, i.e., networks that leverage different means of communi...
βˆ™ 02/14/2022

Routing Schemes and Distance Oracles in the Hybrid Model

The 𝖧𝖸𝖑𝖱𝖨𝖣 model was introduced as a means for theoretical study of dist...
βˆ™ 10/26/2020

Distance Computations in the Hybrid Network Model via Oracle Simulations

The Hybrid network model was introduced in [Augustine et al., SODA '20] ...
βˆ™ 05/13/2021

On Sparsity Awareness in Distributed Computations

We extract a core principle underlying seemingly different fundamental d...
This week in AI

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