Route Calculation

The proposed heuristic for route calculation in RFC3626 is a relatively trivial shortest-path algorithm. It can be outlined as:

1. Add all one hop neighbors registered as symmetric to the routing table with a hop-count of 1.

2. For each symmetric one-hop neighbor, add all two hop neighbors registered on that neighbor that has:
   • Not already been added to the routing table.
   • A symmetric link to the neighbor.
   These entries are added with a hop-count of two and next-hop as the current neighbor.

3. Then, for every added node N in the routing table with hop-count $n = 2$ add all entries from the TC set where:
   • the originator in the TC entry == N

   • the destination has not already been added to the routing table

   New entries are added with a hop-count of $n + 1$ and next-hop as the next-hop registered on Ns routing entry.

4. Increase $n$ with one and do step 3 over until there are no entries in the routing-table with hop-count == $n + 1$

5. For all entries E in the routing table the MID set is queried for address aliases. If such aliases exist an entry is added to the routing table with hop-count set to Es hop-count, and next-hop set to Es next-hop for every alias address.