trill-1----Page:11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
|
Single bcast: summary With reachibility-based MAC announcements… CP is well within the limits of current link-state routing protocols Can comfortably handle O(10k) routes Dynamics are very similar There’s an existence proof that this works CP data overhead is O(N) Worse than IP routing: O(log N) However, net size is upper-bound by bcast limits Small switches will need to store & compute more Data-plane may require bigger MAC tables in smaller switches |