Decentralized Consistent Updates in SDN

Nguyen, Thanh Dang; Chiesa, Marco; Canini, Marco

doi:10.1145/3050220.3050224

Cited by 47 publications

(42 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[69]- [71]), programming languages (e.g. [72]- [76]), safe network updates (e.g., [77]- [80]), data plane checking (e.g., [10], [11], [16], [25]), real-time checkers [12], [14], [30], [81], and more general network analyses (e.g., [6], [8], [9], [19], [82], [83]) together with suitable levels of abstractions (e.g., [84], [85]).…”

Section: E Discussion: Importance Of Empty Pecsmentioning

confidence: 99%

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification

Horn

Kheradmand

Prasad

2019

2019 IEEE 27th International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

Network verification promises to detect errors, such as black holes and forwarding loops, by logically analyzing the control or data plane. To do so efficiently, the state-of-the-art (e.g., Veriflow) partitions packet headers with identical forwarding behavior into the same packet equivalence class (PEC).Recently, Yang and Lam showed how to construct the minimal set of PECs, called atomic predicates. Their construction uses Binary Decision Diagrams (BDDs). However, BDDs have been shown to incur significant overhead per packet header bit, performing poorly when analyzing large-scale data centers. The overhead of atomic predicates prompted ddNF to devise a specialized data structure of Ternary Bit Vectors (TBV) instead.However, TBVs are strictly less expressive than BDDs. Moreover, unlike atomic predicates, ddNF's set of PECs is not minimal. We show that ddNF's non-minimality is due to empty PECs. In addition, empty PECs are shown to trigger wrong analysis results. This reveals an inherent tension between precision, expressiveness and performance in formal network verification.Our paper resolves this tension through a new latticetheoretical PEC-construction algorithm, #PEC, that advances the field as follows: (i) #PEC can encode more kinds of forwarding rules (e.g., ip-tables) than ddNF and Veriflow, (ii) #PEC verifies a wider class of errors (e.g., shadowed rules) than ddNF, and (iii) on a broad range of real-world datasets, #PEC is 10× faster than atomic predicates. By achieving precision, expressiveness and performance, this paper answers a longstanding quest that has spanned three generations of formal network analysis techniques.

show abstract

Section: E Discussion: Importance Of Empty Pecsmentioning

confidence: 99%

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification

Horn

Kheradmand

Prasad

2019

2019 IEEE 27th International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

show abstract

“…Furthermore, our approach does not rely on tight clock synchronization protocols while providing the same benefits [10]. In the dataplane, we can use the approach by ez-Segway [7], leveraging per-switch local controllers to manipulate dataplane state (via OpenFlow).…”

Section: Approach and Main Ideamentioning

confidence: 99%

“…A more efficient solution would supply forwarding rules only to those nodes actually en route, as performed e.g., in [7] for network flows. The authors propose a distributed version of the 2-phase update scheme by e.g., Reitblatt et al [11] 1 : the routing path for flow F is updated in reverse, where the destination informs its predecessor on the path to update its rules for F , which in turn informs its predecessor, and so on.…”

Section: Efficient Certification Limited To Involved Routesmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees

Foerster

Schmid

2019

2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)

View full text Add to dashboard Cite

While SDNs enable more flexible and adaptive network operations, (logically) centralized reconfigurations introduce overheads and delays, which can limit network reactivity. This paper initiates the study of a more distributed approach, in which the consistent network updates are implemented by the switches and routers directly in the data plane. In particular, our approach leverages concepts from local proof labeling systems, which allows the data plane elements to locally check network properties, and we show that this is sufficient to obtain global network guarantees. We demonstrate our approach considering three fundamental use cases, and analyze its benefits in terms of performance and fault-tolerance.

show abstract

“…Listing 2 shows the MAFIA code for this measurement task. It has three code Listing 4: Monitoring the ez-Segway [31] protocol. segments to be installed at different switches.…”

Section: A Expressivenessmentioning

confidence: 99%

Measurements As First-class Artifacts

Laffranchini

Rodrigues

Canini

et al. 2019

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

The emergence of programmable switches has sparked a significant amount of work on new techniques to perform more powerful measurement tasks, for instance, to obtain fine-grained traffic and performance statistics. Previous work has focused on the efficiency of these measurements alone and has neglected flexibility, resulting in solutions that are hard to reuse or repurpose and that often overlap in functionality or goals.In this paper, we propose the use of a set of reusable primitive building blocks that can be composed to express measurement tasks in a concise and simple way. We describe the rationale for the design of our primitives, that we have named MAFIA (Measurements As FIrst-class Artifacts), and using several examples we illustrate how they can be combined to realize a comprehensive range of network measurement tasks. Writing MAFIA code does not require expert knowledge of low-level switch architecture details. Using a prototype implementation of MAFIA, we demonstrate the applicability of our approach and show that the use of our primitives results in compiled code that is comparable in size and resource usage with manually written specialized P4 code, and can be run in current hardware.

show abstract

Decentralized Consistent Updates in SDN

Cited by 47 publications

References 36 publications

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees

Measurements As First-class Artifacts

Contact Info

Product

Resources

About