A Discrete-Event Network Simulator
API
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
RIP

The RIP protocol (RFC 2453) is a unicast-only IPv4 IGP (Interior Gateway Protocol). More...

Classes

class  ns3::Rip
 RIP Routing Protocol, defined in RFC 2453. More...
 
class  ns3::RipHeader
 RipHeader - see RFC 2453 More...
 
class  ns3::RipRoutingTableEntry
 Rip Routing Table Entry. More...
 
class  ns3::RipRte
 Rip v2 Routing Table Entry (RTE) - see RFC 2453. More...
 

Detailed Description

The RIP protocol (RFC 2453) is a unicast-only IPv4 IGP (Interior Gateway Protocol).

Its convergence time is rather long. As a consequence, it is suggested to carefully check the network topology and the route status before sending data flows.

RIP implements the Bellman-Ford algorithm (although the RFC does not state it). Bellman-Ford algorithm convergence time is O(|V|*|E|) where |V| and |E| are the number of vertices (routers) and edges (links) respectively. Since unsolicited updates are exchanged every 30 seconds, the convergence might require a long time.

For the RIP protocol, the exact convergence time is shorter, thanks to the use of triggered updates, which are sent when a route changes. Even with triggered updates, the convergence is in the order of magnitude of O(|V|*|E|) * 5 seconds, which is still quite long for complex topologies.

Todo:
: Add routing table compression (CIDR). The most evident result: without it a router will announce to be the default router and more RTEs, which is silly.