On Wed, Nov 26, 2014 at 3:45 AM, Franck Martin <fmar...@linkedin.com> wrote:
> You may want to read > https://www.m3aawg.org/sites/maawg/files/news/M3AAWG_Inbound_IPv6_Policy_Issues-2014-09.pdf I'm well aware of the issues of cache efficiency and query volumes due to the vast address space. The solution to just cut off at /64 is nice, but there will be many legitimate cases where this is will not be "good enough". That's why I am convinced that in the end we will need something like a "tree walk" algorithm, where an "intelligent" algorithm starts at (let's say) a /32 boundary and then gets responses to the best fitting response. Yes, such an approach might initially double the amount of queries and has an increased risk of not getting DNS responses, but on the other hand such "tree information" can be nicely cached with reasonably long TTLs, even for the fast-paced DNSBLs out there. Maybe such a tree-walk algorithm is worth an experiment as a SpamAssassin plugin? -- Matthias
