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

Similar documents
Internet Routing. Reminder: Routing. CPSC Network Programming

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

Inter-domain Routing

Distance vector protocol

Network Layer: Routing Classifications; Shortest Path Routing

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

Chapter 4: outline. Network Layer 4-1

Three planes in networks

Chapter 4: Network Layer

Chapter IV: Network Layer

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

Routing in the Internet

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

DATA COMMUNICATOIN NETWORKING

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

CSc 450/550 Computer Networks Internet Routing

Chapter 4 NETWORK LAYER

Routing: Network Layer Part II

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

Computer Networking Introduction

Topics for This Week

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

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

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

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

Chapter 4: Network Layer, partb

Routing Protocols. Autonomous System (AS)

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

Routing Unicast routing protocols

CSC 4900 Computer Networks: Routing Protocols

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

CSCI Topics: Internet Programming Fall 2008

McAfee Web Gateway

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

Routing. Jens A Andersson Communication Systems

Chapter 7 Routing Protocols

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

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

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

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

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

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

BTEC Level 3 Extended Diploma

Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse

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

Chapter 4 Network Layer

Architecture and Data Flows Reference Guide

Introduction to Dynamic Routing Protocols

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

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

CS 268: IP Multicast Routing

Routing. Outline. Algorithms Scalability

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

CS321: Computer Networks Unicast Routing

Architecture and Data Flows Reference Guide

Why dynamic route? (1)

Enterprise Digital Signage Create a New Sign

Network layer: Overview. Network layer functions Routing IP Forwarding

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery

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

COMP 3331/9331: Computer Networks and Applications

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

Network Layer: Routing

Lecture (03) RIP. By: Dr. Ahmed ElShafee. Dr. Ahmed ElShafee, ACU : Fall 2016, Practical App. Networks II

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

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

Introduction to IP Routing. Geoff Huston

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

Distributed Systems Principles and Paradigms

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

Error Numbers of the Standard Function Block

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

Basic Idea. Routing. Example. Routing by the Network

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

Inter-Domain Routing: BGP

Routing by the Network

COMP/ELEC 429/556 Introduction to Computer Networks

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

Routing Protocols and

EE 122: Intra-domain routing

Overview 4.2: Routing

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli

Adjacency. Adjacency Two vertices u and v are adjacent if there is an edge connecting them. This is sometimes written as u v.

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

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

Introduction to Computer Networks

Interplay Between Routing, Forwarding

Inter-domain Routing. Outline. Border Gateway Protocol

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

Chapter 5 Network Layer: The Control Plane

A distributed edit-compile workflow

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.

COM-208: Computer Networks - Homework 6

McAfee Data Loss Prevention Prevent

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

CSCE 463/612 Networks and Distributed Processing Spring 2018

McAfee Network Security Platform

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

Dynamic Routing. The Protocols

IP Addressing & Interdomain Routing. Next Topic

Transcription:

CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The Network Lyer: Routing & Addressing Outline! Network lyer funtions! Router rhiteture! IP Internet Protool» Addressing! Routing lgorithms» Lest ost pth omputtion lgorithms! Hierrhil routing» Conneting networks of networks! Routing on the Internet» Intr-domin routing» Inter-domin routing pplition trnsport network link physil pplition trnsport network link physil 2

The Network Lyer: Routing & Addressing Hierrhil routing! The theory of routing: reltively simple lgorithms with mngele shortomings! Critil ssumptions:» All routers re identil» The network is flt! The relity: Routing is dominted y issues of sle» The Internet hs 100 million hosts! " Cn t store ll host destintions in routing tles! " Routing tle exhnge would swmp links!» We must route to networks, not hosts! Routing lso dominted y issues of dministrtive utonomy» The Internet is network of networks eh network owner my wnt to ontrol routing in its own network 3 Hierrhil Routing Gtewy routers! Aggregte routers into regions, utonomous systems (AS)! All routers inside sme AS run sme routing protool mong themselves» Intr-AS routing protool» Routers in different AS n run different intr- AS routing protool Gtewy routers! Speil routers in AS! Run intr-as routing protool with ll other routers inside AS! Responsile for routing to destintions outside AS» Also run inter-as routing protool with gtewy routers in djent AS 4

Hierrhil Routing Intr-AS & Inter-AS Routing C C. d A A. A. B. B! Gtewys:» Perform inter-as routing mong themselves» Perform intr-as routing with other routers in their AS Inter-AS nd intr-as routing in gtewy A. Intr-AS Routing Algorithm Routing Tle Inter-AS Routing Algorithm network lyer link lyer physil lyer to/from A. DL PHY DL PHY to/from A.d DL PHY to/from B. 5 Hierrhil Routing Intr-AS & Inter-AS Routing Host h1 C C. A. A. d A Intr-AS routing within AS A Inter-AS routing etween A nd B B. B Host h2 Intr-AS routing within AS B! We ll exmine speifi inter-as nd intr-as Internet routing protools shortly 6

Routing on the Internet The Internet AS hierrhy Inter-AS order (exterior gtewy) routers C C. d A A. A. B. B Intr-AS (interior gtewy) routers 7 The Internet AS Hierrhy Intr-AS routing C C. d A A. A. B. B! Also known s Interior Gtewy Protools (IGPs)! Most ommon IGPs:» RIP: Routing Informtion Protool» OSPF: Open Shortest Pth First» IGRP: Interior Gtewy Routing Protool (Ciso proprietry) 8

Intr-AS routing RIP! Distne vetor-like lgorithm» Commonly used in the erly Internet! Distne metri: Numer of hops» Mximum vlue = 15 hops (! = 16)! Routing tles (inluding osts) re exhnged with djent nodes every 30 seonds vi Response Messge (lso lled route dvertisement )» Reeiver determines if djent node hs found new minimum ost to destintion! Eh dvertisement onsists of the minimum ost route for up to 25 destintion networks 9 RIP Link filure nd reovery! If no dvertisement herd fter 180 seonds, djent node/link delred filed» Routes vi tht djent node invlidted» New dvertisements sent to other djent nodes» Advertisement reeivers in turn send out new dvertisements (if their tles hnged)» Link filure informtion quikly propgtes to entire net» Poisoned reverse used to prevent ping-pong loops " infinity = 16 10

Intr-AS routing IGRP! CISCO proprietry; suessor of RIP (mid 80s)! Distne Vetor-like similr to RIP» Severl ost metris: dely, ndwidth, reliility, lod, et.» Uses TCP to exhnge routing updtes 11 Intr-AS routing OSPF! Open : pulily ville! Uses the Link Stte minimum ost pth omputtion lgorithm» LS updte flooding» Topology mp t eh node» Route omputtion using Dijkstr s lgorithm! OSPF dvertisement rries one entry per djent node! Advertisements disseminted to n entire AS (vi flooding) 12

OSPF Advned fetures (not in RIP)! Seurity: ll OSPF messges uthentited to prevent mliious intrusion» TCP onnetions used in flooding! Multiple sme-ost pths llowed (only one pth in RIP)! For eh link, multiple ost metris for different network-lyer servies» (e.g., stellite link ost set low for est effort; high for rel time)! Hierrhil OSPF used in lrge networks 13 OSPF Why hierrhil OSPF? 14

OSPF Hierrhil OSPF To other AS 15 OSPF Hierrhil OSPF! Two-level hierrhy: lol re, kone» Link-stte dvertisements only in re» Eh re node hs detiled re topology; only knows shortest pth to networks in other res! Are Border Routers: summrize distnes to nets in own re nd dvertise to other Are Border routers! Bkone Routers: run OSPF routing limited to kone! Boundry Routers: onnet to other AS 16

The Internet AS Hierrhy Inter-AS Routing C C. d A A. A. B. B! Border Gtewy Protool (BGP) is the de fto stndrd! Pth Vetor protool:» Similr to Distne Vetor protool» Eh Border Gtewy dvertises to djent nodes (peers) the entire pth (i.e., sequene of AS numers) to destintion» e.g., Gtewy X my send its pth to destintion Z: pth (X,Z) = X, Y 1, Y 2, Y 3,, Z 17 Internet Inter-AS Routing BGP! Suppose gtewy X sends pth to peer gtewy W! W my or my not selet the pth dvertised y X» Cost, poliy ( don t route vi ompetitor X s network ), or loop prevention resons! If W selets the pth dvertised y X to Z, then: pth (W,Z) = W + pth (X,Z)! Note tht X n ontrol its inoming trffi y ontrolling its route dvertisements to djent order gtewys:» If X does not wnt to route trffi to Z, then X will not dvertise ny routes to Z 18

Internet Inter-AS Routing BGP! BGP messges exhnged using TCP! BGP messges:» OPEN: opens TCP onnetion to peer nd uthentites sender» UPDATE: dvertises new pth (or withdrws old)» KEEPALIVE: keeps onnetion live in sene of UPDATES; lso ACKs OPEN request» NOTIFICATION: reports errors in previous messge; lso used to lose onnetion 19 The Internet AS Hierrhy 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 20