Time-based Updates in Software Defined Networks Tal Mizrahi, Yoram Moses Technion – Israel Institute of Technology SDNRG, IETF Meeting, Berlin, July 2013.

Slides:



Advertisements
Similar presentations
Progress Report: Metering NSLP (M-NSLP) 66th IETF meeting, NSIS WG.
Advertisements

Jaringan Komputer Lanjut Packet Switching Network.
CSE 534 Fundamentals of Computer Networks Lecture 4: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised.
CS 4700 / CS 5700 Network Fundamentals Lecture 7: Bridging (From Hub to Switch by Way of Tree) Revised 1/14/13.
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Software-Defined Networks: Incremental Deployment with Panopticon Published by the IEEE Computer Society Marco Canini, Université catholique de Louvain.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
SDN and Openflow.
Flowspace revisited OpenFlow Basics Flow Table Entries Switch Port MAC src MAC dst Eth type VLAN ID IP Src IP Dst IP Prot L4 sport L4 dport Rule Action.
Network based System on Chip Final Presentation Part B Performed by: Medvedev Alexey Supervisor: Walter Isaschar (Zigmond) Winter-Spring 2006.
Shadow Configurations: A Network Management Primitive Richard Alimi, Ye Wang, Y. Richard Yang Laboratory of Networked Systems Yale University.
Distributed Systems CS Synchronization – Part II Lecture 8, Sep 28, 2011 Majd F. Sakr, Vinay Kolar, Mohammad Hammoud.
Routing Going from one network to the next. Where is routing handled? IP serves the functions of –routing –universal naming Identification is easiest.
COS 338 Day DAY 16 Agenda Capstone Proposals Overdue 3 accepted, 3 in mediation Capstone progress reports still overdue I forgot to mark in calendar.
Border Gateway Protocol (BGP). 2 CORE, PEERs Autonomous Systems BGP Basic Operations The BGP Routing Process.
Spring 2004 EE4272 The Need of Spanning Tree Algorithm.
Institute of Technology, Sligo Dept of Computing Semester 3, version Semester 3 Chapter 3 VLANs.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Robert Horn, Agfa Corporation
Virtual LANs. VLAN introduction VLANs logically segment switched networks based on the functions, project teams, or applications of the organization regardless.
Connecting LANs, Backbone Networks, and Virtual LANs
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Differences between In- and Outbound Internet Backbone Traffic Wolfgang John and Sven Tafvelin Dept. of Computer Science and Engineering Chalmers University.
ONF Configuration and Management WG Jürgen Quittek
Introduction to Dynamic Routing Protocol
VLAN Trunking Protocol (VTP)
CN2668 Routers and Switches (V2) Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
IETF-84 (29 July – 3 Aug. 2012) Cloud Computing, Networking, and Service (CCNS) Update for GISFI-10, New Delhi, India Sept Monday-10-September-20121IETF84.
VLAN V irtual L ocal A rea N etwork VLAN Network performance is a key factor in the productivity of an organization. One of the technologies used to.
Brett Neely IP Next Generation. To boldly go where no network has gone before...
Group Communication A group is a collection of users sharing some common interest.Group-based activities are steadily increasing. There are many types.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
© 2002, Cisco Systems, Inc. All rights reserved..
Othman Othman M.M., Koji Okamura Kyushu University 1.
1 Kyung Hee University Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs.
Campus Networking Best Practices Hervey Allen NSRC & University of Oregon Dale Smith University of Oregon & NSRC
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Real-time Flow Management 2 BOF: Remote Packet Capture Extensions Jürgen Quittek NEC Europe Ltd, Heidelberg, Germany Georg Carle GMD.
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
SDN AND OPENFLOW SPECIFICATION SPEAKER: HSUAN-LING WENG DATE: 2014/11/18.
STORE AND FORWARD & CUT THROUGH FORWARD Switches can use different forwarding techniques— two of these are store-and-forward switching and cut-through.
Switching Topic 6 Rapid spanning tree protocol. Agenda RSTP features – Port states – Port roles – BPDU format – Edge ports and link types – Proposals.
1 | © 2015 Infinera Open SDN in Metro P-OTS Networks Sten Nordell CTO Metro Business Group
Switching Topic 3 VTP. Agenda VTP basics Components Frames and advertisements Domains and revision numbers VTP operations VTP pruning VTP issues.
Chapter 4 Version 1 Virtual LANs. Introduction By default, switches forward broadcasts, this means that all segments connected to a switch are in one.
Time Capability in NETCONF draft-mm-netconf-time-capability-03
VLAN Trunking Protocol (VTP)
Chabot College ET Cisco Semester 3 Chapter 3 VLANs M. McGregor, Los Medanos College, Pittsburg, CA.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Exploration 3 Chapter 4. What is VTP? VTP allows a network manager to configure a switch so that it will propagate VLAN configurations to other switches.
Gijeong Kim ,Junho Kim ,Sungwon Lee Kyunghee University
University of Maryland College Park
CCNA 3 Chapter 10 Virtual Trunking Protocol
© 2002, Cisco Systems, Inc. All rights reserved.
VLAN Trunking Protocol
Virtual LANs.
Subject Name: Computer Communication Networks Subject Code: 10EC71
Precision Time Protocol
VLAN Trunking Protocol
Timed Consistent Network Updates in Software-Defined Networks
CCNA 3 v3 JEOPARDY Module 8 CCNA3 v3 Module 8 K. Martin.
Opnet Simulator Project
Chapter 3 VLANs Chaffee County Academy
Programmable Networks
Distributed Systems CS
Editors: Bala’zs Varga, Jouni Korhonen
Distributed Systems CS
Presentation transcript:

Time-based Updates in Software Defined Networks Tal Mizrahi, Yoram Moses Technion – Israel Institute of Technology SDNRG, IETF Meeting, Berlin, July Time-based Updates in SDNs

Introduction Time has been used for many years in distributed systems, typically not for network configuration. SDN: rapid and frequent configuration changes  simple, scalable updates with minimal transient effects. Accurate network time synchronization has evolved (NTP, PTP) and has become accessible. Time-based Updates in SDNs2

Time-triggered Configuration Updates We propose to use time as a tool for network updates / reconfiguration. TimeConf: a class of time-triggered configuration scenarios: – Coordinated updates. – An ordered sequence of updates based on a sequence of scheduled times. Time-based Updates in SDNs3

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs4

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs5

Example: Path Reconfiguration Time-based Updates in SDNs6 Flow A: path 1  path 2.

Example: Path Reconfiguration Time-based Updates in SDNs7 Best-effort approach: update all switches when possible.

Example: Path Reconfiguration Time-based Updates in SDNs8 Best-effort approach: What happens if Switch 1 is updated before Switch 4? Inconsistency  Consistency [Reitblatt et al.]: every packet sent through the network is processed according to a single configuration version, either the previous or the current one.

Example: Path Reconfiguration Time-based Updates in SDNs9 TimeConf: all switches are updated at (T- , T+  ).

Example: Path Reconfiguration Time-based Updates in SDNs10 What can we say about consistency with TimeConf? D = maximal delay from Switch 1 to Switch 3 through path 1 TimeConf: inconsistent for a short period (T-  -D, T+  ). Consistent otherwise. TimeConf: short transition period.

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs11

Example: Path Reconfiguration Time-based Updates in SDNs12 Sequential approach: 1.Update Switch 4. 2.Receive ACK from Switch 4. 3.Update Switch 1.

Example: Path Reconfiguration Time-based Updates in SDNs13 Sequential TimeConf: Send updates to all switches: -Switch 4 at time T4 -Switch 1 at time T1 T 4 <T 1 Sequential TimeConf: maintains consistency.

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs14

Updating Physical Layer Attributes Physical attributes such as: switch resources, flow rate limit, port transmission rate, … Per-packet consistency is irrelevant. TimeConf can apply the update to all switches at the same time T. Time-based Updates in SDNs15

Example: Port Rate Reconfiguration Time-based Updates in SDNs16 TimeConf allows physical layer updates with short transition period. Both switches are configured to change the port rate at time T. What happens when the sequential approach is not possible?

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs17

Consistency / Simplicity Tradeoff Time-based Updates in SDNs18

Agenda Transition time during updates. Sequential updates. Updating physical layer configurations. Consistency/simplicity tradeoff. Time-based updates in practice. Time-based Updates in SDNs19

Time-based Updates in Practice Proposal to the Open Networking Foundation (ONF): – Time-based Updates in OpenFlow: A Proposed Extension to the OpenFlow Protocol – Presented in July 2013 to: ONF Extensibility WG ONF Configuration and Management WG. Proposal to the IETF: – – To be presented in IETF 87 in Berlin, Jul Time-based Updates in SDNs20

Time-based Updates in Practice: Routing Change Time-based Updates in SDNs21 Client instructs routers 1, 2 to update routing tables at T 1, T 2 so that T 1 <T 2. I2RS: rapid and dynamic routing changes (e.g., This example: change the route to AS1.

Summary We propose to use time as a tool for coordinated configuration updates. Can be used for: – Reducing transition period. – Physical layer updates. – Simplifying update procedure. This work presents a tradeoff between consistency and simplicity of the update procedure. Time-based Updates in SDNs22

THANKS ! Time-based Updates in SDNs23

Further Reading Mizrahi, T., Moses, Y., "Time-based Updates in Software Defined Networks", the second workshop on hot topics in software defined networks (HotSDN), to appear, Mizrahi, T., Moses, Y., "Time-based Updates in OpenFlow: A Proposed Extension to the OpenFlow Protocol", Technion - Israel Institute of Technology, technical report, CCIT Report #835, July 2013, EE Pub No. 1792, Mizrahi, T., Moses, Y., “Time Capability in NETCONF,” IETF, draft-mm-netconf-time- capability, work in progress, L. Lamport, “Using time instead of timeout for fault-tolerant distributed systems”, ACM Trans. Program. Lang. Syst., vol. 6, pp. 254–280, Apr Time-based Updates in SDNs24

BACKUP SLIDES Time-based Updates in SDNs25

Example: Rate Limiting Reconfiguration Time-based Updates in SDNs26 Using time: controller sends update messages to the n switches, scheduled to time T.

Time-based Updates in SDNs27 Versioning approach: 0. ST 1 uses VLAN 1 (tagged). 1. Configure VLAN 2 (tagged) with ST Configure switches to start using VLAN 2 (and still accept traffic from VLAN 1). 3. Remove VLAN 1 from all switches. Example: Spanning Tree Reconfiguration

Time-based Updates in SDNs28 Time-based versioning approach: 0. ST 1 uses VLAN 1 (tagged). 1. Configure VLAN 2 with ST 2  T 1 Configure switches to start VLAN 2  T 2 Remove VLAN 1 from all switches  T 3 T 1 <T 2 <T 3 Example: Spanning Tree Reconfiguration