Unicast Routing. TCP/IP class

Similar documents
Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

Internet Routing Protocols, DHCP, and NAT

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

Unit 3: Dynamic Routing

Routing Unicast routing protocols

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

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

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

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

Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls

Introduction to Routing

Overview 4.2: Routing

Why dynamic route? (1)

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

CSc 450/550 Computer Networks Internet Routing

Inter-Domain Routing: BGP

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

EEC-684/584 Computer Networks

Routing. Jens A Andersson Communication Systems

Routing in the Internet

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

Internet Routing Protocols Tuba Saltürk

Inter-domain Routing. Outline. Border Gateway Protocol

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

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full

Internet Routing : Fundamentals of Computer Networks Bill Nace

Routing Protocols. Autonomous System (AS)

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

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

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

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

Planning for Information Network

Open Shortest Path First (OSPF)

Chapter 7 Routing Protocols

Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls

TDC 363 Introduction to LANs

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.

IP Protocols. ALTTC/Oct

Chapter 7: Routing Dynamically. Routing & Switching

Introduction to OSPF

Lecture 12. Introduction to IP Routing. Why introduction? Routing

Introduction to OSPF

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

Symbols. Numerics I N D E X

ABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6

OSPF. OSPF processs can be enabled on 2 levels

Chapter 4: Network Layer

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

Computer Networking Introduction

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

CCNP 1: Advanced Routing

Configuring OSPF. Cisco s OSPF Implementation

9.1. Routing Protocols

Network Layer Protocols

Introduction to OSPF

CS118 Discussion Week 7. Taqi

11. Dynamic Routing Protocols

Chapter 4: outline. Network Layer 4-1

Implementing Cisco IP Routing (ROUTE)

Routing Protocols --- Exterior Gateway Protocol

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

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

Routing Information Protocol aka (let er) RIP

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

Operation Manual Routing Protocol. Table of Contents

Routing & Protocols 1

Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP

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

Routing. Advanced Computer Networks: Routing 1

To contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN).

Routing Protocols. Technology Description BGP CHAPTER

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

RIP Version 2. The Classless Brother

CompSci 356: Computer Network Architectures. Lecture 12: Dynamic routing protocols: Link State Chapter Xiaowei Yang

Redesde Computadores(RCOMP)

Routing Protocols Classification

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting

Routing. Directly Connected IP Networks. Data link layer routing. ifconfig command

Topics for This Week

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

Chapter 13 Configuring BGP4

CS BGP v4. Fall 2014

Top-Down Network Design

Configuring IP Routing Protocols

DATA COMMUNICATOIN NETWORKING

Chapter 8 Configuring OSPF

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

Configuring Networking Protocols

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

Configuring OSPF. Finding Feature Information

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1

Lecture 19: Network Layer Routing in the Internet

Table of Contents 1 OSPF Configuration 1-1

CompSci 356: Computer Network Architectures. Lecture 13: Dynamic routing protocols: Link State Chapter 3.3.3, Xiaowei Yang

Configuring BGP. Cisco s BGP Implementation

IP Router. Introduction to IP Routing. Agenda. IP Routing 1

Presentation On Routing Protocol

CSCI Topics: Internet Programming Fall 2008

Transcription:

Unicast Routing TCP/IP class

Routing Protocols intro RIP and son of RIP OSPF BGP odd bodkins NAT TCP/IP Internetworking Protocols 2

divide routing world into 3 parts topology IETF ISO/OSI same link or wire enterprise or campus between enterprises none, intra-link? none, intra-link? Interior Gateway Protocol - IGP Exterior Gateway Protocol - EGP intra-domain routing protocol inter-domain TCP/IP Internetworking Protocols 3

protocols acc. to topology topology IETF ISO/OSI intra-link ARP ES-IS intra-domain RIP, RIP(2), OSPF IS-IS inter-domain EGP, BGP(4) IDRP TCP/IP Internetworking Protocols 4

the Interior - RIP or OSPF Joe Bob Inc s Network Map out link TCP/IP Internetworking Protocols 5

Exterior - Between Domains - BGP autonomous system (IETF term) A.S. 1 inter-domain routing A.S. or domain A.S. 3 boundary router A.S. 2 TCP/IP Internetworking Protocols 6

Routing Information Protocol BSD app based on XNS (Xerox) version, Netware RIP is similar too (surprise) done first and RFC 1058 (1988) later created in widespread use for at least two reasons widely available, came with that there Sun # routed & is all you need to do BSD routed and Cornell gated support it TCP/IP Internetworking Protocols 7

RIP details messages carried in UDP datagrams, send/recv on port 520 broadcast every 30 seconds, routing table as pairs of (to net, hop count) triggered update sent if metric (hop count) changes (only relevant info) hop count, direct connect == 1, network one router away is 2 hops away new route with shorter hop count replaces older route on init, router requests route table from neighbors TCP/IP Internetworking Protocols 8

more RIP details when routing response receiving, routing table is updated (metrics aren t typically displayed in netstat -rn unfortunately) route has timeout. 3 minutes, no new info, then mark with metric=16, one minute later delete (holddown so the fact that route is gone is propagated) infinity == 16, RIP can suffer count to infinity default route is route to 0.0.0.0 routers are active, hosts are passive, determined by whether or not system > 1 i/f (can set by hand) TCP/IP Internetworking Protocols 9

to RIP or not to RIP? pros simple, stupid... cons no understanding of subnetting; e.g.,» 121.12.3.127 could be a host or a subnet paired with 121.12.0.0 leads rip to think what? convergence is slower (minutes sometimes) AND not as scalable as OSPF - can t aggregate as well» hop count max is small (not really important)» can t deal with different link types TCP/IP Internetworking Protocols 10

RIP(1) header one route entry command version(1) must be zero family(2) must be zero ip address must be zero must be zero metric: (1-16) up to 24 more routes, 25 routes max (< 512) note: command: 1, request; 2, response TCP/IP Internetworking Protocols 11

RIP(2) header one route entry command version(2) routing domain family(2) route tag ip address net mask next hop IP address metric: (1-16) up to 24 more routes, 25 routes max (< 512) TCP/IP Internetworking Protocols 12

RIP-2 RFC 1388 (1993) zero fields cleverly used, should interoperate if RIP(1) ignores fields version is 2 routing domain can be used to allow more than one RIP domain on a campus; more than one routed on a system route tag - AS number, communicate boundary info subnet mask - for CIDR, route == (ip, net mask) next hop, ip address for VIA part of route (as opposed to getting it from IP src) TCP/IP Internetworking Protocols 13

RIP-2 clear-text password shared-secret e.g., with MD5 is second possibility (and better) can use multicasting as opposed to broadcast, thus hosts that don t give a RIP(2) can ignore it TCP/IP Internetworking Protocols 14

OSPF - Open Shortest Path First OSPF version 2, in RFC 1247 (1991) link-state protocol as contrasted with RIP OSPF uses IP direct, not on top of UDP, proto = 89 OSPF has backbone routers (top level/l2) and (lower level/l1) internal routers supports AREA notion, backbone router can summarize IP addresses in area, report summary to other backbone routers, and leak that info into area so that internal routers can optimize their routes uses multicast as opposed to broadcast TCP/IP Internetworking Protocols 15

OSPF routers can do load balancing if more than one path and metric is the same equal-cost multi-path routing metrics are in theory dimensionless, in reality: link speed (ethernet is 1000/100/10...) one router on link plays the LSP game, designated router, has election algorithm supports subnets (CIDR), host route has mask of all 1 s, default all 0 s TCP/IP Internetworking Protocols 16

OSPF router types BGP - external routing AS Border Router (1) area 1 stub area 0 Area Border Router (2) ordinary OSPF router (3), maybe DR TCP/IP Internetworking Protocols 17

router functions ASBR - runs BGP/OSPF decides how much external BGP routing info to interject into A.S. (and vice versa) Border Router - aggregates area external and internal routes and injects into other area (summaries) DRs and non-drs, participate in OSPF within an area TCP/IP Internetworking Protocols 18

OSPF - 3-sub-protocols hello routers on same link exchange link info elect DR - designated router exchange bringing up adjacencies routers at (re)boot exchange Link-State tables update flooding of link-state change/includes ACK TCP/IP Internetworking Protocols 19

Link-State record types (5) router LSP - sent by routers within AREA describes links and associated costs (metrics) network LSP - sent by DR, within AREA only describes other routers on link IP network summary - Area Border Routers send across areas aggregation of one area to another TCP/IP Internetworking Protocols 20

LSP types, cont. border router summary - ASBRs send describes path to ASBR external - ASBRs send IN describes path to outside world default route may be included here note 1st two describe AREA setup last 3 describe into/out of AREAs/A.S. and include aggregation TCP/IP Internetworking Protocols 21

BGP - Border Gateway Protocol bind A.S. or domains together (Layer 3?). A.S. is 16 bit number allocated by regionals (e.g., ARIN in US) replaced EGP, see RFC 1457 and possibly newer versions BGP uses TCP to communicate reliable can tunnel across a domain distance vector protocol. route == series of A.S. numbers, since route is enumerated, can detect loops route update = To X, AS #1, AS #2, etc. TCP/IP Internetworking Protocols 22

BGP continued AS is either: stub: only one way in/out transit: in the middle of stub A.S. multi-homed: more than one way out but refuses to do transit work routing can be policy-based but is typically hop based policies are determined by admin and put in config files TCP/IP Internetworking Protocols 23

A.S. must be obtained from relevant authorities (www.arin.net in US) view IP address as two tuple (A.S., IP) BGP routes in implicit sense via A.S. tuple BUT explicit still routes to IP net hope network is highly AGGREGATED could be serial host (worst case) TCP/IP Internetworking Protocols 24

transit A.S. POV A.S. Y internal BGP A.S. X OSPF within A.S. A.S. 100 EBGP peers stub auto. system A.S. 101 TCP/IP Internetworking Protocols 25

BGP protocol types hello can take MD5 checksum (authentication) but not in use (yet) notification (error) loop detected (example) failure in TCP state machine update (or withdrawal) route change TCP/IP Internetworking Protocols 26

two types of BGP external, typically TCP on 2 directly connected links between two A.S. internal - cross BGP routers across transit A.S. (normally), may be multi-hop internal BGP routers must be fully meshed; i.e., should have 1-1 connection between all BGP routers OSPF must converge internally before BGP, else potential of BLACK HOLE TCP/IP Internetworking Protocols 27

Network Address Translation RFC 1918 specifies a set of internal-only intranet addresses in range: class A 10.0.0.0 class B 172.16.0.0.. 172.31.255.255 class C 192.168.0.0.. 192.168.255.255 NAT idea: internal systems use private IP address - somehow mapped at router to real ip address TCP/IP Internetworking Protocols 28

two possible configurations you have lots of hosts, use 10.0.0.0 internally, ip address mapping only used, but one class C address externally 204.1.2.0 possibly this limits your external tcp connections of course e.g., 10.0.0.1 is mapped to 204.1.2.1 during a tcp connect NAT with ports (NAPT). One external IP address. Add tcp/udp port space to make unique mapping. TCP/IP Internetworking Protocols 29

NAT picture 10.0.0.1 Intranet NAT-capable router 204.1.2.0 address pool Internet TCP/IP Internetworking Protocols 30

NAT with ports picture - Mapping Example ip src = 10.0.0.1 udp src = 434 ip src 1: ip src = 10.0.0.2 udp src = 434 ip src 2: NAPT-capable router ip src = 201.1.2.3 udp src = 434 ip src 1: ip src = 201.1.2.3 udp src = 435 ip src 2: what observations can you make about how the NAT box must work? TCP/IP Internetworking Protocols 31

pros/cons pros may allow administrative domain to shield all hosts from address change needed by ISP switch may have security function/s» outside can t see inside or can t talk to inside» inside IP address changes from one connection to next therefore privacy function can conserve IP address space or better utilize it may have way to map one virtual address to N real addresses and get a load balancing function for server TCP/IP Internetworking Protocols 32

con: traditional: loss of end-end connectivity breaks end to end model MIP won t work IPSEC won t work FTP... needs passive mode, because» of IP addresses in L4 DNS functionality and tie-in? TCP/IP Internetworking Protocols 33