3 ms·
It doesn't, prefix lookup is solved faster and cheaper in hardware via CAM or TCAM, maybe combined with hashing, because you can limit yourself to a prefix, dis
by corty 6y ago
It doesn't, prefix lookup is solved faster and cheaper in hardware via CAM or TCAM, maybe combined with hashing, because you can limit yourself to a prefix, discarding the rest of the address.
Even if you are right about the endpoints (which only need to know all devices in their specific subtree), as soon as you get to a part of the network where there is no longer just a limited tree below a given router hierarchically, you need a global view of all addresses. This view has to be current, correct and total. That is impossible to achieve, even if the lookup itself would work (which it won't, a conservative estimate of 4 billion active internet devices take up 64GB just for their addresses, not even including routes and metrics). You just cannot search those 64GB fast enough for each packet you are passing through your links (remember, even saturating 10GE in software is hard, and routers do have a lot of those ports in 40 or 100GE...).
- JoeAltmaier 6y agoNobody suggests 'just searching' 64GB (which is not an unreasonable amount of memory today for a core router). Associative lookup is required, as is the case today. Nothing very new is required to create even larger (hashed) associative memories to manage this problem.
- JoeAltmaier 6y agoReally? Can no one else conceive of this? How about, 1M associative memories of 64K, addressed by the 1st 20 bits of the UUID?
- icedchai 6y agoEven if it's possible, what's the point? IPv6 is available now. I've been running it without issue for over a decade.
- JoeAltmaier 6y agoExcept for the long list of 'usual' issues. Allocation, regulation, duplicate IDs, spoofing, and on and on.