3 research outputs found
Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees
While SDNs enable more flexible and adaptive network operations, (logically)
centralized reconfigurations introduce overheads and delays, which can limit
network reactivity. This paper initiates the study of a more distributed
approach, in which the consistent network updates are implemented by the
switches and routers directly in the data plane. In particular, our approach
leverages concepts from local proof labeling systems, which allows the data
plane elements to locally check network properties, and we show that this is
sufficient to obtain global network guarantees. We demonstrate our approach
considering three fundamental use cases, and analyze its benefits in terms of
performance and fault-tolerance.Comment: Appears in IEEE NCA 201
Does preprocessing help under congestion?
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