Delayed Convergence Background(why does this happen?)
Well known that distance vector protocols exhibit poor convergence behaviors
- Counting to infinity, looping, bouncing problem
RIP redefines infinity and adds split-horizon, poison reverse, etc.
- Still, slow convergence and not scalable
BGP advertises ASPaths instead of distance
- Solves counting to infinity and RIP looping problem, but…
- BGP can still explore “invalid” paths during convergence (i.e. the bouncing problem)