Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
type: Item
instance of: scholarly article
title: Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
zbMATH Open document ID: 1382.68017
author: Klaus-Tycho Foerster
author: Thomas Luedi
author: Jochen Seidel
author: Roger Wattenhofer
published in: Theoretical Computer Science
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6820651
zbMATH Keywords: local checking
zbMATH Keywords: \(s\)-\(t\) reachability
zbMATH Keywords: acyclicity
zbMATH Keywords: software-defined networking
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.11.018
OpenAlex ID: W2549442734
cites work: The local detection paradigm and its applications to self-stabilization
cites work: Reachability is harder for directed than for undirected finite graphs
cites work: Transiently Consistent SDN Updates: Being Greedy is Hard
cites work: Distributedly Testing Cycle-Freeness
cites work: Randomized proof-labeling schemes
cites work: Bounds in the propagation of selection into logic programs
cites work: Optimal consistent network updates in polynomial time
cites work: Self-stabilization
cites work: Anonymous networks
cites work: Randomized distributed decision
cites work: What can be decided locally without identifiers?
cites work: On the Impact of Identifiers on Local Decision
cites work: Node labels in local decision
cites work: Towards a complexity theory for local distributed computing
cites work: Locally checkable proofs
cites work: Distributed verification of minimum spanning trees
cites work: Proof labeling schemes
cites work: Scheduling loop-free network updates: it's good to relax!
cites work: What can be computed locally?
cites work: Distributed Verification and Hardness of Distributed Approximation
DOI: 10.1016/J.TCS.2016.11.018
description: scientific article; zbMATH DE number 6820651