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

prior work
SMART_READER_LITE
LIVE PREVIEW

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

Prior Work Consensus Consensus Reliable BGP Consensus Reliable BGP Consensus Routing Reliable BGP Routing Reliable BGP Routing Routing Graceful Seamless Graceful Seamless Graceful Seamless Seamless Graceful Migration Migration


slide-1
SLIDE 1
slide-2
SLIDE 2
slide-3
SLIDE 3
slide-4
SLIDE 4

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-5
SLIDE 5
slide-6
SLIDE 6
slide-7
SLIDE 7
slide-8
SLIDE 8
slide-9
SLIDE 9
slide-10
SLIDE 10
slide-11
SLIDE 11

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-12
SLIDE 12
slide-13
SLIDE 13

MECHANISMS

13

slide-14
SLIDE 14
slide-15
SLIDE 15
slide-16
SLIDE 16
slide-17
SLIDE 17
slide-18
SLIDE 18

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-19
SLIDE 19

IMPLEMENTATION & EVALUATION

19

slide-20
SLIDE 20
slide-21
SLIDE 21

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-22
SLIDE 22

Results: Routing Application

Fattree Small-world Waxman 22

0% 25% 50% 75% 100%

Host Link Both Host Link Both Host Link Both

Worst-Case Rule Overhead Full Subset

slide-23
SLIDE 23

WRAP UP

23

slide-24
SLIDE 24

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-25
SLIDE 25

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-26
SLIDE 26

BACKUP SLIDES

26

slide-27
SLIDE 27