An Update to Happy Eyeballs
draft-pauly-v6ops-happy-eyeballs-update-00

• Status
• IESG evaluation record
• IESG writeups
• Email expansions
• History

• Versions
• 00
• 01

Network                                                         T. Pauly
Internet-Draft                                               D. Schinazi
Intended status: Standards Track                              Apple Inc.
Expires: September 9, 2017                                 March 8, 2017

                      An Update to Happy Eyeballs
               draft-pauly-v6ops-happy-eyeballs-update-00

Abstract

   "Happy Eyeballs" (RFC6555) is the name for a technique of reducing
   user-visible delays on dual-stack hosts.  Since one address family
   (IPv4 or IPv6) may be blocked, broken, or sub-optimal on a network,
   clients that attempt connections for both address families in
   parallel have a higher chance of establishing a connection sooner.
   Now that this approach has been deployed at scale and measured for
   several years, the algorithm specification can be refined to improve
   its reliability and generalization.

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 http://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 September 9, 2017.

Copyright Notice

   Copyright (c) 2017 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
   (http://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

Pauly & Schinazi        Expires September 9, 2017               [Page 1]
Internet-Draft         An Update to Happy Eyeballs            March 2017

   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
     1.1.  Requirements Language . . . . . . . . . . . . . . . . . .   2
   2.  Hostname Resolution Query Handling  . . . . . . . . . . . . .   3
     2.1.  Handling Multiple DNS Server Addresses  . . . . . . . . .   3
   3.  Sorting Addresses . . . . . . . . . . . . . . . . . . . . . .   3
   4.  Connection Attempt Delay  . . . . . . . . . . . . . . . . . .   4
   5.  Handling DNS Answer Changes . . . . . . . . . . . . . . . . .   5
   6.  Summary of Configurable Values  . . . . . . . . . . . . . . .   5
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .   5
   8.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   6
   9.  Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .   6
   10. References  . . . . . . . . . . . . . . . . . . . . . . . . .   6
     10.1.  Normative References . . . . . . . . . . . . . . . . . .   6
     10.2.  Informative References . . . . . . . . . . . . . . . . .   6
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   6

1.  Introduction

   "Happy Eyeballs" [RFC6555] is the name for a technique of reducing
   user-visible delays on dual-stack hosts.  Since one address family
   (IPv4 or IPv6) may be blocked, broken, or sub-optimal on a network,
   clients that attempt connections for both address families in
   parallel have a higher chance of establishing a connection sooner.
   Now that this approach has been deployed at scale and measured for
   several years, the algorithm specification can be refined to improve
   its reliability and generalization.

   This document recommends an algorithm of racing resolved addresses
   that has several stages of ordering and racing to avoid delays to the
   user whenever possible, while preferring the use of IPv6.
   Specifically, it discusses how to handle DNS queries when starting a
   connection on a dual-stack client, how to create an ordered list of
   addresses to which to attempt connections, and how to race the
   connection attempts.

1.1.  Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in "Key words for use in
   RFCs to Indicate Requirement Levels" RFC 2119 [RFC2119].

Pauly & Schinazi        Expires September 9, 2017               [Page 2]
Internet-Draft         An Update to Happy Eyeballs            March 2017