RFC 5001

DNS Name Server Identifier (NSID) Option

๐Ÿ“… published August 2007, from ietf

RFC 5001 ๐ŸŽ€ DNS Name Server Identifier (NSID) Option

Author: R. Austein from ISC ๐Ÿ’…

Category: Standards Track ๐ŸŒธ (an Internet standards track protocol)

Date: August 2007 ๐Ÿ“…

Obsoletes / Updates: The header doesn't list either one, so this RFC isn't replacing or updating anything else ๐Ÿ™ˆ

Status of This Memo ๐Ÿ“œ

This document specifies an Internet standards track protocol for the Internet community, and asks for discussion and suggestions for improvements. For the standardization state and status of this protocol, check the current edition of the "Internet Official Protocol Standards" (STD 1). Distribution of this memo is unlimited โœจ

Copyright (C) The IETF Trust (2007).

Abstract ๐Ÿ’ญ

Okay so DNS anycast, load balancing, and other setups let more than one DNS name server share a single IP address, which is iconic for scaling but makes it hard to tell which server in the pool actually answered your query ๐Ÿ˜ญ Ad-hoc tricks let an operator send follow-up queries to debug this, but the only completely reliable way to get the responding server's identity is for the server to include it in the response itself. This note defines a protocol extension to support that ๐Ÿฆ‹

Table of Contents ๐Ÿ—‚๏ธ

1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  2
  1.1.  Reserved Words . . . . . . . . . . . . . . . . . . . . . .  3
2.  Protocol . . . . . . . . . . . . . . . . . . . . . . . . . . .  3
  2.1.  Resolver Behavior  . . . . . . . . . . . . . . . . . . . .  3
  2.2.  Name Server Behavior . . . . . . . . . . . . . . . . . . .  3
  2.3.  The NSID Option  . . . . . . . . . . . . . . . . . . . . .  4
  2.4.  Presentation Format  . . . . . . . . . . . . . . . . . . .  4
3.  Discussion . . . . . . . . . . . . . . . . . . . . . . . . . .  4
  3.1.  The NSID Payload . . . . . . . . . . . . . . . . . . . . .  4
  3.2.  NSID Is Not Transitive . . . . . . . . . . . . . . . . . .  7
  3.3.  User Interface Issues  . . . . . . . . . . . . . . . . . .  7
  3.4.  Truncation . . . . . . . . . . . . . . . . . . . . . . . .  8
4.  IANA Considerations  . . . . . . . . . . . . . . . . . . . . .  8
5.  Security Considerations  . . . . . . . . . . . . . . . . . . .  9
6.  Acknowledgements . . . . . . . . . . . . . . . . . . . . . . .  9
7.  References . . . . . . . . . . . . . . . . . . . . . . . . . .  9
  7.1.  Normative References . . . . . . . . . . . . . . . . . . .  9
  7.2.  Informative References . . . . . . . . . . . . . . . . . . 10

1. Introduction โœจ

So you know how DNS anycast, load balancing, and friends let more than one name server hide behind one IP address? Iconic for scaling, but it's genuinely hard to tell which server in the pool answered a given query ๐Ÿ™ˆ

Existing ad-hoc mechanisms let an operator send follow-up queries when they need to debug a setup like this, but that's not totally satisfying ๐Ÿ’€ Anycast routing may have changed by then, or the server pool might be sitting behind some extremely dynamic load balancing hardware. So these ad-hoc mechanisms are certainly better than nothing (and they already work, which is a big plus), but a better solution seems desirable ๐ŸŒˆ

A DNS query is an idempotent operation with no retained state, so the only completely reliable way to learn which name server responded is for that name server to put identifying information in the response itself. This note defines a protocol enhancement to achieve this ๐Ÿ’–

1.1. Reserved Words ๐Ÿ”ฅ

Here's the word list, bestie: the key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119] ๐Ÿซถ

2. Protocol ๐Ÿ’…

Okay, the big idea: this note uses an EDNS [RFC2671] option to do two jobs. It lets the resolver say "hey, I want to know who you are," and it holds the name server's answer, if it has one ๐Ÿ‘‘

2.1. Resolver Behavior ๐ŸŒธ

A resolver signals that it wants identifying info by sending an empty NSID option (Section 2.3) in an EDNS OPT pseudo-RR in the query message โœจ

The resolver MUST NOT include any NSID payload data in the query message. ๐Ÿ™…โ€โ™€๏ธ

Now the non-transitive part, which is lowkey the most important bit ๐Ÿง  An NSID request is not transitive. If a query has an NSID option, that's a request for the name server that receives the query to identify itself. If the name server side of a recursive name server gets an NSID request, the client is asking that recursive name server to identify itself. If the resolver side of that recursive name server wants identifying info too, it's free to add NSID requests in its own queries, but that's a separate matter ๐Ÿฆ‹

2.2. Name Server Behavior ๐Ÿ“

A name server that understands the NSID option and decides to honor a particular NSID request responds by putting identifying information in an NSID option (Section 2.3) in an EDNS OPT pseudo-RR in the response message ๐Ÿ’œ

The name server MUST ignore any NSID payload data that might be present in the query message. ๐Ÿ™ˆ

The NSID option is not transitive, and this part is non-negotiable ๐Ÿ˜ค A name server MUST NOT send an NSID option back to a resolver that didn't request it. A recursive name server might add an NSID option when it sends its own query, sure, but that has no effect on whether the NSID option shows up (or doesn't) in the recursive name server's response to the original client ๐ŸŒˆ

As stated in Section 2.1, this mechanism isn't restricted to authoritative name servers. The semantics are meant to be equally applicable to recursive name servers too, so everybody gets to slay โœจ

2.3. The NSID Option ๐ŸŽ€

The OPTION-CODE for the NSID option is 3. ๐Ÿ”ข

The OPTION-DATA for the NSID option is an opaque byte string. Its semantics are deliberately left outside the protocol, so the protocol doesn't decide what it means. See Section 3.1 for discussion ๐Ÿงš

2.4. Presentation Format ๐Ÿซง

User interfaces MUST read and write the contents of the NSID option as a sequence of hexadecimal digits, two digits per payload octet. ๐Ÿ’ป

The NSID payload is binary data, bestie. Any comparison between NSID payloads MUST be a comparison of the raw binary data. Copy operations MUST NOT assume that the raw NSID payload is null-terminated ๐Ÿ˜ญ Any resemblance between raw NSID payload data and some form of text is purely a convenience, and it doesn't change the underlying nature of the payload data ๐Ÿ™ƒ

See Section 3.3 for discussion. ๐Ÿ’œ

3. Discussion ๐Ÿงš

This section is where we talk through some of the protocol's quirks and explain the thinking behind the design choices that got us here โœจ

3.1. The NSID Payload โœจ

okay so the syntax and semantics of the NSID option's content are deliberately left outside the scope of this specification ๐Ÿ™ˆ this doc is not going to tell you what the content looks like.

choosing the NSID content is totally the server administrator's call ๐Ÿ‘‘. they might encode it so that the server operator (or clients the operator authorizes) can decode it and get more info than everyone else ๐Ÿ”. or the operator might go with unencoded content that means the same thing to literally any client ๐ŸŒธ.

this section walks through some of the kinds of data admins might pick as NSID content, and explains why we land on a simple opaque byte string in Section 2.3 ๐Ÿงš

there are several possibilities for the NSID payload:

  • it could be the "real" name of the specific name server within the name server pool ๐Ÿท๏ธ
  • it could be the "real" IP address (IPv4 or IPv6) of the name server within the name server pool ๐Ÿ“
  • it could be some sort of pseudo-random number generated in a predictable fashion somehow using the server's IP address or name as a seed value ๐ŸŽฒ
  • it could be some sort of probabilistically unique identifier initially derived from some sort of random number generator, then preserved across reboots of the name server โœจ
  • it could be some sort of dynamically generated identifier so that only the name server operator could tell whether or not any two queries had been answered by the same server ๐Ÿ•ต๏ธโ€โ™€๏ธ
  • it could be a blob of signed data, with a corresponding key which might (or might not) be available via DNS lookups โœ๏ธ
  • it could be a blob of encrypted data, the key for which could be restricted to parties with a need to know (in the opinion of the server operator) ๐Ÿ”’
  • it could be an arbitrary string of octets chosen at the discretion of the name server operator ๐ŸŽจ

each one has its own pros and cons, and honestly it's giving "no perfect answer" ๐Ÿ’€

  • using the "real" name is simple, but the name server may not have a "real" name ๐Ÿซ 
  • using the "real" address is also simple, and the name server almost certainly does have at least one non-anycast IP address for maintenance operations, but the operator of the name server may not be willing to divulge its non-anycast address ๐Ÿ™…โ€โ™€๏ธ
  • given that one common reason for using anycast DNS techniques is an attempt to harden a critical name server against denial of service attacks, some name server operators are likely to want an identifier other than the "real" name or "real" address of the name server instance ๐Ÿ›ก๏ธ
  • using a hash or pseudo-random number can provide a fixed length value that the resolver can use to tell two name servers apart without necessarily being able to tell where either one of them "really" is, but makes debugging more difficult if one happens to be in a friendly open environment. furthermore, hashing might not add much value, since a hash based on an IPv4 address still only involves a 32-bit search space, and DNS names used for servers that operators might have to debug at 4am tend not to be very random ๐Ÿ˜ด
  • probabilistically unique identifiers have properties similar to hashed identifiers, but (given a sufficiently good random number generator) are immune to the search space issues. however, the strength of this approach is also its weakness: there is no algorithmic transformation by which even the server operator can associate name server instances with identifiers while debugging, which might be annoying ๐Ÿ˜ค. this approach also requires the name server instance to preserve the probabilistically unique identifier across reboots, but this does not appear to be a serious restriction, since authoritative nameservers almost always have some form of non-volatile storage ๐Ÿ’พ. in the rare case of a name server that does not have any way to store such an identifier, nothing terrible will happen if the name server generates a new identifier every time it reboots ๐Ÿ™Œ
  • using an arbitrary octet string gives name server operators yet another setting to configure, or mis-configure, or forget to configure. having all the nodes in an anycast name server constellation identify themselves as "My Name Server" would not be particularly useful ๐Ÿฅฒ
  • a signed blob is not particularly useful as an NSID payload unless the signed data is dynamic and includes some kind of replay protection, such as a timestamp or some kind of data identifying the requestor. signed blobs that meet these criteria could conceivably be useful in some situations, but would require detailed security analysis beyond the scope of this document ๐Ÿ”
  • a static encrypted blob would not be particularly useful, as it would be subject to replay attacks and would, in effect, just be a random number to any party that does not possess the decryption key. dynamic encrypted blobs could conceivably be useful in some situations but, as with signed blobs, dynamic encrypted blobs would require detailed security analysis beyond the scope of this document ๐Ÿฅ€

given all of the issues listed above, there does not appear to be a single solution that will meet all needs ๐Ÿ˜ฉ. so Section 2.3 defines the NSID payload to be an opaque byte string and leaves the choice of payload up to the implementor and name server operator ๐ŸŽ€

these guidelines may be useful to implementors and server operators:

  • operators for whom divulging the unicast address is an issue could use the raw binary representation of a probabilistically unique random number. this should probably be the default implementation behavior ๐Ÿงธ
  • operators for whom divulging the unicast address is not an issue could just use the raw binary representation of a unicast address for simplicity. this should only be done via an explicit configuration choice by the operator โš™๏ธ
  • operators who really need or want the ability to set the NSID payload to an arbitrary value could do so, but this should only be done via an explicit configuration choice by the operator ๐Ÿซถ

this approach appears to provide enough information for useful debugging without unintentionally leaking the maintenance addresses of anycast name servers to nogoodniks, while also allowing name server operators who do not find such leakage threatening to provide more information at their own discretion ๐Ÿ’–


3.2. NSID Is Not Transitive โœจ

as specified in Section 2.1 and Section 2.2, the NSID option is not transitive. this is strictly a hop-by-hop mechanism ๐Ÿฆ‹

most of the discussion of name server identification so far has focused on identifying authoritative name servers, since the best known cases of anycast name servers are a subset of the name servers for the root zone ๐Ÿ‘‘. however, given that anycast DNS techniques are also applicable to recursive name servers, the mechanism may also be useful with recursive name servers. the hop-by-hop semantics support this ๐ŸŒˆ

while there might be some utility in having a transitive variant of this mechanism (so that, for example, a stub resolver could ask a recursive server to tell it which authoritative name server provided a particular answer to the recursive name server), the semantics of such a variant would be more complicated, and are left for future work ๐Ÿ”ฎ


3.3. User Interface Issues ๐Ÿ’…

given the range of possible payload contents described in Section 3.1, it is not possible to define a single presentation format for the NSID payload that is efficient, convenient, unambiguous, and aesthetically pleasing ๐Ÿ™ƒ. in particular, while it is tempting to use a presentation format that uses some form of textual strings, attempting to support this would significantly complicate what's intended to be a very simple debugging mechanism ๐Ÿงผ

in some cases the content of the NSID payload may be binary data meaningful only to the name server operator, and may not be meaningful to the user or application. but the user or application must be able to capture the entire content anyway in order for it to be useful. thus, the presentation format must support arbitrary binary data ๐Ÿค–

in cases where the name server operator derives the NSID payload from textual data, a textual form such as US-ASCII or UTF-8 strings might at first glance seem easier for a user to deal with. there are, however, a number of complex issues involving internationalized text which, if fully addressed here, would require a set of rules significantly longer than the rest of this specification. see [RFC2277] for an overview of some of these issues ๐ŸŒ

it is much more important for the NSID payload data to be passed unambiguously from server administrator to user and back again than it is for the payload data to be pretty while in transit ๐Ÿ’ฏ. in particular, it's critical that it be straightforward for a user to cut and paste an exact copy of the NSID payload output by a debugging tool into other formats such as email messages or web forms without distortion ๐Ÿ“‹. hexadecimal strings, while ugly, are also robust ๐Ÿ›


3.4. Truncation ๐Ÿ“

in some cases, adding the NSID option to a response message may trigger message truncation. this specification does not change the rules for DNS message truncation in any way, but implementors will need to pay attention to this issue โœ‚๏ธ

including the NSID option in a response is always optional, so this specification never requires name servers to truncate response messages ๐Ÿซง

by definition, a resolver that requests NSID responses also supports EDNS, so a resolver that requests NSID responses can also use the "sender's UDP payload size" field of the OPT pseudo-RR to signal a receive buffer size large enough to make truncation unlikely ๐Ÿ“ฆ


4. IANA Considerations โœจ

IANA has allocated EDNS option code 3 for the NSID option (Section 2.3) ๐ŸŽŸ๏ธ


5. Security Considerations ๐Ÿ’€

this document describes a channel signaling mechanism intended primarily for debugging. channel signaling mechanisms are outside the scope of DNSSEC, per se. applications that require integrity protection for the data being signaled will need to use a channel security mechanism such as TSIG [RFC2845].

Section 3.1 discusses a number of different kinds of information that a name server operator might choose to provide as the value of the NSID option. some of these kinds of information are security sensitive in some environments. this specification deliberately leaves the syntax and semantics of the NSID option content up to the implementation and the name server operator ๐Ÿšจ

two of the possible kinds of payload data discussed in Section 3.1 involve a digital signature and encryption, respectively. while this specification discusses some of the pitfalls that might lurk for careless users of these kinds of payload data, full analysis of the issues that would be involved in these kinds of payload data would require knowledge of the content to be signed or encrypted, algorithms to be used, and so forth, which is beyond the scope of this document. implementors should seek competent advice before attempting to use these kinds of NSID payloads ๐Ÿซฃ

6. Acknowledgements โœจ

Big thank-you energy ๐Ÿซถ to all these legends: Joe Abley, Harald Alvestrand, Dean Anderson, Mark Andrews, Roy Arends, Steve Bellovin, Alex Bligh, Randy Bush, David Conrad, John Dickinson, Alfred Hoenes, Johan Ihren, Daniel Karrenberg, Peter Koch, William Leibzon, Ed Lewis, Thomas Narten, Mike Patton, Geoffrey Sisson, Andrew Sullivan, Mike StJohns, Tom Taylor, Paul Vixie, Sam Weiler, and Suzanne Woolf. ๐Ÿ’œ None of them are responsible for what the author ended up doing with their comments and suggestions, so no blame, only love. If I accidentally left anyone off this list, I'm so sorry ๐Ÿ™ˆ you deserve a shoutout too.

7. References

7.1. Normative References

[RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
           Requirement Levels", RFC 2119, BCP 14, March 1997.

[RFC2671]  Vixie, P., "Extension Mechanisms for DNS (EDNS0)",
           RFC 2671, August 1999.

[RFC2845]  Vixie, P., Gudmundsson, O., Eastlake 3rd, D., and B.
           Wellington, "Secret Key Transaction Authentication for DNS
           (TSIG)", RFC 2845, May 2000.

7.2. Informative References

[RFC2277]  Alvestrand, H., "IETF Policy on Character Sets and
           Languages", RFC 2277, BCP 18, January 1998.

Author's Address ๐ŸŒธ

Rob Austein
ISC
950 Charter Street
Redwood City, CA  94063
USA

EMail: sra@isc.org

Okay, the legal bits, and yes they matter ๐Ÿ“œ The copyright is The IETF Trust (2007). This document is subject to the rights, licenses and restrictions in BCP 78, and except as set forth there, the authors keep all their rights. The document and everything in it are provided on an "AS IS" basis, and the contributor, the organization they represent or are sponsored by (if any), the Internet Society, the IETF Trust, and the Internet Engineering Task Force all disclaim every warranty, express or implied. That includes, but isn't limited to, any warranty that using the information won't infringe any rights, and any implied warranties of merchantability or fitness for a particular purpose. Here's the exact wording, because lawyers ๐Ÿ™ˆ

Copyright (C) The IETF Trust (2007).

This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors
retain all their rights.

This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.

Intellectual Property ๐Ÿฆ‹

The IETF is not picking a side on whether any IP rights claimed around this tech are valid or how far they reach, and it's not saying whether licenses are available either. It also hasn't done its own digging to find any such rights. If you want the procedures for rights in RFC documents, check out BCP 78 and BCP 79 ๐Ÿงš

Copies of IPR disclosures sent to the IETF Secretariat, any assurances of licenses that are supposed to be available, and the results of any attempt to get a general license or permission for implementers or users to use proprietary rights can all be found in the IETF's online IPR repository at http://www.ietf.org/ipr. โœจ

The IETF also invites anyone who's interested to flag any copyrights, patents, patent applications, or other proprietary rights that might cover technology needed to implement this standard. Send that info to ietf-ipr@ietf.org ๐Ÿ’Œ

Acknowledgement ๐ŸŽ€

Funding for the RFC Editor function is currently provided by the Internet Society. ๐ŸŒˆ

๐Ÿ“ฆ where this page comes from