Decreasing Fetch time of Root Data by Additional Caching Rules
draft-arnt-yao-dnsop-root-data-caching-00

Document Type Active Internet-Draft (individual)
Last updated 2019-02-13
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
dnsop                                                     A. Gulbrandsen
Internet-Draft
Intended status: Standards Track                                  J. Yao
Expires: August 16, 2019                                           CNNIC
                                                       February 12, 2019

     Decreasing Fetch time of Root Data by Additional Caching Rules
               draft-arnt-yao-dnsop-root-data-caching-00

Abstract

   Some DNS recursive resolvers have long round trip times to the
   nearest DSN root server, which has been an obstacle to DNS query
   performance.  In order to decrease root record fetch time without
   introducing a new source of errors, this document proposes a root-
   specific modification to the caching rules.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on August 16, 2019.

Copyright Notice

   Copyright (c) 2019 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of

Gulbrandsen & Yao        Expires August 16, 2019                [Page 1]
Internet-Draft                 root-relay                  February 2019

   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   2
   3.  Design Considerations . . . . . . . . . . . . . . . . . . . .   3
   4.  Changes . . . . . . . . . . . . . . . . . . . . . . . . . . .   3
     4.1.  Impact on the resolver  . . . . . . . . . . . . . . . . .   3
     4.2.  Impact on the root servers  . . . . . . . . . . . . . . .   4
     4.3.  Impact on the network . . . . . . . . . . . . . . . . . .   4
   5.  System Requirements . . . . . . . . . . . . . . . . . . . . .   4
   6.  Difference between this mechanism and RFC7706 based mechanism   4
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .   4
   8.  Change History  . . . . . . . . . . . . . . . . . . . . . . .   4
     8.1.  draft-arnt-yao-dnsop-root-data-caching: Version 00  . . .   5
   9.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   5
     9.1.  Normative References  . . . . . . . . . . . . . . . . . .   5
     9.2.  Informative References  . . . . . . . . . . . . . . . . .   5
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   6

1.  Introduction

   Some DNS recursive resolvers suffer from long round trip times to the
   nearest DSN root server, which has been an obstacle to DNS query
   performance.

   A particular characteristic of the root zone is that when cached, its
   data is usable for very different queries: An MTA that wishes to send
   mail to Google needs the NS records for .com, and so does a web
   browser that wishes to open the Bing home page.  Other public zones
   (such as .co.uk and .gen.nz, and perhaps tumblr.com) are shared among
   some queries, the root zone is used for all.

   This suggests that caching rules that are appropriate to the rest of
   the DNS tree may not be ideal for the root zone.

   We propose to refresh root zone data probabilistically when it
   expires, instead of when needed.

2.  Terminology

   The basic key words such as "MUST", "MUST NOT", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "MAY", and "MAYNOT" are to be interpreted as
   described in [RFC2119].

Gulbrandsen & Yao        Expires August 16, 2019                [Page 2]
Internet-Draft                 root-relay                  February 2019

   The basic DNS terms used in this specification are defined in the
   documents [RFC1034] and [RFC1035].

3.  Design Considerations

   o  The RRs in the root zone do not change frequently.

   o  The root zone is not large, compared to the RAM of even smallish
Show full document text