Skip to main navigation Skip to search Skip to main content

Optimizing DNS Resolvers for High Loads

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    Handling volumetric attacks and high loads is fundamental for Domain Name System (DNS) resolvers. While one can often scale up resources to cope with high loads, this costly solution is not always viable. Thus, our work revisits the design of DNS resolvers and maps the design decisions that most impact the resolver's robustness to high loads and volumetric attacks. Our work suggests a novel resolver composed of deadline-aware queue management, optimized cache policy, and high-load handling mechanisms. An evaluation with real DNS traces shows a consistent improvement of 21% in a high load scenario and by 40% under an NXDomain attack when compared with the best alternative method.

    Original languageAmerican English
    Title of host publication2023 IFIP Networking Conference, IFIP Networking 2023
    ISBN (Electronic)9783903176577
    DOIs
    StatePublished - 1 Jan 2023
    Event22nd International Federation for Information Processing Conference on Networking, IFIP Networking 2023 - Barcelona, Spain
    Duration: 12 Jun 202315 Jun 2023

    Publication series

    Name2023 IFIP Networking Conference, IFIP Networking 2023

    Conference

    Conference22nd International Federation for Information Processing Conference on Networking, IFIP Networking 2023
    Country/TerritorySpain
    CityBarcelona
    Period12/06/2315/06/23

    Keywords

    • Cache Policy
    • Count-Min Sketch
    • DNS Resolver
    • Queue Management
    • Volumetric Attacks
    • component
    • formatting
    • insert
    • style
    • styling

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Information Systems
    • Safety, Risk, Reliability and Quality

    Fingerprint

    Dive into the research topics of 'Optimizing DNS Resolvers for High Loads'. Together they form a unique fingerprint.

    Cite this