DeepAI AI Chat
Log In Sign Up

Shortest Paths in a Hybrid Network Model

by   John Augustine, et al.

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^ε).


page 1

page 2

page 3

page 4


Computing Shortest Paths and Diameter in the Hybrid Network Model

The 𝖧𝖸𝖡𝖱𝖨𝖣 model, introduced in [Augustine et al., SODA '20], provides a...

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

We consider the problem of computing shortest paths in hybrid networks, ...

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

Near Tight Shortest Paths in the Hybrid Model

Shortest paths problems are subject to extensive studies in classic dist...

Distance Computations in the Hybrid Network Model via Oracle Simulations

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

Quantifying synergy and redundancy in multiplex networks

Understanding how different networks relate to each other is key for obt...