This exercise says: "Now at this point you may or may not see some routing loops involving RIP networks. This can happen if R5 processes the update from R2 faster then R6 does, and R6 learns the route via EIGRP before it learns it via OSPF. At that point R6 will redistribute those routes into OSPF and R2 will install the route via OSPF. This breaks redistribution from RIP into OSPF because there will be no more RIP routes available!"
To illustrate: R1 |---0RIP R2 R4 | \ / \ \FR/ 0-OSPF | / \ R5/ \R6 So if i get it right what is happening here : R2 redistributes from RIP into OSPF, R5 might process it quicker and redistribute it over EIGRP, R6 might be slower and instead of getting it over the OSPF network it gets it through the EIGRP process, and redistributes that back into OSPF. R2 then installs that route as it has a lower AD then the RIP process, so no RIP routes will be in the routing table. As there is now nothing to redistribute (i.e. no RIP routes in the routing table) (i think i should see the redistribution process mentally of what's actually IN the routing table), the route R5 has now becomes invalid after a while and again R2 will start redistributing as all routes are gone and the cycle repeats itself. Can anyone confirm? Many thanks, Alef _______________________________________________ For more information regarding industry leading CCIE Lab training, please visit www.ipexpert.com Are you a CCNP or CCIE and looking for a job? Check out www.PlatinumPlacement.com
