Local Recurrent Problems in the SUPPORTED Model

Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We study the SUPPORTED model of distributed computing introduced by Schmid and Suomela [27], which generalizes the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by the subnetwork to which they apply. recur over time, and need to be solved efficiently online. To do that, one may rely on an initial preprocessing phase for computing some useful information. This preprocessing phase makes it possible, in some cases, to obtain improved distributed algorithms, overcoming locality-based time lower bounds. Our main contribution is to expand the class of problems to which the SUPPORTED model applies, by handling also multiple recurring instances of the same problem that differ from each other by some problem specific input, and not only the subnetwork to which they apply. We illustrate this by considering two extended problem classes. The first class, denoted PCS, concerns problems where client nodes of the network need to be served, and each recurring instance applies to some Partial Client Set. The second class, denoted PFO, concerns situations where each recurrent instance of the problem includes a partially fixed output, which needs to be completed to a full consistent solution. Specifically, we propose some natural recurrent variants of the dominating set problem and the coloring problem that are of interest particularly in the distributed setting. For these problems, we show that information about the topology can be used to overcome locality-based lower bounds. We also categorize the round complexity of Locally Checkable Labellings in the SUPPORTED model for the simple case of paths. Finally we present some interesting open problems and some partial results towards resolving them.

Original languageEnglish
Title of host publication27th International Conference on Principles of Distributed Systems, OPODIS 2023
EditorsAlysson Bessani, Xavier Defago, Junya Nakamura, Koichi Wada, Yukiko Yamauchi
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773089
StatePublished - Jan 2024
Externally publishedYes
Event27th International Conference on Principles of Distributed Systems, OPODIS 2023 - Tokyo, Japan
Duration: 6 Dec 20238 Dec 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference27th International Conference on Principles of Distributed Systems, OPODIS 2023

Bibliographical note

Publisher Copyright:
© Akanksha Agrawal, John Augustine, David Peleg, and Srikkanth Ramachandran;


Funding John Augustine and Srikkanth Ramachandran are supported by the Centre of Excellence in Cryptography, Cybersecurity, and Distributed Trust (CCD) and by an IITM-Accenture project (SB/22-23/007/JOHN/ACC).

FundersFunder number
Centre of Excellence in Cryptography
Distributed Trust
ARC Centre of Excellence in Cognition and its Disorders


    • Distributed Algorithms
    • LOCAL Model
    • SUPPORTED Model


    Dive into the research topics of 'Local Recurrent Problems in the SUPPORTED Model'. Together they form a unique fingerprint.

    Cite this