Transiently Consistent SDN Updates: Being Greedy is Hard

DOI10.1007/978-3-319-48314-6_25zbMath1482.68044arXiv1605.03158OpenAlexW2383862330MaRDI QIDQ2835039

Jan Marcinkowski, Stefan Schmid, Saeed Akhoondian Amiri, Arne Ludwig

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (2)

Congestion-Free Rerouting of Flows on DAGs ⋮ Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs

Cites Work

• Scheduling Loop-free Network Updates
• Decentralizing SDN Policies

This page was built for publication: Transiently Consistent SDN Updates: Being Greedy is Hard