All At the end of Tuesday's session we're having Bert Hubert from Power DNS give a talk on what he views "The Camel". He sent us a short abstract:
"In past years, DNS has been enhanced with DNSSEC, QName Minimization, EDNS Client Subnet and in-band key provisioning through magic record types. It is now also seeing work on 'DNS Stateful Operations', XPF, ANAME (ALIAS), resolver/client encryption, resolver/authoritative encryption & KSK signalling/rollovers. Each of these features interacts with all the others. Every addition therefore causes a further combinatorial explosion in complexity. Up to now, the increase in DNS complexity (mostly driven by DNSSEC) has been made possible by the huge pool of programming talent, mostly in the open source world. This presentation sets out, with examples, how innoccuous features contribute to the combinatorial rise of complexity, and how we might ponder thinking twice before loading up this camel further." https://datatracker.ietf.org/meeting/101/materials/slides-101-dnsop-sessa-the-dns-camel-00 Now, before everyone jumps into the deep end here, we suggest one read RFC 8324, published February of this year https://tools.ietf.org/html/rfc8324 by John Klensin. John discusses very similar subject matter. Bert's talk has a more "operational" focus, which is what caught this chair's eye (since many in the WG worry about operational issues). I believe the authors would agree they are complementary in nature. (If I am incorrect, the authors are free to castigate me) thanks Tim
_______________________________________________ DNSOP mailing list DNSOP@ietf.org https://www.ietf.org/mailman/listinfo/dnsop
