本文介绍OSPF路由协议如何使用Dijkstra算法计算最短路径树(SPT)，并详细阐述了增量SPF算法的工作原理及其优势：仅重新计算受影响的部分而非整个树，从而加快OSPF收敛速度并节省CPU资源。
OSPF uses Dijkstra’s SPF algorithm to compute the shortest path tree (SPT). During the computation of the SPT, the shortest path to each node is discovered. The topology tree is used to populate the routing table with routes to IP networks. When changes to a Type-1 or Type-2 link-state advertisement (LSA) occur in an area, the entire SPT is recomputed. In many cases, the entire SPT need not be recomputed because most of the tree remains unchanged. Incremental SPF allows the system to recompute only the affected part of the tree. Recomputing only a portion of the tree rather than the entire tree results in faster OSPF convergence and saves CPU resources. Note that if the change to a Type-1 or Type-2 LSA occurs in the calculating router itself, then the full SPT is performed.
Incremental SPF is scheduled in the same way as the full SPF. Routers enabled with incremental SPF and routers not enabled with incremental SPF can function in the same internetwork.
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
