BGP Best Case
- What is the best we can expect from BGP?
- Implementation of MinRouteAdver timer leads to 30 second rounds
- Time complexity is O(n-3)*30 seconds
- State/Computational complexity O(n)
- At its best, BGP performs as well as RIP2 (but uses exponentially more memory in the process)