>Algorithms and data structures to store routing table entries for quick lookup (hash? trie?)
>Algorithm optimization (for example, using Cache)
>Reward: The historical evolution of these algorithms (based on the fact that memory has become cheaper, etc.)
Note: The actual creation of the routing table (via routing protocols such as RIP, OSPF or manual entries) is It doesn’t matter.
How the router organizes its routes Table to quickly serve crashed packets? This is more like a programming problem, I’m looking for:
>Algorithms and data structures to store routing table entries for quick lookup (hash? trie?)
>Algorithm optimization (for example, using Cache)
>Reward: The historical evolution of these algorithms (based on the fact that memory has become cheaper, etc.)
Note: The actual creation of the routing table (via routing protocols such as RIP, OSPF or manual entries) is It doesn’t matter.
You can use trie and cache the lookup on the hash. For example, see Linux’s ip_route_input() (it tries to find on the hash Entry) and ip_route_input_slow() (it tries to find the entry in the forwarding repository, a trie).