OSPF

LY
N
O
SE
U
AL

SPF Calculation Example: Part 4

N

RTR-B is the most recent entry to the tree database, so all RTR-B’s 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 (B,A,3) tuple is
removed because RTR-A already has the shortest path to RTR-A.
TE

The cost to each neighbor ID from the root is then calculated. It costs RTR-B 3 to reach RTR-D, and it
costs 1 to reach RTR-B from the root. Therefore, the total cost to reach RTR-D from the root through
RTR-B is 4.
IN

The lowest cost tuple in the candidate database, (A,C,2), is now moved over to the tree database,
and RTR-C is placed on the network map.
The candidate database is not empty, so the algorithm continues.

www.juniper.net 45