Brief Announcement: Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster; Janne H. Korhonen; Joel Rybicki; Stefan Schmid

Brief Announcement: Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid

Forschungsgruppe Communication Technologies

Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed

Abstract

This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper, we show that a large class of lower bounds in the CONGEST model still hold in the SUPPORTED model, highlighting the robustness of these bounds. This also raises the question how much does preprocessing help in the CONGEST model.

Originalsprache	Englisch
Titel	ACM Symposium on Principles of Distributed Computing (PODC 2019)
Publikationsstatus	Veröffentlicht - 1 Aug. 2019

ÖFOS 2012

102025 Verteilte Systeme

Zugriff auf Dokument

http://eprints.cs.univie.ac.at/6052/

Zitationsweisen

@inproceedings{c371a98da3d84affae159a0a672074d6,

title = "Brief Announcement: Does Preprocessing Help under Congestion?",

abstract = "This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper, we show that a large class of lower bounds in the CONGEST model still hold in the SUPPORTED model, highlighting the robustness of these bounds. This also raises the question how much does preprocessing help in the CONGEST model.",

author = "Klaus-Tycho Foerster and Korhonen, {Janne H.} and Joel Rybicki and Stefan Schmid",

year = "2019",

month = aug,

day = "1",