TRILL shortest path first implementation
First Claim
1. A computer program product for performing a Shortest Path First (SPF) computation in a network, the computer program product comprising a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code being configured to:
- identify a plurality of network elements connected together as a distributed network, operating under a link state protocol (LSP);
identify a change in network topology in the LSP occurring in the distributed network;
determine whether the change in network topology in the LSP impacts an SPF value on the distributed network; and
perform the SPF computation in the distributed network only when the change in the LSP impacts the SPF value.
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.
-
Citations
13 Claims
-
1. A computer program product for performing a Shortest Path First (SPF) computation in a network, the computer program product comprising a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code being configured to:
-
identify a plurality of network elements connected together as a distributed network, operating under a link state protocol (LSP); identify a change in network topology in the LSP occurring in the distributed network; determine whether the change in network topology in the LSP impacts an SPF value on the distributed network; and perform the SPF computation in the distributed network only when the change in the LSP impacts the SPF value. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A network system, comprising:
-
a plurality of network elements connected together in a distributed network; and a server connected to the distributed network, the server being configured to; identify a change in status of one of the network elements in the distributed network, reference a list of predetermined events, determine whether the change in status of one of the network elements corresponds to one of the predetermined events, and compute a shortest path first (SPF) value for the distributed network if the change in status of one of the network elements is not one of the predetermined events. - View Dependent Claims (9, 10, 11, 12, 13)
-
Specification