Trill shortest path first implementation

摘要

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.