SDN and Streamlining the Plumbing. Nick McKeown Stanford University

Transcription

1 SDN and Streamlining the Plumbing Nick McKeown Stanford University

2

3 What is SDN? (when we clear away all the hype)

4 A network in which the control plane is physically separate from the forwarding plane. and A single control plane controls several forwarding devices. (That s it)

5 Software Defined Network (SDN) f ( Map) f ( Map) f ( Map) Control Program Control Program Global Network Map Control Plane Control Program Abstract Forwarding Model (e.g. OpenFlow) Packet Forwarding Packet Forwarding Packet Forwarding Packet Forwarding Packet Forwarding

6 Why now? Aligning of planets - Availability of good merchant switch chips. - Big data centers. - Frustration with the stranglehold of large network equipment vendors

7 Outline 1. Well-defined control abstraction 2. Well-defined forwarding abstraction 3. Verifiable forwarding behavior

8 Well-defined control abstraction Control plane can run on modern servers Can adopt software engineering best-practices Easier to add new control programs or customize locally Solve distributed systems problem once, rather than for every protocol

9 OSPF Dijkstra 5% OSPF Dijkstra Global Network Map Network Map 95% Network OS OS Specialized Hardware Packet Forwarding Packet Forwarding Packet Forwarding Packet Forwarding

10 Outline 1. Well-defined control abstraction 2. Well-defined forwarding abstraction 3. Verifiable forwarding behavior

11 Well-defined forwarding abstraction Vendor-agnostic interface to forwarding plane (e.g. OpenFlow)

12 Match-Action Forwarding Abstraction Action Primitives Plumbing primitives 1. Forward to ports 4 & 5 2. Push header Y after bit Pop header bits Decrement bits Drop packet 6. H H Match Action F Action(F) G H Action(G) Action(H)

13 Multiple Table Match-Action H n H 1 H Match Action Match Action F 1 Action(F) F n Action(F) G 1 Action(G) G n Action(G) H 1 Action(H) H n Action(H)

14 Data Parser Combine Header L2 Table Action: set L2D L3 Table Action: set L2D, dec TTL ACL Table Action: permit/deny Today: Fixed function switches L2: 128k x 48 Exact match L3: 16k x 32 Longest prefix match ACL: 4k Ternary match Queues In L2 Stage L3 Stage ACL Stage Data Header Out Stage 1 Stage 2 Stage 3 Data 14

15 Programmer wants To decide how packets are processed: Which headers to recognize/add/remove How headers are matched and modified The sequence of actions and dependencies Build actions from primitives: Forwarding, Congestion control primitives; queueing primitives Fixed function switches at odds with this model. 15

16 Current switch chips Don t let you Trade one memory size for another Add a new table Add a new header field Add a new action 16

17 Today: Designing a router Try to squeeze router design into chip System Software How do I use it? (API) What can the chip do? (Datasheet) Switch API Packet Forwarding Engine Bottom up Design

18 Programmatic control is top down Control Program firewall.c Control Program if( TCP_port == SMTP) droppacket(); Control Plane Control Program Match Action Packet A Forwarding Action(A) B Action(B) Match Action Match Action A Action(A) Packet Forwarding G Action(G) Match Action F Packet Forwarding G Action(F) Action(G) H Action(H) C Action(C) Match Action A Action(A) Packet Forwarding G Action(G) X Action(X) Packet Forwarding Y Action(Y) Z Action(Z) H Action(H) D Action(D) 18

19 Think like a programmer This is how I want to network to behave Control Program Control Program I will take care of it Control Plane Tell switch how to process packets Compiler Top Down Design Configure switch Populate tables Switch Packet Forwarding Engine

20 What will chips look like in this new environment?

21 Software or hardware? CPU: software forwarding at 50Gb/s NPU: microcode forwarding at 200Gb/s ASIC: hardware forwarding at 2Tb/s 21

22 DATA Recombine HEADER Action Action RISC-like RMT architecture Stage 1 Stage 32 In Match Table Match Table Output Queues Out

23 We designed an RMT Chip with Texas Instruments 64 x 10GE OpenFlow-optimized ASIC 1Gpackets/second Industry-standard 28nm design process Parse existing + custom packet headers 32 stages of Match + Action

24 Question How much extra area and power compared to a traditional, fixed function switch chip?

25 Match Tables TCAM Physical Stage 1 Logical Table 1 Physical Stage 2 Logical Table 2 Physical Stage 32 Logical Table HASH 6 7 Logical Table 8

26 DATA Recombine HEADER Action Action Stage 1 Stage 32 In Match Table Match Table Output Queues Out

27 Header In Field Field Header Out Action Processor Match result VLIW Instructions

28 DATA Recombine HEADER Action Action Stage 1 Stage 32 In Match Table Match Table Output Queues Out

29 Area Comparison with Fixed Function Switches Section Area % of chip Extra Cost I/O, buffer, queue, CPU, etc 37% 0.0% Match memory & logic 54.3% 8.0% VLIW action engine 7.4% 5.5% Parser + deparser 1.3% 0.7% Total extra area cost 14.2%

30 Area increase: the cost of flexibility Serial I/O CPU Queues Parser +0.7% Action Engine +5.5% Total: +14.2% +8% Match Memory and Logic 30

31 Target Switch Top down control of switches Control Program Control Program Control Program Control Program Control PlaneControl Plane Switch Config Forwarding Rules Target Independent Target Dependent Switch Capabilities Configuration Compiler Optimizer Table map Rule Translator Switch Config Configure Populate Forwarding Rules Switch Configuration Agent Switch Datapath Agent Packet Forwarding Engine (hw or sw)

32 Outline 1. Well-defined control abstraction 2. Well-defined forwarding abstraction 3. Verifiable forwarding behavior

33 Verifiable forwarding behavior The forwarding tables capture the entire forwarding behavior. Control plane writes the forwarding state. Therefore, we can verify its correctness.

34 Software Defined Network (SDN) firewall.c Control Program if( TCP_port == SMTP) Control droppacket(); Program Global Network Map Network OS Control Program Match Action Packet A Forwarding Action(A) B Action(B) Match Action Match Action A Action(A) Packet Forwarding G Action(G) Match Action F Packet Forwarding G Action(F) Action(G) H Action(H) C Action(C) Match Action A Action(A) Packet Forwarding G Action(G) X Action(X) Packet Forwarding Y Action(Y) Z Action(Z) H Action(H) D Action(D)

35 Software Defined Network (SDN) firewall.c Control Program if( TCP_port == SMTP) Control droppacket(); Program Global Network Map Network OS Control Program Match Action Packet A Forwarding Action(A) B Action(B) Match Action Match Action A Action(A) Packet Forwarding G Action(G) Match Action F Packet Forwarding G Action(F) Action(G) H Action(H) C Action(C) Match Action A Action(A) Packet Forwarding G Action(G) X Action(X) Packet Forwarding Y Action(Y) Z Action(Z) H Action(H) D Action(D)

36 Making Software Work Functional Description (Code) Specification Testbench $10B tool business supports a $300B S/W industry Static Code Analysis Run-time Checker Invariant Checker Interactive Debugger Model Checking 100s of Books >100,000 Papers 10s of Classes

37 Static checking of design against original intent Making Chips Work Specification Functional Description (RTL) Functional Verification Logical Synthesis Static Timing Place & Route Design Rule Checking (DRC) Layout vs Schematic (LVS) Layout Parasitic Extraction (LPE) Testbench & Vectors Static checking across boundaries Manufacture & Validate $10B tool business supports a $250B chip industry 100s of Books >10,000 Papers 10s of Classes

38 Making Chips Work Formal specification languages Specification Functional Description (RTL) Testbench & Vectors Static checking of lowest level design Functional Verification Logical Synthesis Static Timing Place & Route Design Rule Checking (DRC) Layout vs Schematic (LVS) Layout Parasitic Extraction (LPE) Automatic Test Vector Generation (ATVG) Manufacture & Validate Dynamic troubleshooting to Identify root cause

39 Making Networks Work (Today) traceroute, ping, tcpdump, SNMP, Netflow. er, that s about it.

40 Networks are kept working by Masters of Complexity A handful of books Almost no papers No classes

41 Why it is hard in legacy networks

42 Even simple questions are hard 1. Can host A talk to host B? 2. What are all the packets from A that can reach B? 3. Are there any loops in the network? 4. Is Group X provably isolated from Group Y? 5. What happens if I remove a line in a config file? 42

43 More interesting questions 1. When I add a new forwarding rule, how can I dynamically check in real-time if it will violate my network policy? 2. How do I track down the source code that was the root cause of a data plane error? 3. If switch hardware is malfunctioning, how will I know? How will I identify the switch/rule?

44 These questions cannot be adequately answered in legacy protocol-centric networks. All of these questions will be addressed for SDNs.

45 Neither observe nor control Complex interaction Between multiple protocols on a switch/router. Between state on different switches/routers. Multiple uncoordinated writers of state. Network owner can t Observe all state. Control all state.

46 Formal specification languages Making Chips Work Functional Description (RTL) Functional Verification Specification 1. Multiple layers of abstraction Testbench & Vectors 2. Strong foundation (Boolean algebra) Static checking of lowest level design Logical Synthesis Static Timing Place & Route Design Rule Checking (DRC) Layout vs Schematic (LVS) Layout Parasitic Extraction (LPE) Automatic Test Vector Generation (ATVG) Manufacture & Validate Dynamic troubleshooting to Identify root cause

47 Making Chips Networks Work Frenetic, NetCore, Pyretic, Procera, [2012] Formal specification languages Anteater, HSA [2011] Static checking of lowest level design (several) [2012] Consistent Updates Policy Control Program Network OS Match F Action Action(F) Veriflow, NetPlumber [2012] Dynamic checking of lowest level design ATPG [2012], NetSONAR [2013] Automatic Test Pkt Generation (ATPG) WWW, ndb [2012] Dynamic troubleshooting to Identify root cause G H Action(G) Action(H) NETWORK

48 HSA: Modeling forwarding

49 Header Space Analysis [NSDI 12] Header L Data Header Data

50 Header Space Analysis 1 Match + Action 2

51 The set of packets from A that can reach B

52 All packets from A that can reach B

53 Implications Reachability and loops Prove two groups are isolated Regardless of protocol or layer Analogy to Boolean algebra Follow-on 1. NetPlumber: Dynamic checking for Google s OpenFlow WAN 10,000 times per second 2. ATPG: Testing every forwarding rule 10-times per second

54 Why industry cares about SDN

55 Why industry cares Lower cost: Networking industry enjoys enormous margins at the customers expense. Switches will be simpler Software will be limited to only what is needed More control: Puts network operators in control of their networks for the first time. Programmatic control of the network Remove unneeded features Much faster innovation

56 Specialized Features Specialized Control Plane Specialized Hardware Hundreds of protocols 6,500 RFCs Tens of millions of lines of code. Closed, proprietary, outdated. Billions of gates. Power hungry and bloated.

57 AppAppAppAppAppAppAppAppAppAppApp Specialized Applications Specialized Operating System Specialized Hardware Windows (OS) Open Interface or Linux or Open Interface Microprocessor Mac OS Vertically integrated Closed, proprietary Slow innovation Small industry Horizontal Open interfaces Rapid innovation Huge industry

58 AppAppAppAppAppAppAppAppAppAppApp Specialized Features Specialized Control Plane Control Plane or Open Interface Control Plane or Open Interface Control Plane Specialized Hardware Merchant Switching Chips Vertically integrated Closed, proprietary Slow innovation Horizontal Open interfaces Rapid innovation

59 Concluding Remarks SDN s clean abstractions means 1. We will see new programmable RMT-style switches. 2. Networks will be more reliable than ever before.

60 <end>