Implementing Interfaces to Transport Services
draft-ietf-taps-impl-03
|
| Document |
Type |
|
Active Internet-Draft (taps WG)
|
|
Last updated |
|
2019-03-11
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
Informational
|
|
Formats |
|
plain text
pdf
html
bibtex
|
| Stream |
WG state
|
|
WG Document
(wg milestone:
Nov 2019 - Submit document(s) t...
)
|
|
Document shepherd |
|
No shepherd assigned
|
| IESG |
IESG state |
|
I-D Exists
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
TAPS Working Group A. Brunstrom, Ed.
Internet-Draft Karlstad University
Intended status: Informational T. Pauly, Ed.
Expires: September 12, 2019 Apple Inc.
T. Enghardt
TU Berlin
K-J. Grinnemo
Karlstad University
T. Jones
University of Aberdeen
P. Tiesel
TU Berlin
C. Perkins
University of Glasgow
M. Welzl
University of Oslo
March 11, 2019
Implementing Interfaces to Transport Services
draft-ietf-taps-impl-03
Abstract
The Transport Services architecture [I-D.ietf-taps-arch] defines a
system that allows applications to use transport networking protocols
flexibly. 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 September 12, 2019.
Brunstrom, et al. Expires September 12, 2019 [Page 1]
Internet-Draft TAPS Implementation March 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
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Implementing Basic Objects . . . . . . . . . . . . . . . . . 3
3. Implementing Pre-Establishment . . . . . . . . . . . . . . . 4
3.1. Configuration-time errors . . . . . . . . . . . . . . . . 5
3.2. Role of system policy . . . . . . . . . . . . . . . . . . 5
4. Implementing Connection Establishment . . . . . . . . . . . . 6
4.1. Candidate Gathering . . . . . . . . . . . . . . . . . . . 7
4.1.1. Structuring Options as a Tree . . . . . . . . . . . . 7
4.1.2. Branch Types . . . . . . . . . . . . . . . . . . . . 9
4.2. Branching Order-of-Operations . . . . . . . . . . . . . . 11
4.3. Sorting Branches . . . . . . . . . . . . . . . . . . . . 12
4.4. Candidate Racing . . . . . . . . . . . . . . . . . . . . 13
4.4.1. Delayed . . . . . . . . . . . . . . . . . . . . . . . 14
4.4.2. Failover . . . . . . . . . . . . . . . . . . . . . . 15
4.5. Completing Establishment . . . . . . . . . . . . . . . . 15
4.5.1. Determining Successful Establishment . . . . . . . . 16
4.6. Establishing multiplexed connections . . . . . . . . . . 17
4.7. Handling racing with "unconnected" protocols . . . . . . 17
4.8. Implementing listeners . . . . . . . . . . . . . . . . . 18
4.8.1. Implementing listeners for Connected Protocols . . . 18
4.8.2. Implementing listeners for Unconnected Protocols . . 18
4.8.3. Implementing listeners for Multiplexed Protocols . . 18
5. Implementing Data Transfer . . . . . . . . . . . . . . . . . 19
5.1. Data transfer for streams, datagrams, and frames . . . . 19
5.1.1. Sending Messages . . . . . . . . . . . . . . . . . . 19
Show full document text