DNS
Name resolution, recursive and authoritative roles, records, delegation, caching, DNSSEC and troubleshooting.
What this topic solves
Name resolution, recursive and authoritative roles, records, delegation, caching, DNSSEC and troubleshooting.
Follow state and packet path
Separate IP connectivity from the service itself. Capture the transaction and validate state, timers, relay/proxy functions and security policy.
Input → classification/state → decision → table → next-hop/output → countersDesign before configuration
- Define the failure domain and expected convergence behavior.
- Document addressing, identifiers, timers, MTU and policy boundaries.
- Prefer explicit, observable state over assumptions.
- Plan rollback and out-of-band access before risky changes.
Commands and verification
Command syntax varies by platform and software release. The examples below come from the existing portal content and must be validated against the target platform documentation before production use.
Aplicação
↓
Stub resolver
↓
Recursive resolver
├─ cache? → responde
└─ sem cache:
Root
↓ referral
TLD
↓ referral
Authoritative
↓ answer
cache → cliente
# Consulta normal
dig example.com A
dig example.com AAAA
dig example.com MX
# Autoritativo específico
dig @ns1.example.net example.com A
# Sem recursão
dig +norecurse example.com A
# Caminho de delegação
dig +trace example.com
# DNSSEC
dig +dnssec example.com A
# Reverso
dig -x 192.0.2.10
# Windows
nslookup example.com
Resolve-DnsName example.com -Type AEvidence-driven workflow
- Define source, destination, time window and exact symptom.
- Establish the expected healthy state and compare it with the observed state.
- Inspect counters, tables, logs and packet captures before resets.
- Test one hypothesis at a time and prefer reversible changes.
- Repeat the original test after correction and check side effects.
DNS RFCs
Use the current standard/RFC and the documentation for the exact software release being operated. Vendor syntax is an implementation detail; protocol behavior should be understood independently.
Prove the behavior in a controlled topology
Build the smallest topology that reproduces the mechanism, capture control and data traffic, introduce one deliberate failure and diagnose it before applying the fix.