I am just trying to clarify in my mind what happens in BGP routing.
Lets say in my example B,C,D run IBGP and A and B are different EBGP neighbors.
A advertises route to B.
B propogates the route to C and D, and D will advertise the route to E. So the route will be in A,B,C,D,E (I guess B also advertises it back to A)
B propogates the route to C but because of the synchronisation rule C won't pass it to D and D can't pass it to E?
If I then assume B,C,D are fully meshed, then I guess B,C,D get the route propogated, but D still can't advertise the route to E?
Hopefully Im on the right track. It seems that when I write it out like that it makes sense.