Article ID Journal Published Year Pages File Type
6875694 Theoretical Computer Science 2018 16 Pages PDF
Abstract
Lastly, we also study how to apply the concept of local checkability to updating spanning trees in a loop free manner in the context of asynchronous networking, by exploring the similarities between prover-and-verifier pairs and Software Defined Networks (SDNs).
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs
Authors
, , , ,