In article <[email protected]> you write: >Comments eagerly sought, of course.
This seems sorta kinda like my dbound draft, only with _tagged TXT records rather than a new rrtype, and (unless I missed something) a hope that somehow you can use a yet to be invented cache to avoid walking up the tree, where mine used wildcards to do one lookup per boundary regardless of the tree depth. I can see that the tradeoffs are different but I don't see why they're better. R's, John >A new version of I-D, draft-dcrocker-dns-perimeter-00.txt >has been successfully submitted by D. Crocker and posted to the >IETF repository. > >Name: draft-dcrocker-dns-perimeter >Revision: 00 >Title: DNS Perimeter Overlay >Document date: 2019-04-02 >Group: Individual Submission >Pages: 20 >URL: >https://www.ietf.org/internet-drafts/draft-dcrocker-dns-perimeter-00.txt _______________________________________________ dmarc mailing list [email protected] https://www.ietf.org/mailman/listinfo/dmarc
