an introduction to interdomain routing and the border gateway protocol bgp n.
Skip this Video
Loading SlideShow in 5 Seconds..
An Introduction to Interdomain Routing and the Border Gateway Protocol (BGP) PowerPoint Presentation
Download Presentation
An Introduction to Interdomain Routing and the Border Gateway Protocol (BGP)

An Introduction to Interdomain Routing and the Border Gateway Protocol (BGP)

154 Views Download Presentation
Download Presentation

An Introduction to Interdomain Routing and the Border Gateway Protocol (BGP)

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. An Introduction to Interdomain Routing and the Border Gateway Protocol (BGP) Timothy G. Griffin AT&T Research ICNP PARIS November 12, 2002 ICNP 2002

  2. Outline • The Internet is implemented with a diverse set of physical networks • Relationships between Autonomous Routing Domains (ARDs) • BGP as a means of implementing and maintaining relationships between ARDs • BGP as means of implementing local optimizations (“Traffic Engineering”) • What Problem is BGP Solving anyway? • Current Internet Growth Trends • Selected References ICNP 2002

  3. In Memory of Abha Ahuja Photo by Peter Lothberg. NANOG memorial site: ICNP 2002

  4. PART I Physical Connectivity ICNP 2002

  5. Internet Initiative Japan (IIJ) ICNP 2002

  6. IIJ, Tokyo ICNP 2002

  7. Telstra international ICNP 2002

  8. WorldCom (UUNet) ICNP 2002

  9. UUNet, Europe ICNP 2002

  10. Sprint, USA ICNP 2002

  11. Manchester Birmingham LA-Airport Blvd San Antonio NX OC192 AT&T IP BackboneYear end 2001 Anchorage, AK Seattle Spokane Portland Worcester Portland Minneapolis R Albany St. Paul Syracuse Cambridge Glenview Rochester Milwaukee Wayne Hartford Framingham Madison Grand Rapids Providence R Providence Buffalo Stamford RollingMeadows R Bridgeport Detroit Harrisburg Des Moines New Brunswick NYC White Plains Oak Brook Salt LakeCity Cedar Knolls Plymouth Davenport Phil Pittsburgh Wash.DC R Sacramento Rochelle Pk Chicago R Cleveland San Francisco Akron R South Bend Hamilton Square Chicago Omaha R San Francisco Silver Springs Las Vegas Denver Columbus Newark Dayton Baltimore Freehold Kansas City Bohemia Indianapolis R R Arlington Cincinnati NYC- Bdwy Oakland R Florissant Norfolk Camden, NJ San Jose St Louis ColoradoSprings Louisville Richmond Redwood City R Raleigh Los Angeles Albuquerque Greensboro Nashville Sherman Oaks OklahomaCity Charlotte Tulsa SanBernardino Honolulu Little Rock Anaheim Memphis Columbia Birmingham Gardena Phoenix Norcross Dunwoody San Diego Gateway Node Atlanta Dallas Ft. Worth Backbone Node Jacksonville R Remote GSR Access Router New Orleans Austin Orlando Remote Access Router Houston R N X DS3 Tampa Note: Connectivity and nodes shown are targeted for deployment; actual deployment may vary. Maps should not be used to predict service availability. W. Palm Beach N X OC3 R Ft. Lauderdale Ojus Ft. Lauderdale N X OC12 Miami N X OC48 San Juan PR ICNP 2002 Rev. 6-4-01

  12. GARR-B ICNP 2002

  13. ICNP 2002

  14. GO BUCKY! ICNP 2002

  15. ICNP 2002

  16. Network Interconnections • Exchange Point • Layer 2 or Layer 3 • Private Circuit • May be provided by a third party ICNP 2002

  17. PART II Relationships Between Networks ICNP 2002

  18. Some Costs of Running an ISP • People • Physical connectivity and bandwidth • Hardware • Data center space and power • … ICNP 2002

  19. Ballpark Figures (In US $) • Hardware for an OC192 Pop: about 3,000,000. • Installation: 10,000 • Power: 20,000/month • OC192 link from NYC to D.C.: about 2,000,000/year • Gigabit Ethernet IP connectivity • For end user: 10,000/month • For ISP: 30,000/month Prices can vary widely. Thanks to Ben Black and Vijay Gill for hints. ICNP 2002

  20. Customers and Providers provider customer IP traffic provider customer Customer pays provider for access to the Internet ICNP 2002

  21. The “Peering” Relationship peer peer provider customer Peers provide transit between their respective customers Peers do not provide transit between peers Peers (often) do not exchange $$$ traffic allowed traffic NOT allowed ICNP 2002

  22. Peering Provides Shortcuts peer peer provider customer Peering also allows connectivity between the customers of “Tier 1” providers. ICNP 2002

  23. Peering Wars Reduces upstream transit costs Can increase end-to-end performance May be the only way to connect your customers to some part of the Internet (“Tier 1”) You would rather have customers Peers are usually your competition Peering relationships may require periodic renegotiation Peer Don’t Peer Peering struggles are by far the most contentious issues in the ISP world! Peering agreements are often confidential. ICNP 2002

  24. Routing vs. Forwarding Net Nxt Hop Forwarding always works Routing can be badly broken A B C D E default R1 Direct R3 R1 R3 R1 Default to upstream router B Net Nxt Hop R A B C D E default R2 R2 Direct R5 R5 R2 R2 A R R R1 R3 C R5 R4 Net Nxt Hop D E A B C D E default R4 R3 R3 R4 Direct R4 Forwarding: determine next hop Routing: establish end-to-end paths

  25. How Are Forwarding Tables Populated to implement Routing? Statically Dynamically Administrator manually configures forwarding table entries Routers exchange network reachability information using ROUTING PROTOCOLS. Routers use this to compute best routes + More control + Not restricted to destination-based forwarding - Doesn’t scale - Slow to adapt to network failures + Can rapidly adapt to changes in network topology + Can be made to scale well - Complex distributed algorithms - Consume CPU, Bandwidth, Memory - Debugging can be difficult - Current protocols are destination-based In practice : a mix of these. Static routing mostly at the “edge”

  26. Architecture of Dynamic Routing OSPF BGP AS 1 EIGRP IGP = Interior Gateway Protocol Metric based: OSPF, IS-IS, RIP, EIGRP (cisco) AS 2 EGP = Exterior Gateway Protocol Policy based: BGP The Routing Domain of BGP is the entire Internet ICNP 2002

  27. Topology information is flooded within the routing domain Best end-to-end paths are computed locally at each router. Best end-to-end paths determine next-hops. Based on minimizing some notion of distance Works only if policy is shared and uniform Examples: OSPF, IS-IS Each router knows little about network topology Only best next-hops are chosen by each router for each destination network. Best end-to-end paths result from composition of all next-hop choices Does not require any notion of distance Does not require uniform policies at all routers Examples: RIP, BGP Technology of Distributed Routing Link State Vectoring ICNP 2002

  28. The Gang of Four Link State Vectoring OSPF RIP IGP IS-IS BGP EGP ICNP 2002

  29. Routers Talking to Routers Routing info Routing info • Routing computation is distributed among routers within a routing domain • Computation of best next hop based on routing information is the most CPU/memory intensive task on a router • Routing messages are usually not routed, but exchanged via layer 2 between physically adjacent routers (internal BGP and multi-hop external BGP are exceptions) ICNP 2002

  30. Autonomous Routing Domains (ARDs) A collection of physical networks glued together using IP, that have a unified administrative routing policy. • Campus networks • Corporate networks • ISP Internal networks • … ICNP 2002

  31. Autonomous Systems (ASes) … the administration of an AS appears to other ASes to have a single coherent interior routing plan and presents a consistent picture of what networks are reachable through it. RFC 1930: Guidelines for creation, selection, and registration of an Autonomous System An autonomous system is an autonomous routing domain that has been assigned an Autonomous System Number (ASN). ICNP 2002

  32. AS Numbers (ASNs) ASNs are 16 bit values. 64512 through 65535 are “private” Currently over 11,000 in use. • Genuity (f.k.a. BBN): 1 • MIT: 3 • Harvard: 11 • UC San Diego: 7377 • AT&T: 7018, 6341, 5074, … • UUNET: 701, 702, 284, 12199, … • Sprint: 1239, 1240, 6211, 6242, … • … ASNs represent units of routing policy ICNP 2002

  33. AS Graphs Can Be Fun Part of Worldcom’s Global ARD AT&T North America The subgraph showing all ASes that have more than 100 neighbors in full graph of 11,158 nodes. July 6, 2001. Point of view: AT&T route-server ICNP 2002

  34. AS Graph != Internet Topology The AS graph may look like this. Reality may be closer to this… BGP was designed to throw away information! ICNP 2002

  35. Autonomous Routing Domains Don’t Always Need BGP or an ASN Qwest Nail up routes pointing to Yale Nail up default routes pointing to Qwest Yale University Static routing is the most common way of connecting an autonomous routing domain to the Internet. This helps explain why BGP is a mystery to many … ICNP 2002

  36. ASNs Can Be “Shared” (RFC 2270) AS 701 UUNet AS 7046 Crestar Bank AS 7046 NJIT AS 7046 Hood College ASN 7046 is assigned to UUNet. It is used by Customers single homed to UUNet, but needing BGP for some reason (load balancing, etc..) [RFC 2270] ICNP 2002

  37. A Bit of OGI’s AS Neighborhood AS 2914 Verio AS 101 U of Washington AS 6366 Portland State U AS 11995 Oregon Health Sciences U AS 3356 Level 3 AS 3356 Level 3 AS 7774 U of Alaska AS 3807 U of Montana AS 1239 Sprint AS 7018 AT&T AS 14262 Portland Regional Education Network AS 11964 OGI Sources: ARIN, Route Views, RIPE ICNP 2002

  38. A Bit of U Oregon’s AS Neighborhood AS 3701 Oregon Joint Graduate Schools Of Engineering AS 4600 U Oregon AS 11537 U Corp for Advanced Internet Development AS 293 ESN AS 2914 Verio AS 701 UUNET AS 1239 Sprint AS 3582 U Oregon Sources: ARIN, Route Views, RIPE ICNP 2002

  39. Partial View of Neighborhood AS 3549 Global Crossing AS 209 Qwest AS 1 Genuity AS 2381 WiscNet AS 59 UW Academic Computing AS 3136 UW Madison AS 7050 UW Milwaukee ICNP 2002

  40. ARD != AS • Most ARDs have no ASN (statically routed at Internet edge) • Some unrelated ARDs share the same ASN (RFC 2270) • Some ARDs are implemented with multiple ASNs (example: Worldcom) ASes are an implementation detail of Interdomain routing ICNP 2002

  41. PART III Implementing Inter-Network Relationships with BGP ICNP 2002

  42. BGP-4 • BGP = Border Gateway Protocol • Is a Policy-Based routing protocol • Is the de facto EGP of today’s global Internet • Relatively simple protocol, but configuration is complex and the entire world can see, and be impacted by, your mistakes. • 1989 : BGP-1 [RFC 1105] • Replacement for EGP (1984, RFC 904) • 1990 : BGP-2 [RFC 1163] • 1991 : BGP-3 [RFC 1267] • 1995 : BGP-4 [RFC 1771] • Support for Classless Interdomain Routing (CIDR)

  43. BGP Operations (Simplified) Establish session on TCP port 179 AS1 BGP session Exchange all active routes AS2 While connection is ALIVE exchange route UPDATE messages Exchange incremental updates

  44. Two Types of BGP Neighbor Relationships • External Neighbor (eBGP) in a different Autonomous Systems • Internal Neighbor (iBGP) in the same Autonomous System AS1 iBGP is routed (using IGP!) eBGP iBGP AS2

  45. iBGP Mesh Does Not Scale iBGP updates eBGP update • N border routers means N(N-1)/2 peering sessions • Each router must have N-1 iBGP sessions configured • The addition a single iBGP speaker requires configuration changes to all other iBGP speakers • Size of iBGP routing table can be order N larger than number of best routes (remember alternate routes!) • Each router has to listen to update noise from each neighbor • Currently four solutions: • (0) Buy bigger routers! • Break AS into smaller ASes • BGP Route reflectors • BGP confederations

  46. Route Reflectors • Route reflectors can pass on iBGP updates to clients • Each RR passes along ONLY best routes • ORIGINATOR_ID and CLUSTER_LIST attributes are needed to avoid loops RR RR RR

  47. BGP Confederations AS 65502 AS 65504 AS 65503 AS 65500 AS 1 AS 65501 From the outside, this looks like AS 1 Confederation eBGP (between member ASes) preserves LOCAL_PREF, MED, and BGP NEXTHOP. ICNP 2002

  48. Four Types of BGP Messages • Open : Establish a peering session. • Keep Alive : Handshake at regular intervals. • Notification : Shuts down a peering session. • Update : Announcing new routes or withdrawing previously announced routes. announcement = prefix + attributes values

  49. BGP Attributes Value Code Reference ----- --------------------------------- --------- 1 ORIGIN [RFC1771] 2 AS_PATH [RFC1771] 3 NEXT_HOP [RFC1771] 4 MULTI_EXIT_DISC [RFC1771] 5 LOCAL_PREF [RFC1771] 6 ATOMIC_AGGREGATE [RFC1771] 7 AGGREGATOR [RFC1771] 8 COMMUNITY [RFC1997] 9 ORIGINATOR_ID [RFC2796] 10 CLUSTER_LIST [RFC2796] 11 DPA [Chen] 12 ADVERTISER [RFC1863] 13 RCID_PATH / CLUSTER_ID [RFC1863] 14 MP_REACH_NLRI [RFC2283] 15 MP_UNREACH_NLRI [RFC2283] 16 EXTENDED COMMUNITIES [Rosen] ... 255 reserved for development Most important attributes Not all attributes need to be present in every announcement From IANA: ICNP 2002

  50. Attributes are Used to Select Best Routes pick me! pick me! pick me! Given multiple routes to the same prefix, a BGP speaker must pick at most one best route (Note: it could reject them all!) pick me! ICNP 2002