slipstream only uses pacing-based poll budgets for ResolverMode::Authoritative; recursive mode uses pending_polls (incremented on responses) plus a fixed poll slice. dnstt uses exponential backoff plus immediate polls after receiving data, which ramps quickly but is packet-count based and can spike QPS. It might be worth having that algorithm as a possible option for client if its benefits can be proven in realistic scenarios. /dnstt/dnstt-client/dns.go:26 /dnstt/dnstt-client/dns.go:161
slipstream only uses pacing-based poll budgets for ResolverMode::Authoritative; recursive mode uses pending_polls (incremented on responses) plus a fixed poll slice. dnstt uses exponential backoff plus immediate polls after receiving data, which ramps quickly but is packet-count based and can spike QPS. It might be worth having that algorithm as a possible option for client if its benefits can be proven in realistic scenarios.
/dnstt/dnstt-client/dns.go:26/dnstt/dnstt-client/dns.go:161