rtgwg-1----Page:11
1  2  3  4  5  6  7  8  9  10  11  12  13  14  15 

Complexity Analysis: Control Plane
Computational Complexity is O(neighbors)
Neighbors which aren’t available for use as alternates don’t count. (They decrease the complexity to O(alternate-capable neighbors))

Feel free to discuss the details after meeting…
PPT Version