A while back I wrote a draft that put a B-tree in the DNS, for fairly
efficient prefix matches for lookups, with the intended application being
IPv6 DNSBLs. Last year I wrote a draft that put a state machine for a DFA
for regular expressions in the DNS, to do more general string pattern
matching, with the intended application being e-mail address local parts.
Or look at the DBOUND drafts that Casey Deccio and I wrote, that use
wildcards in parallel subdomains to publish boundary info sort of like the
PSL.
Hm... interesting. For me the question is, do these ideas affect the
fundamental architecture? If I understand them, they are
transformations that take place on queries at specific labels, right?
The hierarchical nature of the DNS remains, right?
In the first two of those applications, I was just using the DNS as a flat
key store. For the B-trees, the labels were just block numbers, e.g.
48933.blacklist.example. For the DFA, the labels were state numbers and
tokens, e.g. if you were in state 123 and your next character was an A,
the node name would be 41.123.somenames.example (41 is the hex ASCII for
A.) In that latter case I made the character leaf node so I could use
*.123.somenames.example for the common case where there's a default rule
for all the letters that don't have explicit rules.
For the PSLish stuff, I used wildcards and the closest encloser rule so if
you wanted to find the boundary for, say, www.bigbank.co.uk, you'd look up
www.bigbank.co._ob.uk (_ob is organizational boundary) and that would be
matched by *.co._ob.uk since co.uk is a boundary.
I'm not sure how helpful this is, but do keep in mind that just because
you don't use some feature of the DNS, it doesn't mean other people don't
use it.
Regards,
John Levine, jo...@taugh.com, Taughannock Networks, Trumansburg NY
Please consider the environment before reading this e-mail.
_______________________________________________
DNSOP mailing list
DNSOP@ietf.org
https://www.ietf.org/mailman/listinfo/dnsop
