38
Routing Table (2)
nCalculated
using a shortest path algorithm
nAssuming existence of:
Iface_b
d1
NH_B
Dest_2
2
Iface_a
d0
NH_A
Dest_1
1
Interface address
Hop Distance
Next Hop address
Destination address
ID
Example of Routing Table
In Neighbors set
In 2-hops Neighbors set
In Topology set as:
Destination
Previous Hop
Source
Additional Intermediate nodes