CSEE W 4140 Networking Laboratory Lecture 4 IP

CSEE W 4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim 02. 15. 2010

Two functions of the network layer (Review) o Routing “Collective interactions of all routers to determine the paths that packets take on their trips from source to destination” o Forwarding “The transfer of a packet from an incoming link to an outgoing link within a single router. ”

Forwarding Table (Review) Destination Next Hop 10. 1. 0. 0/24 10. 1. 2. 0/24 10. 2. 1. 0/24 20. 1. 0. 0/16 20. 2. 1. 0/28 eth 0 eth 1 10. 1. 0. 1 IP datagrams can be directly delivered (“eth 0 or eth 1”) or are sent to a router (“ 10. 1”)

Delivery with forwarding tables (Review) to: 20. 2. 1. 2

Today’s topics

Autonomous System o An autonomous system is a network that is administered by a single organization. o The internet is a collection of autonomous systems. o Examples of autonomous regions are: o o Columbia’s campus network Telecommunication company’s backbone network Regional Internet Service Provider Routing is done differently within an autonomous system (intradomain routing) and between autonomous system (interdomain routing).

Autonomous System

Interdomain and Intradomain Routing o o Routing within an AS Ignores the Internet outside the AS Protocols for Intradomain routing are also called Interior Gateway Protocols or IGP’s. Popular protocols are n n RIP (simple, old) OSPF (better) Interdomain Routing o o o Routing between AS’s Assumes that the Internet consists of a collection of interconnected AS’s Normally, there is one dedicated router in each AS that handles interdomain traffic. Protocols for interdomain routing are also called Exterior Gateway Protocols or EGP’s. Routing protocols: n BGP

Distance Vector Algorithm o Based on the Bellman-Ford equation dx(y) = minv{c(x, v) + dv(y)} dx(y) = least cost path from x to y c(x, v) = link cost from x to v

Assume: - link cost is 1, i. e. , c(v, w) = 1 - all updates occur simultaneously - Initially, each router only knows the cost of connected interfaces Example 10. 0. 3. 0/24 10. 0. 4. 0/24 . 1 . 1 Net via cost Router A t=0: 10. 0. 1. 0 10. 0. 2. 0 - 0 0 t=1: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 2. 2 t=2: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 2. 2 . 2 Router B Net via . 2 Router C Net via 0 0 t=0: 10. 0. 3. 0 10. 0. 4. 0 - 0 0 1 t=1: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 1 0 0 1 t=1: 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 1 0 0 1 2 t=2: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 10. 0. 2. 1 10. 0. 3. 2 10. 0. 3. 1 10. 0. 4. 2 . 1 Router D t=0: 10. 0. 2. 0 10. 0. 3. 0 - 10. 0. 2. 1 10. 0. 3. 2 10. 0. 5. 0/24 2 1 0 0 1 Net via cost . 2 10. 0. 2. 0/24 cost 10. 0. 1. 0/24 t=0: 10. 0. 4. 0 10. 0. 5. 0 - 0 0 t=1: 10. 0. 3. 0 10. 0. 4. 1 10. 0. 4. 0 10. 0. 5. 0 - 1 0 0 t=2: 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 2 1 0 0 10. 0. 4. 1 -

Example 10. 0. 3. 0/24 10. 0. 4. 0/24 . 1 . 1 Net t=2: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 t=3: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 via 10. 0. 2. 2 Router B cost Router A 0 0 1 2 3 . 2 Net via . 2 Router C t=2: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 10. 0. 2. 1 10. 0. 3. 2 1 0 0 1 2 t=3: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 10. 0. 2. 1 10. 0. 3. 2 1 0 0 1 2 Net t=2: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 t=3: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 via 10. 0. 3. 1 10. 0. 4. 2 Now, routing tables have converged ! 10. 0. 5. 0/24 . 1 Router D 2 1 0 0 1 Net via cost . 2 10. 0. 2. 0/24 cost 10. 0. 1. 0/24 t=2: 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 10. 0. 4. 1 - 2 1 0 0 t=3: 10. 0. 1. 0 10. 0. 2. 0 10. 0. 3. 0 10. 0. 4. 0 10. 0. 5. 0 10. 0. 4. 1 - 3 2 1 0 0

Characteristics of Distance Vector Routing o o Periodic Updates: Updates to the routing tables are sent at the end of a certain time period. Typical value in n seconds. Triggered Updates: If a metric changes on a link, a router immediately sends out an update without waiting for the end of the update period. Full Routing Table Update: Most distance vector routing protocols send their neighbors the entire routing table (not only entries which change). Route invalidation timers: Routing table entries are invalid if they are not refreshed. A typical value is to invalidate an entry if no update is received after 3 -6 update periods.

The Count-to-Infinity Problem A 1 B 1 C

Count-to-Infinity o o o The reason for the count-to-infinity problem is that each node only has a “next-hop-view” For example, in the first step, A did not advertise that its route (with cost 2) to C went through node B How can the Count-to-Infinity problem be solved?

Count-to-Infinity o o The reason for the count-to-infinity problem is that each node only has a “next-hop-view” For example, in the first step, A did not realize that its route (with cost 2) to C went through node B How can the Count-to-Infinity problem be solved? Solution 1: Never advertise the cost to a neighbor if this neighbor is the next hop on the current path (Split Horizon) n n Example: A would not send the first routing update to B, since B is the next hop on A’s current route to C Split Horizon does not solve count-to-infinity in all cases!

Count-to-Infinity o o The reason for the count-to-infinity problem is that each node only has a “next-hop-view” For example, in the first step, A did not realize that its route (with cost 2) to C went through node B How can the Count-to-Infinity problem be solved? Solution 2: Always advertise the entire path in an update message (Path vectors) n n If routing tables are large, the routing messages require substantial bandwidth BGP uses this solution

RIP - Routing Information Protocol o A simple intradomain protocol o Straightforward implementation of Distance Vector Routing o Each router advertises its distance vector every 30 seconds (or whenever its routing table changes) to all of its neighbors. o RIP always uses 1 as link cost. o Maximum hop count is 15, with “ 16” equal to “ ”. o Routes expire (set to 16) after 3 minutes if they are not updated.

RIP Messages o o Dedicated port for RIP is UDP port 520. Two types of messages: n n Request messages o used to ask neighboring nodes for an update Response messages o contains an update

RIPv 2 Packet Format 2: RIPv 2 1: request 2: response 2: for IP 0… 0: request full routing table Address of destination Cost (measured in hops) One RIP message can have up to 25 route entries

RIPv 2 Packet Format Used to carry information from other routing protocols (e. g. , autonomous system number) Subnet mask for IP address Identifies a better next-hop address on the same subnet than the advertising router, if one exists (otherwise 0…. 0)

Routing with RIP o Initialization: Send a request packet (command = 1, address family=0. . 0) on all interfaces: o o o RIPv 2 uses multicast address 224. 0. 0. 9, if possible requesting routing tables from neighboring routers Request received: Routers that receive above request send their entire routing table Response received: Update the routing table Regular routing updates: Every 30 seconds, send all or part of the routing tables to every neighbor in an response message Triggered Updates: Whenever the metric for a route change, send entire routing table.

RIP Problems o RIP takes a long time to stabilize n o RIP has all the problems of distance vector algorithms, e. g. , count-to-Infinity n o Even for a small network, it takes several minutes until the routing tables have settled after a change Cisco routers use split horizon, hold-down timer, and triggered updates to avoid count-to-infinity The maximum path in RIP is 15 hops.

Main Points of Lab 4 Parts 1~4 o Zebra Quagga Routing Software o RIP n n Configuration Format and content of advertisements Convergence after link failure Count-to-infinity problem

Quagga Extinct animal…

Homework o o o Prelab 4 due on Friday (02. 19. 2010) Lab report 4. 1 due by beginning of lab 4. 2 next week Reading Assignment n Textbook Lab 4 parts 5 ~ 7