[PPT] - Prior Work Consensus Consensus Reliable BGP Consensus Reliable PowerPoint Presentation

SLIDE 1

SLIDE 2

SLIDE 3

SLIDE 4

SLIDE 5

SLIDE 6

Seamless Migration Seamless Migration Seamless Migration Reliable BGP Reliable BGP Reliable BGP Graceful Migration Graceful Migration Graceful Migration Consensus Routing Consensus Routing Consensus Routing

Prior Work

4

Consensus Routing Reliable BGP Graceful Migration Seamless Migration

SLIDE 7

Seamless Migration Seamless Migration Seamless Migration Reliable BGP Reliable BGP Reliable BGP Graceful Migration Graceful Migration Graceful Migration Consensus Routing Consensus Routing Consensus Routing

Prior Work

4

Consensus Routing Reliable BGP Graceful Migration Seamless Migration

SLIDE 8

SLIDE 9

SLIDE 10

SLIDE 11

SLIDE 12

SLIDE 13

SLIDE 14

SLIDE 15

SLIDE 16

SLIDE 17

SLIDE 18

SLIDE 19

SLIDE 20

SLIDE 21

SLIDE 22

SLIDE 23

SLIDE 24

SLIDE 25

SLIDE 26

SLIDE 27

SLIDE 28

SLIDE 29

SLIDE 30

Universal Property Preservation

Trace Property Any property of a single packet’s path through the network. Theorem: Per-packet consistent updates preserve all trace properties.

11

Examples of Trace Properties: Loop freedom, access control, waypointing ... Trace Property Verifcation Tools: Anteater , Header Space Analysis, ConfjgChecker ...

SLIDE 31

SLIDE 32

MECHANISMS

13

SLIDE 33

SLIDE 34

SLIDE 35

SLIDE 36

SLIDE 37

SLIDE 38

SLIDE 39

SLIDE 40

SLIDE 41

SLIDE 42

SLIDE 43

SLIDE 44

SLIDE 45

Correctness

Example: 2-Phase Update

1. Install new rules on internal switches, leave
ld confjguration in place
2. Install edge rules that stamp with the new

version number

18

}

Unobservable One-touch

}

Question: How do we convince ourselves these mechanisms are correct? Solution: We built an operational semantics, formalized our mechanisms and proved them correct

SLIDE 46

Correctness

Example: 2-Phase Update

1. Install new rules on internal switches, leave
ld confjguration in place
2. Install edge rules that stamp with the new

version number

18

}

Unobservable One-touch

}

Theorem: Unobservable + one-touch = per-packet. Question: How do we convince ourselves these mechanisms are correct? Solution: We built an operational semantics, formalized our mechanisms and proved them correct

SLIDE 47

IMPLEMENTATION & EVALUATION

19

SLIDE 48

SLIDE 49

Evaluation

Setup

Mininet VM

Applications

Routing and Multicast

Scenarios

Adding/removing hosts
Adding/removing links
Both at the same time

21 Fattree Small-world Waxman

Question: How much extra rule space is required? Topologies

SLIDE 50

Results: Routing Application

Fattree Small-world Waxman 22

Full Subset

SLIDE 51

Results: Routing Application

Fattree Small-world Waxman 22

Host Link Both Host Link Both Host Link Both

0% 25% 50% 75% 100% Worst-Case Rule Overhead Full Subset

SLIDE 52

Results: Routing Application

Fattree Small-world Waxman 22

Host Link Both Host Link Both Host Link Both

0% 25% 50% 75% 100% Worst-Case Rule Overhead Full Subset

SLIDE 53

WRAP UP

23

SLIDE 54

Conclusion

Update abstractions

Per-packet
Per-fow

Mechanisms

2-Phase Update
Optimizations

Implementation

Runtime
Verifjer

Formal model

Network operational semantics
Universal property preservation

24

SLIDE 55

Thank You!

Collaborators Shrutarshi Basu (Cornell) Arjun Guha (Cornell) Stephen Gutz (Cornell) Rob Harrison (West Point) Nanxi Kang (Princeton) Naga Praveen Katta (Princeton) Chris Monsanto (Princeton) Josh Reich (Princeton) Cole Schlesinger (Princeton) Robert Soulé (Cornell) Alec Story (Cornell) Nate Foster (Cornell) Mike Freedman (Princeton) Jen Rexford (Princeton) Emin Gün Sirer (Cornell) Dave Walker (Princeton)

http://frenetic-lang.org

25

SLIDE 56

BACKUP SLID ES

26

SLIDE 57