Functions of a RIP Message, Shortcomings and Their Fixes

Functions of a RIP message

RIP (Routing Information Protocol) is a distance-vector protocol that exchanges routing information in UDP datagrams (port 522) with directly connected neighbours. Its message functions are:

1. Request message: asks neighbours to send part or all of their routing tables. Sent at router startup (to discover neighbours) or when a router suspects an inconsistency.
2. Response message (update): carries routing entries - address family, IP address, next hop and metric (hop count). Sent
   • every 30 s as a periodic full-table update,
   • as a triggered (partial) update immediately when a route changes or a link fails,
   • as a direct reply to a request message.
3. Route lifetime management: an entry becomes invalid after 180 s without an update (enters hold-down) and is flushed after 240 s - this ages out stale routes.
4. RIPv2 additions: carries subnet masks (VLSM/CIDR), next-hop address, route tags, multicast updates to 224.0.0.9 and authentication data.

Shortcomings of RIP and their corresponding fixes

Shortcoming	Corresponding fix
Count-to-infinity - loops and extremely slow convergence when a link fails	Split horizon, poison reverse, hold-down timers, triggered updates, and the hard metric cap of 15 hops
Metric is only hop count - a 64-kbps link can be preferred over a 1-Gbps link	Use a bandwidth/delay-aware metric: OSPF cost (based on bandwidth) or EIGRP's composite metric
Periodic full-table flooding every 30 s wastes bandwidth	Triggered (event-driven) and partial updates
Slow convergence due to periodic updates	Triggered updates + hold-down timers; otherwise migrate to link-state routing (OSPF)
No authentication - a rogue router can poison routes	RIPv2 simple password / MD5 authentication
Classful, no subnet mask / VLSM support	RIPv2 advertises subnet masks and supports CIDR; uses multicast instead of broadcast
Poor scalability (15-hop limit, no route redistribution policy)	Move to OSPF/IS-IS (link state) or BGP (path vector)
Single path only (no load balancing on unequal paths)	Equal-cost multi-path (ECMP) in OSPF, or adaptive routing

Summary: RIP's simplicity makes it easy to configure for small networks, but its hop-count metric, periodic updates and count-to-infinity behaviour are fundamental limitations. Split horizon, poison reverse, hold-down and triggered updates mitigate them locally, while OSPF removes the causes by using link-state flooding with a cost metric.