Anda di halaman 1dari 26

Routing Information Protocol

RIPv1 & RIPv2

Topics
Overview Autonomous System Routing Hierarchy Distance Vector Routing RIP (Routing Information Protocol)
Overview Packet Format Algorithm

Sniffed Packets
RIPv1 & RIPv2

Timers Count to Infinity

Overview
Routing Types
Static Dynamic

Routing Algorithms
Bellman-Ford Dijkstra

Routing Protocols
Distance Vector Link State

Autonomous System

Routing Hierarchy

Routing Hierarchy
Interior Gateway Protocols
RIP OSPF IGRP/EIGRP

Exterior Gateway Protocols


EGP BGP CIDR, Policy Routing

Multicasting
IGMP PIM etc

Routing Hierarchy

Distance Vector Routing


Features
Sharing knowledge about entire AS Sharing only with neighbors Sharing with regular interval

Distance Vector Routing Table


Destination Network Hop Count Next Hop Router Other Information (Subnet Mask)

RIP (Routing Information Protocol)


Distance Vector using Bellman ford Designed at UC Berkeley First RFC was 1058, current RFC is 2453 (????) RIP uses hop count metric (Max Hop Count is 15, 16 means unreachable/infinity) RIP messages are transmitted using UDP at port 520 RIPv1
used only for classful routing uses broadcasts (255.255.255.255) to update its routing tables.

RIPv2
used for classless routing (VLSM/CIDR) uses multicasts (224.0.0.9) to update its routing tables.

RIP Packet

RIP Packet
Command. 8 bits Value 1 Description Request. A request for the responding system to send all or part of its routing table. Response. A message containing all or part of the sender's routing table. This message may be sent in response to a request, or it may be an unsolicited routing update generated by the sender. Trace on.Obsolete. Trace off.Obsolete. SUN reserved. Triggered request. Triggered response. Triggered acknowledgement. Update Request. Update Response. Update Acknowledge. References

2
3 4 5 6 7 8 9 10 11

RFC 1582 RFC 1582 RFC 1582 RFC 2091 RFC 2091 RFC 2091

RIP Packet
Family of NET 1
Value 2 for IP Network Address

Next Hop
Address of next routing node

Packets are normally sent every 30sec


Route Update Timer

If a route is not refreshed within 180(?) seconds, distance is set to infinity and later entry is removed Maximum Packet Size
512 Bytes (up 25 entries per message)

RIP Packet

RIP Packet

RIP Example

RIP Updating Algorithm


On each Response RIP Message
Add one hop to the hop count for each advertised destination for each advertised destination
if destination is not in table
add this advertisement in routing table

else if ( next-hop field is the same as sender )


replace existing routing entry

else if (advertised hop-count smaller than one in the table)


replace entry in the table

return.

RIP Updating Algorithm

RIP Updating Algorithm

RIP Updating Algorithm

RIPv1 - Request

RIPv1 Response

RIPv2 Response

RIPv2 Response (Network Unreachable)

RIP Timers
Route Update Timer: Sets the interval, usually 30 seconds, between periodic routing updates, in which the router sends a complete copy of its routing table out to all neighbor routers. Route Invalid Timer: Determines the length of time that must expire, usually 90 seconds, before the router determines that a route is invalid. It will come to this conclusion if it doesn't hear any updates about that route for that period. When the timer expires, the router will send out an update to its neighbors letting them know that the route is invalid. Route Flush Timer: Sets the time between a route becoming invalid and its removal from the routing table (240 secs). Before it's removed, the router will notify its neighbors of that route's impending doom ! The value of the route invalid timer must be less than that of the route flush timer. This is to provide the router

Count to Infinity

Count to Infinity - soultions


Split Horizon
If A reaches a destination through B, it makes no sense for B to reach the same destination through A Instead of broadcasting the same distance vector on all links, send different versions on each outgoing link by removing the entries for the destinations that are reachable through that link

Route Poisoning
Alternative to split horizon, when a router receives information about a route from a particular network, the router advertises the route back to that network with the metric of 16, indicating that the destination is unreachable.

Triggered Updates
A gateway is required to send an immediate update when any route changes. This reduces the occurrence of loops Flood of triggered updates resolves loops faster when these happen

Anda mungkin juga menyukai