http://netbsd.i2p/gallery/presentations/joerg/asiabsdcon2013/hashing.html
BPZ with 2-graph and no post-filter: 50% usage, 2 bit per key Separate tables for larger prefixes IPv4: 64bit per entry (32bit network, 32bit next-hop ID) IPv6: from 64bit to 160bit Fits into L3 cache even with 100,000 entries Question: construction time Dynamic branching: less than 2 lookups on average Summary Modern algorithms like CHM, BPZ and CHD are fast and practical Useful for performance sensitive read-mostly data structures Useful for compact...