| 摘要 |
Connection constraints are flooded using an extension to a routing protoc ol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constr aints. If a node is on a calculated route for a connection it will install f orwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restorat ion paths for the connections on a network-wide priority basis to enable res toration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events t o be applied by nodes in a consistent order regardless of the order in which they arrive. |
