Input-Dynamic Distributed Algorithms for Communication Networks
-
Published:2021-06-22
Issue:1
Volume:49
Page:71-72
-
ISSN:0163-5999
-
Container-title:ACM SIGMETRICS Performance Evaluation Review
-
language:en
-
Short-container-title:SIGMETRICS Perform. Eval. Rev.
Author:
Foerster Klaus-Tycho1,
Korhonen Janne H.2,
Paz Ami1,
Rybicki Joel2,
Schmid Stefan1
Affiliation:
1. University of Vienna, Vienna, Austria
2. IST Austria, Klosterneuburg, Austria
Abstract
Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system 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 in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha 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.
Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.
Funder
The European Union?s Horizon 2020 research and innovation programme under the Marie Sk?odowska?Curie grant agreement
Vienna Science and Technology Fund
Austrian Science Fund (FWF) and netIDEE SCIENCE
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference5 articles.
1. Optimal maintenance of a spanning tree
2. Time-varying graphs and dynamic networks;Casteigts Arnaud;IJPEDS,2012
3. Keren Censor-Hillel , Elad Haramaty , and Zohar S . Karnin . 2016 . Optimal Dynamic Distributed MIS. In Proc. PODC. 217--226. Keren Censor-Hillel, Elad Haramaty, and Zohar S. Karnin. 2016. Optimal Dynamic Distributed MIS. In Proc. PODC. 217--226.
4. David Peleg . 1998. Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees . In Proc . ICALP. Springer , 164--175. David Peleg. 1998. Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees. In Proc. ICALP. Springer, 164--175.
5. Distributed Computing: A Locality-Sensitive Approach