Improving Internet Availability. Some Problems Misconfiguration Miscoordination Efficiency –Market efficiency –Efficiency of end-to-end paths Scalability.

Slides:



Advertisements
Similar presentations
Grand Challenges in Networking Nick Feamster CS 7001.
Advertisements

Diagnosing Network Disruptions with Network-wide Analysis Yiyi Huang, Nick Feamster, Anukool Lakhina, Jim Xu College of Computing, Georgia Tech Boston.
Networking Research Nick Feamster CS Nick Feamster Ph.D. from MIT, Post-doc at Princeton this fall Arriving January 2006 –Here off-and-on until.
Internet Availability Nick Feamster Georgia Tech.
AGORA: A Market for Internet Connectivity Nick Feamster, Georgia Tech Ramesh Johari, Stanford Vijay Vazirani, Georgia Tech.
Multihoming and Multi-path Routing
CS 4251: Computer Networking II Nick Feamster Spring 2008
Nick Feamster Research: Network security and operations –Helping network operators run the network better –Helping users help themselves Lab meetings:
Network Operations Research Nick Feamster
MINT: A Market for Internet Transit Nick Feamster Georgia Tech Joint work with Vytautas Valancius, Ramesh Johari, Vijay Vazirani.
Multihoming and Multi-path Routing
Two-Market Inter-domain Bandwidth Contracting
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing the MPLS VPN Routing Model.
Deployment of MPLS VPN in Large ISP Networks
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
1 Copyright  1999, Cisco Systems, Inc. Module10.ppt10/7/1999 8:27 AM BGP — Border Gateway Protocol Routing Protocol used between AS’s Currently Version.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
INTERDOMAIN ROUTING POLICY COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Mike Freedman
Best Practices for ISPs
How to Construct a Correct and Scalable iBGP Configuration Mythili Vutukuru Joint work with Paul Valiant, Swastik Kopparty and Hari Balakrishnan.
CS 164: Global Internet Slide Set In this set... More about subnets Classless Inter Domain Routing (CIDR) Border Gateway Protocol (BGP) Areas with.
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
INTERDOMAIN ROUTING POLICY READING: SECTIONS PLUS OPTIONAL READING COS 461: Computer Networks Spring 2009 (MW 1:30-2:50 in COS 105) Mike Freedman.
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Wresting Control from BGP: Scalable Fine-grained Route Control UCSD / AT&T Research Usenix —June 22, 2007 Dan Pei, Tom Scholl, Aman Shaikh, Alex C. Snoeren,
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
1 Design and implementation of a Routing Control Platform Matthew Caesar, Donald Caldwell, Nick Feamster, Jennifer Rexford, Aman Shaikh, Jacobus van der.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Interdomain Routing Policy COS 461: Computer Networks Spring 2011 Mike Freedman 1.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Interdomain Routing (Nick Feamster) February 4, 2008.
Interdomain Routing David Andersen Spring 2007 Carnegie Mellon University.
Nick Feamster Interdomain Routing Correctness and Stability.
Information-Centric Networks07b-1 Week 7 / Paper 2 NIRA: A New Inter-Domain Routing Architecture –Xiaowei Yang, David Clark, Arthur W. Berger –IEEE/ACM.
1 Interdomain Routing (BGP) By Behzad Akbari Fall 2008 These slides are based on the slides of Ion Stoica (UCB) and Shivkumar (RPI)
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Lecture 4: BGP Presentations Lab information H/W update.
© Synergon Informatika Rt., 1999 Chapter 12 Connecting Enterprises to an Internet Service Provider.
CS 356: Computer Network Architectures Lecture 13: Dynamic Routing Protocols: Border Gateway Protocol [PD] chapter Xiaowei Yang
Towards an Internet that “Never Fails” Hari Balakrishnan MIT Joint work with Nick Feamster, Scott Shenker, Mythili Vutukuru.
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.
How to Construct a Correct and Scalable iBGP Configuration Mythili Vutukuru Joint work with Paul Valiant, Swastik Kopparty and Hari Balakrishnan.
1 Evolution Towards Global Routing Scalability draft-zhang-evolution-01 Varun Khare Beichuan Zhang
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
INTER-DOMAIN ROUTING AND BORDER GATEWAY PROTOCOL Dr. Rocky K. C. Chang 22 November
© 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—5-1 Customer-to-Provider Connectivity with BGP Connecting a Multihomed Customer to a Single Service.
Border Gateway Protocol (BGP) (Bruce Maggs and Nick Feamster)
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
Securing BGP Bruce Maggs. BGP Primer AT&T /8 Sprint /16 CMU /16 bmm.pc.cs.cmu.edu Autonomous System Number Prefix.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-king-pce-hierarchy-fwk-01.txt.
Working at a Small-to-Medium Business or ISP – Chapter 6
CS 3700 Networks and Distributed Systems
CS 3700 Networks and Distributed Systems
Securing BGP Bruce Maggs.
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Interdomain Routing (Nick Feamster).
Module Summary BGP is a path-vector routing protocol that allows routing policy decisions at the AS level to be enforced. BGP is a policy-based routing.
BGP Overview BGP concepts and operation.
Connecting an Enterprise Network to an ISP Network
Scaling Service Provider Networks
Working at a Small-to-Medium Business or ISP – Chapter 6
Securing BGP Bruce Maggs.
Computer Networks Protocols
Border Gateway Protocol (BGP)
Presentation transcript:

Improving Internet Availability

Some Problems Misconfiguration Miscoordination Efficiency –Market efficiency –Efficiency of end-to-end paths Scalability Accountability

Two Philosophies Bandage: Accept the Internet as is. Devise band-aids. Amputation: Redesign Internet routing to guarantee safety, route validity, and path visibility

Several Big Problems a Week

Goal: Proactive Fault Detection Idea: Analyze configuration before deployment Configure Detect Faults Deploy rcc Many faults can be detected with static analysis. Feamster et al., Detecting BGP Configuration Faults with Static Configuration Analysis, NSDI, May 2005

rcc rcc Overview Normalized Representation Correctness Specification Constraints Faults Analyzing complex, distributed configuration Defining a correctness specification Mapping specification to constraints Challenges Distributed router configurations (Single AS)

Summary: Faults across 17 ASes Route ValidityPath Visibility Every AS had faults, regardless of network size Most faults can be attributed to distributed configuration

Routing Control Platform iBGP RCP After: RCP gets best iBGP routes (and IGP topology) iBGP eBGP Before: conventional iBGP Caesar et al., Design and Implementation of a Routing Control Platform, NSDI, 2005

Some Problems Misconfiguration Miscoordination Efficiency –Market efficiency –Efficiency of end-to-end paths Scalability Accountability

Market Inefficiency Pair of ASes may decide to terminate connectivity arrangement –Even if end nodes would pay for the path to be there! 31 Jul 2005: Level 3 Notifies Cogent of intent to disconnect. 16 Aug 2005: Cogent begins massive sales effort and mentions a 15 Sept. expected depeering date. 31 Aug 2005: Level 3 Notifies Cogent again of intent to disconnect (according to Level 3) 5 Oct :50 UTC: Level 3 disconnects Cogent. Mass hysteria ensues up to, and including policymakers in Washington, D.C. 7 Oct 2005: Level 3 reconnects Cogent During the outage, Level 3 and Cogents singly homed customers could not reach each other. (~ 4% of the Internets prefixes were isolated from each other) October 2005April 2007

Depeerings Continue

Connectivity Inefficiency Paths become longer (or nonexistent) simply because two ASes decide not to interconnect Comcast Abilene AT&T Cogent $$ Peering points in Atlanta Peering point in Washington, D.C.

Idea Separate path setup from maintenance of connectivity on individual networks –Enable customers who value end-to-end paths to actually pay for those paths Establish a market for the exchange of segments –Interdomain RCP facilitates this market

MINT: Market for Internet Transit New types of contracts –ISPs advertise path segments –Edge networks bid for end-to-end paths –Mediator assembles segments into paths Exchanges as waypoints between segments Mediator collects information about path segments and sells end- to-end paths to edge networks M

Protocol Operation Provider advertises, per ingress/egress pair –Segment properties –A price for that segment Mediator(s) compile the pairs of endpoints to be bought and sold Edge networks request end-to-end connectivity Mediators solve an optimization problem and allocate resources to edge networks

Questions Contract setup –Protocols for tracking available capacity of segments –Scalability of mediator architecture –Efficiency of resulting contracts Contract enforcement –How can edge networks determine that they are receiving a certain level of service? Performance under churn –Containing churn within an ISP when links fail –Limiting recomputation of end-to-end paths