Visual RFC.
ALL RFCs / RFC 1034
Read the RFC ↗
RFC 1034 / NAMES & RECORDS

The name tree

01

A DNS name locates a node in one shared tree. The rightmost labels are closest to the root.

Related RFCs and changes

“Updates” changes part of an earlier RFC. “Obsoletes” replaces it. This list shows selected related documents.

DIAGRAM§ 3.1 ↗
RFC 1034 · § 3.1EXAMPLE
3 / 3
The name treeA branching DNS namespace with the selected name path revealed label by label.ROOT.com.org.shop.com.example.org.ietf.org.wwwmailwww.example.org. → example → org → root
03
Reach the named node.

The full name is read from this node back toward the root.

Protocol participantThreat or exceptionProtocol controlSimplified drawings · precise section references
KEY POINT

Names describe hierarchy, not network location.

  • Each label is at most 63 octets; a complete encoded name is at most 255 octets.
  • A trailing dot explicitly includes the root label.
  • DNS comparisons of ASCII letters ignore case; preserve the original case when possible.
DETAILS

A domain contains its descendants. A zone is an administrative portion of the tree, and may stop at delegation boundaries.

Read the RFC section ↗

Diagrams simplify the RFC. Read the linked sections for complete requirements.

Privacy
All chapters in this RFC
  1. The name tree
  2. Resource records
  3. Delegation & glue
  4. Iterative resolution
  5. Recursive resolution
  6. Caches & TTL
  7. Aliases
  8. Missing names & failures
  9. Wildcard synthesis
  10. Zone maintenance
  11. Reverse lookups
  12. Transport & historical scope
RFC 9700 / CHAPTERS

Chapters

For full details, tables, algorithms, and exceptions, read the original RFC.

RFC status and corrections ↗