Name
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
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3293611.3331581 | Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing |
Keywords | Field | DocType |
congest model, graph algorithms, lower bounds, preprocessing, software defined networking, supported model | Computer science,Theoretical computer science,Preprocessor,Computer engineering | Conference |
ISBN | Citations | PageRank |
978-1-4503-6217-7 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus-Tycho Foerster | 1 | 32 | 10.49 |
| Janne Korhonen | 2 | 71 | 10.52 |
| Joel Rybicki | 3 | 78 | 9.69 |
| Stefan Schmid | 4 | 559 | 71.98 |