February 2000
Intermediate to advanced
387 pages
7h 36m
English
OSPF works with directed graphs, as shown in Figure 6-2(a). The graphs contain values between two points, the interfaces between two routers (their link interfaces). The values represent the weighted shortest path value with the router established as the root. Consequently, the shortest path tree from the router to any point in an internet is determined by the router performing the calculation. The calculation only reveals the next hop to the destination in the hop-to-hop forwarding process. The link state database used in the calculation is derived from the information obtained by advertisements sent by the routers to their neighbors, with periodic flooding throughout the routing domain.
The information ...
Read now
Unlock full access