Survey of Consistent Software-Defined Network Updates
Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio

TL;DR
This survey reviews mechanisms and protocols for performing fast, consistent network updates, emphasizing their importance in SDNs and exploring the underlying algorithmic challenges and historical context.
Contribution
It provides a comprehensive overview of consistency properties, algorithmic techniques, and the relationship to classic optimization problems in network updates, with a focus on SDNs.
Findings
Identifies key consistency properties for network updates.
Discusses algorithmic techniques for ensuring consistency.
Explores the trade-offs between update speed and cost.
Abstract
Computer networks have become a critical infrastructure. In fact, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to policy changes, increasing traffic, or failures. This paper presents a structured survey of mechanism and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
