4.12 - Design Issue in the task?
I have 2 issues with task 4.12.
1. Does the task 4.11 set the problem correctly that task 4.12 is supposed to solve? I think that if you'll perform all redistributions stated in 4.11, it's not necessarily that you'll get a loop between R5, R1 and R4 for original RIP networks. I think it only depends on the order of operations. For example if you do the 4.11 task line by line where redistribution on R5 is requested in the second place (before redistribution on R1), then you'll not get any loops. The reason in my opinion is that if R5 manages to redistribute RIP into OSPF first (before R1 redisrtributes from EIGRP), then R1 will receive those routes via OSPF and will install them in his routing table. Once this happens, R1 will never install these routes from EIGRP because of worse AD of external EIGRP (170) vs OSPF (110). Therefore R1 will not redistribute them into OSPF himself. Therefore R5 will keep all his original RIP routes and everything will work fine wothout any loops. It's only if R1 redistributes them first and R5 learns them through OSPF, pointing to R1, you'll get a loop as R1 will be pointing to R4 for them, R4 to R5 and R5 back to R1. This can happen after reload of the routers and if R1 will load and perform redistribution first (before R5 performs redistribution). Basically, they cancel each other redistribution. Please correct me if I am wrong here and share your thoughts.
2. Secondly, in the event that we do have loops (second option as described above) I don't understand why do we need to prevent redistribution of original RIP routes back into RIP on R5 (all tagging and filtering based on those tags as SG suggests). Wouldn't just setting AD for OSPF external to 121 on R5 do the trick? If all OSPF external routes are given AD of 121, R5 wouldn't install those routes into his routing table because he has them with better AD of 120 from RIP and therefore shouldn't redistribute them back into RIP? What am I missing here? Please help to understand.
Thanks in advance!