No relevant resource is found in the selected language.

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies. Read our privacy policy>Search


To have a better experience, please upgrade your IE browser.


ME60 V800R010C10SPC500 Feature Description - WAN Access 01

This is ME60 V800R010C10SPC500 Feature Description - WAN Access
Rate and give feedback:
Huawei uses machine translation combined with human proofreading to translate this document to different languages in order to help you better understand the content of this document. Note: Even the most advanced machine translation cannot match the quality of professional translators. Huawei shall not bear any responsibility for translation accuracy and it is recommended that you refer to the English document (a link for which has been provided).
IS-IS Fast Convergence

IS-IS Fast Convergence

IS-IS fast convergence is an extended feature of IS-IS implemented to speed up route convergence. It includes the following concepts:

  • I-SPF

    Incremental SPF (I-SPF) recalculates only the routes of the changed nodes rather than the routes of all nodes when the network topology changes, which speeds up the calculation of routes.

  • PRC

    Partial route calculation (PRC) calculates only those routes which have changed when the network topology changes.

  • Link State PDUs (LSP) fast flooding

    LSP fast flooding speeds up LSP flooding.

  • Intelligent timer

    The first timeout period of the timer is fixed. If an event that triggers the timer occurs before the set timer expires, the next timeout period of the timer increases.

    The intelligent timer applies to LSP generation and SPF calculation.


In ISO 10589, the Dijkstra algorithm was adopted to calculate routes. When a node changes on the network, the algorithm recalculates all routes. The calculation requires a long time to complete and consumes a significant amount of CPU resources, reducing convergence speed.

I-SPF improves the algorithm. Except for the first time the algorithm is run, only the nodes that have changed rather than all nodes in the network are used in the calculation. The SPT generated using I-SPF is the same as that generated using the previous algorithm. This significantly decreases CPU usage and speeds up network convergence.


Similar to I-SPF, PRC calculates only routes that have changed. PRC, however, does not calculate the shortest path. It updates routes based on the SPT calculated by I-SPF.

In route calculation, a leaf represents a route, and a node represents a device. If the SPT changes after I-SPF calculation, PRC calculates all the leaves only on the changed node. If the SPT remains unchanged, PRC calculates only the changed leaves.

For example, if IS-IS is enabled on an interface of a node, the SPT calculated by I-SPF remains unchanged. In this case, PRC updates only the routes of this interface, which consumes less CPU resources.

PRC working with I-SPF further improves network convergence performance and replaces the original SPF algorithm.

On the ME60, only I-SPF and PRC are used to calculate IS-IS routes.

LSP Fast Flooding

When an IS-IS device receives new LSPs from other devices, it updates the LSPs in the LSDB and periodically floods the updated LSPs based on a timer. Therefore, the synchronization of all LSDBs is slow.

With lSP fast flooding, when the ME device receives LSPs that can trigger route calculation or route update, it floods these LSPs before route calculation occurs, which speeds up network convergence and LSDB synchronization throughout the entire network.

Intelligent Timer

Although the route calculation algorithm is improved, the long interval for triggering route calculation also affects the convergence speed. A millisecond-level timer can shorten the interval. Frequent network changes, however, also consume too much CPU resources. The SPF intelligent timer addresses these problems.

In most cases, an IS-IS network running normally is stable. The frequent changes on a network are rather rare, and IS-IS does not calculate routes frequently. Therefore, a short period (within milliseconds) can be configured as the first interval for route calculation. If the network topology changes frequently, the interval set by the intelligent timer increases with the calculation times to reduce CPU consumption.

The LSP generation intelligent timer is similar to the SPF intelligent timer. When the LSP generation intelligent timer expires, the system generates a new LSP based on the current topology. The original mechanism uses a timer with fixed intervals, which results in slow convergence and high CPU consumption. Therefore, the LSP generation timer is designed as an intelligent timer to respond to emergencies (for example, the interface goes Up or Down) quickly and speed up network convergence. In addition, when the network changes frequently, the interval for the intelligent timer becomes longer to reduce CPU consumption.

Updated: 2019-01-04

Document ID: EDOC1100059473

Views: 15606

Downloads: 10

Average rating:
This Document Applies to these Products
Related Version
Related Documents
Previous Next