Happy Eyeballs Version 2: Better Connectivity Using Concurrency
draft-ietf-v6ops-rfc6555bis-00

The information below is for an old version of the document
Document Type Active Internet-Draft (v6ops WG)
Last updated 2017-04-10
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state WG Document (wg milestone: Nov 2017 - Update RFC 6555 with... )
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
Network                                                         T. Pauly
Internet-Draft                                               D. Schinazi
Obsoletes: 6555 (if approved)                                 Apple Inc.
Intended status: Standards Track                           April 8, 2017
Expires: October 10, 2017

    Happy Eyeballs Version 2: Better Connectivity Using Concurrency
                     draft-ietf-v6ops-rfc6555bis-00

Abstract

   Many communication protocols operated over the modern Internet uses
   host names.  These often resolve to multiple IP addresses, each of
   which may have different performance and connectivity
   characteristics.  Since specific addresses or address families (IPv4
   or IPv6) may be blocked, broken, or sub-optimal on a network, clients
   that attempt multiple connections in parallel have a higher chance of
   establishing a connection sooner.  This document specifies
   requirements for algorithms that reduce this user-visible delay and
   provides an example algorithm.

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 October 10, 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

Pauly & Schinazi        Expires October 10, 2017                [Page 1]
Internet-Draft              Happy Eyeballs v2                 April 2017

   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
   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 . . . . . . . . . . . . . . . . . .   3
   2.  Overview  . . . . . . . . . . . . . . . . . . . . . . . . . .   3
   3.  Hostname Resolution Query Handling  . . . . . . . . . . . . .   3
     3.1.  Handling Multiple DNS Server Addresses  . . . . . . . . .   4
   4.  Sorting Addresses . . . . . . . . . . . . . . . . . . . . . .   4
   5.  Connection Attempts . . . . . . . . . . . . . . . . . . . . .   5
   6.  DNS Answer Changes during Happy Eyeballs Connection Setup . .   6
   7.  Summary of Configurable Values  . . . . . . . . . . . . . . .   6
   8.  Limitations . . . . . . . . . . . . . . . . . . . . . . . . .   7
     8.1.  Path Maximum Transmission Unit Discovery  . . . . . . . .   7
     8.2.  Application Layer . . . . . . . . . . . . . . . . . . . .   7
     8.3.  Hiding Operational Issues . . . . . . . . . . . . . . . .   8
   9.  Security Considerations . . . . . . . . . . . . . . . . . . .   8
   10. IANA Considerations . . . . . . . . . . . . . . . . . . . . .   8
   11. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .   8
   12. References  . . . . . . . . . . . . . . . . . . . . . . . . .   8
     12.1.  Normative References . . . . . . . . . . . . . . . . . .   8
     12.2.  Informative References . . . . . . . . . . . . . . . . .   9
   Appendix A.  Differences from RFC6555 . . . . . . . . . . . . . .   9
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   9

1.  Introduction

   Many communication protocols operated over the modern Internet uses
   host names.  These often correspond to multiple IP addresses, whose
   performance can vary.  Since specific addresses or address families
   (IPv4 or IPv6) may be blocked, broken, or sub-optimal on a network,
   clients that attempt multiple connections in parallel have a higher
   chance of establishing a connection sooner.  This document specifies
   requirements for algorithms that reduce this user-visible delay and
   provides an algorithm.

   This documents expands on "Happy Eyeballs" [RFC6555], a technique of
   reducing user-visible delays on dual-stack hosts.  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
Show full document text