Compute a shortest-path tree
04Each router computes routes from its link-state database using the shortest-path calculation.
Related RFCs and changes
“Updates” changes part of an earlier RFC. “Obsoletes” replaces it. This list shows selected related documents.
RFC 2328 · § 16.1 — Shortest-path treeEXAMPLE
3 / 3
03
Install the shortest-path next hop or equal-cost set.
Install the shortest-path next hop or equal-cost set.
Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
Read the updated RFC section ↗
The root is the calculating router; link costs determine the illustrative path choice.
- The root is the calculating router; link costs determine the illustrative path choice.
- Equal-cost multipath is possible; this is not an unconstrained policy protocol like BGP.
The drawing is a simplified worked example. Follow the linked RFC and its updates for implementation requirements.
Read the RFC section ↗Diagrams simplify the RFC. Read the linked sections for complete requirements.
Privacy