Implementing Interfaces to Transport Services
draft-ietf-taps-impl-07
TAPS Working Group A. Brunstrom, Ed.
Internet-Draft Karlstad University
Intended status: Informational T. Pauly, Ed.
Expires: 14 January 2021 Apple Inc.
T. Enghardt
Netflix
K-J. Grinnemo
Karlstad University
T. Jones
University of Aberdeen
P. Tiesel
TU Berlin
C. Perkins
University of Glasgow
M. Welzl
University of Oslo
13 July 2020
Implementing Interfaces to Transport Services
draft-ietf-taps-impl-07
Abstract
The Transport Services (TAPS) system enables applications to use
transport protocols flexibly for network communication and defines a
protocol-independent TAPS Application Programming Interface (API)
that is based on an asynchronous, event-driven interaction pattern.
This document serves as a guide to implementation on how to build
such a system.
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 14 January 2021.
Brunstrom, et al. Expires 14 January 2021 [Page 1]
Internet-Draft TAPS Implementation July 2020
Copyright Notice
Copyright (c) 2020 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 the Trust Legal Provisions and are
provided without warranty as described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Implementing Connection Objects . . . . . . . . . . . . . . . 4
3. Implementing Pre-Establishment . . . . . . . . . . . . . . . 5
3.1. Configuration-time errors . . . . . . . . . . . . . . . . 5
3.2. Role of system policy . . . . . . . . . . . . . . . . . . 6
4. Implementing Connection Establishment . . . . . . . . . . . . 7
4.1. Candidate Gathering . . . . . . . . . . . . . . . . . . . 8
4.1.1. Gathering Endpoint Candidates . . . . . . . . . . . . 8
4.1.2. Structuring Options as a Tree . . . . . . . . . . . . 9
4.1.3. Branch Types . . . . . . . . . . . . . . . . . . . . 11
4.1.4. Branching Order-of-Operations . . . . . . . . . . . . 13
4.1.5. Sorting Branches . . . . . . . . . . . . . . . . . . 14
4.2. Candidate Racing . . . . . . . . . . . . . . . . . . . . 16
4.2.1. Immediate . . . . . . . . . . . . . . . . . . . . . . 16
4.2.2. Delayed . . . . . . . . . . . . . . . . . . . . . . . 17
4.2.3. Failover . . . . . . . . . . . . . . . . . . . . . . 17
4.3. Completing Establishment . . . . . . . . . . . . . . . . 18
4.3.1. Determining Successful Establishment . . . . . . . . 19
4.4. Establishing multiplexed connections . . . . . . . . . . 19
4.5. Handling racing with "unconnected" protocols . . . . . . 20
4.6. Implementing listeners . . . . . . . . . . . . . . . . . 20
4.6.1. Implementing listeners for Connected Protocols . . . 21
4.6.2. Implementing listeners for Unconnected Protocols . . 21
4.6.3. Implementing listeners for Multiplexed Protocols . . 21
Show full document text