Downloaded 52 times
Uploaded bySaranya Parthasarathy
Routing information protocol
RIP (Routing Information Protocol) is a distance-vector interior gateway protocol that uses hop count as its routing metric. It works by having routers periodically share their full routing tables with neighbors every 30 seconds. RIP has a maximum hop count of 15 and routes exceeding this are considered unreachable. While simple to implement, RIP has limitations in scalability and slow convergence for large networks.
More Related Content
Similar to Routing information protocol
Routing information protocol
- 1. ROUTING INFORMATION PROTOCOL (RIP) BY T.P. SARANYA 111705032 MCA(LE) II
- 2. Why routing informationprotocol ? modified hop count - highest cost Others push less info about themselves RIP pushes its info for every 30 seconds 8/4/2018 2
- 3. Objectives Routers Routingprotocols Distance vector algorithm RIP How it works ? Advantages and disadvantages of RIP 8/4/2018 3
- 4. Introduction Routing – •Moving packets across a network from one host to another. • Mostly performed by routers. Why routing ? • to move packets between large network 8/4/2018 4
- 5. Routers • Simple hardwaredevice • Perform traffic directing functions • Main function - Store and forward packets • Works in physical, data link and network layer • Inside an Autonomous system 8/4/2018 5
- 6.
- 7.
- 8. Autonomous system (AS) a group of networks and routers under a single administration 8/4/2018 8
- 9.
- 10. Routing protocols specifieshow routers communicate with each other distributes information that enables them to select routes between any two nodes 8/4/2018 10
- 11. Types of routingprotocols Interior routing protocol Exterior routing protocol 8/4/2018 11
- 12.
- 13. 8/4/2018 13 Interior routing protocols Works within an autonomous system Passes info between routers within AS Also known as Interior gateway protocol (IGP) and Intra domain protocol
- 14.
- 15. Interior routing protocoltypes Routing information protocol (RIP) Open shortest path first (OSPF) Interior gateway routing protocol (IGRP) 8/4/2018 15
- 16. Routing information protocol(RIP) Implements using distance vector algorithm max of 15 hops advertisement every 30 seconds to all neighbors 8/4/2018 16
- 17. RIP (contd.) uses1 as link metric Maximum hop count is 15, with 16 equal to Routes are timed out (set to 16) after 180 seconds if they are not updated Used in WAN 8/4/2018 17
- 18. Distance vector routing 8/4/2018 18 the best route with shortest distance One router counted as a hop A router knows the whole network Routing only to neighbours Info shared at regular intervals
- 19. Routing table Eachrouter maintains a routing table Consists of destination node, cost and the next hop 8/4/2018 19
- 20. 8/4/2018 20 Network id CostNext hop ........ ........ ........ ........ ........ ........
- 21. How it works? 8/4/2018 21 1. Receive: a response RIP message 1. Add one to the hop count for each advertised destination 2. Repeat for each advertised destination a. If ( destination is not in my routing table) 1) Add the destination to my table b. Else If ( next-hop field is the same) 1) Replace existing entry with the new advertised one c. Else if (advertised hop-count –after incrementing- is smaller) 1) Replace existing entry with the new advertised one
- 22.
- 23.
- 24.
- 25. How RIP works? RIP Message Format Request and Response Timers in RIP RIP Version 2 Encapsulation 8/4/2018 25
- 26. RIP Router sendsand receives packets Tables as packets Requests neighbours to send packets Responded with tables as packets 8/4/2018 26
- 27.
- 28.
- 29. RIP message format COMMAND Type of message (8 bits) Request or response VERSION Version 1 Version 2 8/4/2018 29
- 30. RIP message format NETWORK ADDRESS Destination address ALL 0’S Space for expansion of future protocols 8/4/2018 30
- 31. RIP request andresponse Request Requests neighbours to send distance vector table with specific subset or all contents Response Responded by a device with info in its local distance vector table 8/4/2018 31
- 32. RIP request Startuprouter requests for full routing table Response message is sent by RIP-enabled neighbours It sends a triggered update with its own routing table to all RIP-enabled neighbours 8/4/2018 32
- 33.
- 34. RIP response Solicitedresponse Sent in response to request Unsolicited response sent every 30s or when there is a change in routing table 8/4/2018 34
- 35.
- 36. Periodic timer 8/4/2018 36 Periodictimer Within 25-35 seconds Controls ads of regular update messages Counts down to zero (0) If zero reached, update message sent to all routers and timer is reset
- 37. Expiration timer Within180 seconds Governs validity of a route If no update message is received within 180 seconds, route is considered expired and hop set to 16 8/4/2018 37
- 38. Garbage collection timer Within 120 seconds Advertising failure of a route If route is invalid, it is kept with cost 16 and not removed from table If count is zero, route removed from table 8/4/2018 38
- 39.
- 40. RIP vs. RIPv2 Multicast addressing (224.0.0.09) Supports VLSM Supports classless inter domain routing (CIDR) Supports authentication Supports discontinuous network 8/4/2018 40 Broadcast addressing (255.255.255.255) Doesn’t support VLSM Doesn’t support classless inter domain routing (CIDR) Doesn’t support authentication Doesn’t support discontinuous network
- 41. RIP security Issue:Sending fake routing updates to a router RIPv1: No protection RIPv2: Simple authentication scheme 8/4/2018 41
- 42. Advantages of RIP Very easy to understand and configure Guaranteed to be supported by all routers Supports load balancing Loop free 8/4/2018 42
- 43. Disadvantages of RIP Inefficient Slow convergence in larger networks Limited scalability with max 15 hops 8/4/2018 43
- 44. Conclusion RIP usesdistance vector algorithm RIP V1 message format RIP V2 message format Differences 8/4/2018 44
- 45.