1 / 6

Flow-level State Transition as a New Switch Primitive for SDN

Flow-level State Transition as a New Switch Primitive for SDN. (HotSDN’14). Masoud Moshref , Apoorv Bhargava , Adhip Gupta, Minlan Yu, Ramesh Govindan. Motivation. Current practice Proactive needs a priori knowledge Reactive has high delay.

lyle-robles
Download Presentation

Flow-level State Transition as a New Switch Primitive for SDN

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Flow-level State Transition as a New Switch Primitive for SDN (HotSDN’14) Masoud Moshref, ApoorvBhargava, Adhip Gupta, Minlan Yu, Ramesh Govindan

  2. Motivation • Current practice • Proactive needs a priori knowledge • Reactive has high delay Opportunity:Local state is enough for many policies (stateful firewall, FTP monitoring, large source IP detection) Key idea: State machine is a general but efficient abstraction to allow dynamic actions at switches

  3. FAST (Flow-level State Transitions) Abstraction • Controller proactively programs state transitions and actions at switches • Switches run state machines and actions of a state • Examples: • Stateful firewall: TCP state machine with actions that drop uninitiated flows • FTP Monitoring: Track the states of control channel & allow data channel traffic • Large source IP detection: Keep a counter per IP and compare it against a threshold

  4. FAST Control Plane Controller translates state machines to switch API None Init2 Close1 SYN ACK FINACK Init1 Est Close2 FAST compiler FAST controller FIN SYNACK Switch agent Switch agent Network

  5. FAST Data Plane FAST data plane is implementable in hardware switch components Packet State table State machine filter Packet, H(p) Packet Close1 Pick fields and hash Packet, Est Update state Action table State transition table Packet, Close1 Packet

  6. FAST Data Plane Evaluation in Open vSwitch Delay of going through all TCP states for FAST is small 1 packet, 1 flow : FAST: 28x faster (3ms) > 64 concurrent flows: 6ms FAST state lookup has small overhead: Iperf throughput (Gbps): <5% overhead

More Related