MULTIPLE PATHS COMPUTATION FOR LABEL SWITCHED PATHS
Abstract:
In general, techniques are described for identifying a result set of multiple paths through a network for one or more label switched paths between a source node and a destination node. In some examples, the identified paths are computed to be broadly separate to avoid overlapping network elements. A device that routes the label switched paths to the network may select from the result set of multiple paths to route each of the label switched paths. In response to detecting a failure of a network element along the routed path for a label switched path, the device may select a new path from the result set that includes already-identified paths.
Public/Granted literature
Information query
Patent Agency Ranking
0/0