IP Addressing & Interdomain Routing. Next Topic

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

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

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

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

Lecture 18: Border Gateway Protocol

Lecture 17: Border Gateway Protocol

Department of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri

Interdomain routing CSCI 466: Networks Keith Vertanen Fall 2011

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

COMP/ELEC 429 Introduction to Computer Networks

CS4700/CS5700 Fundamentals of Computer Networks

Inter-Domain Routing: BGP

Routing. Jens A Andersson Communication Systems

Internet Routing : Fundamentals of Computer Networks Bill Nace

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

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

Routing Unicast routing protocols

CSc 450/550 Computer Networks Internet Routing

Professor Yashar Ganjali Department of Computer Science University of Toronto.

Computer Networking Introduction

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

Inter-domain Routing. Outline. Border Gateway Protocol

CSE 461 Interdomain routing. David Wetherall

Chapter 4: outline. Network Layer 4-1

Routing in the Internet

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

Chapter 4: Network Layer

Internet inter-as routing: BGP

CSCI Topics: Internet Programming Fall 2008

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

Chapter IV: Network Layer

PART III. Implementing Inter-Network Relationships with BGP

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

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

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

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

! Distance vector routing! Link state routing.! Path vector routing! BGP: Border Gateway Protocol! Route aggregation

Internet Routing Protocols Lecture 01 & 02

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

DATA COMMUNICATOIN NETWORKING

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

Routing part 2. Electrical and Information Technology

Lecture 16: Border Gateway Protocol

Master Course Computer Networks IN2097

Topics for This Week

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

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

Basic Idea. Routing. Example. Routing by the Network

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

Routing(2) Inter-domain Routing

Routing by the Network

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

Routing(2) Inter-domain Routing

Internetworking Part 2

Chapter 4: Network Layer, partb

Inter-Domain Routing: BGP

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

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Routing(2) Inter-domain Routing

CSCD 433/533 Advanced Networks Spring 2016

CS555, Spring /5/2005. April 12, 2005 No classes attend Senior Design Projects conference. Chapter 4 roadmap. Internet AS Hierarchy

HY 335 Φροντιστήριο 8 ο

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

INTERDOMAIN ROUTING POLICY

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

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSC 4900 Computer Networks: Routing Protocols

Routing. Info 341 Networking and Distributed Applications. Addresses, fragmentation, reassembly. end-to-end communication UDP, TCP

Configuring BGP. Cisco s BGP Implementation

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

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

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

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

Routing Protocols. Autonomous System (AS)

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

Internet Routing Protocols Lecture 03 Inter-domain Routing

Interplay Between Routing, Forwarding

Next Lecture: Interdomain Routing : Computer Networking. Outline. Routing Hierarchies BGP

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

Finish Network Layer Start Transport Layer. CS158a Chris Pollett Apr 25, 2007.

Master Course Computer Networks IN2097

Inter-Autonomous-System Routing: Border Gateway Protocol

CS 268: Computer Networking. Next Lecture: Interdomain Routing

Routing on the Internet! Hierarchical Routing! The NSFNet 1989! Aggregate routers into regions of autonomous systems (AS)!

Why dynamic route? (1)

Lecture 17: Router Design

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

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

Lecture 19: Network Layer Routing in the Internet

Routing Concepts. IPv4 Routing Forwarding Some definitions Policy options Routing Protocols

Inter-Autonomous-System Routing: Border Gateway Protocol

Other Developments: CIDR

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1

Chapter 7: Routing Dynamically. Routing & Switching

Planning for Information Network

Chapter 4: Advanced Internetworking. Networking CS 3470, Section 1

Introduction to Routing

Internet Routing Protocols, DHCP, and NAT

internet technologies and standards

Network Layer: Routing

Transcription:

IP Addressing & Interdomain Routing Next Topic IP Addressing Hierarchy (prefixes, class A, B, C, subnets) Interdomain routing Application Presentation Session Transport Network Data Link Physical

Scalability Concerns Routing burden grows with size of an inter-network Size of routing tables Volume of routing messages Amount of routing computation To scale to the size of the Internet, apply: Hierarchical addressing Route aggregation IP Addresses Reflect location in topology; used for scalable routing Unlike flat Ethernet addresses Interfaces on same network share prefix Prefix administratively assigned (IANA or ISP) Addresses globally unique Routing only advertises entire networks by prefix Local delivery in a single network doesn t involve router

Getting an IP address Old fashioned way: sysadmin configured each machine Dynamic Host Configuration Protocol (DHCP) One DHCP server with the bootstrap info Host address, gateway address, subnet mask, Find it using broadcast Addresses may be leased; renew periodically Stateless Autoconfiguration (in IPv6) Get rid of server reuse Ethernet addresses for lower portion of address (uniqueness) and learn higher portion from routers IPv4 Address Formats Class A 0 7 24 Network Host Class B 1 0 14 16 Network Host Class C 1 1 0 21 8 Network Host 32 bits written in dotted quad notation, e.g., 18.31.0.135

IPv6 Address Format 001 RegistryID ProviderID SubscriberID SubnetID InterfaceID 128 bits written in 16 bit hexadecimal chunks Still hierarchical, just more levels Updated Forwarding Routine Used to be look up destination address for next hop Now addresses have network and host portions: Source host: if destination network is the same as the host network, then deliver locally (without router) Otherwise send to the router Intermediate router: look up destination network in routing table to find next hop and send to next router. If destination network is directly attached then deliver locally. (Note that it will get a little more complicated later)

Subnetting More Hierarchy Split up one network number into multiple physical networks Helps allocation efficiency -- can hand out subnets Network number Class B address Host number Rest of internet does not see subnet structure subnet is purely internal to network aggregates routing info Network number Subnet ID Subnetted address Host ID Subnet Example 128.96.34.15 H1 R1 Subnet mask: 255.255.255.128 Subnet number: 128.96.34.0 128.96.34.1 128.96.34.130 Subnet mask: 255.255.255.128 Subnet number: 128.96.34.128 H3 128.96.33.14 128.96.34.129 R2 128.96.33.1 H2 128.96.34.139 Subnet mask: 255.255.255.0 Subnet number: 128.96.33.0

CIDR (Supernetting) CIDR = Classless Inter-Domain Routing Generalize class A, B, C into prefixes of arbitrary length; now must carry prefix length with address Aggregate adjacent advertised network routes e.g., ISP has class C addresses 192.4.16 through 192.4.31 Really like one larger 20 bit address class Advertise as such (network number, prefix length) Reduces size of routing tables But IP forwarding is more involved Based on Longest Matching Prefix operation CIDR Example X and Y routes can be aggregated because they form a bigger contiguous range. Corporation X (11000 00000 00010 00001) /20 Border gateway (advertises path to 11000 00000 00010 0000) /19 Regional network But aggregation isn t always possible. can only aggregate power of 2 Corporation Y (11000 00000 00010 00000) /20

IP Forwarding Revisited Routing table now contains routes to prefixes IP address and length indicating what bits are fixed Now need to search routing table for longest matching prefix, only at routers Search routing table for the prefix that the destination belongs to, and use that to forward as before There can be multiple matches; take the longest prefix This is the IP forwarding routine used at routers. Structure of the Internet Inter-domain versus intra-domain routing You at work Large corporation Peering point Consumer ISP Backbone service provider Consumer ISP Peering point Large corporation Consumer ISP Small corporation You at home

Inter-Domain Routing Network comprised of many Autonomous Systems (ASes) or domains To scale, use hierarchy: separate inter-domain and intra-domain routing Also called interior vs exterior gateway protocols (IGP/EGP) IGP = RIP, OSPF EGP = EGP, BGP 44 12 23 1123 7 321 Inter-Domain Routing Border routers summarize and advertise internal routes to external neighbors and viceversa Border routers apply policy Internal routers can use notion of default routes Core is default-free ; routers must have a route to all networks in the world AS1 R1 R3 R2 Autonomous system 1 Border router R4 Autonomous system 2 Border router R5 R6 AS2

Hierarchical Routing May Pay a Price for Path Quality AS 4 AS 3 AS 2 AS 1 Many Routing Processes Can Run on a Single Router BGP RIP process RIP routing table OSPF process OSPF Routing table BGP process BGP routing table RIP domain OSPF domain Forwarding Table Manager OS kernel Forwarding Table

Border Gateway Protocol (BGP-4) Features: Path vector routing Application of policy Operates over reliable transport (TCP) Uses route aggregation (CIDR) Internet Interdomain Routing: BGP BGP (Border Gateway Protocol): the de facto standard Path Vector protocol: similar to Distance Vector protocol a border gateway sends to a neighbor entire path (i.e., a sequence of ASes) to a destination, e.g., gateway X sends to neighbor N its path to dest. Z: path (X,Z) = X,Y1,Y2,Y3,,Z if N selects path(x, Z) advertised by X, then: path (N,Z) = N, path (X,Z) N X Z Question: what are the implications of path vector?

BGP Routing Decision Process route selection policy: rank paths routing cache select best path export path to neighbors export policy: which paths to export to which neighbors BGP Operations (Simplified) Establish session on TCP port 179 AS1 Exchange all active routes BGP session AS2 Exchange incremental updates while (connection is ALIVE) exchange UPDATE message select best available route if route changes, export to neigh.

BGP Messages Four types of messages OPEN: opens TCP connection to peer and authenticates sender UPDATE: advertises new path (or withdraws old) KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN request NOTIFICATION: used to close connection Internet Routing Architecture Divided into Autonomous Systems Distinct regions of administrative control Routers/links managed by a single institution Service provider, company, university, Hierarchy of Autonomous Systems Large, tier-1 provider with a nationwide backbone Medium-sized regional provider with smaller backbone Small network run by a single company or university Interaction between Autonomous Systems Internal topology is not shared between ASes but, neighboring ASes interact to coordinate routing

Autonomous System Numbers AS Numbers are 16 bit values. Currently just over 20,000 in use. Level 3: 1 MIT: 3 Washington AS: 73 Princeton: 88 AT&T: 7018, 6341, 5074, UUNET: 701, 702, 284, 12199, Sprint: 1239, 1240, 6211, 6242, AS Topology Node: Autonomous System Edge: Two ASes that connect to each other 4 3 5 2 7 6 1

What is an Edge, Really? Edge in the AS graph At least one connection between two ASes Some destinations reached from one AS via the other d AS 1 d AS 1 Exchange Point AS 2 AS 2 AS 3 Path: 6, 5, 4, 3, 2, 1 Interdomain Paths 3 4 5 2 7 6 1 Client Web server

Business Relationships Neighboring ASes have business contracts How much traffic to carry Which destinations to reach How much money to pay Common business relationships Customer-provider E.g., UW is a customer of NTT E.g., MIT is a customer of Level 3 Peer-peer E.g., AT&T is a peer of Sprint Customer-Provider Relationship Customer needs to be reachable from everyone Provider tells all neighbors how to reach the customer Customer does not want to provide transit service Customer does not let its providers route through it Traffic to the customer Traffic from the customer advertisements provider d provider traffic d customer customer

Customer Connecting to a Provider Provider Provider 1 access link 2 access links Provider Provider 2 access routers 2 access PoPs Multi-Homing: Two or More Providers Motivations for multi-homing Extra reliability, survive single ISP failure Financial leverage through competition Better performance by selecting better path Gaming the 95 th -percentile billing model Provider 1 Provider 2

Example Internet: customer of AT&T and RegionalAS Research universities/labs: customer of Internet2 AT&T RegionalAS Internet2 Peer-Peer Relationship Peers exchange traffic between customers AS exports only customer routes to a peer AS exports a peer s routes only to its customers Often the relationship is settlement-free (i.e., no $$$) Traffic to/from the peer and its customers advertisements peer traffic peer d

Implication of Business Relationship on Policies Route selection (ranking) policy: the typical route selection policy is to prefer customers over peers/providers to reach a destination, i.e., Customer > Peer > Provider Route export policy: since the export of a path to a neighbor is an indication that the AS is willing to transport traffic for the neighbor, an AS may not export routes to all neighbors Typical Export Policies case 1: routes learned from customer customer provider customer routes learned from a customer are sent to all other neighbors peer case 2: routes learned from provider provider provider customer case 3: routes learned from peer provider peer customer routes learned from a provider are sent only to customers peer routes learned from a peer are sent only to customers peer

Example Export Policy: No-Valley Routing P 1 P 2 A advertises path to C, but not P 2 A learns paths to C, P1, P2 A A advertises path to C, but not P 1 A advertises to C paths to P 1 and P 2 C IP traffic Suppose P 1 and P 2 are providers of A; A is a provider of C AS Structure: Tier-1 Providers Tier-1 provider Has no upstream provider of its own Typically has a national or international backbone UUNET, Sprint, AT&T, Level 3, Top of the Internet hierarchy of 9-15 ASes Full peer-peer connections between tier-1 providers

Efficient Early-Exit Routing Customer B Diverse peering locations Provider B Comparable capacity at all peering points Can handle even load Consistent routes multiple peering points Early-exit routing Same destinations advertised at all points Same AS path length for a destination at all points Provider A Customer A AS Structure: Other ASes Tier-2 and Tier-3 providers Provide transit service to downstream customers but, need at least one provider of their own Typically have national or regional scope E.g., Minnesota Regional Network Includes a few thousand of the Ases Stub ASes Do not provide transit service to others Connect to one or more upstream providers Includes vast majority (e.g., 85-90%) of the ASes

Characteristics of the AS Graph CCDF AS graph structure High variability in node degree ( power law ) A few very highly-connected ASes Many ASes have only a few connections 1 All ASes have 1 or more neighbors 0.1 0.01 Very few have degree >= 100 0.001 1 10 100 1000 AS degree Characteristics of AS Paths AS path may be longer than shortest AS path Router path may be longer than shortest path 2 AS hops, 8 router hops s d 3 AS hops, 7 router hops

Shared Risks Co-location facilities ( co-lo hotels ) Places ISPs meet to connect to each other and co-locate their routers, and share space & power E.g., 32 Avenue of the Americas in NYC Shared links Fiber is sometimes leased by one institution to another Multiple fibers run through the same conduits and run through the same tunnels, bridges, etc. Difficult to identify and accounts for these risks Not visible in network-layer measurements E.g., traceroute does not tell you links in the same ditch Convergence Recently, it was realized that BGP convergence can undergo a process analogous to count-to-infinity! Prefix P In AS X X 1 2 View from here 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

Impact of Policies Example Early Exit / Hot Potato if it s not for you, bail Combination of best local policies not globally best A Side-effect: asymmetry B Key Concepts Internet is a collection of Autonomous Systems (ASes) Policy dominates routing at the AS level Structural hierarchy helps make routing scalable BGP routes between autonomous systems (ASes)