Routed Information Protocol

1
Routed Information Protocol

• Presenter
• Graham C Herd

2
Agenda

• Introduction
• Limitations of the protocol
• Specifications for the protocol
• Overview

3
Introduction

• Routed Information Protocol known as RIP
• Describes one protocol in a series of routing
  protocols based on the Bellman-Ford (or distance
  vector) algorithm
• This algorithm has been used for routing
  computations in computer networks since the early
  days of the ARPANET
• RIP is one of a class of algorithms known as
  "distance vector algorithms".
• RIP is intended for use within the IP-based
  Internet
• It has become a de facto standard for exchange of
  routing information among gateways and hosts

4
Limitations of the protocol

• Longest path involves 15 hops
• Depends upon "counting to infinity"
• Uses fixed "metrics"

5
Specifications for the protocol

• Routing Table Entry
• Message Formats
• Addressing Considerations
• Timers
• Input processing
• Output processing

6
Overview

• Parameter RIP Default Value
• Infinity 16 (fixed)
• Update time 30 sec
• Invalid time 180 sec
• Flush time 120 sec
• Holddown Not used
• Width restriction
• No direct subnet support
• Bandwidth consumptive
• Difficult diagnosis
• Weak security
• Several benefits

7
Thank You !

• Any Questions ?