Route Calculation of IS-IS Protocol P-0

Confidential Information of Huawei. No Spreading Without

Permission
Route Calculation of IS-IS Protocol P-1

Confidential Information of Huawei. No Spreading Without

Permission
Route Calculation of IS-IS Protocol P-2

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-3

 IS-IS uses the shortest path first (SPF) algorithm to calculate the route. SPF algorithm
is also known as Dijkstra’s algorithm and it can be used to calculate the loop-free
topology according to the link state information. IS-IS builds the routing table based
on the result of the SPF algorithm. To increase the speed of route calculation, IS-IS
adopts PRC and i-SPF calculation method. Link state routing protocols are based on
adjacencies relationship. Each router reports the cost and status of its links. Therefore,
each router in the area is aware of all active links in the area as well as the
information initiated by the routers identified by these links. Each router then sends
the status information to other routers in the network in order to synchronize the
database. Each router is identified by the unique address to avoid repetition. Link-
state routing protocols are based on SPF computation. During the computation of
SPF, each router generates an SPT with itself as the root node and other routers as
leaf nodes, and then calculates the shortest path from root to every other destination.
The IS-IS protocol adopts a hierarchical network structure, calculating the SPTs
based on the Level-1 and Level-2 databases respectively.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-4

 We learn the process of SPF calculation by using this example.

 In this diagram, RTA is the root node ( this indicates that SPF computation is run on
RTA), the numerical number beside the link represents the cost of the link.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-5

 RTA is the root node , we have to consider all the other nodes,A knows that it has 3
directly connected nodes namely B, C and E and the cost to these nodes via the
exchange of the protocol packets.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-6

 From the diagram shown above, the link between A and C is added to the SPT. At
this moment, the link between C and D is selected as backup link. We have to
consider B,E and D.
 The previous steps are repeated. We observe that the cost from E to A is 3 ，which is
the lowest among the B,E and D.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-7

 From the diagram above, there are 2 links in the SPT namely AC and AE. Besides,
there are 3 nodes in the SPT namely A, C and E. The link between E and D is
selected as backup link.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-8

 As depicted in the diagram above, the link between A and B has become part of the
SPT.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-9

 Two equal cost links between D and E have become part of the SPT.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-10

 This diagram shows the SPT in which the A is functioned as the Root.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-11

 If B is functioned as root, the result of the SPF algorithm is shown as above.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-12

 IS-IS does not use the IP prefix to build the SPT. IP prefixes only act as the leaf nodes
in the SPT tree. Therefore, any changes in the IP prefixes will not affect the basic
topology of the SPT. As shown in the diagram, the process of the SPF calculation is
completed and the result of the SPT is shown by using the solid line. One more
interface which is enabled with IS-IS routing protocol is added on RTB. In the diagram
above, Interface loopback 0 with IP address 2.2.2.2/32 is added to RTB. The change
in IP prefix on RTB will not trigger a full SPF calculation.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-13

 i-SPF calculates only the changed routes at a time rather than all the routes. At first, i-
SPF calculates all the nodes. Later, it calculates only the changed nodes for any
changes occur in the network topology. This reduces the CPU utilization and speeds
up the network convergence. However, the i-SPF algorithm increases the calculation
overhead and calculation complexity.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-14

 If a link is not part of the SPT, its interface state (UP or DOWN) will not affect the
computation of i-SPF.

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-15

 D announces its new neighbor, RTG. In this case, SPT needs to be extended outward
from D. A is not necessary to re-calculate the whole SPT. Therefore, A will just
calculate the SPT from D.

Confidential Information of Huawei. No Spreading Without

Permission
Route Calculation of IS-IS Protocol P-16

Confidential Information of Huawei. No Spreading Without

Permission
 Route Calculation of IS-IS Protocol P-17

 Q: Describe the basic concept of SPF calculation.

 A: SPF calculation is shortest path first calculation. It calculates the loop-free topology
based on the link state information of the network.

 Q: Describe the basic concept of PRC.

 A: In the SPT of IS-IS protocol, an IP prefix represent a leaf. Any changes on leaves
will not affect the structure of the tree. Therefore, PRC updates only the changed
leaves (routes) on the node. Full SPF calculation is not required in this case and this
save the CPU resource.

 Q: Describe the basic concept of i-SPF.

 A: When there are any changes in the network, i-SPF calculates only the changed
node. It speeds up the network convergence time.

Confidential Information of Huawei. No Spreading Without

Permission
Route Calculation of IS-IS Protocol P-18

Confidential Information of Huawei. No Spreading Without

Permission