CSE 461 Interdomain routing. David Wetherall

Similar documents
CSE/EE 461 Lecture 11. Inter-domain Routing. This Lecture. Structure of the Internet. Focus How do we make routing scale?

CSC458 Lecture 6. Administrivia. Inter-domain Routing IP Addressing. Midterm will Cover Following Topics (2) Midterm will Cover Following Topics

Most important (cont d) What s most important in Project 1. Important for individuals. From from Most Important

Overview 4.2: Routing

IP Addressing & Interdomain Routing. Next Topic

Interdomain routing CSCI 466: Networks Keith Vertanen Fall 2011

Routing. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing

Routing. Outline. Algorithms Scalability

Routing in Internet. Problem. Given set of nodes, how do routers acquire info about neighbors to construct the routing tables?

Lecture 16: Interdomain Routing. CSE 123: Computer Networks Stefan Savage

Inter-domain Routing. Outline. Border Gateway Protocol

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley

CSCD 433/533 Advanced Networks Spring 2016

Interdomain Routing Reading: Sections P&D 4.3.{3,4}

CS 457 Networking and the Internet. The Global Internet (Then) The Global Internet (And Now) 10/4/16. Fall 2016

Routing on the Internet. Routing on the Internet. Hierarchical Routing. Computer Networks. Lecture 17: Inter-domain Routing and BGP

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella

Routing. Jens A Andersson Communication Systems

Interdomain Routing Reading: Sections K&R EE122: Intro to Communication Networks Fall 2007 (WF 4:00-5:30 in Cory 277)

CSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca

Network Layer (Routing)

Lecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011

Routing Unicast routing protocols

EECS 122, Lecture 17. The Distributed Update Algorithm (DUAL) Optimization Criteria. DUAL Data Structures. Selecting Among Neighbors.

COMP/ELEC 429 Introduction to Computer Networks

Inter-Domain Routing: BGP

CS4700/CS5700 Fundamentals of Computer Networks

CSCD 433/533 Network Programming Fall Lecture 14 Global Address Space Autonomous Systems, BGP Protocol Routing

Inter-Domain Routing: BGP

CS 204: BGP. Jiasi Chen Lectures: MWF 12:10-1pm Humanities and Social Sciences

Inter-Domain Routing: BGP

Link State Routing & Inter-Domain Routing

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017

Internet inter-as routing: BGP

Internet Routing : Fundamentals of Computer Networks Bill Nace

BGP. Autonomous system (AS) BGP version 4

BGP. Autonomous system (AS) BGP version 4

SCALABLE INTERNET ROUTING

Other Developments: CIDR

CSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca

internet technologies and standards

This appendix contains supplementary Border Gateway Protocol (BGP) information and covers the following topics:

Computer Networking Introduction

CSE 561 Lecture 6, Spring David Wetherall

Introduction. Keith Barker, CCIE #6783. YouTube - Keith6783.

BGP. Autonomous system (AS) BGP version 4

Dynamics of Hot-Potato Routing in IP Networks

Lecture 19: Network Layer Routing in the Internet

CSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013

CS4450. Computer Networks: Architecture and Protocols. Lecture 15 BGP. Spring 2018 Rachit Agarwal

PART III. Implementing Inter-Network Relationships with BGP

Master Course Computer Networks IN2097

EE 122: Inter-domain routing Border Gateway Protocol (BGP)

Outline Computer Networking. Inter and Intra-Domain Routing. Internet s Area Hierarchy Routing hierarchy. Internet structure

Planning for Information Network

Inter-AS routing and BGP. Network Layer 4-1

BGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)

CS BGP v4. Fall 2014

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...

CS321: Computer Networks Unicast Routing

Routing in the Internet

Lecture 18: Border Gateway Protocol

Introduction to exterior routing. Autonomous Systems

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCI Topics: Internet Programming Fall 2008

Chapter 4: outline. Network Layer 4-1

Top-Down Network Design

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala October 9, 2018 (a) October 18 October 9,

How the Internet works? The Border Gateway Protocol (BGP)

Topic. How rou=ng protocols work with IP. The Host/Router dis=nc=on. I don t! I route. CSE 461 University of Washington 1

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:

Inter-Autonomous-System Routing: Border Gateway Protocol

Configuring BGP. Cisco s BGP Implementation

Basic Idea. Routing. Example. Routing by the Network

Internetworking Terms. Internet Structure. Internet Structure. Chapter 15&16 Internetworking. Internetwork Structure & Terms

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University

Unit 3: Dynamic Routing

Chapter 4: Network Layer

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Interdomain Routing. EE122 Fall 2011 Scott Shenker

Routing by the Network

CSc 450/550 Computer Networks Internet Routing

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

TELE 301 Network Management

Lecture 17: Border Gateway Protocol

Unicast Routing. TCP/IP class

Internetworking Part 2

BGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1

Border Gateway Protocol (an introduction) Karst Koymans. Monday, March 10, 2014

Inter-Autonomous-System Routing: Border Gateway Protocol

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)

Internetworking: Global Internet and MPLS. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806

Master Course Computer Networks IN2097

Why dynamic route? (1)

Interdomain Routing. EE122 Fall 2012 Scott Shenker

Transcription:

CSE 461 Interdomain routing David Wetherall djw@cs.washington.edu

Interdomain routing Focus: Routing across internetworks made up of different parties Route scaling Application Route policy Transport The protocol: BGP Network Link Physical djw // CSE 461, Autumn 2011 2

Two key problems beyond intradomain i Scale Size of routing tables, computation, messages All grow with the size of the network Policy Different parties with different goals make different decisions ISPs are out to make money (locally good paths), not save the world (global shortest path) djw // CSE 461, Autumn 2011 3

Problem: Core BGP Table Growth 1994-2010 Growth of the BGP routing table kept at ISP routers Size roughly indicates routing/forwarding workload www.cidr-report.org djw // CSE 461, Autumn 2011 4

For context: t reachable Internet t hosts djw // CSE 461, Autumn 2011 5

Problem: Independent d decisions i Multiple parties can greatly influence the routes chosen Example: Early Exit / Hot Potato if it s not for you, get rid of it Combination of best local policies is not globally best A B Side-effect: route asymmetry djw // CSE 461, Autumn 2011 6

Solutions? Scale solution Standard approach of information hiding In the forms of IP prefixes and ASes Policy solution No great solutions here! Let everyone make their own decisions to the extent possible Economic model gives rise to common commercial policies, e.g, transit vs peering djw // CSE 461, Autumn 2011 7

Preliminaries i i Basic issue is how much information is required to effect routing To scale, we want to be able to control it, at the least Me Info to compute next hop for all destinations Info so others can find me Aggregation: reduce amount others need to know Hierarchy: reduce the amount that I need to know djw // CSE 461, Autumn 2011 m9.8

Scaling with IP prefixes Route to blocks of addresses called prefixes Written as IP prefix x.x.x.x/length for 2 (32-length) addresses Replaces old fixed blocks of lengths 8, 16 and 24 Only store one entry for a prefix in the routing table djw // CSE 461, Autumn 2011 9

Old-style IP Address Classes 0 net host Class A 10 net host Class B 110 net host Class C Network mask defined as part of the address Three sizes, class A, B and C, for different size networks. Now Classless Interdomain Routing (CIDR) [previous] Adds flexibility; network mask is carried in the routing protocol Internet routes are to variable length prefixes, e.g., MIT = 18.0.0.0/8 Also notion of subnet Mask used dto decide if host tis on a network djw // CSE 461, Autumn 2011 Linternet.10

IP address assignment is hierarchical IANA owns everything, assigns blocks to Regional Internet Registries (RIR), who assign to ISPs/users e.g., ARIN = American Registry for Internet Numbers) http://www.arin.net/statistics/index.html djw // CSE 461, Autumn 2011 m9.11

Example (cont.) djw // CSE 461, Autumn 2011 m9.12

IP Forwarding -- Longest Matching Prefix Destination Gateway Default (0/0) 192.168.1.1 192.168.1.0/24 Link #4 My PC s routing table (netstat r) Can t tell from an address which prefix it belongs to, so match on the longest prefix for forwarding Routers in the Internet may have 100s of 1000s of prefixes Example: Send a packet to my printer (192.168.1.254) Send a packet to cnn (157.166.224.25) 166 25) djw // CSE 461, Autumn 2011 Linternet.13

Subnetting Can internally divide a prefix Better manageability and efficient allocation Internal, 3 prefixes External, 1 prefix djw // CSE 461, Autumn 2011 14

Aggregation (CIDR, supernetting) Can externally combine prefixes Same mechanism, different goal -- smaller routing tables Would reduce table size by up to 40% if use was widespread! External, 1 prefix Internal to ISP, 3 prefixes djw // CSE 461, Autumn 2011 15

Oi Original i lstructure t of fthe Internet t Like address assignment: hierarchical Stanford NSFNET backbone ISU Berkeley BARRNET regional PARC NCAR Westnet regional UNM UNL MidNet regional KU UA What s s wrong with this? djw // CSE 461, Autumn 2011 m9.16

Current Structuret Inter-domain versus intra-domain routing You at work Large corporation Multihomed AS Consumer ISP Peering point Backbone service provider Consumer ISP Transit AS Large corporation Consumer ISP Peering point Small corporation You at home Stub AS djw // CSE 461, Autumn 2011 m9.17

Scaling with ASes Network comprised of many Autonomous Systems (ASes) or domains 23 To scale, use hierarchy to separate inter-domain (BGP) and intra- domain (OSPF) routing 12 7 44 321 1123 [Incomplete-- one step to BGP] 1123 djw // CSE 461, Autumn 2011 18

Path Vectors Similar to distance vector, except send entire paths e.g. 321 hears [7,12,44] stronger avoidance of loops supports policies (later) Modulo policy, shorter paths are chosen in preference to longer ones Reachability only no metrics 23 12 7 44 321 1123 djw // CSE 461, Autumn 2011 Linterdomain.19

An Ironic Twist on Convergence Recently, it was realized that BGP convergence can undergo a process analogous to count-to-infinity! Prefix P In AS X View from here X 1 2 4 3 AS 4 uses path 4 1 X. A link fails and 1 withdraws 4 1 X. So 4 uses 4 2 1 X, which is soon withdrawn, then 4 3 2 1 X, Result is many invalid paths can be explored before convergence djw // CSE 461, Autumn 2011 Linterdomain.20

Applying Hierarchy to ASes We ve already seen an example: host gateways Hosts Router 128.208.2.2208 2 2 0/0 is me 128.208.2.5 Internet 128.208.2.3 128.208.2/24 is local 0/0 is djw // CSE 461, Autumn 2011 m9.21

Generalizing: i Routing Areas Routers within an area (only) exchange full link state information Limit cost of link state traffic / computation (Different areas could have different cost metrics) Area border routers (ABRs) summarize area to other ABRs ABRs summarize rest of world to an area (Areas can have more than one ABR.) djw // CSE 461, Autumn 2011 m9.22

Inter-Domain Routing Border routers summarize and advertise internal routes to external neighbors and vice-versa Border routers apply policy Internal routers can use notion of default routes Core is default-free ; free routers must have a route to all networks in the world AS1 Border router Border router AS2 djw // CSE 461, Autumn 2011 m9.23

BGP Interdomain routing protocol of the Internet Each has tells other ASes the paths it is offering Paths are summaries to prefixes via the sequence of ASes No detailed paths of cost metrics to particular IPs This happens at each border router of the AS Each AS picks the paths it wants to use to send traffic Default rule: prefer shortest AS path, then shortest internal path But selection heavily customized by ISPs This happens at each border router of the AS djw // CSE 461, Autumn 2011 24

BGP djw // CSE 461, Autumn 2011 25

Policies i Each ISP decides which routes to advertise, which to use Choice of routes may depend on owner, cost, AUP, Example: providers sell Transit to their customers Customer announces their prefixes to provider for the rest of the Internet to reach them; Provider announces all other prefixes to customer for them to reach the rest of the Internet Example: parties Peer for mutual benefit Peers announce path to their customer s prefixes to each other but do not propagate announcements further djw // CSE 461, Autumn 2011 26

Policies i Q: What routing do A, B, and C need to do? djw // CSE 461, Autumn 2011 27

Multi-Homing i Connect to multiple providers for reliability, load sharing Provider Cust Provider Choose the best outgoing path to P out of any of the announcements to P that we hear from our providers Easy to control outgoing g traffic, e.g, for load balancing Advertise the possible routes to P to our providers Less control over what paths other parties will use to reach us djw // CSE 461, Autumn 2011 Linterdomain.28

Bogons djw // CSE 461, Autumn 2011 m9.29

Prefix Hijacking http://arstechnica.com/old/content/2008/02/insecure-routing-redirects- routing redirects youtube-to-pakistan.ars Insecure routing redirects YouTube to Pakistan By Iljitsch van Beijnum Last updated February 25, 2008 3:31 AM On Sunday, YouTube became unreachable from most, if not all, of the Internet. No "sorry we're down" or cutesy kitten-with-screwdriver page, nothing. What happened was that packets sent to YouTube were flowing to Pakistan. Which was curious, because the Pakistan government had just instituted a ban on the popular video sharing site. What apparently happened is that Pakistan Telecom routed the address block that YouTube's servers are into a "black hole" as a simple measure to filter access to the service. However, this routing information escaped from Pakistan Telecom to its ISP PCCW in Hong Kong, which propagated the route to the rest of the world In the case of YouTube and Pakistan Telecom, YouTube injected the address block 208.65.152.0/22 (208.65.152.0-208.65.155.255) in the Internet's routing tables, while Pakistan Telecom advertised the 208.65.153.0/24 (208.65.153.0-208.65.153.255) block. So even though YouTube's routing information was still there, packets would flow towards Pakistan Telecom because of the longest match first rule. djw // CSE 461, Autumn 2011 m9.30

Prefix Hijacking http://news.cnet.com/8301-10784_3-9878655-7.html /8301 10784 3 7h djw // CSE 461, Autumn 2011 m9.31