CODEWITHSUNDEEP
data-structuresipv6ipv4trie
SnickersAreMyFave
SnickersAreMyFave

Reputation: 5143

IPv6 lookup data structure

A patricia trie is the well-know, recommended data structure for storing IPv4 allocations/assignments and performing lookup.

Is this true for IPv6 adddresses too? Just a deeper/taller trie to accommodate the extra 96 bits? Is the trie still patricia, or a different radix trie?

Upvotes: 6

Views: 1899

Answers (1)

schot
schot

Reputation: 11268

You can still use Patricia tries with a bigger depth, but the problem is the performance degrades linearly with the trie depth. Designing specialized data structures for IPv6 lookup is an active field. Recent publications include:

I don't know of any available (open source) implementations of these data structures.

Upvotes: 5

Related Questions