To be more clear:
Code: Select all
N
|
A
/ \
B H
| |
C G
| |
D F
\ /
E
1) If H fails, F and G are declared unreachable, but they aren't because I can reach them from E.
2) With H already failed and having G as an important network node (while H is not so important and doesn't require immediate attention), if F fails I will not get any alert (because F and G are unreachable)
This is only an example, my actual network is far more sophisticated and has a lot of redundant paths, sometimes on L2 layer (breaking loops with STP) and sometimes at L3 (defining routes with BGP/OSPF).
I understand that there are at least two different problems with circular parent/child relations: one is making the map and the other one is preventing the recursive checking engine to end up in an endless loop. Is there any solution?
Bye