Shortest Paths in a Hybrid Network Model

09/04/2019
by   John Augustine, et al.
0

We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where communication is only possible between specific pairs of nodes, and a global mode where communication between any pair of nodes is possible. This can be motivated, for instance, by wireless networks in which we combine direct device-to-device communication (e.g., using WiFi) with communication via a shared infrastructure (like base stations, the cellular network, or satellites). Typically, communication over short-range connections is cheaper and can be done at a much higher rate. Hence, we are focusing here on the LOCAL model (in which the nodes can exchange an unbounded amount of information in each round) for the local connections while for the global communication we assume the so-called node-capacitated clique model, where in each round every node can exchange only O(log n)-bit messages with just O(log n) other nodes. In order to explore the power of combining local and global communication, we study the impact of hybrid communication on the complexity of computing shortest paths in the graph given by the local connections. Specifically, for the all-pairs shortest paths problem (APSP), we show that an exact solution can be computed in time Õ(n^2/3) and that approximate solutions can be computed in time Θ̃(√(n)). For the single-source shortest paths problem (SSSP), we show that an exact solution can be computed in time Õ(√(SPD)), where SPD denotes the shortest path diameter. We further show that a (1+o(1))-approximate solution can be computed in time Õ(n^1/3). Additionally, we show that for every constant ε>0, it is possible to compute an O(1)-approximate solution in time Õ(n^ε).

READ FULL TEXT

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...
07/02/2020

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

We consider the problem of computing shortest paths in hybrid networks, ...
02/14/2022

Routing Schemes and Distance Oracles in the Hybrid Model

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

Near-Shortest Path Routing in Hybrid Communication Networks

Hybrid networks, i.e., networks that leverage different means of communi...
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] ...
07/27/2018

Study of the Impact of PHY and MAC Parameters in 3GPP C-V2V Mode 4

In the latest years, 3GPP has added short range cellular-vehicle-to-anyt...
02/10/2020

On the Communication Latency of Wireless Decentralized Learning

We consider a wireless network comprising n nodes located within a circu...
This week in AI

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