Safe, Efficient, and Robust SDN Updates by Combining Rule Replacements and Additions
| Autor: | Stefano Vissicchio, Luca Cittadini |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Correctness
Computer Networks and Communications Robustness (computer science) Computer science Distributed computing Real-time computing 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 020201 artificial intelligence & image processing 02 engineering and technology Electrical and Electronic Engineering Software Computer Science Applications |
| Zdroj: | IEEE/ACM Transactions on Networking. 25:3102-3115 |
| ISSN: | 1558-2566 1063-6692 |
| Popis: | Disruption-free updates are a key primitive to effectively operate SDN networks and maximize the benefits of their programmability. In this paper, we study how to implement this primitive safely (with respect to forwarding correctness and policies), efficiently (in terms of consumed network resources) and robustly to unpredictable factors, such as delayed message delivery and processing. First, we analyze the fundamental limitations of prior proposals, which either: 1) progressively replace initial flow rules with new ones or 2) instruct switches to maintain both initial and final rules. Second, we show that safe, efficient, and robust updates can be achieved by leveraging a more general approach. We indeed unveil a dualism between rule replacements and additions that opens new degrees of freedom for supporting SDN updates. Third, we demonstrate how to build upon this dualism. We propose FLIP, an algorithm that computes operational sequences combining the efficiency of rule replacements with the applicability of rule additions. FLIP identifies constraints on rule replacements and additions that independently prevent safety violations from occurring during the update. Then, it explores the solution space by swapping constraints that prevent the same safety violations, until it reaches a satisfiable set of constraints. Fourth, we perform extensive simulations, showing that FLIP can significantly outperform prior work. In the average case, it guarantees a much higher success rate than algorithms only based on rule replacements, and massively reduces the memory overhead needed by techniques solely using rule additions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|