Method and system to calculate multiple shortest path first trees
AssigneeCisco Technology, Inc.
InventorsVarun Shah, Madhukar Anand
Life of this patent
Estimating the term…
Abstract
An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.
Claims20
A method to be performed in conjunction with a processor that executes computer instructions for performing the method, the method comprising:
- identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network;
- applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node;
- and
- establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.
An apparatus comprising at least one processor and at least one memory, the at least one memory including computer program instructions that, when executed by the at least one processor, cause the apparatus to:
- identify a plurality of distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network;
- apply the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node;
- and
- establish a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.
A non-transitory computer readable medium comprising instructions that, when executed by a processor, cause an apparatus to:
- identify a plurality of distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network;
- apply the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node;
- and
- establish a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.
Dependencies are inferred from the claim text.