Tesseract A 4D Network Control Plane

Slides:



Advertisements
Similar presentations
Path Splicing with Network Slicing
Advertisements

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
CS 4700 / CS 5700 Network Fundamentals Lecture 7: Bridging (From Hub to Switch by Way of Tree) Revised 1/14/13.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
SANE: A Protection Architecture for Enterprise Networks Offense by: Amit Mondal Bert Gonzalez.
Revisiting Ethernet: Plug-and-play made scalable and efficient Changhoon Kim and Jennifer Rexford Princeton University.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Computer Science Department Princeton University
1 Problems and Solutions in Enterprise Network Control: Motivations for a 4D Architecture David A. Maltz Microsoft Research Joint work with Albert Greenberg,
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Routing and Routing Protocols
CS335 Networking & Network Administration Tuesday, April 20, 2010.
1 Network-wide Decision Making: Toward a Wafer-thin Control Plane Jennifer Rexford, Albert Greenberg, Gisli Hjalmtysson ATT Labs Research David A. Maltz,
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
DataLink Layer1 Ethernet Technologies: 10Base2 10: 10Mbps; 2: 200 meters (actual is 185m) max distance between any two nodes without repeaters thin coaxial.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
CECS 5460 – Assignment 3 Stacey VanderHeiden Güney.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Routing and Routing Protocols Routing Protocols Overview.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Routing & Architecture
CS3502: Data and Computer Networks Local Area Networks - 4 Bridges / LAN internetworks.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Introduction Slide 1 A Communications Model Source: generates.
1 Next Few Classes Networking basics Protection & Security.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Floodless in SEATTLE : A Scalable Ethernet ArchiTecTure for Large Enterprises. Changhoon Kim, Matthew Caesar and Jenifer Rexford. Princeton University.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
11 Tesseract* A 4D Network Control Plane Hong Yan, David A. Maltz, T. S. Eugene Ng Hemant Gogineni, Hui Zhang, Zheng Cai *Tesseract is a 4-dimensional.
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Routing and Routing Protocols PJC CCNA Semester 2 Ver. 3.0 by William Kelly.
+ Routing Concepts 1 st semester Objectives  Describe the primary functions and features of a router.  Explain how routers use information.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Network Layer. application transport network link physical message segment packet frame signal Network Architecture.
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
Routing and Routing Protocols CCNA 2 v3 – Module 6.
Open Shortest Path First (OSPF)
Multi Node Label Routing – A layer 2.5 routing protocol
Instructor Materials Chapter 6: Quality of Service
Routing Jennifer Rexford.
ETHANE: TAKING CONTROL OF THE ENTERPRISE
Revisiting Ethernet: Plug-and-play made scalable and efficient
Lecture#10: LAN Redundancy
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
Chapter 3 Part 3 Switching and Bridging
CS 457 – Lecture 12 Routing Spring 2012.
Introduction to Internet Routing
Routing.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
COS 561: Advanced Computer Networks
70-293: MCSE Guide to Planning a Microsoft Windows Server 2003 Network, Enhanced Chapter 4: Planning and Configuring Routing and Switching.
COS 561: Advanced Computer Networks
Routing With a Link-State Protocol
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Chapter 3 Part 3 Switching and Bridging
CS 381: Introduction to Computer Networks
Routing.
Reconciling Zero-conf with Efficiency in Enterprises
Presentation transcript:

Tesseract A 4D Network Control Plane Carnegie Mellon University Microsoft Research Rice University Presented by: Alberto Gonzalez, Whitney Young

Current Designs No direct control Subtle dependencies Example: load balance forwarding by tuning OSPF link weights, but impacts inter-domain routing

4D Architecture Control plane: Decision Dissemination Discovery Data Services: Dissemination Node configuration

Design

Design Goals Timely reaction to network changes Resilient to decision plane failure Robust and secure control channels Minimal switch configuration Backward compatibility Support diverse decision algorithms Support multiple data planes

Implementation Overview Switch Implements data plane Decision Element (DE) Implements discovery, dissemination, and decision planes

Decision Plane Any network control algorithm can be easily integrated Incremental shortest path first Spanning tree Joint packet filtering/routing Link cost-based traffic engineering Resiliency to DE failure Hot standbys receiving heartbeats

Dissemination Plane Goal: communication between DEs and switches DEs handle most of dissemination plane, but switches help out Path to destination handled by DE Switches have separate queue and dissemination packets have higher priority Security (protects switches, info passed through dissemination plane, and compromised DEs)

Discovery Plane Goal: minimize manual configuration Switches send HELLO messages DEs handle instructing the switches on what to do once active Initiate eBGP session with outside world Backward compatibility (bootstrapping end hosts) Discovery plane as DHCP proxy

Data Plane Configured by decision plane WriteTable exposed with simple interface to provide configuration service to decision plane Allows easy implementation of different services Decision/Dissemination Interface Function independently of each other Only 3 functions used to interface between them (2 more simply to improve performance)

Performance Evaluation Single Link Failures Switch& Regional Failures Link Flapping 10-hop to 12-hop change Tesseract can handle network changes

Performance Evaluation 1347 nodes & 6244 edges DE Computation Time Worst Case: 151ms 99th percentile: 40ms Bandwidth overhead Worst Case: 4.4MB 90% of switched updated with new state

Performance Evaluation Failover times

Applications In enterprise network: Computers both new routes & packet filter placements Loads into routers with no forbidden traffic leaked No human involvement once security policy is specified

Ethernet Key features Tesseract keeps these properties. Widely implemented frame format Support for broadcasting frames Transparent address learning model Tesseract keeps these properties.

Ethernet Through point comparisons Control Plane for TCP flows Started at 570Mbps Leveled at 280Mbps after a failure Conventional RSTP Control Plane Starts at 280Mbps Hit zero after failure Recovered after 7-8 seconds at ~180Mbps

Summary Tesseract Robust Secure Resuable Good Performance Scalable Decission/Dissemination Planes Secure Enterprise Network Resuable Ethernet or IP Good Performance Convergence & Throughput Scalable 1,000+ Switches Enables direct Control Easier to Understand and Deploy