The naming of copyrighted trademarks in this manual, even when not specially indicated, should not

Notes:
be taken to mean that these names may be considered as free in the sense of the trademark and
tradename protection law and hence that they may be freely used by anyone.

© 2015 Hirschmann Automation and Control GmbH

Manuals and software are protected by copyright. All rights reserved. The copying, reproduction,
translation, conversion into any electronic medium or machine scannable form is not permitted, either
in whole or in part. An exception is the preparation of a backup copy of the software for your own
use. For devices with embedded software, the end-user license agreement on the enclosed CD/DVD
applies.

The performance features described here are binding only if they have been expressly agreed when
the contract was made. This document was produced by Hirschmann Automation and Control GmbH
according to the best of the company's knowledge. Hirschmann reserves the right to change the
contents of this document without prior notice. Hirschmann can give no guarantee in respect of the
correctness or accuracy of the information in this document.

Hirschmann can accept no responsibility for damages, resulting from the use of the network
components or the associated operating software. In addition, we refer to the conditions of use
specified in the license contract.

Printed in Germany
Hirschmann Automation and Control GmbH
Stuttgarter Str. 45-51
72654 Neckartenzlingen
Germany
Tel.: +49 1805 141538

1
 Notes:
 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.

 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 netmask prefix.

 RIP router regularly exchanges every 30 seconds the content of its entire
routing table with its direct neighbor. Every router knows only its own routes
and the routes of its direct neighbor. Thus it only has a local perspective.

 Today two version of RIP are existing:

 RIP v1 (RFC 1058) does not support subnetting and distributes the routing
table via Broadcast in plain text.
 RIPv2 (RFC 2453) offers subnetting (propagates the netmask) and uses
multicasts to the IP address 224.0.0.9 instead of broadcasts. RIPv2 also
offers authentication with a simple password, which is transported in plain
text, and acc. to RFC 2082 alternatively with MD5.

2
 Notes:
 When you start a router, the router only knows the networks directly connected
to it. Direct connected networks have hop count = 1.

 Now the router starts to forward its current routing table.

3
 Notes:
 As soon as router R1 receives the first update from router R2 and R3, router
R1 will update its routing table with the information provided by router R2 and
R3.

 Router R2 and R3 will learn in the same way new networks via their neighbor
routers.

4
 Notes:
 In this example router R1 knows now all networks after the second update.

 The network 10.6.0.0/24 is from point of view of router R1 reachable via router
R2 and R3 with the same hop count. While RIP doesn’t support load sharing
router R1 needs to decide which neighbor router it will use to reach this
network. In this case a RIP router will use the neighbor, which provides first the
information about this network. In this example router R2 informs Router R1
first, so router R1 will use Router R2 as the next hop.

·
RIP no
soporta ECMP balanceo de
carga
le
=>
Escoge la ruta
' primero llegue o se registre .

5
 Notes:
 The biggest problem with RIP is that routers only know their neighbors directly.
This results in long convergence times and the count-to-infinity problem. Infinity
refers to the inaccessibility of a destination, and it is designated by hop count
16 in RIP. Thus the hop count 16 specifies the maximum size of a network with
RIP as the routing procedure. The longest paths may use up to 15 routers.

 Normal state:
 Router B propagates its connected networks
 Router C propagates also. In the process router B recognizes that its own
entry to the networks “A” and “B” is better, therefore nothing changes.

6
 Notes:
 After failure of router A router B still propagates the old values.

 If router B does not receive any updates from router A for 6 times the update
interval (6 * 30 s = 180 s), router B changes the hop count of the route to the
network 192.168.0.0./24 to 16 (unreachable).

 The entry for the interface is listed for another 120 s. Then the garbage
collector deletes the entry if not before a new route to the network is detected.

 In this example router B receives an update from router B for the network
192.168.0.0/24 with e better metric. Now router B accepts the new route via
Router C to the network 192.168.0.0/24.

7
 Notes:
 Router B with the next update propagates the new value for network
192.168.0.0/24 to router C which will update its entry. The hop count increases.

 The routers B and C would keep sending their routing tables until the metric
reached a value of 16. Then the routers recognize that the destination is
inaccessible.

8
 Notes:
 Using the “Split Horizon” approach eliminates this looping problem between
two neighboring routers.

 Split Horizon omits the entries known by a neighbor when sending the routing
table to this neighbor.

 In this example, Router B do not forward the information about the network
10.0.0.0/24 in direction to Router C.

9
 Notes:
 Simple split horizon with poison reverse sends the routing table to a neighbor
with the entries known by this neighbor, but denotes these entries with the
infinity metric (=16).

10
 Notes:
 Split-Horizon can only be prevent routing loops of two routers, but won‘t help if
3 routers are in a loop and every router refers to the next one. Here the
process stops when the metric „infinity“ (network unreachable) is reached.

 Triggered Updates are an attempt to speed up this convergence. Whenever a

router changes a metric for a route, it is required to send the updated routing
table immediately and not with the next regular update. If a Triggered Update
has no effect on the metric of another router - because it uses a different route
to the destination - then that router won‘t transmit Triggered Updates.

 Triggered Updates have to keep a minimum distance of 1-5 s (random).

11