Proceedings of the ACM Internet Measurement Conference 2020
DOI: 10.1145/3419394.3423640
|View full text |Cite
|
Sign up to set email alerts
|

Trufflehunter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…Specifically, in the without-cache experiment, we only perform a single query for each domain in our domain dataset towards the target DNS resolvers. Conversely, in the with-cache experiment, we query each domain twice within a 5-second interval, confirming cache hits through the maximum TTL value [121] and bypassing potential loadbalancing policies [94].…”
Section: Querying Performance Of Pdnsmentioning
confidence: 98%
“…Specifically, in the without-cache experiment, we only perform a single query for each domain in our domain dataset towards the target DNS resolvers. Conversely, in the with-cache experiment, we query each domain twice within a 5-second interval, confirming cache hits through the maximum TTL value [121] and bypassing potential loadbalancing policies [94].…”
Section: Querying Performance Of Pdnsmentioning
confidence: 98%
“…We infer the presence of cache for this group of resolvers. Note that this is a lower bound estimation for caching open resolvers due to the existence of complex caching implementations (e.g., in case of public DNS resolvers) [33]. Key Takeaway: The fact that majority of open resolvers do not respond from cache provides an opportunity to deploy response rate limiting on authoritative nameservers or upstream resolvers as a measure to dampen the impact of amplification attacks.…”
Section: Cachingmentioning
confidence: 99%
“…(3) The number of independent caches in recursive resolver services [44,53]. (4) If recursive resolvers cache negative replies.…”
Section: The Tsuname Problemmentioning
confidence: 99%
“…While cycles were recognized as a problem more than 30 years ago, the problem is pressing today because evolution of the system has amplified query rates: the "happy eyeballs" algorithm doubles queries [62] and large public resolvers often use parallelism across many machines without shared caches [44]. Recommendations from 1987 and 1993 emphasize the role of the single recursive resolver without considering the interactions in today's DNS ecosystem.…”
Section: The Tsuname Problemmentioning
confidence: 99%
See 1 more Smart Citation