DeepAI AI Chat
Log In Sign Up

Input-dynamic distributed graph algorithms for congested networks

05/15/2020
by   Klaus-Tycho Foerster, et al.
Institute of Science and Technology Austria
Universität Wien
0

Consider a distributed system, where the topology of the communication network remains fixed, but local inputs given to nodes may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic CONGEST model, where the communication network G = (V,E) remains fixed and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, – how much time as a function of α we need to update an existing solution, and – how much information the nodes have to keep in local memory between batches in order to update the solution quickly. We give a general picture of the complexity landscape in this model, including a general framework for lower bounds. In particular, we prove non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/18/2020

Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model

We study dynamic graph algorithms in the Massively Parallel Computation ...
05/27/2021

On the Complexity of Weight-Dynamic Network Algorithms

While operating communication networks adaptively may improve utilizatio...
02/27/2018

Local Distributed Algorithms in Highly Dynamic Networks

The present paper studies local distributed graph problems in highly dyn...
04/12/2023

When Should You Wait Before Updating? Toward a Robustness Refinement

Consider a dynamic network and a given distributed problem. At any point...
05/10/2022

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering

Hierarchical agglomerative clustering (HAC) is a popular algorithm for c...
04/23/2022

BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale

Many real-world applications operate on dynamic graphs that undergo rapi...
10/06/2021

A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials

The personalized PageRank algorithm is one of the most versatile tools f...