Routing alternatives
Provide a map at every intersection:
- These maps should be consistent
- Find the min-distance path to each destination from that intersection (just like AAA-style)
- Then, point their next-hop in the right direction
- Called “link-state routing”: because map is maintained in terms of link-states
Provide a marker to every destination along with the currently best-known distance to that destination
- The next-hop points in the min-distance direction
- Update markers by simply exchanging markers and seeing if there is a new min-distance path per-destination
- This is known as “distance-vector” routing.