Inter-domain Routing

Similar documents
Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

Internet Routing. Reminder: Routing. CPSC Network Programming

Distance vector protocol

Network Layer: Routing Classifications; Shortest Path Routing

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms

Three planes in networks

Minimal Memory Abstractions

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

McAfee Web Gateway

Error Numbers of the Standard Function Block

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

Network Interconnection: Bridging CS 571 Fall Kenneth L. Calvert All rights reserved

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing

Enterprise Digital Signage Create a New Sign

CS Summer Lecture #23: Network and End-to-End layers

Architecture and Data Flows Reference Guide

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA:

Inter-domain Routing. Outline. Border Gateway Protocol

CS553 Lecture Introduction to Data-flow Analysis 1

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

Chapter 4 NETWORK LAYER

Introduction to IP Routing. Geoff Huston

A distributed edit-compile workflow

To access your mailbox from inside your organization. For assistance, call:

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup

CS 268: IP Multicast Routing

Lecture 13: Graphs I: Breadth First Search

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion

Architecture and Data Flows Reference Guide

Distributed Systems Principles and Paradigms

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

Greedy Algorithm. Algorithm Fall Semester

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

Introduction to BGP. BGP Basics BGP. Border Gateway Protocol. Path Vector Protocol. Path Vector Protocol INET 2000 NTW

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

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

Inter-Domain Routing: BGP

Internet Routing : Fundamentals of Computer Networks Bill Nace

Routing: Network Layer Part II

From Dependencies to Evaluation Strategies

COMP211 Chapter 5 Network Layer: The Control Plane

COSC 6374 Parallel Computation. Dense Matrix Operations

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

Calculus Differentiation

COMP 423 lecture 11 Jan. 28, 2008

Mobile IP route optimization method for a carrier-scale IP network

Interdomain Routing. Networked Systems (H) Lecture 11

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

INTEGRATED WORKFLOW ART DIRECTOR

Chapter IV: Network Layer

McAfee Network Security Platform

What are suffix trees?

All in One Kit. Quick Start Guide CONNECTING WITH OTHER DEVICES SDE-4003/ * 27. English-1

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

Routing(2) Inter-domain Routing

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

McAfee Network Security Platform

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

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

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

Lecture 19: Network Layer Routing in the Internet

style type="text/css".wpb_animate_when_almost_visible { opacity: 1; }/style

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Midterm Exam CSC October 2001

Network Layer (Routing)

McAfee Data Loss Prevention Prevent

Routing(2) Inter-domain Routing

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page

CSCI Topics: Internet Programming Fall 2008

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

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

Ravi Chandra cisco Systems Cisco Systems Confidential

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

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

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Operational Verification. 26 SEP 2017 VMware Validated Design 4.1 VMware Validated Design for Software-Defined Data Center 4.1

Software Configuration Management

IP Addressing & Interdomain Routing. Next Topic

Readings : Computer Networking. Outline. The Next Internet: More of the Same? Required: Relevant earlier meeting:

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

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

Agilent Mass Hunter Software

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

Registering as an HPE Reseller

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

INSTALLING PRIVA GATEWAY FOR PRIVA CONNEXT

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012

Lecture 8: Graph-theoretic problems (again)

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Parallelization Optimization of System-Level Specification

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs

DATA COMMUNICATOIN NETWORKING

COM-208: Computer Networks - Homework 6

CS321: Computer Networks Unicast Routing

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

CSEP 573 Artificial Intelligence Winter 2016

Interdomain routing CSCI 466: Networks Keith Vertanen Fall 2011

Transcription:

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit the notion of utonomous systems to divide routing into two prts Intr-domin routing: Routing within n utonomous system eg: RIP (distne-vetor type), OSPF (link-stte type) Inter-domin routing: Routing etween utonomous systems Hierrhilly ggregte routing informtion Route propgtion ( know smrter router poliy): Hosts know lol (defult) router Lol routers know site routers Site routers know ore (kone) routers Core routers know everything 2 Copyright y Jsleen Kur 1

Internet AS-level Arhiteture: Properties Lrge orportion Consumer ISP Peering point Consumer ISP Bkone servie provider Peering point Lrge orportion Consumer ISP Smll orportion Tiered Internet servie providing Multi-homed stu networks Peering reltions Points of presene (POPs) 3 Internet-sle Routing: Chllenges Mtter of sle! Bkone routers must provide mth for ny vlid IP ddress Even with CIDR, still need to mintin O(100,000) prefixes Autonomous nture of domins: Eh domin runs own interior routing protool nd linkost ssignment sheme Impossile to lulte meningful pth osts for pths tht ross multiple domins Therefore, inter-domin routing dvertises only rehility informtion Find ny pth tht is loop-free (optimlity not onsidertion) 4 Copyright y Jsleen Kur 2

Internet-sle Routing: Chllenges Issue of trust: Provider A my e unwilling to elieve route dvertisements from provider B Misonfigured routers, insuffiient pity to rry trffi, mliious intent Need to support flexile routing poliies: Prevention of trnsit trffi Multi-homed orportions my not wish to rry trffi etween the two providers Provider A my wnt to implement speil poliies: Use provider B only to reh these ddresses Use the pth tht rosses the fewest ASes Use AS x in preferene to AS y Erly-exit poliy! 5 Border Gtewy Protool (BGP) Arhiteturl Components eh AS hs: At lest one BGP speker (spokesperson for entire AS) Estlish BGP sessions to spekers in other ASes Exhnge rehility informtion mong ASes One or more Border Gtewys (through whih pkets enter/leve the AS) Routers hrged with tsk of forwrding pkets etween ASes C. B. C A. A. B d A Border Gtewys 6 Copyright y Jsleen Kur 3

BGP: Bsi Ide BGP is Pth-vetor protool: Advertises omplete pth for rehing given destintion AS 2 dvertises: networks 128.96, 192.4.153, 192.4.32, 192.4.3 n e rehed diretly from AS 2 Bkone AS dvertises: 128.96, 192.4.153, 192.4.32, 192.4.3 n e rehed long pth: (AS1, AS2) 192.12.169, 192.4.54, 192.4.23 n e rehed long pth: (AS1, AS3) Customer P (AS 4) 128.96 192.4.153 Bkone Provider (AS 1) Regionl Provider A (AS 2) Regionl Provider A (AS 3) Customer Q (AS 5) Customer R (AS 6) Customer S (AS 7) 192.4.32 192.4.3 192.12.169 192.4.54 192.4.23 7 BGP Advertisements: Implementing Poliies Complete AS pth helps implement loop-free routing If AS finds itself in n dvertisement, ignores it An AS will dvertise only those routes tht it onsiders good enough for itself And these re the routes tht it will tully use for forwrding dt BGP spekers need not dvertise routes, even if they know of one Helps implement non-trnsit poliy for multi-homed stu networks If X does not wnt to route trffi to Z, then X will not dvertise ny routes to Z Helps implement ost-relted or usiness-relted poliies Don t dvertise routes vi ompetitor s network (even if ompetitor hs dvertised routes to you) Don t dvertise routes through peers tht hrge you for ytes routed through them 8 Copyright y Jsleen Kur 4

Putting It Together: Intr-AS & Inter-AS Routing Host h1 C C. d A A. Inter-AS routing etween A nd B A. Intr-AS routing within AS A B. B Intr-AS routing within AS B Host h2 Stu networks send to only order router (if single- homed) Provider AS: Border router injets inform^on into the intr- domin rou^ng protool I hve link to ustomer- prefix Y of ost X All internl routers send pkets for this des^n^on to this order router Bkone AS: Use Interior- BGP (IBGP) to distriute info lerned y BGP spekers to ll routers Enles eh router to lern est order router to use for given prefix 9 Why Different Intr- nd Inter-AS Routing? Poliy: Inter-AS: dministrtion wnts ontrol over how its trffi routed nd who routes through its network Intr-AS: single dministrtion, so no poliy deisions needed Sle: Hierrhil routing sves tle size, redued updte trffi Performne: Intr-AS: n fous on performne Inter-AS: poliy my dominte over performne 10 Copyright y Jsleen Kur 5

BGP Performne: Pth Reovery 2-yer study of routing updtes y the Routeviews projet Oservtions: Dely in Internet inter-domin pth filovers verges 3 minutes Some lst 15 minutes Cuse: Mostly unforeseen intertion of protool timers with speifi vendor implementtion deisions User-Impt: Filovers ffet end-to-end performne signifintly Mesured pket losses grow y 30 times Lteny grows y 4 times 11 BGP Performne: Misonfigurtions Oservtions mde in 2001 study: Eh dy, 200-1200 prefixes (1% glol BGP tle) suffer misonfigurtions 2% of the time, inreses routing updte lod y t lest 10% One oservtion douled lod ross ll vntge points 3-4 new prefixes seen everydy result from misonfigurtions Cuses: Involuntry slips y network opertors Router initiliztion ugs Poor understnding of onfigurtion semntis y opertors User-impt: onnetivity is roust Only 4% of d nnounements disrupt onnetivity 12 Copyright y Jsleen Kur 6

BGP Performne: Pth Infltions 2002 study oserved firly inflted pths Cuses: Mny pths tht use erly-exit re inflted (longer RTTs) Topology-insensitive lod lning n use signifint pth infltion Peering points etween ISPs my not e on the shortest pth for two end-hosts Non-erly exit poliies To void ongested peering point Not ll ISPs re diretly onneted to eh other 13 Copyright y Jsleen Kur 7