Trill shortest path first implementation
First Claim
1. A method of implementing a Shortest Path First (SPF) computation, comprising:
- identifying a plurality of network elements connected together as a distributed network;
identifying one or more predetermined events occurring in a status of one of the plurality of network elements in the distributed network under a link state protocol (LSP); and
implementing, by a processor, the SPF computation only for a multicast distribution in the distributed network except when the identified one or more predetermined events trigger a change in the LSP, wherein the one or more identified predetermined events includes a change in a distribution tree.
1 Assignment
0 Petitions
Accused Products
Abstract
A shortest path first (SPF) computation in a distributed network may be performed efficiently by performing the SPF computation in stages. Rather than perform a new SPF computation every time a change occurs affecting a link state within the distributed network, a routing protocol may identify the change and determine if the impact to the link state necessarily needs the new SPF computation. For example, a predetermined list of events may identify changes that may not necessarily impact the SPF value(s) currently associated with the distributed network. Embodiments disclosed may avoid computation of the new SPF for changes to the link state thus managing network system resources more efficiently.
9 Citations
5 Claims
-
1. A method of implementing a Shortest Path First (SPF) computation, comprising:
-
identifying a plurality of network elements connected together as a distributed network; identifying one or more predetermined events occurring in a status of one of the plurality of network elements in the distributed network under a link state protocol (LSP); and implementing, by a processor, the SPF computation only for a multicast distribution in the distributed network except when the identified one or more predetermined events trigger a change in the LSP, wherein the one or more identified predetermined events includes a change in a distribution tree. - View Dependent Claims (2, 3, 4, 5)
-
Specification