In OSPF, the process of calculating shortest path tree can be divided into two phases, calculate Transit node first, then calculate Stub network.

Question

Quizplus · Accepted Answer

In OSPF, the process of calculating the shortest path tree is divided into two phases: calculating the transit nodes first, and then calculating the stub networks. This is because transit nodes are responsible for forwarding traffic between different areas, while stub networks are only responsible for forwarding traffic within their own area.

In OSPF, the Process of Calculating Shortest Path Tree Can