Rip - Hirschmann Power MICE User Manual

RIP

6 RIP
The Routing Information Protocol (RIP) is a routing protocol based on the
distance vector algorithm. It is used for the dynamic creation of the routing
table for routers.
When you start a router, the router only knows the networks directly connect-
ed to it, and it sends this routing table to the neighboring routers. At the same
time, it requests the routing tables of its neighboring routers. The router adds
this information to its routing table and thus learns which networks can be
accessed via which routers, and how much work is involved in this. In order
to detect changes in the network (when a router fails or starts), the routers
regularly repeat the exchange of all the routing tables, usually every
30 seconds. This involves a considerable bandwidth requirement in large
networks.
The costs, also known as the metric, refer to the work involved in accessing
a particular network. RIP uses the hop count for this, which describes the
number of routers that are traversed along the path to the destination net-
work. The name 'distance vector' is derived from the fact that the distance
(metric) is the criterion for determining the route, and the direction is specified
by the next hop (vector). The next hop refers to the neighboring router along
the path to the destination address.
An entry in the routing table consists of the address of the next hop, the
destination address and the metric. The RIP routing table always contains
the most efficient route to the destination. This is the route with the smallest
metric and the longest suitable network mask prefix.
Routing L3E
63
Release 4.2 08/08