Distance Computations in the Hybrid Network Model via Oracle Simulations

10/26/2020
by   Keren Censor-Hillel, et al.
0

The Hybrid network model was introduced in [Augustine et al., SODA '20] for laying down a theoretical foundation for networks which combine two possible modes of communication: One mode allows high-bandwidth communication with neighboring nodes, and the other allows low-bandwidth communication over few long-range connections at a time. This fundamentally abstracts networks such as hybrid data centers, and class-based software-defined networks. Our technical contribution is a density-aware approach that allows us to simulate a set of oracles for an overlay skeleton graph over a Hybrid network. As applications of our oracle simulations, with additional machinery that we provide, we derive fast algorithms for fundamental distance-related tasks. One of our core contributions is an algorithm in the Hybrid model for computing exact weighted shortest paths from Õ(n^1/3) sources which completes in Õ(n^1/3) rounds w.h.p. This improves, in both the runtime and the number of sources, upon the algorithm of [Kuhn and Schneider, PODC '20], which computes shortest paths from a single source in Õ(n^2/5) rounds w.h.p. We additionally show a 2-approximation for weighted diameter and a (1+ϵ)-approximation for unweighted diameter, both in Õ(n^1/3) rounds w.h.p., which is comparable to the Ω̃(n^1/3) lower bound of [Kuhn and Schneider, PODC '20] for a (2-ϵ)-approximation for weighted diameter and an exact unweighted diameter. We also provide fast distance approximations from multiple sources and fast approximations for eccentricities.

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...
03/14/2019

Fast Approximate Shortest Paths in the Congested Clique

We design fast deterministic algorithms for distance computation in the ...
11/03/2017

A Faster Distributed Single-Source Shortest Paths Algorithm

We devise new algorithms for the single-source shortest paths problem in...
07/02/2020

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

We consider the problem of computing shortest paths in hybrid networks, ...
05/13/2021

On Sparsity Awareness in Distributed Computations

We extract a core principle underlying seemingly different fundamental d...
09/04/2019

Shortest Paths in a Hybrid Network Model

We introduce a communication model for hybrid networks, where nodes have...
02/14/2022

Routing Schemes and Distance Oracles in the Hybrid Model

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

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