T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 The Struggle for Network Control: How Can Distributed and Centralized Controls Effectively Collaborate?

Slides:



Advertisements
Similar presentations
Open Archive Forum ECDL2001, (c) Susanne Dobratz, Humboldt-University1 European Support for Open Archives Susanne Dobratz Humboldt-University.
Advertisements

1/31/01 Professor Richard Fikes Frame Representation of Electronic Circuit Example Computer Science Department Stanford University CS222 Winter 2001 Knowledge.
2/13/2014Bucknell University1 Health Care Issues BOF Cindy Bilger,
T. S. Eugene Ng Mellon University1 Towards Global Network Positioning T. S. Eugene Ng and Hui Zhang Department of Computer.
April 2004NUCAD Northwestern University1 Minimal Period Retiming Under Process Variations Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Internet architecture Slides used with permissions.
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
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.
Best PracticesUSCA Fall 2010: Baylor University3.
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
Contents Shortcomings of QoS in the Current Internet About OpenFlow
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Montek Singh COMP Nov 10,  Design questions at various leves ◦ Network Adapter design ◦ Network level: topology and routing ◦ Link level:
Traffic Engineering With Traditional IP Routing Protocols
CS 501: Software Engineering Fall 2000 Lecture 16 System Architecture III Distributed Objects.
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 Towards a Framework for Network Control Composition T. S. Eugene Ng Rice University Hong Yan Carnegie.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Routing.
Tesseract A 4D Network Control Plane
1 Network-wide Decision Making: Toward a Wafer-thin Control Plane Jennifer Rexford, Albert Greenberg, Gisli Hjalmtysson ATT Labs Research David A. Maltz,
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Border Gateway Protocol (BGP4) Rizwan Rehman, CCS, DU.
OSPF To route, a router needs to do the following: Know the destination address Identify the sources it can learn from Discover possible.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 8: Bridging Slides used with permissions.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
Introduction to Dynamic Routing Protocol
1 Controlling IP Spoofing via Inter-Domain Packet Filters Zhenhai Duan Department of Computer Science Florida State University.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
VeriFlow: Verifying Network-Wide Invariants in Real Time
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18 Omar Meqdadi Department of Computer Science and Software Engineering University.
Chapter 9. Implementing Scalability Features in Your Internetwork.
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
SDN AND OPENFLOW SPECIFICATION SPEAKER: HSUAN-LING WENG DATE: 2014/11/18.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—6-1 Scaling Service Provider Networks Scaling IGP and BGP in Service Provider Networks.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—2-1 BGP Transit Autonomous Systems Forwarding Packets in a Transit AS.
Network Virtualization Sandip Chakraborty. In routing table we keep both the next hop IP (gateway) as well as the default interface. Why do we require.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
Preliminaries: EE807 Software-defined Networked Computing KyoungSoo Park Department of Electrical Engineering KAIST.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723
Yiting Xia, T. S. Eugene Ng Rice University
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Architecture and Algorithms for an IEEE 802
Network Layer Goals: Overview:
Chapter 4: Routing Concepts
CS4470 Computer Networking Protocols
Distributed Control Plane
Introduction to Internet Routing
Plethora: Infrastructure and System Design
Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
DDoS Attack Detection under SDN Context
IS4680 Security Auditing for Compliance
Netscope: Traffic Engineering for IP Networks
CS 4594 Broadband PNNI Signaling.
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
Routing Fundamentals JNCIA-JUNOS Foryanto Jaya Wiguna.
In-network computation
Using Service Function Chaining for In-Network Computation
Presentation transcript:

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 The Struggle for Network Control: How Can Distributed and Centralized Controls Effectively Collaborate? T. S. Eugene Ng Department of Computer Science Rice University Joint work with Alan L. Cox, Zheng Cai, Florin Dinu, Jie Zheng

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University2 Beyond Best Effort Datagram Service in Present and Future Networks Controller Best Effort Datagram Autonomous Network Routin g Protoc ol Routin g Protoc ol Routin g Protoc ol Routin g Protoc ol Routin g Protoc ol Virtual Private Network VPN Provisionin g Auto Load Balance IGP Link Weight Optimization Reachability Policy Packet Filter Configuratio n DDoS Mitigation Content Distribution Elastic Cloud Computing Big Data Computing

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University3 Fundamental Need for Control Component Collaboration (SLA Compliance Example) Routing Load balancing DDoS filtering DDoS

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University4 Control Component Collaboration is Tricky Pair-wise collaboration does not scale Routing Protocol Content Distribution Optimization Packet Filter Configuration IGP Link Weight Optimization Lack of state consistency

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University5 Maestro Unified Network State Management …….. Logic 1Logic 2Logic 3Logic N Virtual Network States Underlying Network States Environmental State Computed State Performance State

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University6 Requirements Synchronized access to state –Granularity of locking Consistency of input state of collaborating controls –Even when underlying network state changes Maintaining a history of state –For trend analysis and incremental computations Extensible network state –Support new state associated with new network functions Extensible control logic –Programmatic, reusable, reconfigurable logic

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University7 Maestro Architecture Overview Physical Network Driver State Dissemination Global Environment Driver BSG Local Environment Snapshot CLG Logic CLG Logic Transactional Update Local Environment Snapshot

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University8 Application to SLA Compliance DPC Coordination Protocol –Regulates forwarding table changes –Ensures routers adopt consistent forwarding tables Maestro DPC Driver Logic

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University9 CLG 1: Evaluates Acceptability of Routing State on New Observed Topology OSPF Routing Prediction Access Control Configuration SLA Compliance Analysis From local env Connectivity To temp env PredictedIntraDomainRoutingTable From local env TrafficDemandMatrix Connectivity ApprovedIntraDomainRoutingTable From temp env PredictedIntraDomainRoutingTable To temp env Null From local env Connectivity From temp env PredictedIntraDomainRoutingTable PredictedAccessControlConfiguration Terminal To global env ApprovableConnectivity ApprovableIntraDomainRoutingTable ApprovableAccessControlConfiguration From local env Connectivity AccessControlPolicy ApprovedAccessControlConfiguration From temp env PredictedIntraDomainRoutingTable To temp env PredictedAccessControlConfiguration Activation Connectivity

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University10 CLG 2: Computes IGP Link Weights for Load Balance Compute or Select Precomputed OSPF Link Weights for Improved SLA Compliance From local env Connectivity TrafficDemandMatrix To temp env OSPFLinkWeights From temp env OSPFLinkWeights Terminal To global env OSPFLinkWeights Activation Connectivity

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University11 Experimental Results NS-2 simulator interfaced with Java implementation of Maestro 79-node, 147-link Rocketfuel topology 100 Poisson traffic flows, random source-destination –Average rates follow Zipf distribution 5 malicious flows that need to be blocked Conduct random link failure experiments, observe impact to traffic flows

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University12 Number of Flows Affected by Packet Loss

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University13 Reduction in SLA Violations

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University14 Summary Future networks will no doubt be rich in services Control components (distributed or centralized) need to collaborate Maestro proposes an hourglass architecture for control component collaboration –Provides consistent access to network state –Programmable, extensible –Measurable benefits (e.g. SLA compliance) Target to release the software by the end of summer Work supported by NSF FIND and Microsoft Research