Guidelines for Racing During Connection Establishment
draft-pauly-taps-guidelines-01

Document Type Active Internet-Draft (individual)
Last updated 2017-10-24
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)
Network Working Group                                           T. Pauly
Internet-Draft                                                Apple Inc.
Intended status: Standards Track                        October 24, 2017
Expires: April 27, 2018

         Guidelines for Racing During Connection Establishment
                   draft-pauly-taps-guidelines-01

Abstract

   Often, connections created across the Internet have multiple options
   of how to communicate: address families, specific IP addresses,
   network attachments, and application and transport protocols.  This
   document describes how an implementation can race multiple options
   during connection establishment, and expose this functionality
   through an API.

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 April 27, 2018.

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
   include Simplified BSD License text as described in Section 4.e of

Pauly                    Expires April 27, 2018                 [Page 1]
Internet-Draft       Connection Establishment Racing        October 2017

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

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   3
     2.1.  Endpoint  . . . . . . . . . . . . . . . . . . . . . . . .   3
     2.2.  Derived Endpoint  . . . . . . . . . . . . . . . . . . . .   3
     2.3.  Path  . . . . . . . . . . . . . . . . . . . . . . . . . .   3
     2.4.  Connection  . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Connection Establishment Overview . . . . . . . . . . . . . .   4
   4.  Structuring Options as a Tree . . . . . . . . . . . . . . . .   5
     4.1.  Branch Types  . . . . . . . . . . . . . . . . . . . . . .   7
       4.1.1.  Derived Endpoints . . . . . . . . . . . . . . . . . .   7
       4.1.2.  Alternate Paths . . . . . . . . . . . . . . . . . . .   7
       4.1.3.  Protocol Options  . . . . . . . . . . . . . . . . . .   8
     4.2.  Branching Order-of-Operations . . . . . . . . . . . . . .   9
   5.  Connection Establishment Dynamics . . . . . . . . . . . . . .  10
     5.1.  Building the Tree . . . . . . . . . . . . . . . . . . . .  10
     5.2.  Racing Methods  . . . . . . . . . . . . . . . . . . . . .  11
       5.2.1.  Delayed Racing  . . . . . . . . . . . . . . . . . . .  11
       5.2.2.  Failover  . . . . . . . . . . . . . . . . . . . . . .  12
     5.3.  Completing Establishment  . . . . . . . . . . . . . . . .  12
       5.3.1.  Determining Successful Establishment  . . . . . . . .  13
   6.  API Considerations  . . . . . . . . . . . . . . . . . . . . .  14
     6.1.  Handling 0-RTT Data . . . . . . . . . . . . . . . . . . .  14
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .  15
   8.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  16
   9.  Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .  16
   10. Informative References  . . . . . . . . . . . . . . . . . . .  16
   Author's Address  . . . . . . . . . . . . . . . . . . . . . . . .  17

1.  Introduction

   Often, connections created across the Internet have multiple options
   of how to communicate: address families, specific IP addresses,
   network attachments, and application and transport protocols.  If an
   application chooses to only attempt one of these options, it may fail
   to connect, or end up using a suboptimal path.  If an application
   chooses to attempt one option after another, waiting for each to fail
   or time out, a user of the application may need to wait for a very
   long time before progress is made.  And, if an application
   simultaneously attempts all options, it may unnecessarily consume
   significant local or network resources.

   In order to solve this, applications can employ a method of racing
Show full document text