ccamp-3 Page:3
1  2  3  4  5  6  7  8 

1. Defining a Neighborhood to Meet Time Constraint Example of neighborhood sub-graph for Link Protection The set of nodes reachable by the end nodes of the failure, and the set of links that are connected by these two nodes A protection path is calculated by any protection algorithm, while considering only nodes in the neighborhood sub-graph indicates a node that can be reached within the time constraint by the nodes at each end of the link failure