2019/08/27 by Klaus-Tycho Foerster, Stefan Schmid, Foerster, Klaus-Tycho +1
Computer Science · Engineering · #Advanced Memory and Neural Computing #Distributed #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Parallel #Quantum-Dot Cellular Automata #Software-Defined Networks and 5G #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1908.10086
openalex publication_date 2019/08/27 · openalex created_date 2022/07/28 · openalex updated_date 2026/07/28
While SDNs enable more flexible and adaptive network operations, (logically)\ncentralized reconfigurations introduce overheads and delays, which can limit\nnetwork reactivity. This paper initiates the study of a more distributed\napproach, in which the consistent network updates are implemented by the\nswitches and routers directly in the data plane. In particular, our approach\nleverages concepts from local proof labeling systems, which allows the data\nplane elements to locally check network properties, and we show that this is\nsufficient to obtain global network guarantees. We demonstrate our approach\nconsidering three fundamental use cases, and analyze its benefits in terms of\nperformance and fault-tolerance.\n