Scheduling Loop-free Network Updates

DOI10.1145/2767386.2767412zbMath1333.68215OpenAlexW1964393599MaRDI QIDQ2796237

Jan Marcinkowski, Arne Ludwig, Stefan Schmid

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767412

zbMATH Keywords

schedulinggraph algorithmsNP-hardnesssoftware-defined networking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (5)

Kaki: concurrent update synthesis for regular policies via Petri games ⋮ Congestion-Free Rerouting of Flows on DAGs ⋮ Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs ⋮ Transiently Consistent SDN Updates: Being Greedy is Hard ⋮ Automatic synthesis of transiently correct network updates via Petri games

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: Scheduling Loop-free Network Updates