RIP Migration

RIP Migration
John is the network engineer for company XYZ. Currently, XYZ has only 14 routers and is running
RIPv1. Recently XYZ purchased company ABC. Company ABC had 10 routers that were
also running RIP. John has been tasked with merging the two companies’ networks. John
remembers back when he was studying for the BSCI that RIP has a maximum consecutive
device count of 15. Well, he now has 24 routers and will exceed this limit for a number of paths.
Noticing the dilemma, he decides to implement EIGRP to replace the RIP network. In order to
make sure the company doesn’t lose connectivity, John decides he will implement EIGRP and
leave RIP on the devices until EIGRP is completely implemented. By choosing to do it this way,
John will be able to migrate the two networks together without losing connectivity.

What you need to concentrate on at this point is the commonality among the two versions
of RIP, such as updates and timers:
 They are considered distance-vector routing protocols.
 They use the Bellman-Ford algorithm.
RIP Migration
John is the network engineer for company XYZ. Currently, XYZ has only 14 routers and is running
RIPv1. Recently XYZ purchased company ABC. Company ABC had 10 routers that were
also running RIP. John has been tasked with merging the two companies’ networks. John
remembers back when he was studying for the BSCI that RIP has a maximum consecutive
device count of 15. Well, he now has 24 routers and will exceed this limit for a number of paths.
Noticing the dilemma, he decides to implement EIGRP to replace the RIP network. In order to
make sure the company doesn’t lose connectivity, John decides he will implement EIGRP and
leave RIP on the devices until EIGRP is completely implemented. By choosing to do it this way,
John will be able to migrate the two networks together without losing connectivity.
Components of Routing Data 15
 The metric used to determine the best route is hop count. A route can extend through
15 routers—or hops—and then will be marked as unreachable.
 The route update timer for periodic updates is set to 30 seconds.
 The route invalid timer is set to 180 seconds. This is the time the router will wait for an update
before a route will be marked as unreachable and the holddown timer will be started, which
is also 180 seconds.
 The route flush timer is set to 240 seconds. This is the time between the route’s last received
update and the route being removed from the routing table. In the time period between the
invalid timer and the flush timer, neighboring routers will be notified about the route’s
being unreachable, unless the holddown timer expires before the flush timer does and
updates come in for the route. In that case, business resumes as usual, possibly through a
path less desirable than the original, but one that’s valid and the best known one.
Now that you have a good understanding of how distance-vector routing works, let’s take
a look at link-state routing and its functionality.
If you need to view real-time information about the operation of RIPv1 or RIPv2,
you can use the debug ip rip command.
The ip default-network command can be used with RIPv1 or RIPv2 to advertise
a default network to your neighboring devices.