OSPF

LY
N
O
SE
U
AL

SPF Calculation Example: Part 6

N

RTR-D, through its link to router B, is the most recent entry to the tree database. Therefore, its tuples
are moved from the LSDB into the candidate database.
R

All known nodes in the tree database are then removed from the candidate. Thus, the (C,D,4),
(D,B,1), and (D,C,2) tuples are removed because RTR-A already has paths to RTR-B, RTR-C, and
TE

RTR-D. The candidate database is now empty of all tuples, so the algorithm stops at this point.
RTR-A now has a complete network map built with the total cost to each node calculated. This
information is then passed to the Junos routing table for its use.
IN

www.juniper.net 47