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

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

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

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

Chapter IV: Network Layer

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

Chapter 4: Network Layer

Chapter 4: outline. Network Layer 4-1

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

DATA COMMUNICATOIN NETWORKING

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

CSCI Topics: Internet Programming Fall 2008

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

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

CSC 4900 Computer Networks: Routing Protocols

Routing in the Internet

Chapter 4: Network Layer, partb

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

CSc 450/550 Computer Networks Internet Routing

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

Computer Networking Introduction

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

Network layer: Overview. Network layer functions Routing IP Forwarding

Lecture 19: Network Layer Routing in the Internet

COMP211 Chapter 5 Network Layer: The Control Plane

CSCE 463/612 Networks and Distributed Processing Spring 2018

Internet rou)ng. V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst

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

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

Chapter 4: Network Layer. TDTS06 Computer networks. Subnets. Subnets. Subnets. IP Addressing: introduction

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

Chapter 4 Network Layer

Interplay Between Routing, Forwarding

Master Course Computer Networks IN2097

PART III. Implementing Inter-Network Relationships with BGP

Inter-Autonomous-System Routing: Border Gateway Protocol

Inter-Autonomous-System Routing: Border Gateway Protocol

Inter-domain Routing. Outline. Border Gateway Protocol

Routing. Outline. Algorithms Scalability

Network layer: Overview. Network layer functions Routing IP Forwarding

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture

Inter-Domain Routing: BGP

Internet inter-as routing: BGP

Internet Routing : Fundamentals of Computer Networks Bill Nace

Chapter 4: Network Layer

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

Network Layer: Routing

Introduction to Communication Networks Spring Unit 16 Global Internetworking

CS118 Discussion 1A, Week 7. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m.

Topics for This Week

Unit 3: Dynamic Routing

Why dynamic route? (1)

CSCE 463/612 Networks and Distributed Processing Spring 2018

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

Planning for Information Network

11/13/2017 Network Layer (SSL) Network-layer functions. Recall the two network-layer functions:

BTEC Level 3 Extended Diploma

Introduction to Computer Networks

CSC 8560 Computer Networks: Control Plane

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

Routing. Jens A Andersson Communication Systems

Introduction to Routing

Network Layer: Control Plane 5-2

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

Routing Unicast routing protocols

Chapter 4: Network Layer: Part II

Introduction to IP Routing. Geoff Huston

Lecture 9. Network Layer (cont d) Network Layer 1-1

Chapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP

Computer Networks. Instructor: Niklas Carlsson

CNT Computer and Network Security: BGP Security

Back to basics J. Addressing is the key! Application (HTTP, DNS, FTP) Application (HTTP, DNS, FTP) Transport. Transport (TCP/UDP) Internet (IPv4/IPv6)

CMPE 80N: Introduction to Networking and the Internet. Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 20

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

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

Routing(2) Inter-domain Routing

Chapter 5 Network Layer: The Control Plane

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

Chapter 5 Network Layer: The Control Plane

Ravi Chandra cisco Systems Cisco Systems Confidential

DATA COMMUNICATOIN NETWORKING

Master Course Computer Networks IN2097

Top-Down Network Design

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

Network Layer: Routing. Routing. Routing protocol. Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links

CS 3516: Computer Networks

EECS 3214: Computer Networks Protocols and Applications

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

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

Lecture 4. The Network Layer (cont d)

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14

Routing Overview for Firepower Threat Defense

ETSF10 Internet Protocols Routing on the Internet

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

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

Master Course Computer Networks IN2097

Basic Idea. Routing. Example. Routing by the Network

Network Layer: Routing

ROUTING PROTOCOLS. Mario Baldi Routing - 1. see page 2

Routing by the Network

Transcription:

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

Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small tables) No flooding (fewer messages) Large number of messages sent on events Large routing tables as network size grows Slower convergence Larger window of inconsistency

Today: Real Protocols Link State Open Shortest Path First (OSPF) Intermediate System to Intermediate System (IS-IS) Distance Vector Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP CISCO) Border Gateway Protocol (BGP path vector protocol) Slide 3

Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in practice Scale: with 600 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! Administrative autonomy internet = network of networks each network admin may want to control routing in its own network

Hierarchical routing We aggregate routers into regions, autonomous systems (AS) Routers in same AS run same routing protocol intra-as or interior routing protocol routers in different AS can run different intra-as routing protocol Gateway (or border) router: at edge of its own AS has link to router in another AS

Interconnected ASes 3c 3a 3b AS3 1a 1c 1d 1b Intra-AS Routing algorithm AS1 Forwarding table Inter-AS Routing algorithm 2a 2c AS2 2b Forwarding table configured by both intraand inter-as routing algs intra-as sets entries for internal dests inter-as & intra-as sets entries for external dests

Inter-AS tasks Suppose router in AS1 receives a datagram destined outside of AS1: other networks Router should forward packet to gateway router, but which one? 3b 3c AS3 3a 1a AS1 1c 1d 1b AS1 must: 1. Learn which dests are reachable through AS2, which through AS3 2. Propagate this reachability info to all routers in AS1 Job of inter-as routing! 2a AS2 2c 2b other networks

Inter-AS tasks Suppose AS1 learns (via inter-as protocol) that AS with prefix x is reachable via AS3 (gateway 1c), but not via AS2 inter-as protocol propagates reachability to all internal routers Router 1d determines from intra-as routing info that its interface I is on the least cost path to 1c Installs forwarding table entry (x,i) 3c x other networks 3b AS3 3a 1a AS1 1c 1d 1b 2a AS2 2c 2b other networks

If an external destination is reachable from multiple gateways, a router inside the AS should forward packets for that destination to A. The closest gateway that can reach the destination. B. The gateway that has the least-cost external path to the destination. C. The gateway that has the least-cost path for both the internal and external path. D. Somewhere else.

Routing Policy How should the ISP route the customer s traffic to the destination? Other Networks Other Networks Customer s ISP Destination AS Customer AS Do what s best for who?

Hot Potato Routing Hot Potato: get rid of packets ASAP! Best path: get it as close to the destination as we can. Other Networks Other Networks Customer s ISP Destination AS Customer AS

Hot Potato Routing Hot Potato: get rid of packets ASAP! Best path: get it as close to the destination as we can. Other Networks Other Networks Not my problem! (Don t use resources) Customer s ISP Destination AS Customer AS

Hot Potato Routing Hot Potato: get rid of packets ASAP! Best path: get it as close to the destination as we can. Other Networks Other Networks Customer s ISP Destination AS Customer AS Hold packet longer, use more resources. Provide better service!

Route Selection Often dictated by non-technical factors When governed by protocols, two categories: Intra-AS / Interior gateway protocols Inter-AS / Exterior gateway protocols

Why different Intra-, Inter-AS routing? Policy: inter-as: admin wants control over how its traffic routed, who routes through its net. intra-as: single admin, so no policy decisions needed Scale: hierarchical routing saves table size, reduced update traffic Performance: intra-as: can focus on performance inter-as: policy may dominate over performance

Intra-AS Routing Also known as interior gateway protocols (IGP) Distance Vector: RIP: Routing Information Protocol (E)IGRP: Interior Gateway Routing Protocol (Cisco proprietary) Link State: OSPF: Open Shortest Path First IS-IS: Intermediate system to Intermediate system OSPF and IS-IS are deployed most commonly today!

Intra-AS Routing Also known as interior gateway protocols (IGP) Distance Vector: RIP: Routing Information Protocol IGRP: Interior Gateway Routing Protocol (Cisco proprietary) Goal: Get traffic that is already in an AS to a Link State: destination inside that same AS. OSPF: Open Shortest Path First IS-IS: Intermediate system to Intermediate system OSPF and IS-IS are deployed most commonly today!

RIP (Routing Information Protocol) Included in BSD-UNIX distribution in 1982 distance metric: # hops (max = 15 hops), each link has cost 1 hops = number of subnets traversed Distance vectors exchanged with neighbors every 30 sec Each advertisement: list of up to 25 destination subnets from router A to destination subnets: z u A C B D v y w x subnet hops u 1 v 2 w 2 x 3 y 3 z 2

OSPF (Open Shortest Path First) Link state protocol (reliable flooding of LSAs) Open : standardized, publicly available implementations Multiple equal-cost paths allowed (load balancing) Additional features: OSPF messages authenticated (to prevent malicious intrusion) Hierarchical OSPF for large autonomous systems.

Hierarchical OSPF Two-level hierarchy: local area, backbone. link-state advertisements only in area each nodes has detailed area topology; only know direction (shortest path) to nets in other areas. Area border routers: summarize distances to nets in own area, advertise to other Area Border routers. Backbone routers: route between local areas Boundary routers: connect to other AS s.

Hierarchical OSPF boundary router backbone router area border routers backbone area 3 area 1 area 2 internal routers

Route Selection Often dictated by non-technical factors When governed by protocols, two categories: Intra-AS / Interior gateway protocols Inter-AS / Exterior gateway protocols

Internet inter-as routing: BGP BGP (Border Gateway Protocol): The de facto inter-domain routing protocol BGP provides each AS a means to: external BGP: obtain subnet reachability information from neighboring ASs. Goal: internal BGP: propagate reachability information Get to all traffic AS-internal from routers. one AS to another. determine good routes to other networks based on reachability information and policy. Allows a subnet to advertise its prefix to the rest of the Internet

Border routers: exchange AS reachability, Internal routers: exchange intra-as reachability., Is this sufficient to route from source to destination? Destination A. Yes B. No 3c other networks 3b AS3 3a 1a AS1 1c 1d 1b 2a AS2 2c 2b other networks Source

Internet inter-as routing: BGP BGP (Border Gateway Protocol): The de facto inter-domain routing protocol BGP provides each AS a means to: external BGP: obtain subnet reachability information from neighboring ASs. internal BGP: propagate reachability information to all AS-internal routers. determine good routes to other networks based on reachability information and policy. Allows a subnet to advertise its prefix to the rest of the Internet

BGP BGP session: two BGP routers ( peers ) exchange BGP messages: Advertising paths to different destination network prefixes ( path vector ) Exchanged over long-term TCP connections When AS3 advertises a prefix to AS1: AS3 promises it will forward datagrams towards that prefix AS3 can aggregate prefixes in its advertisement other networks 3b 3c AS3 3a 1a AS1 BGP message 1c 1d 1b 2a AS2 2c 2b other networks

BGP: Distributing Path Information Using ebgp session between 3a and 1c, AS3 sends prefix reachability info to AS1. 1c can then use ibgp do distribute new prefix info to all routers in AS1 1b can then re-advertise new reachability info to AS2 over 1b-to-2a ebgp session When a router learns of a new prefix, it creates an entry for the prefix in its forwarding table. other networks 3b AS3 3a 1a AS1 1c 1d ebgp session ibgp session 1b 2a AS2 2c 2b other networks

Path attributes and BGP routes An advertised prefix includes BGP attributes prefix + attributes = route Two important attributes: AS-PATH: contains list of ASs through which prefix advertisement has passed: If AS2 advertises a prefix to AS1, AS1 will advertise path: AS1 AS2 Ignore routes that include yourself in them! NEXT-HOP: indicates specific internal-as router to next-hop AS. (may be multiple links from current AS to next-hop-as) Gateway router receiving route advertisement uses import policy to accept/decline e.g., never route through AS x policy-based routing

BGP Route Selection Router may learn about more than one route to destination AS, selects route based on: local preference value attribute: administrative policy shortest AS-PATH closest NEXT-HOP router: hot potato routing additional criteria

Which routes a BGP router advertises will depend on A. which ISPs have contractual agreements. B. the shortest path to a subnet/prefix. C. which subnets are customers of an ISP. D. More than one of the above. (which?)

Which routes a BGP router advertises will depend on A. which ISPs have contractual agreements. B. the shortest path to a subnet/prefix. C. which subnets are customers of an ISP. D. More than one of the above. (which?)

BGP routing policy W A B C X legend: provider network customer network: Y A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two networks X does not want to route from B via X to C.. so X will not advertise to B a route to C

BGP routing policy (2) W A B C X legend: provider network customer network: Y A advertises path AW to B B advertises path BAW to X Should B advertise path BAW to C? B gets no revenue for routing CBAW since neither W nor C are B s customers B wants to force C to route to w via A B wants to route only to/from its customers!

BGP routing policy gone wrong W A B C X legend: provider network customer network: Y x advertises a path to E (that it is not connected to). all traffic starts to flow into x from B and C!

Faulty redistribution can be dangerous! AS7007 incident (April, 1997): Hijack large part of the Internet

Summary As we ve seen before (DNS), a hierarchy can help manage state storage constraints. intra-as routing: lots of info about local routes inter-as routing: less info about far away routes BGP: the inter-as routing protocol for the Internet Decisions often contractual BGP advertises AS prefixes, including: entire path of ASes along the way which border router heard the advertisement (Next Hop)