  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.
