Optimal consistent network updates in polynomial time

DOI10.1007/978-3-662-53426-7_9zbMath1393.68020arXiv1607.05159OpenAlexW2511199264MaRDI QIDQ1660929

Nilesh Jagnik, Jedidiah McClurg, Pavol Černý, Nate Foster

Publication date: 16 August 2018

Full work available at URL: https://arxiv.org/abs/1607.05159

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs ⋮ DyNetKAT: an algebra of dynamic networks ⋮ Model Checking Data Flows in Concurrent Network Updates

This page was built for publication: Optimal consistent network updates in polynomial time