Border Gateway Protocol (BGP)

Slides:



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

AGORA: A Market for Internet Connectivity Nick Feamster, Georgia Tech Ramesh Johari, Stanford Vijay Vazirani, Georgia Tech.
CS 4251: Computer Networking II Nick Feamster Spring 2008
1 Interdomain Traffic Engineering with BGP By Behzad Akbari Spring 2011 These slides are based on the slides of Tim. G. Griffin (AT&T) and Shivkumar (RPI)
Border Gateway Protocol Ankit Agarwal Dashang Trivedi Kirti Tiwari.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
Border Gateway Protocol Autonomous Systems and Interdomain Routing (Exterior Gateway Protocol EGP)
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
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Practical and Configuration issues of BGP and Policy routing Cameron Harvey Simon Fraser University.
S ufficient C onditions to G uarantee P ath V isibility Akeel ur Rehman Faridee
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.
Computer Networking Lecture 10: Inter-Domain Routing
Internet Routing (COS 598A) Today: Interdomain Traffic Engineering Jennifer Rexford Tuesdays/Thursdays.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Ion Stoica October 2, 2002 (* this presentation is based on Lakshmi Subramanian’s slides) EE 122: Inter-domain routing – Border Gateway Protocol (BGP)
Backbone Networks Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Interdomain Routing Policy COS 461: Computer Networks Spring 2011 Mike Freedman 1.
Border Gateway Protocol(BGP) L.Subramanian 23 rd October, 2001.
Interdomain Routing (Nick Feamster) February 4, 2008.
Computer Networks Layering and Routing Dina Katabi
Interdomain Routing David Andersen Spring 2007 Carnegie Mellon University.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—6-1 Connecting an Enterprise Network to an ISP Network BGP Attributes and Path Selection Process.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
CS 356: Computer Network Architectures Lecture 13: Dynamic Routing Protocols: Border Gateway Protocol [PD] chapter Xiaowei Yang
Border Gateway Protocol (BGP) W.lilakiatsakun. BGP Basics (1) BGP is the protocol which is used to make core routing decisions on the Internet It involves.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
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.
R-BGP: Staying Connected in a Connected World Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 16 PHILLIPA GILL - STONY BROOK U.
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
Securing BGP Bruce Maggs. BGP Primer AT&T /8 Sprint /16 CMU /16 bmm.pc.cs.cmu.edu Autonomous System Number Prefix.
1 Border Gateway Protocol (BGP) and BGP Security Jeff Gribschaw Sai Thwin ECE 4112 Final Project April 28, 2005.
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.
Interdomain Interconnections and Routing Computer Networks Hari Balakrishnan Fall 2016 Most of these slides were prepared by Nick Feamster (’00,
Working at a Small-to-Medium Business or ISP – Chapter 6
CS 3700 Networks and Distributed Systems
2017 session 1 TELE3118: Network Technologies Week 6: Network Layer Control Plane Inter-Domain Routing Protocols Some slides have been adapted from:
Border Gateway Protocol
BGP 1. BGP Overview 2. Multihoming 3. Configuring BGP.
CS 3700 Networks and Distributed Systems
Securing BGP Bruce Maggs.
Border Gateway Protocol
BGP (cont) 1. BGP Peering 2. BGP Attributes
Interdomain Routing (Nick Feamster).
COS 561: Advanced Computer Networks
BGP supplement Abhigyan Sharma.
Interdomain Traffic Engineering with BGP
Lixin Gao ECE Dept. UMASS, Amherst
Cours BGP-MPLS-IPV6-QOS
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Backbone Networks Mike Freedman COS 461: Computer Networks
BGP Policies Jennifer Rexford
Working at a Small-to-Medium Business or ISP – Chapter 6
COMP/ELEC 429/556 Introduction to Computer Networks
Securing BGP Bruce Maggs.
COS 561: Advanced Computer Networks
BGP Instability Jennifer Rexford
Computer Networks Protocols
Presentation transcript:

Border Gateway Protocol (BGP) (Bruce Maggs and Nick Feamster)

BGP Primer Autonomous System Number 128.2/16 1239 9 Sprint AT&T 1239 144.223/16 AT&T 7018 12/8 Block of IP addresses 128.2/16 9 CMU 9 128.2/16 AS Path bmm.pc.cs.cmu.edu 128.2.205.42

BGP Details AS that owns a prefix “originates” an advertisement with only it’s AS number on path AS advertises only its primary path to a prefix (the path it actually uses) to its neighbors Primary path for an IP address must be chosen from received advertisements with most specific (longest) prefix containing address, e.g., for 128.2.205.42, 128.2.205/24 is preferred over 128.2/16 Advertisement contains entire AS path to prevent cycles Router withdraws the advertisement if the path is no longer available

Problems with BGP Not secure – susceptible to route “hijacking” Routing policy determined primarily by economics, not performance Slow to converge (and not guaranteed) During convergence, endpoints can be disconnected even when valid routes exist

What Causes Transient Disconnection? Sprint AT&T Peter All of Hari’s providers use him to get to MIT BGP Rule: An AS advertises only its current forwarding path Hari Let’s start by taking a closer look at what actually causes the packetloss bgp during convergence <dramatic pause> To do this, let’s take a hypothetical example Now remember that since BGP is a path vector protocol, convergence happens separately for each destination - All of Hari’s providers Recall that BGP’s scalability stems from a simple rule, how BGP works: - Advertise only the best path - Don’t tell an alternate route to the AS through whom you’re routing Understand: - ASes - BGP never advertise a route to a guy through whom he’s using  Nobody offers Hari an alternate path MIT

What Causes Transient Disconnection? Sprint AT&T Peter Hari knows no path to MIT Hari drops Peter’s and AT&T’s packets in addition to his own Hari LOSS! X - hadn’t left cushy academic job because without an alternate path he’s forced to dropping packets Link Down MIT

What Causes Transient Disconnection? Hari withdraws path Sprint AT&T Peter AT&T and Peter move to alternate paths Hari X MIT

What Causes Transient Disconnection? Hari withdraws path Sprint AT&T Peter AT&T and Peter move to alternate paths AT&T announces the Sprint path to Hari  Traffic flows Hari X Transient Packet Loss MIT

Question: What’s the difference between IGP and iBGP? Two Flavors of BGP iBGP eBGP External BGP (eBGP): exchanging routes between ASes Internal BGP (iBGP): disseminating routes to external destinations among the routers within an AS Question: What’s the difference between IGP and iBGP?

Example BGP Routing Table The full routing table > show ip bgp Network Next Hop Metric LocPrf Weight Path *>i3.0.0.0 4.79.2.1 0 110 0 3356 701 703 80 i *>i4.0.0.0 4.79.2.1 0 110 0 3356 i *>i4.21.254.0/23 208.30.223.5 49 110 0 1239 1299 10355 10355 i * i4.23.84.0/22 208.30.223.5 112 110 0 1239 6461 20171 i > show ip bgp 130.207.7.237 BGP routing table entry for 130.207.0.0/16 Paths: (1 available, best #1, table Default-IP-Routing-Table) Not advertised to any peer 10578 11537 10490 2637 192.5.89.89 from 18.168.0.27 (66.250.252.45) Origin IGP, metric 0, localpref 150, valid, internal, best Community: 10578:700 11537:950 Last update: Sat Jan 14 04:45:09 2006 Specific entry. Can do longest prefix lookup: Prefix AS path Next-hop

Route Attributes and Route Selection BGP routes have the following attributes, on which the route selection process is based: Local preference: numerical value assigned by routing policy. Higher values are more preferred. AS path length: number of AS-level hops in the path Multiple exit discriminator (“MED”): allows one AS to specify that one exit point is more preferred than another. Lower values are more preferred. Shortest IGP path cost to next hop: implements “hot potato” routing Router ID tiebreak: arbitrary tiebreak, since only a single “best” route can be selected

Other BGP Attributes iBGP Next-hop: 192.5.89.89 Next-hop: 4.79.2.1 iBGP 192.5.89.89 4.79.2.2 4.79.2.1 Next-hop: IP address to send packets en route to destination. Question: How to ensure that the next-hop IP address is reachable? Either import external address (e.g., 4.79.2.1) into internal routing tables, or use next-hop-self neighbor command to advertise (in iBGP) own address, as shown Community value: Semantically meaningless. Used for passing around “signals” and labelling routes.

Local Preference Control over outbound traffic Higher local pref Primary Destination Backup Lower local pref Control over outbound traffic Not transitive across ASes Coarse hammer to implement route preference Useful for preferring routes from one AS over another (e.g., primary-backup semantics)

AS Path Length Traffic Destination Among routes with highest local preference, select route with shortest AS path length Shortest AS path != shortest path, for any interpretation of “shortest path”

AS Path Length Hack: Prepending Traffic AS 2 AS 3 AS Path: “1” AS Path: “1 1” AS 1 D Attempt to control inbound traffic Make AS path length look artificially longer How well does this work in practice vs. e.g., hacks on longest-prefix match?

Multiple Exit Discriminator (MED) Dest. Traffic San Francisco New York MED: 20 MED: 10 I Los Angeles Mechanism for AS to control how traffic enters, given multiple possible entry points.

Hot-Potato Routing Prefer route with shorter IGP path cost to next-hop Idea: traffic leaves AS as quickly as possible Dest. New York Atlanta Traffic Common practice: Set IGP weights in accordance with propagation delay (e.g., miles, etc.) 10 5 I Washington, DC

Internet Business Model (Simplified) Provider Preferences implemented with local preference manipulation Free to use Pay to use Example AS Peer Get paid to use Customer Destination Customer/Provider: One AS pays another for reachability to some set of destinations “Settlement-free” Peering: Bartering. Two ASes exchange routes with one another.

Filtering and Rankings Filtering: route advertisement Ranking: route selection Customer Primary Competitor Backup External filtering vs. internal dissemination (external vs. internal) What makes distributed configuration hard? Filtering: Who gets what Dissemination: how they get it (the path by which they get it) Ranking: what they get Not much else in terms of complicated side effects – Verifying distributed program’s correctness

Who owns a prefix? Organizations are granted prefixes of addresses, e.g., 128.2/16, by regional Internet registries ARIN, RIPE NCC, APNIC, AFRINIC, LACNIC Source: http://www.apnic.net/about-APNIC/organization/history-of-apnic/history-of-the-regional-internet-registries Organizations also separately register AS numbers, but no linkage between AS numbers and prefixes.

Route Hijacking Any network can advertise that it knows a path to any prefix! No way to check if the path is legitimate. Highly specific advertisements (e.g., 128.2.205/24) will attract traffic. To mitigate risk, network operators manually create filters to limit what sorts of advertisements they will trust from their peers.

Why Hijack Routes? Steal some IP addresses temporarily, send SPAM until the addresses are blacklisted. Create a sinkhole to divert traffic away from a Web site, making it unavailable. Eavesdrop on traffic but ultimately pass it along.

The AS 7007 Incident On April 25, 1997, AS 7007 (MAI Network Services) leaked its entire routing table with all prefixes broken down (probably due to a bug) to /24 with original AS paths stripped off to AS 1790 Sprint. After MAI turned off their router, Sprint kept advertising the routes! See http://www.merit.edu/mail.archives/nanog/1997-04/msg00444.html

The Business Game and Depeering Cooperative competition (brinksmanship) Much more desirable to have your peer’s customers Much nicer to get paid for transit Peering “tiffs” are relatively common 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 2005 9: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 Cogent’s singly homed customers could not reach each other. (~ 4% of the Internet’s prefixes were isolated from each other)

Depeering Continued Resolution… …but not before an attempt to steal customers! As of 5:30 am EDT, October 5th, Level(3) terminated peering with Cogent without cause (as permitted under its peering agreement with Cogent) even though both Cogent and Level(3) remained in full compliance with the previously existing interconnection agreement. Cogent has left the peering circuits open in the hope that Level(3) will change its mind and allow traffic to be exchanged between our networks. We are extending a special offering to single homed Level 3 customers. Cogent will offer any Level 3 customer, who is single homed to the Level 3 network on the date of this notice, one year of full Internet transit free of charge at the same bandwidth currently being supplied by Level 3. Cogent will provide this connectivity in over 1,000 locations throughout North America and Europe.

Policy Interactions 1 3 0 1 0 1 3 2 0 1 2 3 2 1 0 2 0 2 1 3 0 3 2 0 3 0 3 2 1 0 Jargon!! Remind us about filtering, ranking, and the high-level intuitive description of the property Start off describing what AS 1 does Put on varadhan et al. Varadhan, Govindan, & Estrin, “Persistent Route Oscillations in Interdomain Routing”, 1996

Customers, Providers, and Peers MajorNet GloboNet Peer Customer Provider RegioNet CountryNet MinorNet LocoNet

Valley Free Paths Zero or more customer-to-provider links MajorNet GloboNet RegioNet CountryNet MinorNet Zero or more customer-to-provider links Zero or one peer-to-peer link Zero or more provider-to-customer links LocoNet

Gao-Rexford Conditions Theorem: If there are no customer-provider cycles, and every AS prefers routes learned from its customers, and all advertised routes are valley free, then BGP is guaranteed to converge.