rtgwg-1----Page:5
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
|
Control-Plane : Node-Local Computation A router S must compute: For each destination D (via an enhanced SPF) If a neighbor N has indicated that it can break U-turns for traffic coming in an interface, Does that neighbor N have a loop-free node-protecting alternate to reach the destination D? Does that alternate path also avoid the router S’s primary neighbor P? If a loop-free node-protecting alternate is available, select it for use. If not, pick among loop-free link-protecting alternates and u-turn alternates as desired (router-local decision). |