Page 118 - Handout Computer Network.
P. 118
Figure 5-8 shown a Link-State Routing Protocols
The link-state database is used to calculate the best paths through the network. Link state
routers find the best paths to destinations by applying the Dijkstra Shortest Path First (SPF) algorithm
against the link-state database to build the SPF tree.
The best (shortest) paths are then selected from the shortest-path-first tree and are placed in
the routing table. Examples of link-state protocols are OSPF and IS-IS, as shown in Figure 5-9.
Figure 5-9 shown a Link-State Routing Protocols of OSPF and IS-IS
5.7 Routing Protocol Characteristics
The following sections describe the metrics, network usability, and other significant
characteristics of the most commonly used routing protocols.
136
