<?xml version='1.0' encoding='utf-8'?> encoding='UTF-8'?>

<!-- draft submitted in xml v3 -->

<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.4 (Ruby 3.2.2) -->

<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-taps-impl-18" number="9623" submissionType="IETF" updates="" obsoletes="" consensus="true" category="info" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.18.2 --> version="3" xml:lang="en">

  <front>
    <title abbrev="TAPS Implementation">Implementing Interfaces to Transport Services</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-taps-impl-18"/> name="RFC" value="9623"/>
    <author initials="A." surname="Brunstrom" fullname="Anna Brunstrom" role="editor">
      <organization>Karlstad University</organization>
      <address>
        <postal>
          <street>Universitetsgatan 2</street>
          <city>651 88 Karlstad</city>
          <country>Sweden</country>
        </postal>
        <email>anna.brunstrom@kau.se</email>
      </address>
    </author>
    <author initials="T." surname="Pauly" fullname="Tommy Pauly" role="editor">
      <organization>Apple Inc.</organization>
      <address>
        <postal>
          <street>One Apple Park Way</street>
          <city>Cupertino, California 95014</city>
          <city>Cupertino</city><region>CA</region><code>95014</code>
          <country>United States of America</country>
        </postal>
        <email>tpauly@apple.com</email>
      </address>
    </author>
    <author initials="R." surname="Enghardt" fullname="Reese Enghardt">
      <organization>Netflix</organization>
      <address>
        <postal>
          <street>121 Albright Way</street>
          <city>Los Gatos, CA 95032</city> Gatos</city><region>California</region><code>95032</code>
          <country>United States of America</country>
        </postal>
        <email>ietf@tenghardt.net</email>
      </address>
    </author>
    <author initials="P." initials="P.S." surname="Tiesel" fullname="Philipp S. Tiesel">
      <organization>SAP SE</organization>
      <address>
        <postal>
          <street>George-Stephenson-Straße
          <street>George-Stephenson-Str. 7-13</street>
          <city>10557 Berlin</city>
          <city>Berlin</city><code>10557</code>
          <country>Germany</country>
        </postal>
        <email>philipp@tiesel.net</email>
      </address>
    </author>
    <author initials="M." surname="Welzl" fullname="Michael Welzl">
      <organization>University of Oslo</organization>
      <address>
        <postal>
          <street>PO Box 1080 Blindern</street>
          <city>0316  Oslo</city>
          <city>Oslo</city><code>0316</code>
          <country>Norway</country>
        </postal>
        <email>michawe@ifi.uio.no</email>
      </address>
    </author>
    <date year="2023" month="December" day="14"/>
    <area>Transport</area>
    <workgroup>TAPS Working Group</workgroup>
    <keyword>Internet-Draft</keyword> year="2024" month="November"/>
    <area>WIT</area>
    <workgroup>taps</workgroup>

<!-- [rfced] Please insert any keywords (beyond those that appear in
the title) for use on https://www.rfc-editor.org/search. -->

<keyword>example</keyword>

    <abstract>
      <?line 100?>
<t>The Transport Services system enables applications to use transport protocols flexibly for network communication
and defines a protocol-independent Transport Services Application Programming Interface (API) that is based on an asynchronous,
event-driven interaction pattern. This document serves as a guide to implementing such a system.</t>
    </abstract>
  </front>
  <middle>
    <?line 106?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The Transport Services architecture <xref target="I-D.ietf-taps-arch"/> target="RFC9621"/> defines a system that allows applications to flexibly use transport networking protocols. The API that such a system exposes to applications is defined as the Transport Services API <xref target="I-D.ietf-taps-interface"/>. target="RFC9622"/>. This API is designed to be generic across multiple transport protocols and sets of protocol features.</t>
      <t>This document serves as a guide to implementing a system that provides a Transport Services API. This guide offers suggestions to developers, but it is not prescriptive: implementations are free to take any desired form as long as the API specification defined in <xref target="I-D.ietf-taps-interface"/> target="RFC9622"/> is honored. It is the job of an implementation of a Transport Services system to turn the requests of an application into decisions on how to establish connections, connections and how to transfer data over those connections once established. The terminology used in this document is based on the terminology defined in the Transport Services architecture <xref target="I-D.ietf-taps-arch"/>.</t> target="RFC9621"/>.</t>
    </section>
    <section anchor="implementing-connection-objects">
      <name>Implementing Connection Objects</name>
      <t>The connection Connection objects that are exposed to applications for Transport Services are:</t>
      <ul spacing="normal">
        <li>
          <t>the Preconnection, the bundle of properties that describes the application constraints on, and preferences for, the transport;</t>
        </li>
        <li>
          <t>the Connection, the basic object that represents a flow of data as Messages in either direction between the Local and Remote Endpoints;</t>
        </li>
        <li>
          <t>and the Listener, a passive waiting object that delivers new Connections.</t>
        </li>
      </ul>
      <t>Preconnection objects should be implemented as bundles of properties that an application can both read and write. A Preconnection object influences a Connection only at one point in time: when the Connection is created. Connection objects represent the interface between the application and the implementation to manage transport state, state and conduct data transfer. During the process of establishment (<xref target="conn-establish"/>), the Connection will not necessarily be immediately bound to a transport protocol instance, since multiple candidate Protocol Stacks might be raced.</t>
      <t>Once a Preconnection has been used to create an outbound Connection or a Listener, the implementation should ensure that the copy of the properties held by the Connection or Listener cannot be mutated by the application making changes to the original Preconnection object. This may involve the implementation performing a deep-copy, copying the object with all the objects that it references.</t>
      <t>Once the Connection is established, the Transport Services Implementation maps actions and events to the details of the chosen Protocol Stack. For example, the same Connection object may ultimately represent a single transport protocol instance (e.g., a TCP connection, a TLS session over TCP, a UDP flow with fully-specified fully specified Local and Remote Endpoint Identifiers, a DTLS session, a SCTP an Stream Control Transmission Protocol (SCTP) stream, a QUIC stream, or an HTTP/2 stream).
The Connection Properties held by a Connection or Listener are independent of other Connections that are not part of the same Connection Group.</t>
      <t>Connection establishment is only a local operation for a connectionless protocols, which serves to simplify the local send/receive functions and to filter the traffic for the specified addresses and ports <xref target="RFC8085"/> (for example example, using UDP or UDP-Lite transport without a connection handshake procedure).</t>
      <t>Once <tt>Initiate</tt> has been called, the Selection Properties and Endpoint information of the created Connection are immutable (i.e, (i.e., an application is not able to later modify the properties of a Connection by manipulating the original Preconnection object).
Listener objects are created with a Preconnection, at which point their configuration should be considered immutable by the implementation. The process of listening is described in <xref target="listen"/>.</t>
    </section>
    <section anchor="implementing-pre-establishment">
      <name>Implementing Pre-Establishment</name> Preestablishment</name>
      <t>The pre-establishment preestablishment phase allows applications to specify properties for the Connections that they are about to make, make or to query the API about potential Connections they could make.</t>
      <t>During pre-establishment preestablishment, the application specifies one or more Endpoints to be used for communication as well as protocol preferences and constraints via Selection Properties and, if desired, also Connection Properties. <xref section="4" sectionFormat="of" target="I-D.ietf-taps-interface"/> target="RFC9622"/> states that Connection Properties should preferably be configured during pre-establishment, preestablishment because they can serve as input to decisions that are made by the implementation (e.g., the capacity profile can guide usage of a protocol offering scavenger-type congestion control).</t>
      <t>The implementation stores these properties as a part of the Preconnection object for use during connection establishment. For Selection Properties that are not provided by the application, the implementation uses the default values specified in the Transport Services API (<xref target="I-D.ietf-taps-interface"/>).</t> target="RFC9622"/>).</t>
      <section anchor="configuration-time-errors">
        <name>Configuration-time errors</name>
        <name>Configuration-Time Errors</name>
        <t>The Transport Services system should have a list of supported protocols available, which each of which have transport features reflecting the capabilities of the protocol. Once an application specifies its Transport Properties, the Transport Services system matches the required and prohibited properties against the transport features of the available protocols (see <xref section="6.2" sectionFormat="of" target="I-D.ietf-taps-interface"/> target="RFC9622"/> for the definition of property preferences).</t>
        <t>In the following cases, failure should be detected during pre-establishment:</t> preestablishment:</t>
        <ul spacing="normal">
          <li>
            <t>A request by an application for properties that cannot be satisfied by any of the available protocols. For example, if an application requires <tt>perMsgReliability</tt>, but no such feature is available in any protocol on the host running the Transport Services system system, this should result in an error.</t>
          </li>
          <li>
            <t>A request by an application for properties that are in conflict with each other, such as specifying required and prohibited properties that cannot be satisfied by any protocol. For example, if an application prohibits <tt>reliability</tt> but then requires <tt>perMsgReliability</tt>, this mismatch should result in an error.</t>
          </li>
        </ul>
<!-- [rfced] We are having trouble understanding "finally" - perhaps
     "finally" can be removed?  Otherwise, perhaps "ultimately" would
     be more clear?

Original:
   To avoid allocating resources that are not finally needed, it is
   important that configuration-time errors fail as early as possible.
-->

        <t>To avoid allocating resources that are not finally needed, it is important that configuration-time errors fail as early as possible.</t>
      </section>
      <section anchor="role-of-system-policy">
        <name>Role of system policy</name> System Policy</name>
        <t>The properties specified during pre-establishment preestablishment have a close relationship to system policy. The implementation is responsible for combining and reconciling several different sources of preferences when establishing Connections. These include, but are not limited to:</t>
        <ol spacing="normal" type="1"><li>
            <t>Application preferences, i.e., preferences specified during the pre-establishment preestablishment via Selection Properties.</t>
          </li>
          <li>
            <t>Dynamic system policy, i.e., policy compiled from internally and externally acquired information about available network interfaces, supported transport protocols, and current/previous Connections. Examples of ways to externally retrieve policy-support information are through OS-specific statistics/measurement tools and tools that reside on middleboxes and routers.</t>
          </li>
          <li>
            <t>Default implementation policy, i.e., predefined policy by the OS or application.</t>
          </li>
        </ol>
        <t>In general, any protocol or path used for a Connection must conform to all three sources of constraints. A violation that occurs at any of the policy layers should cause a protocol or path to be considered ineligible for use. If such a violation prevents a Connection from being established, this should be communicated to the application, e.g. e.g., via the <tt>EstablishmentError</tt> event. For an example of application preferences leading to constraints, an application may prohibit the use of metered network interfaces for a given Connection to avoid user cost. Similarly, the system policy at a given time may prohibit the use of such a metered network interface from the application's process. Lastly, the implementation itself may default to disallowing certain network interfaces unless explicitly requested by the application.</t>
        <t>It is expected that the database of system policies and the method of looking up these policies will vary across various platforms. An implementation should attempt to look up the relevant policies for the system in a dynamic way to make sure it is reflecting reflects an accurate version of the system policy, since the system's policy regarding the application's traffic may change over time due to user or administrative changes.</t>
      </section>
    </section>
    <section anchor="conn-establish">
      <name>Implementing Connection Establishment</name>
      <t>The process of establishing a network connection begins when an application expresses intent to communicate with a Remote Endpoint by calling <tt>Initiate</tt>, at which point the Preconnection object contains all constraints or requirements the application has configured. The establishment process can be considered complete once there is at least one Protocol Stack that has completed any required setup to the point that it can transmit and receive the application's data.</t>

<!-- [rfced] We are having trouble parsing "only after waiting for
     failures".  Please consider whether the suggested text conveys
     the intended meaning.

Original:
   These attempts are usually staggered, starting each next option
   after a delay, but they can also be performed in parallel or only
   after waiting for failures.

Perhaps:
   These attempts are usually staggered, with each next option
   starting after a delay; however, they can also be performed in
   parallel or after failures occur.
-->
<t>Connection establishment is divided into two top-level steps: Candidate steps:</t>
<ul>
  <li>Candidate Gathering (defined in <xref section="4.2.1" sectionFormat="of" target="I-D.ietf-taps-arch"/>), target="RFC9621"/>) to identify the paths, protocols, and endpoints to use (see <xref target="gathering"/>); and Candidate target="gathering"/>) and</li>
  <li>Candidate Racing (defined in <xref section="4.2.2" sectionFormat="of" target="I-D.ietf-taps-arch"/>), target="RFC9621"/>), in which the necessary protocol handshakes are conducted so that the Transport Services system can select which set to use (see <xref target="racing"/>). Candidate target="racing"/>).</li>
</ul>
<t>Candidate Racing involves attempting multiple options for connection establishment, establishment and choosing the first option to succeed as the Protocol Stack to use for the connection. These attempts are usually staggered, starting each next option after a delay, but delay; however, they can also be performed in parallel or only after waiting for failures.</t>
      <t>For ease of illustration, this document structures the candidates for racing as a tree (see <xref target="tree-structure"/>).
      This is not meant to restrict implementations from structuring racing candidates differently.</t>

<!--[rfced] We have attempted to break this long sentence up using a
     list for the ease of the reader.  Please review and let us know
     if further updates are necessary (particularly, is the second
     bullet also talking about cases of a hostname and port?):

Original:
 However, each step may also differ depending on the requirements of
 the connection: if the Endpoint Identifier is a hostname and port,
 then there may be multiple resolved addresses that are available;
 there may also be multiple paths available, (in this case using an
 interface other than the default system interface); and some
 protocols may not need any transport handshake to be considered
 "established" (such as UDP), while other connections may utilize
 layered protocol handshakes, such as TLS over TCP.

Current:
However, each step may also differ depending on the requirements of
the connection:

   *  if the Endpoint Identifier is a hostname and port, then there may
      be multiple resolved addresses that are available;

   *  there may also be multiple paths available (in this case using an
      interface other than the default system interface); and

   *  some protocols may not need any transport handshake to be
      considered "established" (such as UDP), while other connections
      may utilize layered protocol handshakes, such as TLS over TCP.

-->

<t>The most simple simplest example of this process might involve identifying the single IP address to which the implementation wishes to connect, using the system's current default path (i.e., using the default interface), and starting a TCP handshake to establish a stream to the specified IP address. However, each step may also differ depending on the requirements of the connection: if connection:</t>
<ul>
  <li>if the Endpoint Identifier is a hostname and port, then there may be multiple resolved addresses that are available; there available;</li>
  <li>there may also be multiple paths available, available (in this case using an interface other than the default system interface); and some and</li>
<li>some protocols may not need any transport handshake to be considered "established" (such as UDP), while other connections may utilize layered protocol handshakes, such as TLS over TCP.</t> TCP.</li></ul>

<!--[rfced] Can we update this list as follows?

Original:
The hostname resolves to a single IPv4 address on the Wi-Fi network,
and resolves to the same IPv4 address on the LTE network, as well as a
single IPv6 address.

Perhaps:
The hostname resolves to a single IPv4 address on the Wi-Fi network,
to the same IPv4 address on the LTE network, and to a single IPv6
address.
-->

<t>Whenever an implementation has multiple options for connection establishment, it can view the set of all individual connection establishment options as a single, single aggregate connection establishment. The aggregate set conceptually includes every valid combination of endpoints, paths, and protocols. As an example, consider an implementation that initiates a TCP connection to a hostname + port Endpoint Identifier, Identifier and that has two valid interfaces available (Wi-Fi and LTE). The hostname resolves to a single IPv4 address on the Wi-Fi network, and resolves to the same IPv4 address on the LTE network, as well as a single IPv6 address. The aggregate set of connection establishment options can be viewed as follows:</t>

<!-- [rfced] The following extends beyond the 72 character margin.
     Please review and let us know how the artwork may be adjusted.

FYI: This is a 72 character ruler:
123456789012345678901234567890123456789012345678901234567890123456789012

A) Section 4:
Aggregate [Endpoint Identifier: www.example.com:443] [Interface: Any]   [Protocol: TCP]
|-> [Endpoint Identifier: [2001:db8:23::1]:443]        [Interface: Wi-Fi] [Protocol: TCP]
|-> [Endpoint Identifier: 192.0.2.1:443]             [Interface: LTE]   [Protocol: TCP]
|-> [Endpoint Identifier: [2001:db8:42::1]:443]        [Interface: LTE]   [Protocol: TCP]

B) Section 4.1:
                             ||
              +==============================+
              | www.example.com:443/any path |
              +==============================+
                 //                     \\
+===========================+      +===========================+
| www.example.com:443/Wi-Fi |      |  www.example.com:443/LTE  |
+===========================+      +===========================+
             ||                            //               \\
+============================+  +=====================+  +==========================+
| [2001:db8:23::1]:443/Wi-Fi |  |  192.0.2.1:443/LTE  |  | [2001:db8:42::1]:443/LTE |
+============================+  +=====================+  +==========================+

C) Section 6.3:
MessageFramer.AdvanceReceiveCursor(connection, length)
MessageFramer.DeliverAndAdvanceReceiveCursor(connection, messageContext, length, endOfMessage)
MessageFramer.Deliver(connection, messageContext, messageData, endOfMessage)
-->

      <artwork><![CDATA[
Aggregate [Endpoint Identifier: www.example.com:443] [Interface: Any]   [Protocol: TCP]
|-> [Endpoint Identifier: [2001:db8:23::1]:443]        [Interface: Wi-Fi] [Protocol: TCP]
|-> [Endpoint Identifier: 192.0.2.1:443]             [Interface: LTE]   [Protocol: TCP]
|-> [Endpoint Identifier: [2001:db8:42::1]:443]        [Interface: LTE]   [Protocol: TCP]
]]></artwork>
      <t>Any one of these sub-entries subentries on the aggregate connection attempt would satisfy the original application intent. The concern of this section is the algorithm defining which of these options to try, when, when to try them, and in what order.</t>
      <t>During Candidate Gathering (<xref target="gathering"/>), an implementation prunes and sorts branches according
to the Selection Property preferences (<xref section="6.2" sectionFormat="of" target="I-D.ietf-taps-interface"/>.
It first target="RFC9622"/>).
First, it excludes all protocols and paths that match a Prohibit property or do not
match all Require properties. Then Then, it will sort branches according to Preferred
properties, Avoided properties, and possibly and, possibly, other criteria.</t>
      <section anchor="tree-structure">
        <name>Structuring Candidates as a Tree</name>
        <t>As noted above, the consideration of multiple candidates in a gathering and racing process can be conceptually structured as a tree; this terminological convention is used throughout this document.</t>
        <t>Each leaf node of the tree represents a single, single coherent connection attempt, attempt with an endpoint, a network path, and a set of protocols that can directly negotiate and send data on the network. Each node in the tree that is not a leaf represents a connection attempt that is either underspecified, underspecified or else includes multiple distinct options. For example, when connecting on an IP network, a connection attempt to a hostname and port is underspecified, underspecified because the connection attempt requires a resolved IP address as its Remote Endpoint Identifier. In this case, the node represented by the connection attempt to the hostname is a parent node, node with child nodes for each IP address. Similarly, an implementation that is allowed to connect using multiple interfaces will have a parent node of the tree for the decision between the network paths, paths with a branch for each interface.</t>
        <t>The example aggregate connection attempt above can be drawn as a tree by grouping the addresses resolved on the same interface into branches:</t>
        <artwork><![CDATA[
                             ||
              +==============================+
              | www.example.com:443/any path |
              +==============================+
                 //                     \\
+===========================+      +===========================+
| www.example.com:443/Wi-Fi |      |  www.example.com:443/LTE  |
+===========================+      +===========================+
             ||                            //               \\
+============================+  +=====================+  +==========================+
| [2001:db8:23::1]:443/Wi-Fi |  |  192.0.2.1:443/LTE  |  | [2001:db8:42::1]:443/LTE |
+============================+  +=====================+  +==========================+
]]></artwork>

<!--[rfced] We have updated to match the way characters appear in
     RFC-to-be 9622.  Please note that RFC-to-be 9622 enclosing these
     types of characters in tt tags.  Should the same convention be
     applied here?

Original:
That child node will be uniquely identified by concatenating its
integer to its parent's identifier with a dot in between, such as
"1.1" and "1.2".

and

In Protocol Stacks, the layers are separated by '/' and ordered with
the protocol closest to the application first.

Current:
That child node will be uniquely identified by concatenating its
integer to its parent's identifier with a dot character (".") in
between, such as "1.1" and "1.2".

and

In Protocol Stacks, the layers are separated by a slash character
("/") and ordered with the protocol closest to the application first.
-->

        <t>The rest of this section will use a notation scheme to represent this tree. The root node (or parent node) of the tree will be represented by a single integer, such as "1". ("1" is used assuming that this is the first connection made by the system; future connections created by the application would allocate numbers in an increasing manner.) Each child of that node will have an integer that identifies it, from 1 to the number of children. That child node will be uniquely identified by concatenating its integer to its parent's identifier with a dot character (".") in between, such as "1.1" and "1.2". Each node will be summarized by a tuple of three elements: endpoint, path (labeled here by interface), and protocol. In Protocol Stacks, the layers are separated by '/' a slash character ("/") and ordered with the protocol closest to the application first. The above example can now be written more succinctly as:</t>
        <artwork><![CDATA[
1 [www.example.com:443, any path, TCP]
  1.1 [www.example.com:443, Wi-Fi, TCP]
    1.1.1 [[2001:db8:23::1]:443, Wi-Fi, TCP]
  1.2 [www.example.com:443, LTE, TCP]
    1.2.1 [192.0.2.1:443, LTE, TCP]
    1.2.2 [[2001:db8.42::1]:443, LTE, TCP]
]]></artwork>
        <t>When an implementation is asked to establish a single connection, only one of the leaf nodes in the candidate set is needed to transfer data. Thus, once a single leaf node becomes ready to use, then the connection establishment tree is considered ready. One way to implement this is by having every leaf node update the state of its parent node when it becomes ready, ready until the root node of the tree is ready, which then notifies the application that the Connection as a whole is ready to use.</t>
        <t>A connection establishment tree may consist of only a single node, such as a connection attempt to an IP address over a single interface with a single protocol.</t>
        <artwork><![CDATA[
1 [[2001:db8:23::1]:443, Wi-Fi, TCP]
]]></artwork>
        <t>A root node may also only have one child (or leaf) node, such as a when a hostname resolves to only a single IP address.</t>
        <artwork><![CDATA[
1 [www.example.com:443, Wi-Fi, TCP]
  1.1 [[2001:db8:23::1]:443, Wi-Fi, TCP]
]]></artwork>
        <section anchor="branch-types">

<!--[rfced] Might it be helpful to the reader to list the three types
     of branching here?

Original:
4.1.1.  Branch Types

   There are three types of branching from a parent node into one or
   more child nodes.  Any parent node of the tree must only use one type
   of branching.

4.1.1.1.  Derived Endpoints
-->

          <name>Branch Types</name>
          <t>There are three types of branching from a parent node into one or more child nodes. Any parent node of the tree must only use one type of branching.</t>
          <section anchor="derived-endpoints">
            <name>Derived Endpoints</name>
            <t>If a connection originally targets a single Endpoint Identifer, Identifier, there may be multiple endpoint candidates of different types that can be derived from the original. This creates an ordered list of the derived endpoint candidates according to application preference, system policy policy, and expected performance.</t>
            <t>DNS hostname-to-address resolution is the most common method of endpoint derivation. When trying to connect to a hostname Endpoint Identifer Identifier on a traditional IP network, the implementation should send all applicable DNS queries. Commonly, this will include both A (IPv4) and AAAA (IPv6) records if both address families are supported on the local interface. This can also include SRV records <xref target="RFC2782"/>, SVCB and HTTPS records <xref target="I-D.ietf-dnsop-svcb-https"/>, target="RFC9460"/>, or other future record types. The algorithm for ordering and racing these addresses should follow the recommendations in Happy Eyeballs <xref target="RFC8305"/>.</t>
            <artwork><![CDATA[
1 [www.example.com:443, Wi-Fi, TCP]
  1.1 [[2001:db8::1]:443, Wi-Fi, TCP]
  1.2 [192.0.2.1:443, Wi-Fi, TCP]
  1.3 [[2001:db8::2]:443, Wi-Fi, TCP]
  1.4 [[2001:db8::3]:443, Wi-Fi, TCP]
]]></artwork>
            <t>DNS-Based Service Discovery <xref target="RFC6763"/> can also provide an endpoint derivation step. When trying to connect to a named service, the client may discover one or more hostname and port pairs on the local network using multicast DNS <xref target="RFC6762"/>. These hostnames should each be treated as a branch that can be attempted independently from other hostnames. Each of these hostnames might resolve to one or more addresses, which would create multiple layers of branching.</t>
            <artwork><![CDATA[
1 [term-printer._ipp._tcp.meeting.example.com, Wi-Fi, TCP]
  1.1 [term-printer.meeting.example.com:631, Wi-Fi, TCP]
    1.1.1 [31.133.160.18:631, Wi-Fi, TCP]
]]></artwork>
            <t>Applications can influence which derived Endpoints are allowed and preferred via Selection Properties set on the Preconnection. For example, setting a preference for <tt>useTemporaryLocalAddress</tt> would prefer the use of IPv6 over IPv4, and requiring <tt>useTemporaryLocalAddress</tt> would eliminate IPv4 options, options since IPv4 does not support temporary addresses.</t>
          </section>
          <section anchor="network-paths">
            <name>Network Paths</name>
            <t>If a client has multiple network paths available to it, e.g., a mobile client with interfaces for both Wi-Fi and Cellular connectivity, it can attempt a connection over any of the paths. This represents a branch point in the connection establishment. Similar to a derived endpoint, the paths should be ranked based on preference, system policy, and performance. Attempts should be started on one path (e.g., a specific interface), interface) and then successively on other paths (or interfaces) after delays based on the expected path round-trip-time RTT or other available metrics.</t>
            <artwork><![CDATA[
1 [192.0.2.1:443, any path, TCP]
  1.1 [192.0.2.1:443, Wi-Fi, TCP]
  1.2 [192.0.2.1:443, LTE, TCP]
]]></artwork>
            <t>The same approach applies to any situation in which the client is aware of multiple links or views of the network. A single interface may be shared by
multiple network paths, each with a coherent set of addresses, routes, DNS server, and more. A path may also represent a virtual interface service such as a Virtual Private Network (VPN).</t>
            <t>The list of available paths should be constrained by any requirements the application sets, sets as well as by the system policy.</t>
          </section>
          <section anchor="protocol-options">
            <name>Protocol Options</name>
            <t>Differences in possible protocol compositions and options can also provide a branching point in connection establishment. This allows clients to be resilient to situations in which a certain protocol is not functioning on a server or network.</t>
            <t>This approach is commonly used for connections with optional proxy server configurations. A single connection might have several options available: an HTTP-based proxy, a SOCKS-based proxy, or no proxy. As above, these options should be ranked based on preference, system policy, and performance performance, and should be attempted in succession.</t>
            <artwork><![CDATA[
1 [www.example.com:443, any path, HTTP/TCP]
  1.1 [192.0.2.8:443, any path, HTTP/HTTP Proxy/TCP]
  1.2 [192.0.2.7:10234, any path, HTTP/SOCKS/TCP]
  1.3 [www.example.com:443, any path, HTTP/TCP]
    1.3.1 [192.0.2.1:443, any path, HTTP/TCP]
]]></artwork>
            <t>This approach also allows a client to attempt different sets of application and transport protocols that, when available, could provide preferable features. For example, the protocol options could involve QUIC <xref target="RFC9000"/> over UDP on one branch, branch and HTTP/2 <xref target="RFC7540"/> over TLS over TCP on the other:</t>
            <artwork><![CDATA[
1 [www.example.com:443, any path, HTTP]
  1.1 [www.example.com:443, any path, HTTP3/QUIC/UDP]
    1.1.1 [192.0.2.1:443, any path, HTTP3/QUIC/UDP]
  1.2 [www.example.com:443, any path, HTTP2/TLS/TCP]
    1.2.1 [192.0.2.1:443, any path, HTTP2/TLS/TCP]
]]></artwork>
            <t>Another example is racing SCTP with TCP:</t>
            <artwork><![CDATA[
1 [www.example.com:4740, any path, reliable-inorder-stream]
  1.1 [www.example.com:4740, any path, SCTP]
    1.1.1 [192.0.2.1:4740, any path, SCTP]
  1.2 [www.example.com:4740, any path, TCP]
    1.2.1 [192.0.2.1:4740, any path, TCP]
]]></artwork>
            <t>Implementations that support racing protocols and protocol options should maintain a history of which protocols and protocol options were successfully established, established on a per-network and per-endpoint basis (see <xref target="performance-caches"/>). This information can influence future racing decisions to prioritize or prune branches.</t>
          </section>
        </section>
        <section anchor="branching-order-of-operations">
          <name>Branching Order-of-Operations</name>
          <t>Branch types ought to occur in a specific order relative to one another to avoid creating leaf nodes with invalid or incompatible settings. In the example above, it would be invalid to branch for derived endpoints (the DNS results for www.example.com) before branching between interface paths, paths since there are situations when the results will be different across networks due to private names or different supported IP versions. Implementations need to be careful to branch in a consistent order that results in usable leaf nodes whenever there are multiple branch types that could be used from a single node.</t>
          <t>This document recommends the following order of operations for branching:</t>
          <ol spacing="normal" type="1"><li>
              <t>Network Paths</t>
            </li>
            <li>
              <t>Protocol Options</t>
            </li>
            <li>
              <t>Derived Endpoints</t>
            </li>
          </ol>
          <t>where a lower number indicates higher precedence and therefore and, therefore, higher placement in the tree. Branching between paths is the first in the list because results across multiple interfaces are likely not related to one another: endpoint resolution may return different results, especially when using locally resolved host and service names, names and which the protocols that are supported and preferred may differ across interfaces. Thus, if multiple paths are attempted, the overall connection establishment process can be seen as a race between the available paths or interfaces.</t>
          <t>Protocol options are next checked in order. Whether or not a set of protocols, or protocol-specific options, can successfully connect is generally not dependent on which specific IP address is used. Furthermore, the Protocol Stacks being attempted may influence or altogether change the Endpoint Identifers Identifiers being used. Adding a proxy to a connection's branch will change the Endpoint Identifer Identifier to the proxy's IP address or hostname. Choosing an alternate protocol may also modify the ports that should be selected.</t>
          <t>Branching for derived endpoints is the final step, step and may have multiple layers of derivation or resolution, such as DNS service resolution and DNS hostname resolution.</t>

<!--[rfced] Please review the multiple uses of "first" in this
     sentence about ordering.  It may be helpful to the reader to
     clarify.

Original:

..branches
   will be first sorted accord to path selection, with WiFi
   attempted first.  Then, branches with SCTP will be attempted first
   within their subtree according to the properties influencing protocol
   selection.

-->

          <t>For example, if the application has indicated both a preference for WiFi Wi-Fi over LTE and for a feature only available in SCTP, branches will be first be sorted accord according to path selection, with WiFi Wi-Fi attempted first. Then, branches with SCTP will be attempted first within their subtree according to the properties influencing protocol selection. However, if the implementation has current cache information that SCTP is not available on the path over WiFi, Wi-Fi, there would be no SCTP node in the WiFi Wi-Fi subtree. Here, the path over WiFi Wi-Fi will be attempted first, and, if connection establishment succeeds, TCP will be used. Thus, the Selection Property preferring WiFi Wi-Fi takes precedence over the Property that led to a preference for SCTP.</t>
          <artwork><![CDATA[
1. [www.example.com:80, any path, reliable-inorder-stream]
1.1 [192.0.2.1:443, Wi-Fi, reliable-inorder-stream]
1.1.1 [192.0.2.1:443, Wi-Fi, TCP]
1.2 [192.0.3.1:443, LTE, reliable-inorder-stream]
1.2.1 [192.0.3.1:443, LTE, SCTP]
1.2.2 [192.0.3.1:443, LTE, TCP]
]]></artwork>
        </section>
        <section anchor="branch-sorting">
          <name>Sorting Branches</name>
          <t>Implementations should sort the branches of the tree of connection options in order of their preference rank, rank from most preferred to least preferred as
specified by Selection Properties <xref target="I-D.ietf-taps-interface"/>. target="RFC9622"/>.
Leaf nodes on branches with higher rankings represent connection attempts that will be raced first.</t>
          <t>In addition to the properties provided by the application, an implementation may include additional criteria such as cached performance estimates, see estimates (see <xref target="performance-caches"/>, target="performance-caches"/>) or system policy, see policy (see <xref target="role-of-system-policy"/>, target="role-of-system-policy"/>) in the ranking.
Two examples of how Selection and Connection Properties may be used to sort branches are provided below:</t>
          <ul
          <dl spacing="normal">
            <li>
              <t>"Interface

              <dt>"Interface Instance or Type" (property name <tt>interface</tt>):
If <tt>interface</tt>):</dt>
<dd>If the application specifies an interface type to be preferred or avoided, implementations should accordingly rank the paths.
If the application specifies an interface type to be required or prohibited, an implementation is expected to exclude the non-conforming paths.</t>
            </li>
            <li>
              <t>"Capacity nonconforming paths.</dd>

              <dt>"Capacity Profile" (property name <tt>connCapacityProfile</tt>):
An <tt>connCapacityProfile</tt>):</dt>
<dd><t>An implementation can use the capacity profile to prefer paths that match an application's expected traffic profile. This match will use cached performance estimates, estimates; see <xref target="performance-caches"/>. Some examples of path preferences based on capacity profiles include:  </t>
              <ul include:</t>
              <dl spacing="normal">
                <li>
                  <t>Low Latency/Interactive:
Prefer

                  <dt>Low Latency/Interactive:</dt>
<dd>Prefer paths with the lowest expected Round Trip Time, Round-Trip Time (RTT), based on observed Round Trip Time estimates;</t>
                </li>
                <li>
                  <t>Low RTT estimates;</dd>

                  <dt>Low Latency/Non-Interactive:</dt>
<!-- [rfced] May we update this text for clarity?

Original:
     -  Low Latency/Non-Interactive: Prefer paths with a low expected
        Round Trip Time, but can tolerate delay variation;</t>
                </li>
                <li>
                  <t>Constant-Rate Streaming: variation;

Perhaps:
     -  Low Latency/Non-Interactive: Prefer paths with a low expected
        Round Trip Time (RTT) that can tolerate delay variation;
-->

<dd>Prefer paths with a low expected Round-Trip Time (RTT), but can tolerate delay variation;</dd>

                  <dt>Constant-Rate Streaming:</dt>
<dd>Prefer paths that are expected to satisfy the requested stream send or receive bitrate, bitrate based on the observed maximum throughput;</t>
                </li>
                <li>
                  <t>Capacity-Seeking:
Prefer throughput;</dd>

                  <dt>Capacity-Seeking:</dt>
<dd>Prefer adapting to paths to determine the highest available capacity, capacity based on the observed maximum throughput.</t>
                </li>
              </ul>
            </li>
          </ul> throughput.</dd>
	      </dl>
</dd>
</dl>
          <t>As another example, branch sorting can also be influenced by bounds on the send or receive rate (Selection Properties <tt>minSendRate</tt> / <tt>minRecvRate</tt> / <tt>maxSendRate</tt> / <tt>maxRecvRate</tt>): if the application indicates a bound on the expected send or receive bitrate, an implementation may prefer a path that can likely provide the desired bandwidth, based on cached maximum throughput, see throughput (see <xref target="performance-caches"/>. target="performance-caches"/>). The application may know the send or receive bitrate from metadata in adaptive HTTP streaming, such as MPEG-DASH.</t>

          <t>Implementations process the Properties (<xref section="6.2" sectionFormat="of" target="I-D.ietf-taps-interface"/>) target="RFC9622"/>) in the following order: Prohibit, Require, Prefer, Avoid.
If Selection Properties contain any prohibited properties, the implementation should first purge branches containing nodes with these properties. For required properties, it should only keep branches that satisfy these requirements. Finally, it should order the branches according to the preferred properties, properties and finally use any avoided properties as a tiebreaker.
When ordering branches, an implementation can give more weight to properties that the application has explicitly set, set rather than to the properties that are set by default.</t>
          <t>The available protocols and paths on a specific system and in a specific context can change; therefore, the result of sorting and the outcome of racing may vary, even when using the same Selection and Connection Properties. However, an implementation ought to provide a consistent outcome to applications, e.g., by preferring protocols and paths that are already used by existing Connections that specified similar Properties.</t>
        </section>
      </section>
      <section anchor="gathering">
        <name>Candidate Gathering</name>

<!--[rfced] Are the terms in the following sentence related to those
     mentioned two paragraphs above (from RFC-to-be 9622)?  If so,
     should they take the same form and/or should avoidance be added?

Original:
This list is determined by the requirements, prohibitions, and
preferences of the application as specified in the Selection
Properties.

Two paragraphs before:
Original:
Implementations process the Properties (Section 6.2 of
[I-D.ietf-taps-interface]) in the following order: Prohibit, Require,
Prefer, Avoid.

A few sentences later includes "avoid":
Original:
Finally, it should order the branches according to the preferred
properties, and finally use any avoided properties as a tiebreaker.
-->

        <t>The step of gathering candidates involves identifying which paths, protocols, and endpoints may be used for a given Connection. This list is determined by the requirements, prohibitions, and preferences of the application as specified in the Selection Properties.</t>
        <section anchor="gathering-endpoint-candidates">
          <name>Gathering Endpoint Candidates</name>
          <t>Both Local and Remote Endpoint Candidates must be discovered during connection establishment.  To support Interactive Connectivity Establishment (ICE) <xref target="RFC8445"/>, or similar protocols that involve out-of-band indirect signalling signaling to exchange candidates with the Remote Endpoint, it is important to query the set of candidate Local Endpoints, Endpoints and provide the Protocol Stack with a set of candidate Remote Endpoints, Endpoints before the Local Endpoint attempts to establish connections.</t>
          <section anchor="local-endpoint-candidates">
            <name>Local Endpoint candidates</name> Candidates</name>
            <t>The set of possible Local Endpoints is gathered.  In a simple case, this merely enumerates the local interfaces and protocols, protocols and allocates ephemeral source ports.  For example, a system that has WiFi Wi-Fi and Ethernet and supports IPv4 and IPv6 might gather four candidate Local Endpoints (IPv4 on Ethernet, IPv6 on Ethernet, IPv4 on WiFi, Wi-Fi, and IPv6 on WiFi) Wi-Fi) that can form the source for a transient.</t>
            <t>If NAT traversal is required, the process of gathering Local Endpoints becomes broadly equivalent to the ICE Candidate Gathering phase (see <xref section="5.1.1" sectionFormat="of" target="RFC8445"/>).  The endpoint determines its server reflexive server-reflexive Local Endpoints (i.e., the translated address of a Local Endpoint, on the other side of a NAT, e.g e.g., via a STUN sever server <xref target="RFC5389"/>) and relayed Local Endpoints (e.g., via a TURN server <xref target="RFC5766"/> or other relay), relay) for each interface and network protocol.  These are added to the set of candidate Local Endpoint Identifers Identifiers for this connection.</t>
            <t>Gathering Local Endpoints is primarily a local operation, although it might involve exchanges with a STUN server to derive server reflexive server-reflexive Local Endpoints, Endpoints or with a TURN server or other relay to derive relayed Local Endpoints.  However, it does not involve communication with the Remote Endpoint.</t>
          </section>
          <section anchor="remote-endpoint-candidates">
            <name>Remote Endpoint Candidates</name>
            <t>The Remote Endpoint Identifer Identifier is typically a name that needs to be resolved into a set of possible addresses that can be used for communication.  Resolving the Remote Endpoint is the process of recursively performing such name lookups, until fully resolved, to return the set of candidates for the Remote Endpoint of this Connection.</t>

            <t>How this resolution is done will depend on the type of the Remote Endpoint, Endpoint and can also be specific to each Local Endpoint.  A common case is when the Remote Endpoint Identifer Identifier is a DNS name, in which case case, it is resolved to give a set of IPv4 and IPv6 addresses representing that name.  Some types of Remote Endpoint Identifers Identifiers might require more complex resolution.  Resolving the Remote Endpoint for a peer-to-peer connection might involve communication with a rendezvous server.  The server, which in turn turn, contacts the peer to gain consent to communicate and retrieve its set of candidate Local Endpoints, which Endpoints. These Endpoints are returned and form the candidate remote addresses for contacting that peer.</t>

<!--[rfced] Is "to rendezvous" the rendezvous server?  We are a bit
     confused by the second part of the sentence.  If our suggestion
     does not capture your intent, please rephrase.

Original:
It will involve a directory service, and can require communication
with the Remote Endpoint to rendezvous and exchange peer addresses.

Perhaps:
It will involve a directory service and can require communication
between the Remote Endpoint and a rendezvous server as well as the
exchange of peer addresses.
-->

            <t>Resolving the Remote Endpoint is not a local operation.  It will involve a directory service, service and can require communication with the Remote Endpoint to rendezvous and exchange peer addresses.  This can expose some or all of the candidate Local Endpoints to the Remote Endpoint.</t>
          </section>
        </section>
      </section>
      <section anchor="racing">
        <name>Candidate Racing</name>
        <t>The primary goal of the Candidate Racing process is to successfully negotiate a Protocol Stack to an endpoint over an interface to connect a single leaf node of the tree with as little delay and as few unnecessary connections attempts as possible. Optimizing these two factors improves the user experience, while minimizing network load.</t>
        <t>This section covers the dynamic aspect of connection establishment. The tree described above is a useful conceptual and architectural model. However, an implementation is unable to know all of the nodes that will be used until steps like name resolution have occurred, and occurred; many of the possible branches ultimately might not be attempted.</t>
        <t>There are three different approaches to racing the attempts for different nodes of the connection establishment tree:</t>
        <ol spacing="normal" type="1"><li>
            <t>Simultaneous</t>
          </li>
          <li>
            <t>Staggered</t>
          </li>
          <li>
            <t>Failover</t>
          </li>
        </ol>
        <t>Each approach is appropriate in different use-cases use cases and branch types. However, to avoid consuming unnecessary network resources, implementations should not use simultaneous racing as a default approach.</t>
        <t>The timing algorithms for racing should remain independent across branches of the tree. Any timer or racing logic is isolated to a given parent node, node and is not ordered precisely with regards regard to children of other nodes.</t>
        <section anchor="simultaneous">
          <name>Simultaneous</name>
          <t>Simultaneous racing is when multiple alternate branches are started without waiting for any one branch to make progress before starting the next alternative. This means the attempts are effectively simultaneous. Simultaneous racing should be avoided by implementations, implementations since it consumes extra network resources and establishes state that might not be used.</t>
        </section>
        <section anchor="staggered">
          <name>Staggered</name>
          <t>Staggered racing can be used whenever a single node of the tree has multiple child nodes. Based on the order determined when building the tree, the first child node will be initiated immediately, followed by the next child node after some delay. Once that second child node is initiated, the third child node (if present) will begin after another delay, and so on until all child nodes have been initiated, initiated or one of the child nodes successfully completes its negotiation.</t>
          <t>Staggered racing attempts can proceed in parallel. Implementations should not terminate an earlier child connection attempt upon starting a secondary child.</t>
          <t>If a child node fails to establish connectivity (as in <xref target="determining-successful-establishment"/>) before the delay time has expired for the next child, the next child should be started immediately.</t>
          <t>Staggered racing between IP addresses for a generic Connection should follow the Happy Eyeballs algorithm described in <xref target="RFC8305"/>. <xref target="RFC8421"/> provides guidance Guidance for racing when performing Interactive Connectivity Establishment (ICE).</t> ICE can be found in <xref target="RFC8421"/>.</t>
          <t>Generally, the delay before starting a given child node ought to be based on the length of time the previously started child node is expected to take before it succeeds or makes progress in connection establishment. Algorithms like Happy Eyeballs choose a delay based on how long the transport connection handshake is expected to take. When performing staggered races in multiple branch types (such as racing between network interfaces, interfaces and then racing between IP addresses), a longer delay may be chosen for some branch types. For example, when racing between network interfaces, the delay should also take into account the amount of time it takes to prepare the network interface (such as radio association) and name resolution over that interface, interface in addition to the delay that would be added for a single transport connection handshake.</t>
          <t>Since the staggered delay can be chosen based on dynamic information, such as predicted Round Trip Time, RTT, implementations should define upper and lower bounds for delay times. These bounds are implementation-specific, implementation specific and may differ based on which branch type is being used.</t>
        </section>
        <section anchor="failover">
          <name>Failover</name>
          <t>If an implementation or application has a strong preference for one branch over another, the branching node may choose to wait until one child has failed before starting the next. Failure of a leaf node is determined by its protocol negotiation failing or timing out; failure of a parent branching node is determined by all of its children failing.</t>
          <t>An example in which failover is recommended is a race between a preferred Protocol Stack that uses a proxy and an alternate Protocol Stack that bypasses the proxy. Failover is useful in case if the proxy is down or misconfigured, but any more aggressive type of racing may end up unnecessarily avoiding a proxy that was preferred by policy.</t>
        </section>
      </section>
      <section anchor="completing-establishment">
        <name>Completing Establishment</name>

<!-- [rfced] For clarity, may we update "or else" to "otherwise" here?

Original:
   The process of connection establishment completes when one leaf
   node of the tree has successfully completed negotiation with the
   Remote Endpoint, or else all nodes of the tree have failed to
   connect.

Perhaps:
   The process of connection establishment completes when one leaf
   node of the tree has successfully completed negotiation with the
   Remote Endpoint; otherwise, all nodes of the tree have failed to
   connect.
-->

        <t>The process of connection establishment completes when one leaf node of the tree has successfully completed negotiation with the Remote Endpoint, or else all nodes of the tree have failed to connect. The first leaf node to complete its connection is then used by the application to send and receive data. This is signalled signaled to the application using the <tt>Ready</tt> event in the API (<xref section="7.1" sectionFormat="of" target="I-D.ietf-taps-interface"/>).</t> target="RFC9622"/>).</t>
        <t>Successes and failures of a given attempt should be reported up to parent nodes (towards (toward the root of the tree). For example, in the following case, if 1.1.1 fails to connect, it reports the failure to 1.1. Since 1.1 has no other child nodes, it also has failed and reports that failure to 1. Because 1.2 has not yet failed, 1 is not considered to have failed. Since 1.2 has not yet started, it is started and the process continues. Similarly, if 1.1.1 successfully connects, then it marks 1.1 as connected, which propagates to the root node 1. At this point, the Connection as a whole is considered to be successfully connected and ready to process application data.</t>
        <artwork><![CDATA[
1 [www.example.com:443, Any, TCP]
  1.1 [www.example.com:443, Wi-Fi, TCP]
    1.1.1 [192.0.2.1:443, Wi-Fi, TCP]
  1.2 [www.example.com:443, LTE, TCP]
...
]]></artwork>
        <t>If a leaf node has successfully completed its connection, all other attempts should be made ineligible for use by the application for the original request.
New connection attempts that involve transmitting data on the network ought not to be started after another leaf node has already successfully completed, completed because the Connection as a whole has now been established.
An implementation could choose to let certain handshakes and negotiations complete to gather metrics that influence future connections.
Keeping additional connections is generally not recommended, recommended because those attempts were slower to connect and may exhibit less desirable properties.</t>
        <section anchor="determining-successful-establishment">
          <name>Determining Successful Establishment</name>
          <t>On a per-protocol basis, implementations may select different criteria by which a leaf node is considered to be successfully connected. If the only protocol being used is a transport protocol with a clear handshake, like TCP, then the obvious choice is to declare that node "connected" when the three-way handshake has been completed. completes. If the only protocol being used is an a connectionless protocol, like UDP, the implementation may consider the node fully "connected" the moment it determines a route is present, before sending any packets on the network, see further in <xref target="connectionless-racing"/>.</t>
          <t>When

<!-- [rfced] For readability, may we update the <tt>Initiate</tt> text as follows?

Original:
   When the Initiate action is called without any Messages being sent
   at the same time, depending on the protocols involved, it is not
   guaranteed that the Remote Endpoint will be notified of this, and
   hence a passive endpoint's application may not receive a
   ConnectionReceived event until it receives the first Message on the
   new Connection.

Perhaps:
   Depending on the protocols involved, there is no guarantee that the
   Remote Endpoint will be notified when the Initiate action is called
   without any Messages being sent at the same time.  Therefore, a
   passive endpoint's application may not receive a ConnectionReceived
   event until it receives the first Message on the new Connection.
-->
          <t>When the <tt>Initiate</tt> action is called without any Messages being sent at the same time, depending on the
protocols involved, it is not guaranteed that the Remote Endpoint will be notified; hence, a passive
endpoint's application may not receive a <tt>ConnectionReceived</tt> event until it receives the first Message on the new Connection.</t>
          <t>For Protocol Stacks with multiple handshakes, the decision becomes more nuanced. If the Protocol Stack involves both TLS and TCP, an implementation could determine that a leaf node is connected after the TCP handshake is complete, or it can wait for the TLS handshake to complete as well. The benefit of declaring completion when the TCP handshake finishes, and thus stopping the race for other branches of the tree, is reduced burden on the network and Remote Endpoints from further connection attempts that are likely to be abandoned. On the other hand, by waiting until the TLS handshake is complete, an implementation avoids the scenario in which a TCP handshake completes quickly, but TLS negotiation is either very slow or fails altogether in particular network conditions or to a particular endpoint. To avoid the issue of TLS possibly failing, the implementation should not generate a <tt>Ready</tt> event for the Connection until the TLS handshake is complete.</t>
          <t>If all of the leaf nodes fail to connect during racing, i.e. i.e., none of the configurations that satisfy all requirements given in the Transport Properties actually work over the available paths, then the Transport Services system should report an <tt>EstablishmentError</tt> to the application. An <tt>EstablishmentError</tt> event should also be generated in case if the Transport Services system finds no usable candidates to race.</t>
        </section>
      </section>
      <section anchor="establish-mux">
        <name>Establishing Multiplexed Connections</name>

<!-- [rfced] We are having trouble parsing this sentence.  Are words
     missing?  Or perhaps the Connections are to "be multiplexed connections</name> and
     belong to the same Connection Group" or that the "multiplexed
     Connections belong to the same Connection Group"?

Original:
   Multiplexing several Connections over a single underlying transport
   connection requires that the Connections to be multiplexed belong to
   the same Connection Group (as is indicated by the application using
   the Clone action).
-->

        <t>Multiplexing several Connections over a single underlying transport connection requires that the Connections to be multiplexed belong to the same Connection Group (as is indicated by the application using the <tt>Clone</tt> action). When the underlying transport connection supports multi-streaming, the Transport Services System can map each Connection in the Connection Group to a different stream of this connection.</t>
        <t>For such streams, there is often no explicit connection
establishment procedure for the new stream prior to sending data on it (e.g., with SCTP). In this case, the same
considerations apply to determining stream establishment as apply to establishing a UDP connection, as
discussed in <xref target="determining-successful-establishment"/>.
This means that there might not
be any "establishment" message (like a TCP SYN).</t>
      </section>
      <section anchor="connectionless-racing">
        <name>Handling connectionless protocols</name> Connectionless Protocols</name>
        <t>While protocols that use an explicit handshake to validate a connection to a peer can be used for racing multiple establishment attempts in parallel, connectionless protocols such as raw UDP do not offer a way to validate the presence of a peer or the usability of a Connection without application feedback. An implementation should consider such a Protocol Stack to be established as soon as the Transport Services system has selected a path on which to send data.</t>
        <t>However, this can cause a problem if a specific peer is not reachable over the network using the connectionless protocol, protocol or data cannot be exchanged with the peer for any other reason. To handle the lack of an explicit handshake in the underlying protocol, an application can use a Message Framer (<xref target="message-framers"/>) on top of a connectionless protocol to only mark a specific connection attempt as ready when some data has been received, received or after some application-level handshake has been performed by the Message Framer.</t>
      </section>
      <section anchor="listen">
        <name>Implementing Listeners</name>
        <t>When an implementation is asked to Listen, it registers with the system to wait for incoming traffic to the Local Endpoint. If no Local Endpoint Identifer Identifier is specified, the implementation should use an ephemeral port.</t>
        <t>If the Selection Properties do not require a single network interface or path, path but allow the use of multiple paths, the Listener object should register for incoming traffic on all of the network interfaces or paths that conform to the Properties. The set of available paths can change over time, so the implementation should monitor network path changes, changes and change the registration of the Listener across all usable paths as appropriate. When using multiple paths, the Listener is generally expected to use the same port for listening on each.</t>
        <t>If the Selection Properties allow multiple protocols to be used for listening, listening and the implementation supports it, the Listener object should support receiving inbound connections for each eligible protocol on each eligible path.</t>
        <section anchor="implementing-listeners-for-connected-protocols">
          <name>Implementing Listeners for Connected Protocols</name>
          <t>Connected protocols such as TCP and TLS-over-TCP have a strong mapping between the Local and Remote Endpoint Identifers Identifiers (four-tuple) and their protocol connection state. These map into to Connection objects. Whenever a new inbound handshake is being started, the Listener should generate a new Connection object and pass it to the application.</t>
        </section>
        <section anchor="implementing-listeners-for-connectionless-protocols">
          <name>Implementing Listeners for Connectionless Protocols</name>
          <t>Connectionless protocols such as UDP and UDP-lite UDP-Lite generally do not provide the same mechanisms that connected Connected protocols do to offer Connection objects.  Implementations should wait for incoming packets for connectionless protocols on a listening port and should perform four-tuple matching of packets to existing Connection objects if possible. If a matching Connection object does not exist, an incoming packet from a connectionless protocol should cause a new Connection object to be created.</t>
        </section>
        <section anchor="implementing-listeners-for-multiplexed-protocols">
          <name>Implementing Listeners for Multiplexed Protocols</name>
          <t>Protocols that provide multiplexing of streams can listen for entirely new connections as well as for new sub-connections subconnections (streams of an already existing already-existing connection). A new stream arrival on an existing connection is presented to the application as a new Connection. This new Connection is grouped with all other Connections that are multiplexed via the same protocol.</t>
        </section>
      </section>
    </section>
    <section anchor="implementing-sending-and-receiving-data">
      <name>Implementing Sending and Receiving Data</name>
      <t>The most basic mapping for sending a Message is an abstraction of datagrams, in which the transport protocol naturally deals in discrete packets (such as UDP). Each Message here corresponds to a single datagram.</t>
      <t>For protocols that expose byte-streams (such as TCP), the only delineation provided by the protocol is the end of the stream in a given direction. Each Message in this case corresponds to the entire stream of bytes in a direction. These Messages may be quite long, in which case they can be sent in multiple parts.</t>
      <t>Protocols that provide framing (such as length-value protocols, or protocols that use delimiters like HTTP/1.1) may support Message sizes that do not fit within a single datagram. Each Message for framing protocols corresponds to a single frame, which may be sent either as a complete Message in the underlying protocol, protocol or in multiple parts.</t>
      <t>Messages themselves generally consist of bytes passed in the messageData parameter intended to be processed at an application layer. However, Message objects presented through the API
can carry associated Message Properties passed through the messageContext parameter.
When these are Protocol Specific Protocol-specific Properties, they can include metadata that exists separately from a byte
encoding. For example, these Properties can include name-value pairs of information, like HTTP header fields. In such cases, Messages might be "empty", "empty"
insofar as they contain zero bytes in the messageData parameter, but they can still include data in the messageContext that is interpreted by the Protocol Stack.</t>
      <section anchor="sending-messages">
        <name>Sending Messages</name>
        <t>The effect of the application sending a Message is determined by the top-level protocol in the established Protocol Stack. That is, if the top-level protocol provides an abstraction of framed Messages over a connection, the receiving application will be able to obtain multiple Messages on that connection, even if the framing protocol is built on a byte-stream protocol like TCP.</t>
        <section anchor="msg-properties">
          <name>Message Properties</name>
          <t>The API allows various properties to be associated with each Message, which should be implemented as discussed below.</t>
          <ul
          <dl spacing="normal">
            <li>
              <t><tt>msgLifetime</tt>: this

              <dt><tt>msgLifetime</tt>:</dt><dd>this should be implemented by removing the Message from the queue of pending Messages after the Lifetime has expired. A queue of pending Messages within the Transport Services Implementation that have yet to be handed to the Protocol Stack can always support this property, but once a Message has been sent into the send buffer of a protocol, only certain protocols may support removing it from their send buffer. For example, a Transport Services Implementation cannot remove bytes from a TCP send buffer, while it can remove data from a an SCTP send buffer using the partial reliability extension <xref target="RFC8303"/>. When there is no standing queue of Messages within the system, and the Protocol Stack does not support the removal of a Message from the stack's send buffer, this property may be ignored.</t>
            </li>
            <li>
              <t><tt>msgPriority</tt>: this ignored.</dd>

              <dt><tt>msgPriority</tt>:</dt><dd>this represents the ability to prioritize a Message over other Messages. This can be implemented by the Transport Services system by re-ordering reordering Messages that have yet to be handed to the Protocol Stack, Stack or by giving relative priority hints to protocols that support priorities per Message. For example, an implementation of HTTP/2 could choose to send Messages of different priority on streams of different priority.</t>
            </li>
            <li>
              <t><tt>msgOrdered</tt>: priority.</dd>

<!--[rfced] The double use of "this" seems strange in these sentences.
     Please rephrase.

Original:
when this is false, this disables the requirement of
in-order-delivery for protocols that support configurable ordering.

and

Original:
when this is true, this means that the Message can be used by a
transport mechanism that might deliver it multiple times...

and

Original:
when this is true, this means that the sender will not send any
further Messages.

-->

              <dt><tt>msgOrdered</tt>:</dt><dd>When this is false, this disables the requirement of in-order delivery for protocols that support configurable ordering. When the Protocol Stack does not support configurable ordering, this property may be ignored.</t>
            </li>
            <li>
              <t><tt>safelyReplayable</tt>: when ignored.</dd>

              <dt><tt>safelyReplayable</tt>:</dt><dd>When this is true, this means that the Message can be used by a transport mechanism that might deliver it multiple times -- e.g., as a result of racing multiple transports or as part of TCP Fast Open. Open (TFO). Also, protocols that do not protect against duplicated Messages, such as UDP (when used directly, without a protocol layered atop), can only be used with Messages that are Safely Replayable. When a Transport Services system is permitted to replay Messages, replay protection could be provided by the application.</t>
            </li>
            <li>
              <t><tt>final</tt>: when application.</dd>

              <dt><tt>final</tt>:</dt><dd>When this is true, this means that the sender will not send any further Messages. The Connection need not be closed (in case (if the Protocol Stack supports half-close operation, half-closed operations, like TCP). Any Messages sent after a Message marked <tt>final</tt> will result in a SendError.</t>
            </li>
            <li>
              <t><tt>msgChecksumLen</tt>: when SendError.</dd>

              <dt><tt>msgChecksumLen</tt>:</dt><dd>When this is set to any value other than <tt>Full Coverage</tt>, it sets the minimum protection in protocols that allow limiting the checksum length (e.g. (e.g., UDP-Lite). If the Protocol Stack does not support checksum length limitation, this property may be ignored.</t>
            </li>
            <li>
              <t><tt>msgReliable</tt>: When ignored.</dd>

              <dt><tt>msgReliable</tt>:</dt><dd>When true, the property specifies that the Message must be reliably transmitted. When false, and if unreliable transmission is supported by the underlying protocol, then the Message should be unreliably transmitted. If the underlying
protocol does not support unreliable transmission, the Message should be reliably transmitted.</t>
            </li>
            <li>
              <t><tt>msgCapacityProfile</tt>: When transmitted.</dd>

              <dt><tt>msgCapacityProfile</tt>:</dt><dd>When true, this expresses a wish to override the
Generic Connection Property <tt>connCapacityProfile</tt> for this Message. Depending on the
value, this can, for example, be implemented by changing the DSCP Differentiated Services Code Point  (DSCP) value of the
associated packet (note that the guidelines in <xref section="6" sectionFormat="of" target="RFC7657"/> apply; e.g., for example,
the DSCP value should not be changed for different packets within a reliable
transport protocol session or DCCP connection).</t>
            </li>
            <li>
              <t><tt>noFragmentation</tt>: Setting connection).</dd>

              <dt><tt>noFragmentation</tt>:</dt><dd>Setting this avoids network-layer fragmentation. Messages exceeding the transport’s transport's current estimate of its maximum packet size (the <tt>singularTransmissionMsgMaxLen</tt> Connection Property) can result in transport segmentation when permitted, permitted or generate an error. When used with transports running over IP version 4, IPv4, the Don't Fragment (DF) bit should be set to avoid on-path IP fragmentation (<xref target="RFC8304"/>).</t>
            </li>
            <li>
              <t><tt>noSegmentation</tt>: When <xref target="RFC8304"/>.</dd>

              <dt><tt>noSegmentation</tt>:</dt><dd>When set, this property limits the Message size to the transport’s transport's current estimate of its maximum packet size (the <tt>singularTransmissionMsgMaxLen</tt> Connection Property). Messages larger than this size generate an error. Setting this avoids transport-layer segmentation and network-layer fragmentation. When used with transports running over IP version 4, IPv4, the Don't Fragment DF bit should be set to avoid on-path IP fragmentation (<xref target="RFC8304"/>).</t>
            </li>
          </ul> target="RFC8304"/>).</dd>
          </dl>
        </section>
        <section anchor="send-completion">
          <name>Send Completion</name>
          <t>The application should be notified (using a <tt>Sent</tt>, <tt>Expired</tt> <tt>Expired</tt>, or <tt>SendError</tt> event) whenever a Message or partial Message has been consumed by the Protocol Stack, Stack or has failed to send. The time at which a Message is considered to have been consumed by the Protocol Stack may vary depending on the protocol. For example, for a basic datagram protocol like UDP, this may correspond to the time when the packet is sent into the interface driver. For a protocol that buffers data in queues, like TCP, this may correspond to when the data has entered the send buffer. The time at which a Message failed to send is when the Transport Services Implementation (including the Protocol Stack) has experienced a failure related to sending; this can depend on protocol-specific timeouts.</t>
        </section>
        <section anchor="batching-sends">
          <name>Batching Sends</name>
          <t>Sending multiple Messages can incur high overhead if each needs to be enqueued separately (e.g., each Message might involve a context switch between the
application and the Transport Services System). To avoid this, the application can indicate a batch of <tt>Send</tt> actions through the API. When this is used,
the implementation can defer the processing of Messages until the batch is complete.</t>
        </section>
      </section>
      <section anchor="receiving-messages">
        <name>Receiving Messages</name>
        <t>Similar to sending, receiving a Message is determined by the top-level protocol in the established Protocol Stack. The main difference with receiving is that the size and boundaries of the Message are not known beforehand. The application can communicate in its <tt>Receive</tt> action the parameters for the Message, Message in its <tt>Receive</tt> action, which can help the Transport Services Implementation know how much data to deliver and when. For example, if the application only wants to receive a complete Message, the implementation should wait until an entire Message (datagram, stream, or frame) is read before delivering any Message content to the application. This requires the implementation to understand where Messages end, either via a supplied Message Framer or because the top-level protocol in the established Protocol Stack preserves message boundaries. The application can also control the flow of received data by specifying the minimum and maximum number of bytes of Message content it wants to receive at one time.</t>

<!-- [rfced] For readability, please consider whether the suggested
     text correctly conveys the intended meaning.

Original:
   If a Connection finishes before a requested Receive action can be
   satisfied, the Transport Services system should deliver any partial
   Message content outstanding, or if none is available, an indication
   that there will be no more received Messages.

Perhaps:
   If a Connection finishes before a requested Receive action can be
   satisfied, the Transport Services system should deliver any
   outstanding partial Message content; if none is available, the
   system should indicate that there will be no additional received
   Messages.
-->
        <t>If a Connection finishes before a requested <tt>Receive</tt> action can be satisfied, the Transport Services system should deliver any partial Message content outstanding, or if none is available, an indication that there will be no more received Messages.</t>
      </section>
      <section anchor="fastopen">
        <name>Handling of data Data for fast-open protocols</name> Fast-Open Protocols</name>
        <t>Several protocols allow sending higher-level protocol or application data during their protocol establishment, such as TCP Fast Open TFO <xref target="RFC7413"/> and TLS 1.3 <xref target="RFC8446"/>. This approach is referred to as sending Zero-RTT (0-RTT) data. This is a desirable feature, but it poses challenges to an implementation that uses racing during connection establishment.</t>
        <t>The application can express its preference for sending messagess messages as 0-RTT data by using the <tt>zeroRttMsg</tt> Selection Property on the Preconnection. Then, the application can provide the message to send as 0-RTT data via the <tt>InitiateWithSend</tt> action. In order to be sent as 0-RTT data, the message needs to be marked with the <tt>safelyReplayable</tt> send paramteter. parameter. In general, 0-RTT data may be replayed (for example, if a TCP SYN contains data, and the SYN is retransmitted, the data will be retransmitted as well but may be considered as a new connection instead of a retransmission). When racing connections, different leaf nodes have the opportunity to send the same data independently. If data is truly safely replayable, this is permissible.</t>
        <t>Once the application has provided its 0-RTT data, a Transport Services Implementation should keep a copy of this data and provide it to each new leaf node that is started and for which a protocol instance supporting 0-RTT is being used. Note that the amount of data that can actually be sent as 0-RTT data varies by protocol, so any given Protocol Stack might only consume part of the saved data prior to becoming established. The implementation needs to keep track of how much data a particular Protocol Stack has consumed, consumed and ensure that any pending 0-RTT-eligible data from the application is handled before subsequent Messages.</t>
        <t>It is also possible for Protocol Stacks within a particular leaf node to use a 0-RTT handshakes handshake in a lower-level protocol without any safely replayable application data if a higher-level protocol in the stack has idempotent handshake data to send. For example, TCP Fast Open TFO could use a Client Hello from TLS as its 0-RTT data, data without any data being provided by the application.</t>

<!-- [rfced] For clarity, may we replace "yet" with "but the data will
     be"?

Original:
   In effect, each leaf node will send the same
   early application data, yet encoded (encrypted) differently on the
   wire.

Perhaps:
   In effect, each leaf node will send the same early application
   data, but the data will be encoded (encrypted) differently on the
   wire.
-->

        <t>0-RTT handshakes often rely on previous state, such as TCP Fast Open TFO cookies, previously established TLS tickets, or out-of-band distributed pre-shared keys (PSKs). Implementations should be aware of security concerns around using these tokens across multiple addresses or paths when racing. In the case of TLS, any given ticket or PSK should only be used on one leaf node, since servers will likely reject duplicate tickets in order to prevent replays (see <xref section="8.1" sectionFormat="of" target="RFC8446"/>). If implementations have multiple tickets available from a previous connection, each leaf node attempt can use a different ticket. In effect, each leaf node will send the same early application data, yet encoded (encrypted) differently on the wire.</t>
      </section>
    </section>
    <section anchor="message-framers">
      <name>Implementing Message Framers</name>
      <t>Message Framers are functions that define
simple transformations between application Message data and raw transport
protocol data. Generally, a Message Framer implements a simple
application protocol that can either be provided either by the Transport Services
implementation or by the application. It is optional for Transport Services system implementations to provide Message Framers: the API specification <xref target="I-D.ietf-taps-interface"/> target="RFC9622"/> does not prescribe any particular Message Framers to be implemented.
A Framer can encapsulate or encode outbound Messages,
decapsulate or decode inbound data into Messages, and implement parts of
protocols that do not directly map to application Messages (such as
protocol handshakes or preludes before Message exchange).</t>
      <t>While many protocols can be represented as Message Framers, for the
purposes of the Transport Services API, these are ways for applications
or application frameworks to define their own Message parsing to be
included within a Connection's Protocol Stack. As an example, TLS
is a protocol that is by default built into the Transport Services
API, even though it could also serve the purpose of framing data over TCP.</t>
      <t>Most Message Framers fall into one of two categories:</t>
      <ul spacing="normal">
        <li>
          <t>Header-prefixed record formats, such as a basic Type-Length-Value (TLV) structure</t>
        </li>
        <li>
          <t>Delimiter-separated formats, such as HTTP/1.1</t>
        </li>
      </ul>
      <t>Common Message Framers can be provided by a Transport Services Implementation,
but an implementation ought to allow custom Message Framers to be defined by
the application or some other piece of software. This section describes one
possible API for defining Message Framers, Framers as an example.</t>
      <section anchor="defining-message-framers">
        <name>Defining Message Framers</name>

<!--[rfced] Looking at the following text, is this defining what
     Message Framer means?  If so, please review the fact that the
     paragraph also starts out with a definition.  Please let us know
     what revisions may be needed.

Original:
The Message Framer refers to the object or function within
   the main Connection implementation that delivers events to the custom
   framer implementation whenever data is ready to be parsed or framed.

The paragraph starts with:
   A Message Framer is primarily defined by the code that handles events
   for a framer implementation, specifically how it handles inbound and
   outbound data parsing.

-->

        <t>A Message Framer is primarily defined by the code that handles events
for a framer implementation, specifically how it handles inbound and outbound data
parsing. The function that implements custom framing logic will be referred to
as the "framer implementation", which may be provided by a Transport Services
implementation or the application itself. The Message Framer refers to the object
or function within the main Connection implementation that delivers events
to the custom framer implementation whenever data is ready to be parsed or framed.</t>
        <t>The API examples in this section use the notation conventions for the Transport
Services API defined in <xref section="1.1" sectionFormat="of" target="I-D.ietf-taps-interface"/>.</t> target="RFC9622"/>.</t>
        <t>The Transport Services Implementation needs to ensure that all of the
events and actions taken on a Message Framer are synchronized to ensure
consistent behavior. For example, some of the actions defined below (such as
PrependFramer and StartPassthrough) modify how data flows in a protocol
stack, Protocol
Stack and require synchronization with sending and parsing data in the
	Message Framer.</t>

<!-- [rfced] Please confirm that "stop event" should be "<tt>Stop</tt>
     event".

Original (no caps or <tt>):
   Similarly, a stop event can be delivered when a
   Connection is being torn down.
-->
        <t>When a Connection establishment attempt begins, an event can be delivered to
notify the framer implementation that a new Connection is being created.
Similarly, a stop event can be delivered when a Connection is being torn down.
The framer implementation can use the Connection object to look up specific
properties of the Connection or the network being used that may influence how
to frame Messages.</t>
        <artwork><![CDATA[
MessageFramer -> Start<connection>
MessageFramer -> Stop<connection>
]]></artwork>
        <t>When a Message Framer generates a <tt>Start</tt> event, the framer implementation
has the opportunity to start writing some data prior to the Connection delivering
its <tt>Ready</tt> event. This allows the implementation to communicate control data to the
Remote Endpoint that can be used to parse Messages.</t>
        <t>Once the framer implementation has completed its setup or handshake, it can indicate to
the application that it is ready for handling data with this call.</t>
        <artwork><![CDATA[
MessageFramer.MakeConnectionReady(connection)
]]></artwork>
        <t>Similarly, when a Message Framer generates a <tt>Stop</tt> event, the framer implementation has the opportunity to write some final data or clear up its local state before the <tt>Closed</tt> event is delivered to the Application. application. The framer implementation can indicate that it has finished with this call.</t>
        <artwork><![CDATA[
MessageFramer.MakeConnectionClosed(connection)
]]></artwork>
        <t>At any time if
        <t>If the implementation encounters a fatal error, error at any time, it can also cause the Connection
to fail and provide an error.</t>
        <artwork><![CDATA[
MessageFramer.FailConnection(connection, error)
]]></artwork>
        <t>Should the framer implementation deem the candidate selected during racing unsuitable, it can signal this to the Transport Services API by failing the Connection prior to marking it as ready.
If there are no other candidates available, the Connection will fail. Otherwise, the Connection will select a different candidate and the Message Framer will generate a new <tt>Start</tt> event.</t>
        <t>Before an implementation marks a Message Framer as ready, it can also dynamically
add a protocol or framer above it in the stack. This allows protocols that need to add TLS conditionally,
like STARTTLS <xref target="RFC3207"/>, to modify the Protocol Stack based on a handshake result.</t>
        <artwork><![CDATA[
otherFramer := NewMessageFramer()
MessageFramer.PrependFramer(connection, otherFramer)
]]></artwork>

<!-- [rfced] Does "at first" mean "initially"?

Original:
   In such cases, a Message Framer implementation can intercept
   sending and receiving of Messages at first, but then indicate that
   no more processing is needed.

Perhaps:
   In such cases, a Message Framer implementation can initially
   intercept Messages being sent and received and subsequently
   indicate that no further processing is needed.
-->

        <t>A Message Framer might also choose to go into a passthrough mode once an initial exchange or handshake has been completed, such as the STARTTLS case mentioned above.
This can also be useful for proxy protocols like SOCKS <xref target="RFC1928"/> or HTTP CONNECT <xref target="RFC7230"/>. In such cases, a Message Framer implementation can intercept
sending and receiving of Messages at first, but then indicate that no more processing is needed.</t>
        <artwork><![CDATA[
MessageFramer.StartPassthrough()
]]></artwork>
      </section>
      <section anchor="send-framing">
        <name>Sender-side
        <name>Sender-Side Message Framing</name>
        <t>Message Framers generate an event whenever a Connection sends a new Message. The parameters to the event
align with the <tt>Send</tt> action in the API (<xref section="9.2" sectionFormat="of" target="I-D.ietf-taps-interface"/>).</t> target="RFC9622"/>).</t>
        <artwork><![CDATA[
                        MessageFramer
                              |
                              V
NewSentMessage<connection, messageData, messageContext, endOfMessage>
]]></artwork>
        <t>Upon receiving this event, a framer implementation is responsible for
performing any necessary transformations and sending the resulting data back to the Message Framer, which will which, in turn turn, will send it to the next protocol.
To improve performance, implementations should ensure that there is a way to pass the original data
through without copying.</t>
        <artwork><![CDATA[
MessageFramer.Send(connection, messageData)
]]></artwork>
        <t>To provide an example, a simple protocol that adds the length of the Message data as a header would receive
the <tt>NewSentMessage</tt> event, create a data representation of the length of the Message
data, and then send a block of data that is the concatenation of the length header and the original
Message data.</t>
      </section>
      <section anchor="receive-framing">
        <name>Receiver-side
        <name>Receiver-Side Message Framing</name>
        <t>In order to parse a received flow of data into Messages, the Message Framer
notifies the framer implementation whenever new data is available to parse.</t>
        <t>The parameters to the events and calls for receiving data with a framer
align with the <tt>Receive</tt> action in the API (<xref section="9.3" sectionFormat="of" target="I-D.ietf-taps-interface"/>).</t> target="RFC9622"/>).</t>
        <artwork><![CDATA[
MessageFramer -> HandleReceivedData<connection>
]]></artwork>
        <t>Upon receiving this event, the framer implementation can inspect the inbound data. The
data is parsed from a particular cursor representing the unprocessed data. The
application requests a specific amount of data it needs to have available in order to parse.
If the data is not available, the parse fails.</t>
        <artwork><![CDATA[
MessageFramer.Parse(connection, minimumIncompleteLength, maximumLength)
                                 |
                                 V
             (messageData, messageContext, endOfMessage)
]]></artwork>
        <t>The framer implementation can directly advance the receive cursor once it has
parsed data to effectively discard data (for example, discard a header
once the content has been parsed).</t>
        <t>To deliver a Message to the application, the framer implementation can either directly
deliver data that it has allocated, allocated or deliver a range of data directly from the underlying
transport and simultaneously advance the receive cursor.</t>
        <artwork><![CDATA[
MessageFramer.AdvanceReceiveCursor(connection, length)
MessageFramer.DeliverAndAdvanceReceiveCursor(connection, messageContext, length, endOfMessage)
MessageFramer.Deliver(connection, messageContext, messageData, endOfMessage)
]]></artwork>
        <t>Note that <tt>MessageFramer.DeliverAndAdvanceReceiveCursor</tt> allows the framer implementation
to earmark bytes as part of a Message even before they are received by the transport. This allows the delivery
of very large Messages without requiring the implementation to directly inspect all of the bytes.</t>
        <t>To provide an example, a simple protocol that parses the length of the Message data as a header value would
receive the <tt>HandleReceivedData</tt> event, event and call <tt>Parse</tt> with a minimum and maximum
set to the length of the header field. Once the parse succeeded, it would call
<tt>AdvanceReceiveCursor</tt> with the length of the header field, field and then call
<tt>DeliverAndAdvanceReceiveCursor</tt> with the length of the body that was parsed from
the header, marking the new Message as complete.</t>
      </section>
    </section>
    <section anchor="implementing-connection-management">
      <name>Implementing Connection Management</name>
      <t>Once a Connection is established, the Transport Services API allows applications to interact with the Connection by modifying or inspecting
Connection Properties. A Connection can also generate error events in the form of <tt>SoftError</tt> events.</t>
      <t>The set of Connection Properties that are supported for setting and getting on a Connection are described in <xref target="I-D.ietf-taps-interface"/>. target="RFC9622"/>. For
any properties that are generic, and thus generic and, thus, could apply to all protocols being used by a Connection, the Transport Services Implementation should store the properties
in storage common to all protocols, protocols and notify the Protocol Stack as a whole whenever the properties have been modified by the application. <xref target="RFC8303"/> and <xref target="RFC8304"/> offer guidance on how to do this for TCP, MPTCP, Multipath TCP (MPTCP), SCTP, UDP UDP, and UDP-Lite; see <xref target="specific-protocol-considerations"/> for a description of a back-tracking backtracking method to find the relevant protocol primitives using these documents.
      For Protocol-specific Properties, such as the User Timeout that applies to TCP, the Transport Services Implementation only needs to update the relevant protocol instance.</t>

<!-- [rfced] Section 7: We note that this document uses "keepalives"
     and refers to a "keepAlive" property.  The other documents seem
     to use "keep-alive" to refer to packets.  Please review the use
     of "keepalives" and let us know if any updates are needed.

Original:
   For example, if the application has
   requested to use keepalives with the keepAlive property, and the
   Protocol Stack contains both HTTP/2 and TCP, the HTTP/2 protocol can
   choose to enable its own keepalives to satisfy the application
   request, and disable TCP-level keepalives.
-->
      <t>Some Connection Properties might apply to multiple protocols within a Protocol Stack. Depending on the specific property,
it might be appropriate to apply the property across multiple protocols simultaneously, simultaneously or else only apply it to one protocol.
In general, the Transport Services Implementation should allow the protocol closest to the application to interpret
Connection Properties, and potentially Properties and, potentially, modify the set of Connection Properties passed down to the next protocol in the
stack. For example, if the application has requested to use keepalives with the <tt>keepAlive</tt> property, and the Protocol
Stack contains both HTTP/2 and TCP, the HTTP/2 protocol can choose to enable its own keepalives to satisfy the application
request,
request and disable TCP-level keepalives. For cases where the application needs to have fine-grained per-protocol control,
the Transport Services Implementation can expose Protocol-specific Properties.</t>
      <t>If an error is encountered in setting a property (for example, if the application tries to set a TCP-specific property on a Connection that is
not using TCP), the action must fail gracefully. The application must be informed of the error, error but the Connection itself must not be terminated.</t>
      <t>When protocol instances in the Protocol Stack report generic or protocol-specific
errors, the API will deliver them to the application as <tt>SoftError</tt> events. These allow the application to be informed of ICMP errors, errors and other similar events.</t>
      <section anchor="pooled-connections">
        <name>Pooled Connection</name>
        <t>For applications that do not need in-order delivery of Messages, the Transport Services Implementation may distribute Messages of a single Connection across several underlying transport connections or multiple streams of multi-streaming connections between endpoints, as long as all of these satisfy the Selection Properties.
The Transport Services Implementation will then hide this connection management and only expose a single Connection object, which we here call a "Pooled Connection". This is in contrast to Connection Groups, which explicitly expose combined treatment of Connections, giving the application control over multiplexing, for example.</t>
        <t>Pooled Connections can be useful when the application using the Transport Services system implements a protocol such as HTTP, which employs request/response pairs and does not require in-order delivery of responses.
This enables implementations of Transport Services systems to realize transparent connection coalescing, coalescing and connection migration, migration and to perform per-message endpoint and path selection by choosing among multiple underlying connections.</t>
      </section>
      <section anchor="handling-path-changes">
        <name>Handling Path Changes</name>
        <t>When a path change occurs, e.g., when the IP address of an interface changes or a new interface becomes available, the Transport Services Implementation is responsible for notifying the Protocol Instance of the change. The path change may interrupt connectivity on a path for an active Connection or provide an opportunity for a transport that supports multipath or migration to adapt to the new paths. Note that, in the model of the Transport Services API, migration is considered a part of multipath connectivity; it is just a limiting policy on multipath usage. If the <tt>multipath</tt> Selection Property is set to <tt>Disabled</tt>, migration is disallowed.</t>
        <t>For protocols that do not support multipath or migration, the Protocol Instances should be informed of the path change, change but should not be forcibly disconnected if the previously used path becomes unavailable. There are many common usage scenarios that can lead to a path becoming temporarily unavailable, unavailable and then recovering before the transport protocol reaches a timeout error. These are particularly common using mobile devices. Examples include: an include:</t>
	<ul>
	  <li>an Ethernet cable becoming unplugged and then plugged back in; a in;</li>
	  <li>a device losing a Wi-Fi signal while a user is in an elevator, elevator and reattaching when the user leaves the elevator; and a and</li>
	  <li>a user losing the radio signal while riding a train through a tunnel. If tunnel.</li></ul>
	  <t>If the device is able to rejoin a network with the same IP address, a stateful transport connection can generally resume. Thus, while it is useful for a Protocol Instance to be aware of a temporary loss of connectivity, the Transport Services Implementation should not aggressively close Connections in these scenarios.</t>

<!-- [rfced] We are having trouble parsing the text following "is
     still available or".  Please review and let us know how the
     text may be clarified.

Original:
   A protocol can then establish new subflows over new paths while an
   active path is still available or, if migration is supported, also
   after a break has been detected, and should attempt to tear down
   subflows over paths that are no longer used.

Perhaps (but this leaves out "after a break has been detected"):
   A protocol can then establish new subflows over new paths while an
   active path is still available, or it should attempt to tear down
   subflows over paths that are no longer used if migration is supported.
-->

        <t>If the Protocol Stack includes a transport protocol that supports multipath connectivity, the Transport Services Implementation should also inform the Protocol Instance about potentially new paths that become permissible based on the <tt>multipath</tt> Selection Property and the <tt>multipathPolicy</tt> Connection Property choices made by the application.
A protocol can then establish new subflows over new paths while an active path is still available or, if migration is supported, also after a break has been detected, and should attempt to tear down subflows over paths that are no longer used. The Connection Property <tt>multipathPolicy</tt> of the Transport Services API
allows an application to indicate when and how different paths should be used. However, detailed handling of these policies is implementation-specific. implementation specific.
For example, if the <tt>multipath</tt> Selection Property is set to <tt>active</tt>, the decision about when to create a new path or to announce a new path or set of paths to the Remote Endpoint, e.g., in the form of additional IP addresses, is implementation-specific. implementation specific.
If the Protocol Stack includes a transport protocol that does not support multipath, multipath but does support migrating between paths, the update to the set of available paths can trigger the connection to be migrated.</t>
        <t>In the case of a Pooled Connection <xref target="pooled-connections"/>, (<xref target="pooled-connections"/>), the Transport Services Implementation may add connections over new paths to the pool if permissible based on the multipath policy and Selection Properties.
In the case that
If a previously used path becomes unavailable, the Transport Services system may disconnect all connections that require this path, but it should not disconnect the pooled Connection object exposed to the application.
The strategy to do so is implementation-specific, implementation specific, but it should be consistent with the behavior of multipath transports.</t>
      </section>
    </section>
    <section anchor="implementing-connection-termination">
      <name>Implementing Connection Termination</name>
      <t>For <tt>Close</tt> (which leads to a <tt>Closed</tt> event) and <tt>Abort</tt> (which leads to a <tt>ConnectionError</tt> event),
the application might find it useful to be informed when a peer closes or aborts a
Connection. Whether this is possible depends on the underlying protocol, and no guarantees
can be given. When an underlying transport connection supports multi-streaming (such as SCTP), the Transport Services system can use a stream reset procedure to cause a Finish event upon a <tt>Close</tt> action from the peer <xref target="NEAT-flow-mapping"/>.</t>
    </section>
    <section anchor="cached-state">
      <name>Cached State</name>
      <t>Beyond a single Connection's lifetime, it is useful for an implementation to keep state and history. This cached
state can help improve future Connection establishment due to re-using reusing results and credentials, credentials and favoring paths and protocols that performed well in the past.</t>
      <t>Cached state may be associated with different endpoints for the same Connection, depending on the protocol generating the cached content.
For example, session tickets for TLS are associated with specific endpoints, and thus endpoints; thus, they should be cached based on a connection's
hostname Endpoint Identifer Identifier (if applicable). However, performance characteristics of a path are more likely tied to the IP address
and subnet being used.</t>
      <section anchor="protocol-state-caches">
        <name>Protocol state caches</name> State Caches</name>
        <t>Some protocols will have long-term state to be cached in association with endpoints. This state often has some time after which
it is expired, so the implementation should allow each protocol to specify an expiration for cached content.</t>
        <t>Examples of cached protocol state include:</t>
        <ul spacing="normal">
          <li>
            <t>The DNS protocol can cache resolved addresses (such as those retrieved from A and AAAA queries), queries) associated with a Time To Live (TTL) to
be used for future hostname resolutions without requiring asking the DNS resolver again.</t>
          </li>
          <li>
            <t>TLS caches session state and tickets based on a hostname, which can be used for resuming sessions with a server.</t>
          </li>
          <li>
            <t>TCP can cache cookies for use in TCP Fast Open.</t> TFO</t>
          </li>
        </ul>
        <t>Cached protocol state is primarily used during Connection establishment for a single Protocol Stack, but it may be used to influence an
implementation's preference between several candidate Protocol Stacks. For example, if two IP address Endpoint Identifers Identifiers are otherwise
equally preferred, an implementation may choose to attempt a connection to an address for which it has a TCP Fast Open TFO cookie.</t>
        <t>Applications can use the Transport Services API to request that a Connection Group maintain a separate cache for
protocol state. Connections in the group will not use cached state
from Connections outside the group, and Connections outside the group will not
use state cached from Connections inside the group. This may be necessary, for
example, if application-layer identifiers rotate and clients wish to avoid
linkability via trackable TLS tickets or TFO cookies.</t>
      </section>
      <section anchor="performance-caches">
        <name>Performance caches</name> Caches</name>
        <t>In addition to protocol state, Protocol Instances should provide data into a performance-oriented cache to help guide future protocol and path selection. Some performance information can be gathered generically across several protocols to allow predictive comparisons between protocols on given paths:</t>
        <ul spacing="normal">
          <li>
            <t>Observed Round Trip Time</t> RTT</t>
          </li>
          <li>
            <t>Connection establishment latency</t>
          </li>
          <li>
            <t>Connection establishment success rate</t>
          </li>
        </ul>
        <t>These items can be cached on a per-address and per-subnet granularity, granularity and averaged between different values. The information should be cached on a per-network basis, basis since it is expected that different network attachments will have different performance characteristics. Besides Protocol Instances, other system entities may also provide data into performance-oriented caches. This could for instance be signal strength information reported by radio modems like Wi-Fi and mobile broadband or information about the battery-level of the device. Furthermore, the system may cache the observed maximum throughput on a path as an estimate of the available bandwidth.</t>
        <t>An implementation should use this information, when possible, to influence preference between candidate paths, endpoints, and protocol options. Eligible options that historically had significantly better performance than others should be selected first when gathering candidates (see <xref target="gathering"/>) to ensure better performance for the application.</t>
        <t>The reasonable lifetime for cached performance values will vary depending on the nature of the value. Certain information, like the connection establishment success rate to a Remote Endpoint using a given Protocol Stack, can be stored for a long period of time (hours or longer), longer) since it is expected that the capabilities of the Remote Endpoint are not changing very quickly. On the other hand, the Round Trip Time RTT observed by TCP over a particular network path may vary over a relatively short time interval. For such values, the implementation should remove them from the cache more quickly, quickly or treat older values with less confidence/weight.</t>
        <t><xref target="RFC9040"/> provides guidance about sharing of TCP Control Block information between connections on initialization.</t>
      </section>
    </section>
    <section anchor="specific-protocol-considerations">
      <name>Specific Transport Protocol Considerations</name>
      <t>Each protocol that is supported by a Transport Services Implementation should have a well-defined API mapping.
API mappings for a protocol are important for Connections in which a given protocol is the "top" of the Protocol Stack.
For example, the mapping of the <tt>Send</tt> function for TCP applies to Connections in which the application directly sends over TCP.</t>
      <t>Each protocol has a notion of Connectedness. "Connectedness". Possible definitions of
Connectedness for various types of protocols are:</t>
      <ul
      <dl spacing="normal">
        <li>
          <t>Connectionless. Connectionless

          <dt>Connectionless:</dt><dd>Connectionless protocols do not establish explicit state between endpoints, endpoints and do not perform a handshake during Connection establishment.</t>
        </li>
        <li>
          <t>Connected. Connected establishment.</dd>

          <dt>Connected:</dt><dd>Connected (also called "connection-oriented") protocols establish state between endpoints, endpoints and perform a handshake during connection establishment. The handshake may be 0-RTT to send data or resume a session, but bidirectional traffic is required to confirm connectedness.</t>
        </li>
        <li>
          <t>Multiplexing Connected. Multiplexing Connectedness.</dd>

          <dt>Multiplexing Connected:</dt><dd>Multiplexing Connected protocols share properties with Connected protocols, protocols but also explictly explicitly support opening multiple application-level flows. This means that they can support cloning new Connection objects without a new explicit handshake.</t>
        </li>
      </ul> handshake.</dd>
      </dl>

      <t>Protocols also have a notion of Data Unit. "Data Unit". Possible values for Data Unit are:</t>
      <ul
      <dl spacing="normal">
        <li>
          <t>Byte-stream. Byte-stream

          <dt>Byte-stream:</dt><dd>Byte-stream protocols do not define any message boundaries of their own apart from the end of a stream in each direction.</t>
        </li>
        <li>
          <t>Datagram. Datagram direction.</dd>

          <dt>Datagram:</dt><dd>Datagram protocols define message boundaries at the same level of transmission, such that only complete (not partial) messages are supported.</t>
        </li>
        <li>
          <t>Message. Message supported.</dd>

          <dt>Message:</dt><dd>Message protocols support message boundaries that can be sent and received either as complete or partial messages. Maximum message lengths can be defined, and messages can be partially reliable.</t>
        </li>
      </ul> reliable.</dd>
      </dl>

<!-- [rfced] There is no Appendix D in draft-ietf-taps-interface
     <https://www.ietf.org/archive/id/draft-ietf-taps-impl-18.html#I-D.ietf-taps-interface>.
     We see "callbacks," "fallback," and "backpressure," but we don't
     see "backtrack", "back track", or "back-track."  Please review
     and let us know what section is intended.

Original:
   This back-tracking method applies to all elements of
   [RFC8923] (see appendix D of [I-D.ietf-taps-interface]): they are
   listed in appendix A of [RFC8923] with an implementation hint in the
   same style, pointing back to Section 4 of [RFC8303].
-->

      <t>Below, terms in capitals with a dot character (".") (e.g., "CONNECT.SCTP") refer to the primitives with the same name in <xref section="4" sectionFormat="of" target="RFC8303"/>. For further implementation details, the description of these primitives in <xref target="RFC8303"/> points to <xref section="3" sectionFormat="of" target="RFC8303"/> and <xref section="3" sectionFormat="of" target="RFC8304"/>, which refers back to the relevant specifications for each protocol. This back-tracking backtracking method applies to all elements of <xref target="RFC8923"/> (see appendix D of <xref target="I-D.ietf-taps-interface"/>): target="RFC9622" sectionFormat="of" section="D"/>): they are listed in appendix A of <xref target="RFC8923"/> target="RFC8923" sectionFormat="of" section="A"/> with an implementation hint in the same style, pointing back to <xref section="4" sectionFormat="of" target="RFC8303"/>.</t>
      <t>This document presents the protocol mappings defined in <xref target="RFC8923"/>. Other protocol mappings can be provided as separate documents, following the mapping template in <xref target="appendix-mapping-template"/>.</t>
      <section anchor="tcp">
        <name>TCP</name>
        <t>Connectedness: Connected</t>
        <t>Data Unit: Byte-stream</t>
	<dl>

        <dt>Connectedness:</dt><dd>Connected</dd>
        <dt>Data Unit:</dt><dd>Byte-stream</dd>

          <dt>Connection Object:</dt>
          <dd>
            <t>TCP connections between two hosts map directly to Connection objects.</t>
          </dd>
          <dt>Initiate:</dt>
          <dd>
            <t>CONNECT.TCP. Calling <tt>Initiate</tt> on a TCP Connection causes it to reserve a local port, port and send a SYN to the Remote Endpoint.</t>
          </dd>
          <dt>InitiateWithSend:</dt>
          <dd>
            <t>CONNECT.TCP with parameter <tt>user message</tt>. Early safely replayable data is sent on a TCP Connection in the SYN, as TCP Fast Open TFO data.</t>
          </dd>
          <dt>Ready:</dt>
          <dd>
            <t>A TCP Connection is ready once the three-way handshake is complete.</t>
          </dd>
          <dt>EstablishmentError:</dt>
          <dd>
            <t>Failure of CONNECT.TCP. TCP can throw various errors during connection setup. Specifically, it is important to handle a RST being sent by the peer during the handshake.</t>
          </dd>
          <dt>ConnectionError:</dt>
          <dd>
            <t>Once established, TCP throws errors whenever the connection is disconnected, such as due to receiving a RST from the peer.</t>
          </dd>
          <dt>Listen:</dt>
          <dd>
            <t>LISTEN.TCP. Calling <tt>Listen</tt> for TCP binds a local port and prepares it to receive inbound SYN packets from peers.</t>
          </dd>
          <dt>ConnectionReceived:</dt>
          <dd>
            <t>TCP Listeners will deliver new connections once they have replied to an inbound SYN with a SYN-ACK.</t>
          </dd>
          <dt>Clone:</dt>
          <dd>
            <t>Calling <tt>Clone</tt> on a TCP Connection creates a new Connection with equivalent parameters. These Connections, and Connections generated via later calls to <tt>Clone</tt> on an Established Connection, form a Connection Group. To realize entanglement for these Connections, with the exception of <tt>connPriority</tt>, changing a Connection Property on one of them must affect the Connection Properties of the others too. No guarantees of honoring the Connection Property <tt>connPriority</tt> are given, and thus given; thus, it is safe for an implementation of a Transport Services system to ignore this property. When it is reasonable to assume that Connections traverse the same path (e.g., when they share the same encapsulation), support for it can also experimentally be implemented using a congestion control coupling mechanism (see for example (for example, see <xref target="TCP-COUPLING"/> or <xref target="RFC3124"/>).</t>
          </dd>
          <dt>Send:</dt>
          <dd>
            <t>SEND.TCP. On its own, TCP does not on its own preserve message boundaries. Calling <tt>Send</tt> on a TCP connection lays out the bytes on the TCP send stream without any other delineation. Any Message marked as Final will cause TCP to send a FIN once the Message has been completely written, by calling CLOSE.TCP immediately upon successful termination of SEND.TCP. Note that transmitting a Message marked as Final should not cause the <tt>Closed</tt> event to be delivered to the application, application as it will still be possible to receive data until the peer closes or aborts the TCP connection.</t>
          </dd>
          <dt>Receive:</dt>
          <dd>
            <t>With RECEIVE.TCP, TCP delivers a stream of bytes without any Message delineation. All data delivered in the <tt>Received</tt> or <tt>ReceivedPartial</tt> event will be part of a single stream-wide Message that is marked Final (unless a Message Framer is used). EndOfMessage will be delivered when the TCP Connection has received a FIN (CLOSE-EVENT.TCP) from the peer. Note that reception of a FIN should not cause the <tt>Closed</tt> event to be delivered to the application, as it will still be possible for the application to send data.</t>
          </dd>
          <dt>Close:</dt>
          <dd>
            <t>Calling <tt>Close</tt> on a TCP Connection indicates that the Connection should be gracefully closed (CLOSE.TCP) by sending a FIN to the peer. It will then still be possible to receive data until the peer closes or aborts the TCP connection. The <tt>Closed</tt> event will be issued upon reception of a FIN.</t>
          </dd>
          <dt>Abort:</dt>
          <dd>
            <t>Calling <tt>Abort</tt> on a TCP Connection indicates that the Connection should be immediately closed by sending a RST to the peer (ABORT.TCP).</t>
          </dd>
          <dt>CloseGroup:</dt>
          <dd>
            <t>Calling <tt>CloseGroup</tt> on a TCP Connection (CLOSE.TCP) is identical to calling <tt>Close</tt> on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
          <dt>AbortGroup:</dt>
          <dd>
            <t>Calling <tt>AbortGroup</tt> on a TCP Connection (ABORT.TCP) is identical to calling <tt>Abort</tt> on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
        </dl>
      </section>
      <section anchor="mptcp">
        <name>MPTCP</name>
        <t>Connectedness: Connected</t>
        <t>Data Unit: Byte-stream</t>
<dl>
        <dt>Connectedness:</dt><dd>Connected</dd>
        <dt>Data Unit:</dt><dd>Byte-stream</dd>
</dl>
        <t>The Transport Services API mappings for MPTCP are identical to TCP. MPTCP adds support for multipath properties,
such as <tt>multipath</tt> and <tt>multipathPolicy</tt>, and actions for managing paths, such as <tt>AddRemote</tt> and <tt>RemoveRemote</tt>.</t>
      </section>
      <section anchor="udp">
        <name>UDP</name>
        <t>Connectedness: Connectionless</t>
        <t>Data Unit: Datagram</t>

	<dl>
          <dt>Connectedness:</dt><dd>Connectionless</dd>

        <dt>Data Unit:</dt><dd>Datagram</dd>

          <dt>Connection Object:</dt>
          <dd>
            <t>UDP Connections represent a pair of specific IP addresses and ports on two hosts.</t>
          </dd>
          <dt>Initiate:</dt>
          <dd>
            <t>CONNECT.UDP. Calling <tt>Initiate</tt> on a UDP Connection causes it to reserve a local port, port but does not generate any traffic.</t>
          </dd>
          <dt>InitiateWithSend:</dt>
          <dd>
            <t>Early data on a UDP Connection does not have any special meaning. The data is sent whenever the Connection is <tt>Ready</tt>.</t>
          </dd>
          <dt>Ready:</dt>
          <dd>
            <t>A UDP Connection is ready once the system has reserved a local port and has a path to send to the Remote Endpoint.</t>
          </dd>
          <dt>EstablishmentError:</dt>
          <dd>
            <t>UDP Connections can only generate errors on initiation due to port conflicts on the local system.</t>
          </dd>
          <dt>ConnectionError:</dt>
          <dd>
            <t>UDP Connections can only generate Connection errors in response to <tt>Abort</tt> calls. (Once in use, UDP Connections can also generate <tt>SoftError</tt> events (ERROR.UDP) upon receiving ICMP notifications indicating failures in the network.)</t>
          </dd>
          <dt>Listen:</dt>
          <dd>
            <t>LISTEN.UDP. Calling <tt>Listen</tt> for UDP binds a local port and prepares it to receive inbound UDP datagrams from peers.</t>
          </dd>
          <dt>ConnectionReceived:</dt>
          <dd>
            <t>UDP Listeners will deliver new connections once they have received traffic from a new Remote Endpoint.</t>
          </dd>
          <dt>Clone:</dt>
          <dd>
            <t>Calling <tt>Clone</tt> on a UDP Connection creates a new Connection with equivalent parameters. The two Connections are otherwise independent.</t>
          </dd>
          <dt>Send:</dt>
          <dd>
            <t>SEND.UDP. Calling <tt>Send</tt> on a UDP connection sends the data as the payload of a complete UDP datagram. Marking Messages as Final does not change anything in the datagram's contents. Upon sending a UDP datagram, some relevant fields and flags in the IP header can be controlled: DSCP (SET_DSCP.UDP), DF in IPv4 (SET_DF.UDP) (SET_DF.UDP), and ECN flag (SET_ECN.UDP).</t>
          </dd>
          <dt>Receive:</dt>
          <dd>

            <t>RECEIVE.UDP. UDP only delivers complete Messages to <tt>Received</tt>, each of which represents a single datagram received in a UDP packet. Upon receiving a UDP datagram, the ECN flag from the IP header can be obtained (GET_ECN.UDP).</t>
          </dd>
          <dt>Close:</dt>
          <dd>
            <t>Calling <tt>Close</tt> on a UDP Connection (ABORT.UDP) releases the local port reservation. The Connection then issues a <tt>Closed</tt> event.</t>
          </dd>
          <dt>Abort:</dt>
          <dd>
            <t>Calling <tt>Abort</tt> on a UDP Connection (ABORT.UDP) is identical to calling <tt>Close</tt>, <tt>Close</tt> except that the Connection will send a <tt>ConnectionError</tt> event rather than a <tt>Closed</tt> event.</t>
          </dd>
          <dt>CloseGroup:</dt>
          <dd>
            <t>Calling <tt>CloseGroup</tt> on a UDP Connection (ABORT.UDP) is identical to calling <tt>Close</tt> on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
          <dt>AbortGroup:</dt>
          <dd>
            <t>Calling <tt>AbortGroup</tt> on a UDP Connection (ABORT.UDP) is identical to calling <tt>Close</tt> on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
        </dl>
      </section>
      <section anchor="udp-lite">
        <name>UDP-Lite</name>
        <t>Connectedness: Connectionless</t>
        <t>Data Unit: Datagram</t>
<dl>
        <dt>Connectedness:</dt><dd>Connectionless</dd>
        <dt>Data Unit:</dt><dd>Datagram</dd>
      </dl>
        <t>The Transport Services API mappings for UDP-Lite are identical to UDP. In addition,
UDP-Lite supports the <tt>msgChecksumLen</tt> and <tt>recvChecksumLen</tt> Properties
that allow an application to specify the minimum number of bytes in a Message that
need to be covered by a checksum.</t>
        <t>This includes: CONNECT.UDP-Lite; LISTEN.UDP-Lite; SEND.UDP-Lite; RECEIVE.UDP-Lite; ABORT.UDP-Lite; ERROR.UDP-Lite; SET_DSCP.UDP-Lite; SET_DF.UDP-Lite; SET_ECN.UDP-Lite; GET_ECN.UDP-Lite.</t>
      </section>
      <section anchor="udp-multicast-receive">
        <name>UDP Multicast Receive</name>
        <t>Connectedness: Connectionless</t>
        <t>Data Unit: Datagram</t>
<dl>
        <dt>Connectedness:</dt><dd>Connectionless</dd>
        <dt>Data Unit:</dt><dd>Datagram</dd>

          <dt>Connection Object:</dt>
          <dd>
            <t>Established UDP Multicast Receive connections represent a pair of specific IP addresses and ports.  The <tt>direction</tt> Selection Property must be set to <tt>unidirectional receive</tt>, and the Local Endpoint must be configured with a group IP address and a port.</t>
          </dd>
          <dt>Initiate:</dt>
          <dd>
            <t>Calling <tt>Initiate</tt> on a UDP Multicast Receive Connection causes an immediate <tt>EstablishmentError</tt>.  This is an unsupported operation.</t>
          </dd>
          <dt>InitiateWithSend:</dt>
          <dd>
            <t>Calling <tt>InitiateWithSend</tt> on a UDP Multicast Receive Connection causes an immediate <tt>EstablishmentError</tt>.  This is an unsupported operation.</t>
          </dd>
          <dt>Ready:</dt>
          <dd>
            <t>A UDP Multicast Receive Connection is ready once the system has received traffic for the appropriate group and port.</t>
          </dd>
          <dt>EstablishmentError:</dt>
          <dd>
            <t>UDP Multicast Receive Connections generate an <tt>EstablishmentError</tt> indicating that joining a multicast group failed if <tt>Initiate</tt> is called.</t>
          </dd>
          <dt>ConnectionError:</dt>
          <dd>
            <t>The only <tt>ConnectionError</tt> generated by a UDP Multicast Receive Connection is in response to an <tt>Abort</tt> call.</t>
          </dd>
          <dt>Listen:</dt>
          <dd>
            <t>LISTEN.UDP. Calling <tt>Listen</tt> for UDP Multicast Receive binds a local port, prepares it to receive inbound UDP datagrams from peers, and issues a multicast host join.  If a Remote Endpoint Identifer Identifier with an address is supplied, the join is Source-specific Source-Specific Multicast, and the path selection is based on the route to the Remote Endpoint.  If a Remote Endpoint Identifer Identifier is not supplied, the join is Any-source Any-Source Multicast, and the path selection is based on the outbound route to the group supplied in the Local Endpoint.</t>
          </dd>
</dl>

<!--[rfced] This text may have gotten garbled along the way (see "for
     a multicast group to for a multicast control bus").  Please
     rephrase.

Original:
For example, one Connection might be opened for a multicast group to
for a multicast control bus, and another application later opens a
separate Connection to the same group to send signals to and/or
receive signals from the common bus.
-->
        <t>There are cases where it is required to open multiple connections for the same address(es).
For example, one Connection might be opened for a multicast group to for a multicast control bus,
and another application later opens a separate Connection to the same group to send signals to and/or receive signals from the common bus.
In such cases, the Transport Services system needs to explicitly enable re-use reuse of the same set of addresses (equivalent to setting SO_REUSEADDR
in the socket Socket API).</t>
        <dl>
          <dt>ConnectionReceived:</dt>
          <dd>
            <t>UDP Multicast Receive Listeners will deliver new Connections once they have received traffic from a new Remote Endpoint.</t>
          </dd>
          <dt>Clone:</dt>
          <dd>
            <t>Calling <tt>Clone</tt> on a UDP Multicast Receive Connection creates a new Connection with equivalent parameters. The two Connections are otherwise independent.</t>
          </dd>
          <dt>Send:</dt>
          <dd>
            <t>SEND.UDP. Calling <tt>Send</tt> on a UDP Multicast Receive connection causes an immediate <tt>SendError</tt>.  This is an unsupported operation.</t>
          </dd>
          <dt>Receive:</dt>
          <dd>
            <t>RECEIVE.UDP. The <tt>Receive</tt> operation in a UDP Multicast Receive connection only delivers complete Messages to <tt>Received</tt>, each of which represents a single datagram received in a UDP packet. Upon receiving a UDP datagram, the ECN flag from the IP header can be obtained (GET_ECN.UDP).</t>
          </dd>
          <dt>Close:</dt>
          <dd>
            <t>Calling <tt>Close</tt> on a UDP Multicast Receive Connection (ABORT.UDP) releases the local port reservation and leaves the group. The Connection then issues a <tt>Closed</tt> event.</t>
          </dd>
          <dt>Abort:</dt>
          <dd>
            <t>Calling <tt>Abort</tt> on a UDP Multicast Receive Connection (ABORT.UDP) is identical to calling <tt>Close</tt>, <tt>Close</tt> except that the Connection will send a <tt>ConnectionError</tt> event rather than a <tt>Closed</tt> event.</t>
          </dd>
          <dt>CloseGroup:</dt>
          <dd>
            <t>Calling <tt>CloseGroup</tt> on a UDP Multicast Receive Connection (ABORT.UDP) is identical to calling <tt>Close</tt> on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
          <dt>AbortGroup:</dt>
          <dd>
            <t>Calling <tt>AbortGroup</tt> on a UDP Multicast Receive Connection (ABORT.UDP) is identical to calling <tt>Close</tt>
on this Connection and on all Connections in the same ConnectionGroup.</t>
          </dd>
        </dl>
      </section>
      <section anchor="sctp">
        <name>SCTP</name>
        <t>Connectedness: Connected</t>
        <t>Data Unit: Message</t>
<dl>
        <dt>Connectedness:</dt><dd>Connected</dd>
        <dt>Data Unit:</dt><dd>Message</dd>

          <dt>Connection Object:</dt>
          <dd>

<!-- [rfced] Section 10.6: We find "requirements as follows" and the
     "following explanation" in the subsequent sentence confusing -
     what directly follows the paragraph?  Does the "requirements as
     follows" refer to following paragraph that starts with "Stream
     mapping requires..."?  If yes, should this text (all of the text
     until "Initiate:") be indented under "Connection Object"?

Original:
   Connection Object:  Connection objects can be mapped to an SCTP
      association or a stream in an SCTP association.  Mapping
      Connection objects to SCTP streams is called "stream mapping" and
      has additional requirements as follows.  The following explanation
      assumes a client-server communication model.

   Stream mapping requires ...
-->

            <t>Connection objects can be mapped to an SCTP association or a stream in an SCTP association. Mapping Connection objects to SCTP streams is called "stream mapping" and has additional requirements as follows. The following explanation assumes a client-server communication model.</t>
          </dd>
</dl>

<!-- [rfced] Please confirm that "stream id" (lowercase "id") is
     correct, as we see the following (using "stream IDs") in
     draft-ietf-taps-interface (RFC-to-be 9622):

   The optional connectionProperties parameter allows passing Transport
   Properties that control the behavior of the underlying stream or
   connection to be created, e.g., Protocol-specific Properties to
   request specific stream IDs for SCTP or QUIC.
-->

<t>Stream mapping requires an association to already be in place between the client and the server, and it requires the server to understand that a new incoming stream should be represented as a new Connection object by the Transport Services system. A new SCTP stream is created by sending an SCTP message with a new stream id. Thus, to implement stream mapping, the Transport Services API must provide a newly created Connection object to the application upon the reception of such a message. The necessary semantics to implement a Transport Services system's <tt>Close</tt> and <tt>Abort</tt> primitives are provided by the stream reconfiguration (reset) procedure described in <xref target="RFC6525"/>. This also allows to re-use a stream id to be reused after resetting ("closing") the stream. To implement this functionality, SCTP stream reconfiguration <xref target="RFC6525"/> must be supported by both the client and the server side.</t>

<!-- [rfced] We wonder if "might block" should be "will block" because
     "without risking" implies that blocking should not happen?  Or is
     the intent to say the risk of blocking is reduced?

Original:
   This allows a sender to schedule transmissions between multiple
   streams without risking that transmission of a large message on one
   stream might block transmissions on other streams for a long time.
-->

        <t>To avoid head-of-line blocking, stream mapping should only be implemented when both sides support message interleaving <xref target="RFC8260"/>. This allows a sender to schedule transmissions between multiple streams without risking that transmission of a large message on one stream might block transmissions on other streams for a long time.</t>

<!-- [rfced] Does "growing order" mean "ascending order"?

Original:
   All additional
   Connections are assigned to unused stream ids in growing order.
-->
        <t>To avoid conflicts between stream ids, the following procedure is recommended: the first Connection, for which the SCTP association has been created, must always use stream id zero. All additional Connections are assigned to unused stream ids in growing order. To avoid a conflict when both endpoints map new Connections simultaneously, the peer which that initiated association must use even stream ids whereas the remote side must map its Connections to odd stream ids. Both sides maintain a status map of the assigned stream ids. Generally, new streams should consume the lowest available (even or odd, depending on the side) stream id; this rule is relevant when lower ids become available because Connection objects associated with the streams are closed.</t>
        <t>SCTP stream mapping as described here has been implemented in a research prototype; a desription description of this implementation is given in <xref target="NEAT-flow-mapping"/>.</t>
        <dl>
          <dt>Initiate:</dt>
          <dd>
            <t>If this is the only Connection object that is assigned to the SCTP Association or stream mapping is
not used, CONNECT.SCTP is called. Else, unless the Selection Property <tt>activeReadBeforeSend</tt>
is Preferred or Required, a new stream is used: if there are enough streams
available, <tt>Initiate</tt> is a local operation that assigns a new stream id to the Connection object.
The number of streams is negotiated as a parameter of the prior CONNECT.SCTP call, and it represents a
trade-off between local resource usage and the number of Connection objects that can be mapped
without requiring a reconfiguration signal. When running out of streams, ADD_STREAM.SCTP must be called.</t>
          </dd>
          <dt>InitiateWithSend:</dt>
          <dd>
            <t>If this is the only Connection object that is assigned to the SCTP association or stream mapping is not used, CONNECT.SCTP is called with the "user message" parameter. Else, a new stream
is used (see <tt>Initiate</tt> for how to handle running out of streams), and this just sends the first message
on a new stream.</t>
          </dd>
          <dt>Ready:</dt>
          <dd>
            <t><tt>Initiate</tt> or <tt>InitiateWithSend</tt> returns without an error, i.e. i.e., SCTP's four-way handshake has completed. If an association with the peer already exists, stream mapping is used used, and enough streams are available, a Connection object instantly becomes <tt>Ready</tt> after calling <tt>Initiate</tt> or <tt>InitiateWithSend</tt>.</t>
          </dd>
          <dt>EstablishmentError:</dt>
          <dd>
            <t>Failure of CONNECT.SCTP.</t>
          </dd>
          <dt>ConnectionError:</dt>
          <dd>
            <t>TIMEOUT.SCTP or ABORT-EVENT.SCTP.</t>
          </dd>
          <dt>Listen:</dt>
          <dd>
            <t>LISTEN.SCTP. If an association with the peer already exists and stream mapping is used, <tt>Listen</tt> just expects to receive a new message with a new stream id (chosen in accordance with the stream id assignment procedure described above).</t>
          </dd>
          <dt>ConnectionReceived:</dt>
          <dd>
            <t>LISTEN.SCTP returns without an error (a result of successful CONNECT.SCTP from the peer), peer) or, in the case of stream mapping, the first message has arrived on a new stream (in this case, <tt>Receive</tt> is also invoked).</t>
          </dd>
          <dt>Clone:</dt>
          <dd>
            <t>Calling <tt>Clone</tt> on an SCTP association creates a new Connection object and assigns it a new stream id in accordance with the stream id assignment procedure described above. If there are not enough streams available, ADD_STREAM.SCTP must be called.</t>
          </dd>
          <dt>Send:</dt>
          <dd>
            <t>SEND.SCTP. Message Properties such as <tt>msgLifetime</tt> and <tt>msgOrdered</tt> map to parameters of this primitive.</t>
          </dd>
          <dt>Receive:</dt>
          <dd>
            <t>RECEIVE.SCTP. The "partial flag" of RECEIVE.SCTP invokes a <tt>ReceivedPartial</tt> event.</t>
          </dd>
        </dl>
        <t>Close:
If

          <dt>Close:</dt>

<!-- [rfced] Will "fire" be clear for readers?  Perhaps "be initiated"
     or "be triggered" would be more accurate?

Original:
   At the peer, the event
   RESET_STREAM-EVENT.SCTP will fire, which the peer must answer by
   issuing RESET_STREAM.SCTP too.

Perhaps:
   At the peer, the event
   RESET_STREAM-EVENT.SCTP will be triggered, and the peer must respond by
   also issuing a RESET_STREAM.SCTP.
-->

<dd>If this is the only Connection object that is assigned to the SCTP association, CLOSE.SCTP is called, called and the <tt>Closed</tt> event will be delivered to the application upon the ensuing CLOSE-EVENT.SCTP. Else, the Connection object is one out of several Connection objects that are assigned to the same SCTP assocation, association, and RESET_STREAM.SCTP must be called, which informs the peer that the stream will no longer be used for mapping and can be used by future <tt>Initiate</tt>, <tt>InitiateWithSend</tt> <tt>InitiateWithSend</tt>, or <tt>Listen</tt> calls. At the peer, the event RESET_STREAM-EVENT.SCTP will fire, which the peer must answer by issuing RESET_STREAM.SCTP too. The resulting local RESET_STREAM-EVENT.SCTP informs the Transport Services system that the stream id can now be re-used reused by the next <tt>Initiate</tt>, <tt>InitiateWithSend</tt> <tt>InitiateWithSend</tt>, or <tt>Listen</tt> calls, and invokes a <tt>Closed</tt> event towards toward the application.</t>
        <t>Abort:
If application.</dd>
        <dt>Abort:</dt>
<dd>If this is the only Connection object that is assigned to the SCTP association, ABORT.SCTP is called. Else, the Connection object is one out of several Connection objects that are assigned to the same SCTP assocation, association, and shutdown proceeds as described under <tt>Close</tt>.</t>
        <t>CloseGroup:
Calling <tt>Close</tt>.</dd>
        <dt>CloseGroup:</dt>
<dd>Calling <tt>CloseGroup</tt> calls CLOSE.SCTP, closing which closes all Connections in the SCTP association.</t>
        <t>AbortGroup:
Calling association.</dd>
        <dt>AbortGroup:</dt>
<dd>Calling <tt>AbortGroup</tt> calls ABORT.SCTP, which immediately closing closes all Connections in the SCTP association.</t> association.</dd>
</dl>
        <t>In addition to the API mappings described above, when there are multiple Connection objects assigned to the same SCTP association, SCTP can support Connection properties such as <tt>connPriority</tt> and <tt>connScheduler</tt> where CONFIGURE_STREAM_SCHEDULER.SCTP can be called to adjust the priorities of streams in the SCTP association.</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no actions for IANA.</t> IANA actions.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t><xref target="I-D.ietf-taps-arch"/> target="RFC9621"/> outlines general security consideration considerations and requirements for any system that implements the Transport Services archtecture. architecture. <xref target="I-D.ietf-taps-interface"/> target="RFC9622"/> provides further discussion on security and privacy implications of the Transport Services API. This document provides additional guidance on implementation specifics for the Transport Services API and API; as such such, the security considerations in both of these documents apply. The next two subsections discuss further considerations that are specific to mechanisms specified in this document.</t>
      <section anchor="considerations-for-candidate-gathering">
        <name>Considerations for Candidate Gathering</name>
        <t>The

<!-- [rfced] For readability, may we update the sentence as follows?
     It is difficult to locate the information in RFC 9621 otherwise.

Original:
   The Security Considerations of the Transport Services Architecture
   [I-D.ietf-taps-arch] forbids gathering and racing with Protocol
   Stacks that do not have equivalent security properties.

Perhaps:
   As discussed in Sections 3.3 and 6 of [RFC9621], gathering
   and racing with Protocol Stacks that do not have equivalent security
   properties are forbidden.
-->
        <t>The Security Considerations of the Transport Services architecture <xref target="I-D.ietf-taps-arch"/> target="RFC9621"/> forbids gathering and racing with Protocol Stacks that do not have equivalent security properties. Therefore, implementations need to avoid downgrade attacks that allow network interference to cause the implementation to select less secure, or entirely insecure, combinations of paths and protocols.</t>
      </section>
      <section anchor="considerations-for-candidate-racing">
        <name>Considerations for Candidate Racing</name>
        <t>See <xref target="fastopen"/> for security considerations around racing with 0-RTT data.</t>
        <t>An attacker that knows a particular device is racing several options during connection establishment may be able to block packets for the first connection attempt, thus inducing the device to fall back to a secondary attempt. This is a problem if the secondary attempts have worse security properties that enable further attacks. Implementations should ensure that all options have equivalent security properties to avoid incentivizing attacks.</t>
        <t>Since results from the network can determine how a connection attempt tree is built, such as when DNS returns a list of resolved endpoints, it is possible for the network to cause an implementation to consume significant on-device resources. Implementations should limit the maximum amount of state allowed for any given node, including the number of child nodes, especially when the state is based on results from the network.</t>
      </section>
    </section>
    <section anchor="acknowledgements">
      <name>Acknowledgements</name>
      <t>This work has received funding from the European Union's Horizon 2020 research and
innovation programme under grant agreement No. 644334 (NEAT) and No. 815178 (5GENESIS).</t>
      <t>This work has been supported by Leibniz Prize project funds of DFG - German
Research Foundation: Gottfried Wilhelm Leibniz-Preis 2011 (FKZ FE 570/4-1).</t>
      <t>This work has been supported by the UK Engineering and Physical Sciences
Research Council under grant EP/R04144X/1.</t>
      <t>This work has been supported by the Research Council of Norway under its "Toppforsk"
programme through the "OCARINA" project.</t>
      <t>Thanks to Colin Perkins, Tom Jones, Karl-Johan Grinnemo, Gorry Fairhurst, for their contributions to the design of this specification.
Thanks also to Stuart Cheshire, Josh Graessley, David Schinazi, and Eric Kinnear for their implementation and design efforts, including Happy Eyeballs, that heavily influenced this work.</t>
    </section>

  </middle>
  <back>

    <references>
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>

<!-- [I-D.ietf-taps-arch] companion RFC 9621 -->
         <reference anchor="I-D.ietf-taps-arch"> anchor="RFC9621" target="https://www.rfc-editor.org/info/rfc9621">
	  <front>
	    <title>Architecture and Requirements for Transport Services</title> Services </title>
	    <author initials="T." surname="Pauly" fullname="Tommy Pauly" initials="T." surname="Pauly"> role="editor">
	      <organization>Apple Inc.</organization>
	    </author>
	    <author initials="B." surname="Trammell" fullname="Brian Trammell" initials="B." surname="Trammell"> role="editor">
	      <organization>Google Switzerland GmbH</organization>
	    </author>
	    <author fullname="Anna Brunstrom" initials="A." surname="Brunstrom"> surname="Brunstrom" fullname="Anna Brunstrom">
	      <organization>Karlstad University</organization>
	    </author>
	    <author fullname="Gorry Fairhurst" initials="G." surname="Fairhurst"> surname="Fairhurst" fullname="Gorry Fairhurst">
	      <organization>University of Aberdeen</organization>
	    </author>
	    <author initials="C. S." surname="Perkins" fullname="Colin Perkins" initials="C." surname="Perkins"> S. Perkins">
	      <organization>University of Glasgow</organization>
	    </author>
	    <date day="9" month="November" year="2023"/>
            <abstract>
              <t>   This document describes an architecture for exposing transport
   protocol features to applications for network communication.  This
   system exposes transport protocol features to applications for
   network communication.  The Transport Services Application
   Programming Interface (API) is based on an asynchronous, event-driven
   interaction pattern.  This API uses messages for representing data
   transfer to applications, and describes how a Transport Services
   Implementation can use multiple IP addresses, multiple protocols, and
   multiple paths, and provide multiple application streams.  This
   document provides the architecture and requirements.  It defines
   common terminology and concepts to be used in definitions of a
   Transport Service API and a Transport Services Implementation.

              </t>
            </abstract> year="2024"/>
	  </front>
	  <seriesInfo name="Internet-Draft" value="draft-ietf-taps-arch-19"/> name="RFC" value="9621"/>
	  <seriesInfo name="DOI" value="10.17487/RFC9621"/>
	</reference>

<!-- [I-D.ietf-taps-interface] companion document RFC 9622 -->
        <reference anchor="I-D.ietf-taps-interface"> anchor="RFC9622" target="https://www.rfc-editor.org/info/rfc9622">
	  <front>
            <title>An Abstract Application Layer Interface to
	    <title>The Transport Services</title> Services Application Programming Interface</title>
	    <author initials="B." surname="Trammell" fullname="Brian Trammell" initials="B." surname="Trammell"> role="editor">
	      <organization>Google Switzerland GmbH</organization>
	    </author>
	    <author initials="M." surname="Welzl" fullname="Michael Welzl" initials="M." surname="Welzl"> role="editor">
	      <organization>University of Oslo</organization>
	    </author>
	    <author fullname="Reese Enghardt" initials="R." surname="Enghardt"> surname="Enghardt" fullname="Reese Enghardt">
	      <organization>Netflix</organization>
	    </author>
	    <author fullname="Gorry Fairhurst" initials="G." surname="Fairhurst"> surname="Fairhurst" fullname="Gorry Fairhurst">
	      <organization>University of Aberdeen</organization>
	    </author>
	    <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind"> surname="Kühlewind" fullname="Mirja Kühlewind">
	      <organization>Ericsson</organization>
	    </author>
	    <author initials="C. S." surname="Perkins" fullname="Colin Perkins" initials="C." surname="Perkins"> S. Perkins">
	      <organization>University of Glasgow</organization>
	    </author>
	    <author fullname="Philipp S. Tiesel" initials="P. S." surname="Tiesel"> surname="Tiesel" fullname="Philipp S. Tiesel">
	      <organization>SAP SE</organization>
	    </author>
	    <author fullname="Tommy Pauly" initials="T." surname="Pauly"> surname="Pauly" fullname="Tommy Pauly">
	      <organization>Apple Inc.</organization>
	    </author>
	    <date day="14" month="November" year="2023"/>
            <abstract>
              <t>   This document describes an abstract application programming
   interface, API, to the transport layer that enables the selection of
   transport protocols and network paths dynamically at runtime.  This
   API enables faster deployment of new protocols and protocol features
   without requiring changes to the applications.  The specified API
   follows the Transport Services architecture by providing
   asynchronous, atomic transmission of messages.  It is intended to
   replace the BSD sockets API as the common interface to the transport
   layer, in an environment where endpoints could select from multiple
   network paths and potential transport protocols.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-taps-interface-23"/>
        </reference>
        <reference anchor="RFC8305">
          <front>
            <title>Happy Eyeballs Version 2: Better Connectivity Using Concurrency</title>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <author fullname="T. Pauly" initials="T." surname="Pauly"/>
            <date month="December" year="2017"/>
            <abstract>
              <t>Many communication protocols operating over the modern Internet use hostnames. 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 chance of establishing a connection more quickly. This document specifies requirements for algorithms that reduce this user-visible delay and provides an example algorithm, referred to as "Happy Eyeballs". This document obsoletes the original algorithm description in RFC 6555.</t>
            </abstract> year="2024"/>
	  </front>
	  <seriesInfo name="RFC" value="8305"/> value="9622"/>
	  <seriesInfo name="DOI" value="10.17487/RFC8305"/> value="10.17487/RFC9622"/>
	</reference>
        <reference anchor="RFC7540">
          <front>
            <title>Hypertext Transfer Protocol Version 2 (HTTP/2)</title>
            <author fullname="M. Belshe" initials="M." surname="Belshe"/>
            <author fullname="R. Peon" initials="R." surname="Peon"/>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <date month="May" year="2015"/>
            <abstract>
              <t>This specification describes an optimized expression of the semantics of the Hypertext Transfer Protocol (HTTP), referred to as HTTP version 2 (HTTP/2). HTTP/2 enables a more efficient use of network resources and a reduced perception of latency by introducing header field compression and allowing multiple concurrent exchanges on the same connection. It also introduces unsolicited push of representations from servers to clients.</t>
              <t>This specification is an alternative to, but does not obsolete, the HTTP/1.1 message syntax. HTTP's existing semantics remain unchanged.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7540"/>
          <seriesInfo name="DOI" value="10.17487/RFC7540"/>
        </reference>
        <reference anchor="RFC8421">
          <front>
            <title>Guidelines for Multihomed and IPv4/IPv6 Dual-Stack Interactive Connectivity Establishment (ICE)</title>
            <author fullname="P. Martinsen" initials="P." surname="Martinsen"/>
            <author fullname="T. Reddy" initials="T." surname="Reddy"/>
            <author fullname="P. Patil" initials="P." surname="Patil"/>
            <date month="July" year="2018"/>
            <abstract>
              <t>This document provides guidelines on how to make Interactive Connectivity Establishment (ICE) conclude faster in multihomed and IPv4/IPv6 dual-stack scenarios where broken paths exist. The provided guidelines are backward compatible with the original ICE specification (see RFC 5245).</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="217"/>
          <seriesInfo name="RFC" value="8421"/>
          <seriesInfo name="DOI" value="10.17487/RFC8421"/>
        </reference>
        <reference anchor="RFC8303">
          <front>
            <title>On the Usage of Transport Features Provided by IETF Transport Protocols</title>
            <author fullname="M. Welzl" initials="M." surname="Welzl"/>
            <author fullname="M. Tuexen" initials="M." surname="Tuexen"/>
            <author fullname="N. Khademi" initials="N." surname="Khademi"/>
            <date month="February" year="2018"/>
            <abstract>
              <t>This document describes how the transport protocols Transmission Control Protocol (TCP), MultiPath TCP (MPTCP), Stream Control Transmission Protocol (SCTP), User Datagram Protocol (UDP), and Lightweight User Datagram Protocol (UDP-Lite) expose services to applications and how an application can configure and use the features that make up these services. It also discusses the service provided by the Low Extra Delay Background Transport (LEDBAT) congestion control mechanism. The description results in a set of transport abstractions that can be exported in a transport services (TAPS) API.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8303"/>
          <seriesInfo name="DOI" value="10.17487/RFC8303"/>
        </reference>
        <reference anchor="RFC8304">
          <front>
            <title>Transport Features of the User Datagram Protocol (UDP) and Lightweight UDP (UDP-Lite)</title>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="T. Jones" initials="T." surname="Jones"/>
            <date month="February" year="2018"/>
            <abstract>
              <t>This is an informational document that describes the transport protocol interface primitives provided by the User Datagram Protocol (UDP) and the Lightweight User Datagram Protocol (UDP-Lite) transport protocols. It identifies the datagram services exposed to applications and how an application can configure and use the features offered by the Internet datagram transport service. RFC 8303 documents the usage of transport features provided by IETF transport protocols, describing the way UDP, UDP-Lite, and other transport protocols expose their services to applications and how an application can configure and use the features that make up these services. This document provides input to and context for that document, as well as offers a road map to documentation

	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8305.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7540.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8421.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8303.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8304.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7413.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8446.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8923.xml"/>

      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>

<!-- [rfced] Please note that may help users of the UDP and UDP-Lite protocols.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8304"/>
          <seriesInfo name="DOI" value="10.17487/RFC8304"/>
        </reference>
        <reference anchor="RFC7413">
          <front>
            <title>TCP Fast Open</title>
            <author fullname="Y. Cheng" initials="Y." surname="Cheng"/>
            <author fullname="J. Chu" initials="J." surname="Chu"/>
            <author fullname="S. Radhakrishnan" initials="S." surname="Radhakrishnan"/>
            <author fullname="A. Jain" initials="A." surname="Jain"/>
            <date month="December" year="2014"/>
            <abstract>
              <t>This document describes an experimental TCP mechanism called TCP Fast Open (TFO). TFO allows data to be carried in the SYN and SYN-ACK packets and consumed by the receiving end during the initial connection handshake, and saves up to one full round-trip time (RTT) compared to the standard TCP, which requires a three-way handshake (3WHS) to complete before data can be exchanged. However, TFO deviates from the standard TCP semantics, since the data in the SYN could be replayed to an application in some rare circumstances. Applications should not use TFO unless they can tolerate this issue, as detailed in the Applicability section.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7413"/>
          <seriesInfo name="DOI" value="10.17487/RFC7413"/>
        </reference>
        <reference anchor="RFC8446">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <date month="August" year="2018"/>
            <abstract>
              <t>This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over we have updated the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t>This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961. This document also specifies new requirements for TLS 1.2 implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8446"/>
          <seriesInfo name="DOI" value="10.17487/RFC8446"/>
        </reference>
        <reference anchor="RFC8923">
          <front>
            <title>A Minimal Set of Transport Services for End Systems</title>
            <author fullname="M. Welzl" initials="M." surname="Welzl"/>
            <author fullname="S. Gjessing" initials="S." surname="Gjessing"/>
            <date month="October" year="2020"/>
            <abstract>
              <t>This document recommends a minimal set of Transport Services offered by end systems and gives guidance following
     references.  Please let us know if any corrections are needed.

[NEAT-flow-mapping] updated based on choosing among the available mechanisms and protocols. It is information found at
<https://ieeexplore.ieee.org/document/8264876>.

[TCP-COUPLING] updated based on the set of transport features in RFC 8303.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8923"/>
          <seriesInfo name="DOI" value="10.17487/RFC8923"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name> information found at
<https://ieeexplore.ieee.org/document/8406887>.
-->
        <reference anchor="NEAT-flow-mapping"> anchor="NEAT-flow-mapping" target="https://ieeexplore.ieee.org/document/8264876">
          <front>
            <title>Transparent Flow Mapping flow mapping for NEAT</title>
            <author>
            <author initials="F." surname="Weinrank" fullname="F. Weinrank">
              <organization/>
            </author>
            <author initials="M." surname="Tuxen" fullname="M. Tuxen">
              <organization/>
            </author>
            <date month="June" year="2017"/>
          </front>
          <refcontent>2017 IFIP Networking Conference (IFIP Networking) and Workshops</refcontent>
          <seriesInfo name="IFIP NETWORKING 2017 Workshop on Future of Internet Transport (FIT 2017)" value=""/> name="DOI" value="10.23919/IFIPNetworking.2017.8264876"/>
        </reference>

        <reference anchor="TCP-COUPLING"> anchor="TCP-COUPLING" target="https://ieeexplore.ieee.org/document/8406887">
          <front>
            <title>ctrlTCP: Reducing Latency latency through Coupled, Heterogeneous Multi-Flow coupled, heterogeneous multi-flow TCP Congestion Control</title>
            <author>
              <organization/>
            </author>
            <date>n.d.</date>
          </front>
          <seriesInfo name="IEEE INFOCOM Global Internet Symposium (GI) workshop (GI 2018)" value=""/>
        </reference>
        <reference anchor="RFC8085">
          <front>
            <title>UDP Usage Guidelines</title>
            <author fullname="L. Eggert" initials="L." surname="Eggert"/>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="G. Shepherd" initials="G." surname="Shepherd"/>
            <date month="March" year="2017"/>
            <abstract>
              <t>The User Datagram Protocol (UDP) provides a minimal message-passing transport that has no inherent congestion control mechanisms. This document provides guidelines on the use of UDP for the designers of applications, tunnels, and other protocols that use UDP. Congestion control guidelines are a primary focus, but the document also provides guidance on other topics, including message sizes, reliability, checksums, middlebox traversal, the use of Explicit Congestion Notification (ECN), Differentiated Services Code Points (DSCPs), and ports.</t>
              <t>Because congestion control is critical to the stable operation of the Internet, applications and other protocols that choose to use UDP as an Internet transport must employ mechanisms to prevent congestion collapse and to establish some degree of fairness with concurrent traffic. They may also need to implement additional mechanisms, depending on how they use UDP.</t>
              <t>Some guidance is also applicable to the design of other protocols (e.g., protocols layered directly on IP or via IP-based tunnels), especially when these protocols do not themselves provide congestion control.</t>
              <t>This document obsoletes RFC 5405 and adds guidelines for multicast UDP usage.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="145"/>
          <seriesInfo name="RFC" value="8085"/>
          <seriesInfo name="DOI" value="10.17487/RFC8085"/>
        </reference>
        <reference anchor="RFC2782">
          <front>
            <title>A DNS RR for specifying the location of services (DNS SRV)</title>
            <author fullname="A. Gulbrandsen" initials="A." surname="Gulbrandsen"/> control</title>
            <author fullname="P. Vixie" initials="P." surname="Vixie"/>
            <author fullname="L. Esibov" initials="L." surname="Esibov"/>
            <date month="February" year="2000"/>
            <abstract>
              <t>This document describes a DNS RR which specifies the location of the server(s) for a specific protocol and domain. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2782"/>
          <seriesInfo name="DOI" value="10.17487/RFC2782"/>
        </reference>
        <reference anchor="I-D.ietf-dnsop-svcb-https">
          <front>
            <title>Service Binding and Parameter Specification via the DNS (SVCB and HTTPS Resource Records)</title>
            <author fullname="Benjamin M. Schwartz" initials="B. M." surname="Schwartz">
              <organization>Google</organization> initials="S." surname="Islam" fullname="S. Islam">
              <organization/>
            </author>
            <author fullname="Mike Bishop" initials="M." surname="Bishop">
              <organization>Akamai Technologies</organization> surname="Welzl" fullname="M. Welzl">
              <organization/>
            </author>
            <author fullname="Erik Nygren" initials="E." surname="Nygren">
              <organization>Akamai Technologies</organization> initials="K." surname="Hiorth" fullname="K. Hiorth">
              <organization/>
            </author>
            <date day="11" month="March" year="2023"/>
            <abstract>
              <t>This document specifies the "SVCB" ("Service Binding") and "HTTPS" DNS resource record (RR) types to facilitate the lookup of information needed to make connections to network services, such as for HTTP origins.  SVCB records allow a service to be provided from multiple alternative endpoints, each with associated parameters (such as transport protocol configuration), and are extensible to support future uses (such as keys for encrypting the TLS ClientHello).  They also enable aliasing of apex domains, which is not possible with CNAME.  The HTTPS RR is a variation of SVCB for use with HTTP (see RFC 9110, "HTTP Semantics").  By providing more information to the client before it attempts to establish a connection, these records offer potential benefits to both performance and privacy.
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-dnsop-svcb-https-12"/>
        </reference>
        <reference anchor="RFC6763">
          <front>
            <title>DNS-Based Service Discovery</title>
            <author fullname="S. Cheshire" initials="S." surname="Cheshire"/> initials="D." surname="Hayes" fullname="D. Hayes">
              <organization/>
            </author>
            <author fullname="M. Krochmal" initials="M." surname="Krochmal"/>
            <date month="February" year="2013"/>
            <abstract>
              <t>This document specifies how DNS resource records are named and structured to facilitate service discovery. Given a type of service that a client is looking for, and a domain in which the client is looking for that service, this mechanism allows clients to discover a list of named instances of that desired service, using standard DNS queries. This mechanism is referred to as DNS-based Service Discovery, or DNS-SD.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6763"/>
          <seriesInfo name="DOI" value="10.17487/RFC6763"/>
        </reference>
        <reference anchor="RFC6762">
          <front>
            <title>Multicast DNS</title> initials="G." surname="Armitage" fullname="G. Armitage">
              <organization/>
            </author>
            <author fullname="S. Cheshire" initials="S." surname="Cheshire"/>
            <author fullname="M. Krochmal" initials="M." surname="Krochmal"/>
            <date month="February" year="2013"/>
            <abstract>
              <t>As networked devices become smaller, more portable, and more ubiquitous, the ability to operate with less configured infrastructure is increasingly important. In particular, the ability to look up DNS resource record data types (including, but not limited to, host names) in the absence of a conventional managed DNS server is useful.</t>
              <t>Multicast DNS (mDNS) provides the ability to perform DNS-like operations on the local link in the absence of any conventional Unicast DNS server. In addition, Multicast DNS designates a portion of the DNS namespace to be free for local use, without the need to pay any annual fee, and without the need to set up delegations or otherwise configure a conventional DNS server to answer for those names.</t>
              <t>The primary benefits of Multicast DNS names are that (i) they require little or no administration or configuration to set them up, (ii) they work when no infrastructure is present, and (iii) they work during infrastructure failures.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6762"/>
          <seriesInfo name="DOI" value="10.17487/RFC6762"/>
        </reference>
        <reference anchor="RFC9000">
          <front>
            <title>QUIC: A UDP-Based Multiplexed and Secure Transport</title>
            <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar"/>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document defines the core of the QUIC transport protocol. QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances. Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9000"/>
          <seriesInfo name="DOI" value="10.17487/RFC9000"/>
        </reference>
        <reference anchor="RFC8445">
          <front>
            <title>Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal</title>
            <author fullname="A. Keranen" initials="A." surname="Keranen"/>
            <author fullname="C. Holmberg" initials="C." surname="Holmberg"/>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/> surname="Gjessing" fullname="S. Gjessing">
              <organization/>
            </author>
            <date month="July" year="2018"/>
            <abstract>
              <t>This document describes a protocol for Network Address Translator (NAT) traversal for UDP-based communication. This protocol is called Interactive Connectivity Establishment (ICE). ICE makes use of the Session Traversal Utilities for NAT (STUN) protocol and its extension, Traversal Using Relay NAT (TURN).</t>
              <t>This document obsoletes RFC 5245.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8445"/>
          <refcontent>IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</refcontent>
          <seriesInfo name="DOI" value="10.17487/RFC8445"/> value="10.1109/INFCOMW.2018.8406887"/>
        </reference>
        <reference anchor="RFC5389">
          <front>
            <title>Session Traversal Utilities for NAT (STUN)</title>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/>
            <author fullname="R. Mahy" initials="R." surname="Mahy"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="D. Wing" initials="D." surname="Wing"/>
            <date month="October" year="2008"/>
            <abstract>
              <t>Session Traversal Utilities for NAT (STUN) is a protocol that serves as a tool for other protocols in dealing with Network Address Translator (NAT) traversal. It can be used by an endpoint to determine the IP address and port allocated to it by a NAT. It can also be used to check connectivity between two endpoints, and as a keep-alive protocol to maintain NAT bindings. STUN works with many existing NATs, and does not require any special behavior from them.</t>
              <t>STUN is not a NAT traversal solution by itself. Rather, it is a tool to be used in the context of a NAT traversal solution. This is an important change from the previous version of this specification (RFC 3489), which presented STUN

	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8085.xml"/>
	<xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2782.xml"/>

<!-- [I-D.ietf-dnsop-svcb-https] Published as a complete solution.</t>
              <t>This document obsoletes RFC 3489. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5389"/>
          <seriesInfo name="DOI" value="10.17487/RFC5389"/>
        </reference>
        <reference anchor="RFC5766">
          <front>
            <title>Traversal Using Relays around NAT (TURN): Relay Extensions to Session Traversal Utilities for NAT (STUN)</title>
            <author fullname="R. Mahy" initials="R." surname="Mahy"/>
            <author fullname="P. Matthews" initials="P." surname="Matthews"/>
            <author fullname="J. Rosenberg" initials="J." surname="Rosenberg"/>
            <date month="April" year="2010"/>
            <abstract>
              <t>If a host is located behind a NAT, then in certain situations it can be impossible for that host to communicate directly with other hosts (peers). In these situations, it is necessary for the host to use the services of an intermediate node that acts 9460 as a communication relay. This specification defines a protocol, called TURN (Traversal Using Relays around NAT), that allows the host to control the operation of the relay and to exchange packets with its peers using the relay. TURN differs from some other relay control protocols in that it allows a client to communicate with multiple peers using a single relay address. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5766"/>
          <seriesInfo name="DOI" value="10.17487/RFC5766"/>
        </reference>
        <reference anchor="RFC7657">
          <front>
            <title>Differentiated Services (Diffserv) and Real-Time Communication</title>
            <author fullname="D. Black" initials="D." role="editor" surname="Black"/>
            <author fullname="P. Jones" initials="P." surname="Jones"/>
            <date month="November" year="2015"/>
            <abstract>
              <t>This memo describes the interaction between Differentiated Services (Diffserv) network quality-of-service (QoS) functionality and real- time network communication, including communication based on the Real-time Transport Protocol (RTP). Diffserv is based on network nodes applying different forwarding treatments to packets whose IP headers are marked with different Diffserv Codepoints (DSCPs). WebRTC applications, as well as some conferencing applications, have begun using the Session Description Protocol (SDP) bundle negotiation mechanism to send multiple traffic streams with different QoS requirements using the same network 5-tuple. 04/24/24-->
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9460.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6763.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6762.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9000.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8445.xml"/>

	<!--        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5389.xml"/>-->

<!--[rfced] The results of using multiple DSCPs to obtain different QoS treatments within a single network 5-tuple following RFCs have transport protocol interactions, particularly with congestion control functionality (e.g., reordering). In addition, DSCP markings may be changed or removed between the traffic source and destination. This memo covers the implications of these Diffserv aspects for real-time network communication, including WebRTC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7657"/>
          <seriesInfo name="DOI" value="10.17487/RFC7657"/>
        </reference>
        <reference anchor="RFC3207">
          <front>
            <title>SMTP Service Extension for Secure SMTP over Transport Layer Security</title>
            <author fullname="P. Hoffman" initials="P." surname="Hoffman"/>
            <date month="February" year="2002"/>
            <abstract>
              <t>This document describes an extension to the SMTP (Simple Mail Transfer Protocol) service that allows an SMTP server and client to use TLS (Transport Layer Security) to provide private, authenticated communication over the Internet. This gives SMTP agents the ability to protect some or all of their communications from eavesdroppers and attackers. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3207"/>
          <seriesInfo name="DOI" value="10.17487/RFC3207"/>
        </reference>
        <reference anchor="RFC1928">
          <front>
            <title>SOCKS Protocol Version 5</title>
            <author fullname="M. Leech" initials="M." surname="Leech"/>
            <author fullname="M. Ganis" initials="M." surname="Ganis"/>
            <author fullname="Y. Lee" initials="Y." surname="Lee"/>
            <author fullname="R. Kuris" initials="R." surname="Kuris"/>
            <author fullname="D. Koblas" initials="D." surname="Koblas"/>
            <author fullname="L. Jones" initials="L." surname="Jones"/>
            <date month="March" year="1996"/>
            <abstract>
              <t>This memo describes a protocol that is an evolution of the previous version of the protocol, version 4 [1]. This new protocol stems from active discussions and prototype implementations. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="1928"/>
          <seriesInfo name="DOI" value="10.17487/RFC1928"/>
        </reference>
        <reference anchor="RFC7230">
          <front>
            <title>Hypertext Transfer Protocol (HTTP/1.1): Message Syntax and Routing</title>
            <author fullname="R. Fielding" initials="R." role="editor" surname="Fielding"/>
            <author fullname="J. Reschke" initials="J." role="editor" surname="Reschke"/>
            <date month="June" year="2014"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document provides an overview of HTTP architecture and its associated terminology, defines the "http" and "https" Uniform Resource Identifier (URI) schemes, defines the HTTP/1.1 message syntax and parsing requirements, and describes related security concerns for implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7230"/>
          <seriesInfo name="DOI" value="10.17487/RFC7230"/>
        </reference>
        <reference anchor="RFC9040">
          <front>
            <title>TCP Control Block Interdependence</title>
            <author fullname="J. Touch" initials="J." surname="Touch"/>
            <author fullname="M. Welzl" initials="M." surname="Welzl"/>
            <author fullname="S. Islam" initials="S." surname="Islam"/>
            <date month="July" year="2021"/>
            <abstract>
              <t>This memo provides guidance to TCP implementers that is intended to help improve connection convergence to steady-state operation without affecting interoperability. It updates and replaces RFC 2140's description of sharing TCP state, as typically represented in TCP Control Blocks, among similar concurrent or consecutive connections.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9040"/>
          <seriesInfo name="DOI" value="10.17487/RFC9040"/>
        </reference>
        <reference anchor="RFC3124">
          <front>
            <title>The Congestion Manager</title>
            <author fullname="H. Balakrishnan" initials="H." surname="Balakrishnan"/>
            <author fullname="S. Seshan" initials="S." surname="Seshan"/>
            <date month="June" year="2001"/>
            <abstract>
              <t>This document describes the Congestion Manager (CM), an end-system module that enables an ensemble of multiple concurrent streams from a sender destined to the same receiver and sharing the same congestion properties to perform proper congestion avoidance and control, and allows applications to easily adapt to network congestion. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3124"/>
          <seriesInfo name="DOI" value="10.17487/RFC3124"/>
        </reference>
        <reference anchor="RFC6525">
          <front>
            <title>Stream Control Transmission Protocol (SCTP) Stream Reconfiguration</title>
            <author fullname="R. Stewart" initials="R." surname="Stewart"/>
            <author fullname="M. Tuexen" initials="M." surname="Tuexen"/>
            <author fullname="P. Lei" initials="P." surname="Lei"/>
            <date month="February" year="2012"/>
            <abstract>
              <t>Many applications that use the Stream Control Transmission Protocol (SCTP) want the ability to "reset" a stream. The intention of resetting a stream is to set the numbering sequence of the stream back to 'zero' with a corresponding notification to the application layer that the reset has been performed. Applications requiring this feature want it so that they can "reuse" streams for different purposes but still utilize the stream sequence number so that the application can track the message flows. Thus, without this feature, a new use of an old stream would result in message numbers greater than expected, unless there is a protocol mechanism obsoleted.  We will update to "reset
     point the streams back reader to zero". This document also includes methods for resetting the transmission sequence numbers, adding additional streams, and resetting all stream sequence numbers. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6525"/>
          <seriesInfo name="DOI" value="10.17487/RFC6525"/>
        </reference>
        <reference anchor="RFC8260">
          <front>
            <title>Stream Schedulers and User Message Interleaving for the Stream Control Transmission Protocol</title>
            <author fullname="R. Stewart" initials="R." surname="Stewart"/>
            <author fullname="M. Tuexen" initials="M." surname="Tuexen"/>
            <author fullname="S. Loreto" initials="S." surname="Loreto"/>
            <author fullname="R. Seggelmann" initials="R." surname="Seggelmann"/>
            <date month="November" year="2017"/>
            <abstract>
              <t>The Stream Control Transmission Protocol (SCTP) is a message-oriented transport protocol supporting arbitrarily large user messages. This document adds a new chunk to SCTP for carrying payload data. This allows a sender to interleave different user messages that would otherwise result in head-of-line blocking at one on the sender. The interleaving of user messages is required for WebRTC data channels.</t>
              <t>Whenever an SCTP sender is allowed to send user data, it may choose from multiple outgoing SCTP streams. Multiple ways for performing this selection, called stream schedulers, are defined in this document. A stream scheduler can choose to either implement, or not implement, user message interleaving.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8260"/>
          <seriesInfo name="DOI" value="10.17487/RFC8260"/>
        </reference> right unless we hear
     objection.

-->

        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5389.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5766.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7657.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.3207.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.1928.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7230.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9040.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.3124.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6525.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8260.xml"/>

      </references>
    </references>
    <?line 1189?>

<section anchor="appendix-mapping-template">
      <name>API Mapping Template</name>
      <t>Any protocol mapping for the Transport Services API should follow a common template.</t>
      <t>Connectedness: (Connectionless/Connected/Multiplexing Connected)</t>
      <t>Data Unit: (Byte-stream/Datagram/Message)</t>
      <t>Connection Object:</t>
      <t>Initiate:</t>
      <t>InitiateWithSend:</t>
      <t>Ready:</t>
      <t>EstablishmentError:</t>
      <t>ConnectionError:</t>
      <t>Listen:</t>
      <t>ConnectionReceived:</t>
      <t>Clone:</t>
      <t>Send:</t>
      <t>Receive:</t>
      <t>Close:</t>
      <t>Abort:</t>
      <t>CloseGroup:</t>
      <t>AbortGroup:</t>
    </section>
    <section anchor="appendix-reasons-errors">
      <name>Reasons for errors</name> Errors</name>
      <t>The Transport Services API <xref target="I-D.ietf-taps-interface"/> target="RFC9622"/> allows for the several generic error types to specify a more detailed reason about why an error occurred. This appendix lists some of the possible reasons.</t>
      <ul
      <dl spacing="normal">
        <li>
          <t>InvalidConfiguration:

          <dt>InvalidConfiguration:</dt><dd>
The transport properties and Endpoint Identifers Identifiers provided by the application are either contradictory or incomplete. Examples include the lack of a Remote Endpoint Identifer Identifier on an active open or using a multicast group address while not requesting a unidirectional receive.</t>
        </li>
        <li>
          <t>NoCandidates: receive.</dd>

          <dt>NoCandidates:</dt><dd>
The configuration is valid, but none of the available transport protocols can satisfy the transport properties provided by the application.</t>
        </li>
        <li>
          <t>ResolutionFailed: application.</dd>

          <dt>ResolutionFailed:</dt><dd>
The remote or local specifier provided by the application can not cannot be resolved.</t>
        </li>
        <li>
          <t>EstablishmentFailed: resolved.</dd>

          <dt>EstablishmentFailed:</dt><dd>
The Transport Services system was unable to establish a transport-layer connection to the Remote Endpoint specified by the application.</t>
        </li>
        <li>
          <t>PolicyProhibited: application.</dd>

          <dt>PolicyProhibited:</dt><dd>
The system policy prevents the Transport Services system from performing the action requested by the application.</t>
        </li>
        <li>
          <t>NotCloneable: application.</dd>

          <dt>NotCloneable:</dt><dd>
The Protocol Stack is not capable of being cloned.</t>
        </li>
        <li>
          <t>MessageTooLarge: cloned.</dd>

          <dt>MessageTooLarge:</dt><dd>
The Message is too big for the Transport Services system to handle.</t>
        </li>
        <li>
          <t>ProtocolFailed: handle.</dd>

          <dt>ProtocolFailed:</dt><dd>
The underlying Protocol Stack failed.</t>
        </li>
        <li>
          <t>InvalidMessageProperties: failed.</dd>

          <dt>InvalidMessageProperties:</dt><dd>
The Message Properties either contradict the Transport Properties or they can not cannot be satisfied by the Transport Services system.</t>
        </li>
        <li>
          <t>DeframingFailed: system.</dd>

          <dt>DeframingFailed:</dt><dd>
The data that was received by the underlying Protocol Stack could not be processed by the Message Framer.</t>
        </li>
        <li>
          <t>ConnectionAborted: Framer.</dd>

          <dt>ConnectionAborted:</dt><dd>
The connection was aborted by the peer.</t>
        </li>
        <li>
          <t>Timeout: peer.</dd>

          <dt>Timeout:</dt><dd>
Delivery of a Message was not possible after a timeout.</t>
        </li>
      </ul> timeout.</dd>

      </dl>
    </section>
    <section anchor="appendix-implementations">
      <name>Existing Implementations</name>
      <t>This appendix gives an overview of existing implementations, at the time of writing, of Transport Services systems that are (to some degree) in line with this document.</t>
      <ul spacing="normal">
        <li>
          <t>Apple's Network.framework:
          </t>
          <ul spacing="normal">
            <li>
              <t>Network.framework is a transport-level API built for C, Objective-C, and Swift. It is a connect-by-name API that supports transport security protocols. It provides userspace user-space implementations of TCP, UDP, TLS, DTLS, and proxy protocols, and it allows extension via custom framers.</t>
            </li>
            <li>
              <t>Documentation: <eref target="https://developer.apple.com/documentation/network">https://developer.apple.com/documentation/network</eref></t> target="https://developer.apple.com/documentation/network"/></t>
            </li>
          </ul>
        </li>
        <li>
          <t>NEAT and NEATPy:
          </t>
          <ul spacing="normal">
            <li>
              <t>NEAT is the output of the European H2020 research project "NEAT"; it is a user-space library for protocol-independent communication on top of TCP, UDP UDP, and SCTP, with many more features, such as a policy manager.</t>
            </li>
            <li>
              <t>Code: <eref target="https://github.com/NEAT-project/neat">https://github.com/NEAT-project/neat</eref></t> target="https://github.com/NEAT-project/neat"/></t>
            </li>
            <li>
              <t>Code at the Software Heritage Archive: <eref target="https://archive.softwareheritage.org/swh:1:dir:737820840f83c4ec9493a8c0cc89b3159e2e1a57;origin=https://github.com/NEAT-project/neat;visit=swh:1:snp:bbb611b04e355439d47e426e8ad5d07cdbf647e0;anchor=swh:1:rev:652ee991043ce3560a6e5715fa2a5c211139d15c">https://archive.softwareheritage.org/swh:1:dir:737820840f83c4ec9493a8c0cc89b3159e2e1a57;origin=https://github.com/NEAT-project/neat;visit=swh:1:snp:bbb611b04e355439d47e426e8ad5d07cdbf647e0;anchor=swh:1:rev:652ee991043ce3560a6e5715fa2a5c211139d15c</eref></t> target="https://archive.softwareheritage.org/swh:1:dir:737820840f83c4ec9493a8c0cc89b3159e2e1a57;origin=https://github.com/NEAT-project/neat;visit=swh:1:snp:bbb611b04e355439d47e426e8ad5d07cdbf647e0;anchor=swh:1:rev:652ee991043ce3560a6e5715fa2a5c211139d15c"/></t>
            </li>
            <li>
<!-- [rfced] Appendix C: The URL for the NEAT project
     (https://www.neat-project.org) does not appear to be working
     ("Unable to connect").  Please let us know how this should be
     updated.

Original:
   -  NEAT project: https://www.neat-project.org

-->
              <t>NEAT project: <eref target="https://www.neat-project.org">https://www.neat-project.org</eref></t> target="https://www.neat-project.org"/></t>
            </li>
            <li>
              <t>NEATPy is a Python shim over NEAT which that updates the NEAT API to be in line with version 6 of the Transport Services API draft.</t> <xref target="RFC9622"/>.</t>
            </li>
            <li>
              <t>Code: <eref target="https://github.com/theagilepadawan/NEATPy">https://github.com/theagilepadawan/NEATPy</eref></t> target="https://github.com/theagilepadawan/NEATPy"/></t>
            </li>
            <li>
              <t>Code at the Software Heritage Archive: <eref target="https://archive.softwareheritage.org/swh:1:dir:295ccd148cf918ccb9ed7ad14b5ae968a8d2c370;origin=https://github.com/theagilepadawan/NEATPy;visit=swh:1:snp:6e1a3a9dd4c532ba6c0f52c8f734c1256a06cedc;anchor=swh:1:rev:cd0788d7f7f34a0e9b8654516da7c002c44d2e95">https://archive.softwareheritage.org/swh:1:dir:295ccd148cf918ccb9ed7ad14b5ae968a8d2c370;origin=https://github.com/theagilepadawan/NEATPy;visit=swh:1:snp:6e1a3a9dd4c532ba6c0f52c8f734c1256a06cedc;anchor=swh:1:rev:cd0788d7f7f34a0e9b8654516da7c002c44d2e95</eref></t> target="https://archive.softwareheritage.org/swh:1:dir:295ccd148cf918ccb9ed7ad14b5ae968a8d2c370;origin=https://github.com/theagilepadawan/NEATPy;visit=swh:1:snp:6e1a3a9dd4c532ba6c0f52c8f734c1256a06cedc;anchor=swh:1:rev:cd0788d7f7f34a0e9b8654516da7c002c44d2e95"/></t>
            </li>
          </ul>
        </li>
        <li>
          <t>PyTAPS:
          </t>
          <ul spacing="normal">
            <li>
              <t>A TAPS Transport Services (TAPS) implementation based on Python asyncio, offering protocol-independent communication to applications on top of TCP, UDP UDP, and TLS, with support for multicast.</t>
            </li>
            <li>
              <t>Code: <eref target="https://github.com/fg-inet/python-asyncio-taps">https://github.com/fg-inet/python-asyncio-taps</eref></t> target="https://github.com/fg-inet/python-asyncio-taps"/></t>
            </li>
            <li>
              <t>Code at the Software Heritage Archive: <eref target="https://archive.softwareheritage.org/swh:1:dir:a7151096d91352b439b092ef116d04f38e52e556;origin=https://github.com/fg-inet/python-asyncio-taps;visit=swh:1:snp:4841e59b53b28bb385726e7d3a569bee0fea7fc4;anchor=swh:1:rev:63571fd7545da25142bc1a6371b8f13097cba38e">https://archive.softwareheritage.org/swh:1:dir:a7151096d91352b439b092ef116d04f38e52e556;origin=https://github.com/fg-inet/python-asyncio-taps;visit=swh:1:snp:4841e59b53b28bb385726e7d3a569bee0fea7fc4;anchor=swh:1:rev:63571fd7545da25142bc1a6371b8f13097cba38e</eref></t> target="https://archive.softwareheritage.org/swh:1:dir:a7151096d91352b439b092ef116d04f38e52e556;origin=https://github.com/fg-inet/python-asyncio-taps;visit=swh:1:snp:4841e59b53b28bb385726e7d3a569bee0fea7fc4;anchor=swh:1:rev:63571fd7545da25142bc1a6371b8f13097cba38e"/></t>
            </li>
          </ul>
        </li>
      </ul>
    </section>
  </back>
    <section anchor="acknowledgements" numbered="false">
      <name>Acknowledgements</name>
      <t>This work has received funding from the European Union's Horizon 2020 research and
innovation programme under grant agreement No. 644334 (NEAT) and No. 815178 (5GENESIS).</t>
<t>This work has been supported by:</t>
<ul>
  <li>Leibniz Prize project funds from the DFG - German
Research Foundation: Gottfried Wilhelm Leibniz-Preis 2011 (FKZ FE 570/4-1).</li>
      <li>the UK Engineering and Physical Sciences
Research Council under grant EP/R04144X/1.</li>
      <li>the Research Council of Norway under its "Toppforsk"
programme through the "OCARINA" project.</li></ul>
      <t>Thanks to <contact fullname="Colin S. Perkins"/>, <contact fullname="Tom Jones"/>, <contact fullname="Karl-Johan Grinnemo"/>, and <contact fullname="Gorry Fairhurst"/> for their contributions to the design of this specification.
Thanks also to <contact fullname="Stuart Cheshire"/>, <contact fullname="Josh Graessley"/>, <contact fullname="David Schinazi"/>, and <contact fullname="Eric Kinnear"/> for their implementation and design efforts, including Happy Eyeballs, that heavily influenced this work.</t>
    </section>

<!--[rfced] We had the following questions/comments related to
     abbreviation use:

a) Please note that we have expanded abbreviations in this document.
Please review and let us know any objections.  Examples include:

Differentiated Services Code Point (DSCP)
Multipath TCP (MPTCP)
Stream Control Transmission Protocol (SCTP)

b) We also introduced these abbreviations where the expansions were
first used because the abbreviations were used later in the document.

TFO
DF
TAPS

c) Please also review the use of TAPS in the running header (this was
removed form the short title of RFC-to-be 9622).  Please let us know
if it should also be changed for this document. Note that it does
appear in the body of this document and we have now expanded it there.
-->

<!--[rfced] Please review any uses of the slash character like the
     following and let us know if "and", "or", or "and/or" would be
     clearer for the reader.

Original:
...which serves to simplify the local send/receive functions and to
filter the traffic for the specified addresses and ports...
-->

<!-- ##markdown-source:
H4sIAAAAAAAAA+S96XIbWZYm+B9P4S39CLILgNZYktFdXQyKUtBCIXFERoZN
Z6clHYCD9BTgjnJ3iEIo1dav0b/mYeZN5knm7PdcX0AqKmsZm7DuLBGAX7/L
uWc/35lMJqMmb1bZUXK23qyydVY0eXGdnBVNVi3TeVYnTZlcVmlRb8qqSS6y
6kMOn47S2azKPhwll8fnF+HRtMnLYrQo50W6hiEXVbpsJnnWLCdNuqknOfxu
8uS70SJtsqPRHP73uqx2R0leLMvRKN9UR0lTbevm6ePHf3j8dJRWWXoUXj66
Lav311W53chrf4W/cbKv8LPR+2wHP1gc8dyLrJm8wNePRnWTFou/pKuygCnt
YO6b/Cj5U1POx0kNw1bZsoZ/7db4jz+PRum2uSmro1GSTOD/JzC5+ig5niY/
VNuibqpyTZ/yAo+LIm19UZW4mdkib8qKPiir66Pkp7RawTwWyS9F/iGr6rzZ
0ZfwXJY1R+HjrKmvU5hw8pS+n8MPj5Jvvn6SfPedDcLflNuiwc27uM0WWUGf
Zes0Xx0lKcxqOtNZ/dP7dDuts3g9l9PkPN2udm4tl+V6vXOf9i/keANHDVs8
n0bzf1tk8tV5Wr1Pfk13bvon201WAVmV4+QkXeXLsiryNPnD14+fPI+XArvQ
ZIvkAugICK9cJsfrrMrnqV9cs8EZ/lOKL5vOadPdut5Nk9Pi+iatFo1b2rss
q7P4C1rMG6DMVf4xWsmTp0+S49Wsyq9vmtY6Xpd18iptSiCXk2Oc/7OnXz5/
vA3/1GQylynQabyC82lymcN0V27+5zf5Kt9skovoO1rCxfF5cnEareBVBt9k
k4sm29xkRV0W8M8q/b//ryz5dvLkmVvPk8dff/1t8kNWrfIiXsirrFqnxc7P
e8Nz+KeGJtCd98/T5Nds9Zuf9s/5/CbNVu5zmnK4ArhFb+tVGU3//G3yQ/kR
Jvfd4+QHmNkCLrOb9ONnT75JwlM25TdldZtGM17j62+zf8qX+XSbl9MCeExR
wsIaeP8R/fJs8mIa2FNazW/6Ps+VGR4BkwJWFQ3x5vT4crJclbeTNdAksCP+
OEmErTL7AlZWNMlL+FnyM/8sgXHoYfl5DZSS1Tg8cLCXZ+fw3eWvb9/9dPbm
VfL08ZNvidvVN+UmKYvk5bbZVhlunzI7x6MPXp5d0iOHMjRztFonpsfG/9Hh
vcTDywsY4v3wj+CEL7fZR+E1SUJcnF5EH1yenE9O3v5y/hpm3NqDB/OmWsH3
eBMX2zmu/jU8XMx3SXMDzPv6JjkBFr7KFuPkxwwWVF5nRVZu6+Tn7arJJ7Rv
8Dz8qrjOahQy+E/gbqsH3e1z8z47PT1Nzt68fHvy9ufk1aqcpauwYxe79aas
8+06OXh1dpjc6v7CX7iq7wa2L+wL7QrcybN6la7tU6b9i3SZ//N2FX3XejK6
MftuTefJn6bJjzkc9U3r0Z+qHDYHhEf0bevhF/BwimIwfvZF+iFfRN+0nns1
TY6rdd6k11nr0VdA3B/yFTD/1g+6W/Xqr1kNp3Td3q0GqC/+0qjru8nj55Mn
X49Go8lkkqQz4BPpHMT65U3Wo5iAIK+bbJ1kRTpbwZ8oJ4ADI8mQKrMFQdDY
U5uqBD2gXNXJcpV9zGerHV1LoA6kBmAu6/W2kMdHoEUki2yZFzisPTpBDrXJ
4H+Kpm8+x2ECyTkQdpWu15GGlRwcnwP5NTdpk+R1MktrECHwYzjGtN4Vc7gg
BVyF8Sj7AK+YLCpgPUVCPAn2AYfdpA2SNFzPGxgAtK8t6mJ4JT7gVHG219t8
keH6c6/l1dv5DXzJWzblDV7ni8UqG40e4gyrEq4rLX5ou5FngtCbEz/69KnL
UD9/dpsmh0NrTVdwq7sHZAcRn5QcCc7aDg0XDDR3fsYDRqtJso9wuVl9jV6B
O0TzWeDONP2rwjHbizEp8Pmz7DT+ioar82scD141yxJkXSD0k3RelXWdrJGD
oWLUR3VIUjWofMjJ9dNkmaW4m/UUN/3LDjTeYRgR7jRtfP8aZR08VrlcglSG
XbwWFkt7twCqW5Wgv4HSM9sChRKRFiWOntXzKt+QKAzTkG0GgZcsQaDjGE36
PoOl7minKtgoFKG4DFDJr/UUcDPrTTYHaS23BTjCnjPAadzAzYDxgAPTrHCY
v5Yz3Ey4PPGM6MM9/AKnua0KGqPK/nkLW1DLQI588NrhnszzmlYJn9yAaILP
4PfAcPL6BphGUWR0aWDL8IDlF3T+sMXI2dKkBBUIXgYk6h+AAYEh2Fi4NCRx
WDTwjHJVXtO1WODWNBFpeMYxQNP3uKlTuvaeoE5sbsnb2V/hXzVzgjDnpOTP
5VLD2HzzFp2bh5y1d16oV01o2udVFkYe00ezbQH8SC4I2RGZvGtB9DfL+OD9
KcEYKCXgsHBH+RSAXGHzQefIaCY8uN3J72UCJ+23pzVcZV4iv7XKkPAzHDpN
UO/DqdGRAiH/DAIMxF+NB5TlMACcNlA8b9QMWFiW8fm8LuegiuC83mXrskHj
ZLEpccI4E/ycfgXiHLnJGOVNCrLxQ5bcpjmdjJ/TIluRSg1c8tYtATlItKN2
VqDnbFcL5FZ2S5gf8m7Xfdvduglz+HtWNjewIWDW4oxvKyAvUBKSvneijb/a
8vannqzKAng9DA/WeUI7QMSdo1ZweyO75X4OhD6HNzZ4NU66C7PToeeMXUR7
71ehO91iFkC6YP/ASTquXaNVx7QEq0O5yMeu93qavNhWeDI4HmwerJT20W4z
XdSDT59wbyb26efPh+P2Im9BmSIeCx8gRVU57BEd1hrscZgG/gmGD9+xHsmC
+laTwmaPE1CoYP0mheDYFjnqVqiM8G/BXJ2/B0FFFi+8BdQK2N3R6C0+mLZO
8waJBHdyK1ecTwOpo9w2PCl/LhWMEMi4Z6uFFMFQRb5ElNYQg9mQeSibqZR4
kyHZ7tobBq/Rl+AKcetmuGg8Mvu9P/d1SqoEaNpoUBB7hl+UYPXnBVzMPgoW
YblOd7C7H8rVh6xvOTBRlG4sjBdZtpngSsa0HiUOuRG3wCBQC3KfyVXLkc0o
t9KT6F4EJyfGQ1w/ds3B7Ddw/0TYICmTUmkbsMgaMJ1r3fg5yqeiRSnT5CVs
d/YxxZH5vTUo8d3bSFuFdLdmig13M0WqvO7ViYxyk4Nsej1FzoeGn5cK8Mnr
C1CG6prehYIUfoKf//LinFkybe1yu1rtJqJTABkM8tzkDJV3/BFqOWnywo2P
f1+cXJ6TeyJd45//xy9nJ/YnEjjYW5eX54+eyoeHUxKRbj/OuwScDpEvSlBv
UsBRlCRIHF8PspYUsbRq9MTaJ0GuUaAg91HMj/JaODAoY7g9OFEmlSXd3bDx
K+RnprqOgTuDoao6KdBPjTchX/Jd48HgsBeP4CplKLiW28LRHWr6+aohJYjo
YAl6H72TlmGHli4WQDSoyJMQB1KpQXn5b+9ennz3+LuvQQ08WAZqBKaEdwzJ
AD6E/zN5DSLJURnSBbCpaF3A0opFfYM6KnHtBfChQ710V2cFiFug36vA+WBl
K71xF9mqe8Y4U6MtcxixDkrXigWYPyc69TUyLLBak4N8SpImVj1Z7aYfwO6t
Uty8dbnQLXdcknRdNzrQG4izfLOFh4wJ7eN1sH4jSOVMOEWdObOutroGNMlE
wSuHt+QVbvQyv95WEbefkQZZg9mB5kBYuHDqmKeyDuwk6oqmhgth64u0wAXb
C/xdnyoLk52cetpnTRZ40iS+Ehs46WzIPGXK3PndVqLtXFD4cEfbls6Q6Eip
eJ8Rz4B/g41R7cz04Z9sgC3BbOFU4sFgnDltHA4ASxNNozv3tpzTi1STflUi
wVRO2RSTlWQ5LiNyeKA+eJuBfErDvY/UaFGFTNX+kKeDF2Kc5Eu1/4BSVnXZ
zyCncIYX8ulzcnAOGoA1u9lpq/uZrVAbzzmdsRKlBAlLXgxsI5i62TwlBwRt
PdxE4nO4E3mx4bMMVqBx43W6GKBhlWZ0/dNNir5s3FTggaSTiQ2+ReuBr6/t
ONnl5K2ZpyCsr7Nq0uw2tA71hc7ZF3o4ZZJua1gNnDlRUR1xCfIjeOHRq7cj
WeBOyF7NBwQJawW9px8LK/ZJ9Cllverhthb7bpEtU1Amkg8pmBG1kxD5oMWL
9+pgjwsB9+vhQ6SdwKEmaHokWVWVVX2Xj1HI6yZFyiCuhDtZbzf462zh/Twf
QK1CDqdiM0vhf+jBIJzU74O6H22jcGqkl1m+ypW1C7OnoacJa+nFwK3P4VqG
BYRDGdQXZWkgsOY3svPoDiG3DZvR5U0+y2V5RkrXKeptsU0dFiSTtl1wO3NQ
Z5m78t9Mn+6/9MpsyYeXq1SVqew8e8LTPWPaWJbIzIl8gbXD4pcwETQ3gjgC
zRemsIcnkI/iWH1DpMLFm44za9vMwRap4Uc10Ss9uduzJy0FO+84oeRA6uQK
XvZzff0OzH+mkN0Ve+mKkr2hcgIoJ8OL8oImEBgMbxLo+mB2bItC6W6PswwN
Idk7mAdeSxqU7830d2wUa73Em+F3YhvRJSHldyzOXb33ZErdgy7vOoRwje7Y
ch0e9rxyu02b3aCbYv+Z0Iat85qu1b6dG12CQf+hzBekf8xZXYMflttq3mal
S1TfQKYVWbZAocquWeCfcGRpIa6h+RBzozuAO5qlFer/IONLsHiAQJgrvivZ
6yZHvilhL3aqMgUJa2x46N4oe5yv0NcJm8e61E2+IXXKj86KXksA5MgPgQwL
mptqKbOcyBRPnoTWHHYaRSSYsxVoT6AUExtoEt05YhJBdSHXks0z9nRyXKFG
gpyvtouMr5Tu+ipfE5U1JXCEJ9MovuPeAMcxzUDg+5d2Nqvp1T+H1Kjp6Ok0
ebEr0jVYStHG2cvoL9yfDegVoNJV5ZqdYEwpZPB/DH/O5QJ5G4UV0cAtNBZm
TBiTZUzE9QQ1xEW2rXD/H8HyPuQYyY3295RvGh3LbbojPdRNrMqaKoejlAVN
5H3xPMlbxMHjtxdq5s9JK8Qo6Lx+tM5SdCqxYlxqvIX/Jb7cmiIfhUS9ZuVH
UWthXJgNbPkz2HLRPNqennjrYR8lrCSnACzm7QX5BwKFsEiiCFG6GrfYcIWB
vJugjEcm3Hpb82XG0Al6/chvhAEWR+FOGUc/LGz8SvyZuNpyDodSJ+TKDb41
nuwq3VHwhzkT675pd25sLnjTrQA+d203Ex6bJmdLDcWFCSAZiM/cLYroc5bh
VWj5svI6MhXVKmGXY0dvRN2arg1+cxUZeafI7K7YzcVcHpmtuAtQ0e6/vskq
Sxd0RUu/qx2jHF1cKhvo7bhxMOwasxhgtt3bI0d7TVFctxeNMn4YAVlcDdO9
AF6zQvYsbjZ/5+kcZRhi60NTkbMYnBGfQmtPv6rV4J4mr9O60Sm0mXNTZ6sl
vVr1c7SM8jo1hQt4F2xd30Zs2aWUfcS35g3de9IZeq0DvDok4OD3rKmZrxjd
8Bj9aosr9cXgb2D5N+WCvAdlSb7f7UZNIv0tud0/pNVOY7fwb+JdG6BivHh4
qzqBRaFTjMGvN7R+fIMMjwIv+4DS2N5iPi6eKYr/ZCFcHXihugkS8oezTHcG
AdIf3mP0uVMWVXArtUQCO/7DF3ikTDlVdp1WCxVA8amrJw6PlL3jEqpEElts
M8mhqIixLdYghvFuYAxYnel7g4jR3Uw+PWzFQky/6ARP2KEeEjOCbyu7BtOD
BXrrcgKliO8QqY6EgOcl6sVqe4NnO3Lx4RuD+6/Pu9VvMKMxjtYQsegoElmp
lrhmn3vLV4MOxuCcYGWo5ZmSjaHYW8SHUeSv4IZzABlVZlb6G2RkNUfXYjc+
Xx9+Jz+7ILlgWnWdNduNsltdMwcn8P0k+UEVUh2MfLxdesK7eYf/eZGzR4Bi
63C+8M7NZIV5ByDMs019lJxY0OpVimvDozlQcUtuP3MZTZ9On3QtSA5vY6Ct
THJ29ovTFMarx23lJfP+MWSjYqVe69thrO/pl2Fm79L5/mn1GLY2Lfgx0xbO
SYN+TjcwF7W4YTn+iIdUBjY4bK+xA2tFQSfx2jetpVU0ffSJdNck4a5aeRx+
ZgHFchOi+0POIVEJb8qyVq6zzCsky43KPpBS8yzk5LRpleeqrDO8R1V1mRlv
z7bekhoJU7i+zsjhCP+saN5kUxaga+q70yX60TFWBzrQWA06dvqRmxIumgT1
+FQ3aYUBAFKKOHRCI2hcHuco7gVkhWRXimwC8bJlbsnOrii3p6m2c/aWsM9H
zoA3lk+HPXaYJqunhv+e2KPk0aIgpcQKQAFmrgfDgkY9b+uwNct+HYBsTX6T
e7/ZUqud+BfX6CmgcE/mVSlakLIojiZroFTvnJ6+hP/OzjW+g5MMN6AlYW9R
LaxFFcODH0ugJxJuYnGYIkIK6wFr5+Hn+q3pIYdMnEYgHG8MMaEotyeVEJ+y
xWDRhaVMkx/LW7RDx0xsyMNInBI18W4mHN+jPI6Qc2SSQeNERuZH6JLAj3pC
lsTnyXuDuZQWJhuzX4JFAb5+5rIA0KMA5+LDa+ZaMNPve/ew3gQbgRin92se
aE4Suthkw9PCqZkcxYTXFNFBmBqk58GMtS7X3k2Ic+CECBFTwfCMjiqWig+c
VfEA7oz4kH55cX5IjtiVzsqnYFHUuslX+W8Zm0XOk+sYcXBJYbRYo9BwQ36F
bcfj78lBQ2n7hYxTpO2HPLtlisvIyYy6RV6Q5AReN/i8vYQ4B986oPfra1QB
m2yPNx/vefgdvhW9LNmmYdYqrpEaDSsQVB/SVb4Qv4yFOk2KjlXMiqNO3ZzH
tTPGxnZwPRvHiofoYnUnJ4DTYOwK/ANdgL67Igl5KGRAz+BZO4skeD0Ofs0n
L3P69evL00PeD3uBXB9OLg3M7MNzY2dyq3kU0VrHoiqFZy1i3/csvNc9GUJx
/oXfBKbTPTB2COynC9EkkbxY+LKrvD4ajf6n/Tc6tnH/1LOpR8nt7e1UjhFL
co6eP3/25+RPluGMdVK7PydJ8icV60d4gH8e/W3yjwMj/unp48dPjhaz746e
Pjs6evJnHlL+8yPTDv/5C0Z+8oen08eoJUZDdsaF3f+9M37+dO+MB0Z22z06
Rv9MIUIV1Zt6O5vAqyoO5LKa3XeJ1Qi9JZOU3d27ONzfyma1y07XuypMkNch
z4het7qGIZqbtURegLuzvLY5KklRqutuTBYZkzxpt+iAquB2h+h1r1YfK9nj
Hl6wqbaFGPY1pYPMQBRQsAoM45Ls2pHcrY4XNQoQ4cvuG3eaovOBddbso7A+
5MFxKjcLRWJW7OnHFAnxyFiICtj9okRhNpLfwDDvWPo7zzodCjpY2CuBK+1Z
KG72Oa0IpNRo48J7x+hLioIhwn7Zyb9TwYc5m1Wess//wimCJ0EDTDmDHDXO
hy2NE2iVVE1kHjMQgmNVXIiTmyjoph/W7Piww2beyMpn18wNgsdevQja8PdM
sSFLOp+zTESnn9Awpyuyv5iSMbz2Das/RVUNbOUlrGahN4917SjjV2XovLzh
AEP39o3FsVCYBBw71wXSCB9Fqlw6EJHGqyRrmII71yVJPakVwBoUyh8vxFak
UacJzZ+mLvFwmroWlVDiEC8vWk0P69BHJH15i/V3puZS7kq2CrERp88s0Ote
zE22tGJq5KDR97HeC+sEtTnIuN7plH3KLZ1oa2YuZaNvIAvQpUH7dfZHyrHy
4czAaXLmFFymc9pv29DgtuxfR+NViFySL5CEcBghmjkopQv6gBVDsiC8beFc
wkNqUs25S5Key1MRhdwOyyk9xF8kSOcmFF2BEHXnnJcon9pTdq3EL8wqLMLe
KEakGo575RjxFOUDiyq9LZwNDJtN1eDmyDRbxg5YbgnpWMESIUeTMtNY00n2
/fe3v7W+/4f/uve/f2j9/G99itIjCgKhrfovHB3+e/Sod97/43+M9o31D3e/
7h9G/XNn/fZvurze36AeC2v7F8+gdRT7DqqzD3fsAE6g//vBL2xb+jTVsC/w
/yKFU3YD/1+fwkhf79+r3z9Xr2FeksuhbjrqHnEDjv6B0JAIB9yTdcZ+pFBe
gRIXriFrj1VZCts4oFihsZHDiI/Q6LMOzzSTBu/otU/3ePDkwTQ5gP81GZ7W
9XbNVz6VaYiKyuqZ4yI+HY/dDN8nS66c9ga/JrX2lAmwHi2pGMDptusZhkk5
ZQOEHTzJfDWF4arpIYthZuK07lR2xTHZQlcp7FolDAqgMTvknqi44BeSJYdj
wq7idqOOYHLC9nRb5P+8xTx7G5GWhNoT1lpzKgnKOHt9SX/yYX1Vh+cq5eGL
ktJThNn7U5nCiaAwhn89feC1D50NHNI6rfLf9ICbrXkJkRAyFlv1kdOR2GEH
9neGuQvkeprtOo66kLJz1q5MkKw2iWWjL6vO0Fsrh/vVo69oBDJDNInZJ9Nx
jkrd9MSYmbjEyiahpPILhVNR3uKasQAKdppzbNGhjeoQ5dbEQuZJ8qceRinp
AKQekkUIrGM69FNiMPY7+iX+to8ZtX8MJzYwKDCfaEgMpfwpYl99v3nqXjsN
rMz/1HOeXyVQ103zSev3rLNE/lZmDD7NnJzuwTwOWnutum8ockING/VfSpHq
VGHieW7rMQfN7F3BCgCVslyTPpEudhKECH7VYe8K8bq89q5IGmJKOCkS5LUN
MCYGNAosgqIU5FULE9luaDXEyDDrmaIJdnfl5om9GE16DGyhybnEKPBoz5Jz
+6X535GghSW1r4EFm3ztAmpktzeYL5bHewWq3vEdu0RxZtwmlkVSiyInwYqx
cp1B+6Dwijx5YiOBwkqfsDT53LhI+2LefYMiR43bVHOT0xqI1yORMqdGqYjH
edhZEweu+32L8W44M+Be7KR97b94dQ8fPkx+YDX+crfJOB8aIwSceoX2JX6M
58baNMW/UIDFlgTp277+wFk5mFGxG7Q7KOuJdoGSWQp+Y/RC8lzARF9kCIwQ
Cm9gtmfLmGbUBwbDNWl1nTmDvmPxSbViT+xEBZb3ZWAJsKUc8qaYKU/JxTw3
y7TRmUhNIWsg5A1X4aTZ5Gx18eN9b45cQf3JTON24hBlAUoSjYQ2seIOPXNv
LowSJ0050UtFRLn1/kCKAWIyBepZlltjM6QpS/UOcfym2oV0KrJIY8u+u//k
IUB+vaA0b0Rucc6CnjChJOKQjwSdarIb6M7HdWG9DTnWTmjWnNGUi/0r7gyu
aD5ODtAhf0g7dQz/0d/fHFKqabWoMRhHP9TtWaZglOcSnA/JkWJ9ci1csH/l
zDW+rK++ePdHewFXuD399runnz+Pk4s/nvxAc8Eywwv/I/NXLoq63EzqD/PZ
5KZpNjU+hvFp8uGIzsvPMXmKJmNOXTTTifRarjh27QbLWvaYowQSuEQqgD1X
fI0i+RF2fpec7rIZHAPO8z9hud6zx19TWda/lHPtU2taykr7F8+icZ4OjPM8
+tWzO5gkkNbkB4JekKyL5EVez0sS4HyM33z7zbPPn8OBSwmMdxC6+0Lx4v2X
Bi/MgiqS8rl6XIH8Cq64XcjrI47b9aBtUtBoYxJVR47zFc0xeQhvjy3lKcOf
IFnooEYW5OiZEe9OG/XQiiPI80MR3pRPYZWuiL2D/JFp1sYW48LCDOGlnGIg
8jJpiRgjWdVr2JSTanVj5mIrtARKTKLoV55sKrrA07/km830L818M11nGZpU
nnp7KTd6vOeho2+ePRlU6J/B/z57Nn3yzePpk++6v4x0EV+pOCczUxAXZAcW
bQnJ4X7xFQaMDBQ/g6V85LIuutlvLW8v/EyyKYIcIiZzBYL8MsMahbTaUUX2
MZ/UlZwQ/94nsFKckygaubJGUdGbSyl6dw2YYcZ+gadOUVbxTmt+JH22KDP2
kWuieaMDBjpSPeONXJJz9HaqjsG3LwrvR15RF1kmq5tTltHlvS5nVALII5CS
2soVJkkTwtEn2Wq1XaUhZ+BD3uwsT8Acp5Hew9kIIecbpyRiKAoHyFUNMBx7
jBxzRTNPauso4/Aml8mNAHNojCtUzaCSIra+U06SY03xCsNR0g6PRPAh5EDQ
nbWKgLYHgSwcyjcjRBUyJoXr8HxRWQ+HcCgJXpQg1oLZCWoUvrpC9ItJU+Ub
LrQxARxOf42VDfOuAt8SXP2egDukW1f+9Vvgl+oRBzFdlchcSVOSdAZ4c503
W4NgCllZQqNoqd+mjD4Y+GhevKcMV8wksAQmi04dd+0xUavrm7Qi98yo/+ZI
EpVYbxZ10zSYwOWpYgP+LworKtaVZA+UBjgBOiGz0TwWxYe8wuCim5uIVmel
/VF+c05iOjMucPDH8zdadqsquyvpa5G/ZQOHCrS9GcEIDRblfkTOTK2aEsZk
vrC3zOFANRGTZM6eEa3vcv6ukhAQJUUIXWMuLSTWVZyFZ+xhX/aQRqFqIRst
NceSG6YjgowQQqsDpaVWMhAgQZg5K4CERg/lmJMA2KeIaUbY5INhbd8XuQff
L9EVrzqlaP7HnQ4bVc7Vjoa9h5lUELL1tfTMMq6UCo4UIGTCrINeQrAib09+
uog/xKWU/AenR1lM3SVY/D3YKQegnRpmDJEqLb7IWUngJ3186rveX+L/ILF+
3D3qY13fHj15/PTZ885jtFuPvCr/BdOiJ3pYaN+vY1bpqYluhOJCKDtEnilC
11UdCqZfB2qqBwMQFWMJj7t0yrkoQ3z9DMEgC+iAXRieUK6l15gG0SRcwq1h
Pf4Pjx8/BpOEFANCS2EBynd8bLbmo6divH379XP7vU93VDlIYu5Lndz4hv1e
7vi3zx7hCh7BfCMVee+Rxs8Mu77jp54+gkU+usMTPvhIpJQXrAFotAA1Lras
CVSI2A8C4965dd8+f+xfyUXIq2ySF2S2TzgveXg7W8/j24d2ceCn/ZvX+vGe
Pev7pd+qGKlKHGiqkIfMIJ9u1aZ34YxrrLdJKb8I7m9TVqT5SvHO/hFuMwnd
ACsk/Ki4MJHEDrDRieoowlYnZsgjYKChGjiGO5mnmG1ABRacou9qWWNrTd01
vGQHM4KSIUeHDaYmUxH91i6tGijisMUn3xJhlMvJW8V0Ap1A/LniuN2i+ELL
GUvKOCPL1GaiKynYDvZ1KgRt5YpkUePrXBhGzBjOryVlGjUN+BkyMDENa0mo
cZkgLOxyTV9EwDsZw/I1SIC3bQ3YbxwHNT+uqWfDqUWrhzDgEl0DQZPRLJag
+YnOabVz4u12ioqBEuqrNOIZuL9UDwqN1Fo2txHdkb0XuI4gL8xneHauZX24
Qa0rQdnvkuUO0wICdTtDpyehFErxpfPTOmeaao54KiRF/GFpvnpYrqniM08t
gicgR8PqFDv7XbimA1pr/kEJ0hsUB88PYz5Gnmzv6vFwfX1sbz+ddvVcKtHu
OP9veTUJejcqDaRjyvyc/OY3oLmhwYeVa4tMNSLaAiIS/X4FVMGFaiGtbuou
mZIQq/pRJoI8QWaBJqfpSbTBgX0SeoXPvEe7FLVeuoB87O7+hbi5982jeVNl
hGMbaEteCYYUXW0KfxARs5uPXH9Ueys5U4QDwsmGbAURvbJS0OGhkb87diGx
L5KqXWS1YZEaeM2XnYqSyrkHWa0pSbHeU+TQyhet8TzIaqs60J8t0ywy9Akt
tSUPCPUBq8WAw87fs6bMaczooSVOSDp705PNOWYeLTDhga+qA4qq8ryoUScv
QjIzRIDQgEMDVDPJhnOhT0mRAc1wW+HU0PQd95TT1VJzH/R/BrVUAYSlvaum
vOb1SRVwX/URuk55KH7v8WKhTj80pMgxFE7tK03VZpa5d1yrO8WB4EEf4A3O
4WlyojWFZLASgETjFGGz9z1OHiWNs3YRPEnk6yTY03C3+2WN3XG0GNFZL36G
VIK+Pb5l592nImC9sCEOrF4LvG/uQuPAPibnvtPaQodZ03Yf3BBc2UKAEzhi
1fbH/pq/zFmdx9QzfB/jEyhyEIegPXYQ6oPjkIuu4o95Xi2cYM6hppLdLrV6
kiU7lF4aqC/k1hTRwPBL0ZL5Fa0n6BfMZPMKSyQoZBwFRJsYrUZJ3KuSYXKu
cE82s6d8S6sMSZ2LlDiiKJqvJlzbromVRHtBe40boPFlU3bA8qfHfRY37ZQs
DeaX6YWOhxraobEh7w3yTqm7rUkhD7lkNRegb+sBmEstpCAXPE2hoepkJ08F
4TwLj9AOrQQZvE2IuPSW52HatTe+u58VtMdduu+ZO5yszk/xLHKx7hnTWUHx
M2xWSQJV3w960zEuSq5S/UFvyaeHfGEmNX/zuWtIaVycAhs3wWCIMi3iYjEV
fyrt5Kd55U8NvU+SsEjZAEH0IwYGwQ6Ej9J6FIplZ7v+4NK+lguj10FlxQT0
iE2ItoYzQtPCuXe7KUPC+y0VFdGuhQUROg/ImVyLClv8Yy94YTenjaUqR/d1
VCxMkZobY/7ES2L3HAI7Imwy2iKDpiQpGG3UD67mL4EYwfLjLyf8JT4gbEU2
ajq6vC1VhBA9YK+CcDRpDObtTkq89woC3ipP4kom2aoMNHBQ5f9z8iC0PDlT
kGdsCQDGxYPkwOqjSM5d2dFfHR5hkK3jGjeIw6jImNKD2EIKtIcCjcuhxp0C
eEVvUamBmjBsjouT/b63G4wG64CCTddHJRGkTanlZVJfUkwE84lEFs8Ht/JE
MUTPGUO0u4FI+Por+RFuZRe/BtVQq5tpQ5OS2UoB2W5tW9GC+girEAwZGcSA
0xtV/fB1v5fop8AD11lEtCQMfWGfOcTb66n1PlIzp/+cvAZyl05Uj860o452
9pLKOlm5ZQujQUllgLLad4R5f1nlm+QyXyNanL69nFEoofOTsNDvu9N4A2d+
n6mQZbtvFlvBaQFWQGhBFL8kSCM6MHn1SUlXsZm8w99ckNzKrYnZeefspcGH
kauvMQ3wTYKSQKlYpPEyPAzcgYqaKERBVNumdfoxX2/XWqa32TY6STnGyUWW
ve/MLl2kjEki6qb0reFyQKZrkg+1V8mUMu4/lynVOqaxQ1f11UTEbwQbYhYV
CQzqjWAZN+2toSM66JWKV7CMC/j5O4Ihf0R/v8vmH8Lf6cf4+/SjfX941GcZ
BD9IKo0k2gHtwaPrF3PCJFKBidNcH/FjaBiDkxm5B9AMhMttvkA1zl1X4gnd
vd/PEC5bq8MJvS/K296NloWI3pI1KZVTovOMyAh+QQGqWm9CsNF+Pj99NXlx
fPHjtKtjqQvC6bv5l1UYH6psbnnIjqyEeKxlwmOhfKnyJQnVSzkCRaU4g12A
1H15lGxjbbbVtVMZZUScnXP1Ni1oaY5NmQj078vN6ibL8n2WbcLobJQHjlLH
uCgwLKfvRsOImzMbKI9mFU5VgXY5tGKoUsVTsVM9oQOTDf+aAUG8x/p1Ss2z
ZEl9a9/NIGBvJClKSbvNcnG3txFq+wx3B4tXZ5ROk/appMaUBU9FchH6oJZD
hXoZOfpFg5RKffcFHjb5vuDN7K35PnhIx84JTsB7wgAVcK/cNliHgF9JJGPN
4gdOD9EYvQ+y0YyUe6iezkrvafK1DTsseQveIy5TajWm0mSsWWTUDlb2c9Ic
lzmQ/gvPZR+p+Pm62wMgGD21pEt5QFfGH+/BQfj0MMAgSMYOwgjBZoaK+aiW
XhC6PNCSOGvvQDjzmnw/NKXob+THpoYLIlnNDPJ3dGyMJrcGaF41K7vCKO1B
c+/HvyUTOGySuQ0DVsFo9AO6uYZbvThYAyouoMANJ8xmi7tB7pPL0mKSTkuz
3cJkvBbI4cHZyemh9ix5/vxrtduEHFrF/xqsB1pFA27Gt5LhABLsMyjIhGwp
sAvVEYJpqa1196BD+w4UChdjlMgbeBoQfCRaamK8BdCm1TXtcdrdzcYahMMx
4pc4+3ygnZ5mOrWem7vTvwyLsXSn1lrIvU40hD4uDEKmCmamlf1orcDXGP0t
tmtSn+u+VP44iCy7pNWiwMI3WDeLSUGM0cuuZ3hn5LiNezYi62f3KDaRwVli
q1oKxzDZ1QIWVCw4MZZTkHhBcIG31fApclkDcn8deCzJta1P6Dfso7T3yCeH
QbljKOIbRSAW7kEpLjmDaoBe8ub4Ej/CmGa64vow1gosZUWhPgNja09bK9pm
VZku8FBghA/pSrJvcBi4Yr1slFu5tHoMfE2OPnijXchDvNg3mU/HFx7HqBCS
EUYwrB/xunc2lmHm2JsG6+eQnUUsMEc4fmQcZc4kDEONP4P9InlEGdhpcnH5
yxtOLRMO8vWz7/6AyiInQWOIYdGdDcszHuHyl3dvdAEyxLfffIPJPJqdSsMc
jnugGugtlo5phbeKuchp9gGT+Q4u4qNGDCjBJZIqZkajV4MkQMiC+Zo74XV6
VWFDGWzsdH2DbC6GHlQuaWazbCltCBmKGOC584iJZ8sIfkvjXXQDDhwO7F6I
MjQh81ynG3fgGWLnygmHpRuzwgE4EwYNbHabnGO/XFLCNxtzDFyyJseEqYIv
7XDWFnqgxF/7uwnBwt/RcKrwtecmcTXHEUDmbStJ0XZ99cgeowkj0PJ2U2uR
K0dRddJjBiywrq5t6gxIzO2ZKCbCiafNH8mezNu1cAsMypNTi4O0eq+1TrFX
FhMaqnMUmMaNkg9vYEw0sHXHWmtH6Iq5S0PZe8QpRQ9xrxzGLA8hwNJywPBi
MlTsjGMh46FVxLNuEAwciGWvnNWDDs4qlO0w4hXXgxIC8Ucf3byLWljYbDLs
hlRO8P9283L33CkEASoW2W8fEN5b08V5e1ADRZohU3cuWdn0AtyklPOe6x44
aWbJ0rmAxcZdWpWkPFNxHr5UkihMsoZHK15/OAjJZMYp2lHgLIFU77xnAgcV
M1HUhRqthuSNSwWHCjPorNxMiVdP8H4ciy+jbTnXoIr+SpsbCm2SUCDJrYQZ
DJSyElaGjTqo5Igw6uOYXWjjTw8F+FiRx1HG7JLrMrU3dZ5RDpXXBlysGRwO
rasHwtgX/JWKEBqCB6HKrweKIEZRacghtcqbZqWOXVI9gSyyW+CGAULaJ7sH
kGTX7IXSqNb5b6HaE6ExYUYNNokBvRiUftF+CfcdPYRA4pRjzhCqCAIvA6iu
sAJFTTPBFFmGbCzp5SVw9ykyvr1AldL/GlcdGv0xAAexN5gSZsEFiDjeh9Dq
Gj5Zw/6t9roNCE1Mq7PIc+gojf1cUcyQJBzLHEIoJz9n0krQEAiAOWUMLDRJ
xHfeEClqfivXK5UZmLQtsqj+tFuB77IOJU2d63hC/W449mWUcyih1DbUcA9I
AyfiXeSY2ZIWGdxfzMO7UHRtTMB7meYrPF8B0vMFGPTvTUW3IveJabCLE+rH
RVvjUw3dYYU8U6BgBv7x5K0EZy2SBiN8uJfo5avdMiJcbQUk1rmLJw0vB/5E
S6UjQG7r5IQpx1HbVkl564u1M+QBVoiR+ihDEWwhmeh1aRl/6oyJgOLIJcBM
XNECMO0ir5FwiDdwgwdGzBbcoNBHlmEXJJ3An+noomdrVNWwrKaQZRXFe7UU
Tzusejj0VOBM9YilwQVs8zXZR+ISMAhuunXoeNR3wR5oEDFLizqmaopIAU2R
Iwa9pW4VMdW2Tg1vlrh7EWcoJhvNAc4boTy05z+CcdclORZmliZeC0QLh0r9
PaasGtl4uzwj+6fDXjcmY8m5UZJtJA2iqtMIWeOHKLJFfnLnvKNjnW3h97rn
ONzYJbD2gEwpBvPC9yIfS8wieAQlZdIe5wpKEuMkraRtIXtIsYp44X9N2fHy
HjGqb/Iq+slBTv28UA071Mld54bmL0E6wfRnqFjcCObZlEzqgBaJUc84Edxe
W1YeY8j/vJWzyc0z2FGg8p9Nhs7JGs3iEZMakUUtBboZ34558cFJr3Vs2pZT
cibOqwcXZ7shKAEDteddJo0AH5lq5XLY0iV1/u71vZFX84CyCZNPn5SGYOBJ
2Iu4iRm6KJynj1UUKoqV2AYFhtQAC+QybpNPt9jXEV7fHmu6b8gYDT2XMKkW
mKyLK3TxLFrgFR73OGo07DAt9K/nT598/qxe0ppauqaa3iazo0vnbNkv8SGj
g0TTgsduW9vsU4WGO1uLi8A+RvHuVVZcN4yukK8zDZZRxzZuoEFbHt9NH/7H
rD+dQB6yCQmGQRIChcnvrRc9DtKVVKnWIVDnkEybdIQVYLbSqjTupbV17j2h
OUDPxAVlw7sWPDVx1Wx/LYT1EmhRXV+3PKs530OhWJpOS1GupXEZWDowOSIh
Yp+xmtRF2L3HfALlaPITuiHoJNnPM5+XW+0lvaZ/Kn1gZzE6Vs4L2qRyv7tN
xdwGLfISURvLOTNG9l22lWXJFk1dZ44xR+XjbDzhJKSNmxQnJyTfcZGS+4kB
+UbojmVnzmMr6jRvvNGa2iwu5TekBmD3v7w/D2dAHeU2QcCmNySvFlKnIkki
nHmuPNMaUsq33CzeD2vVBSEXXUovbP7sanDkQ4hzIXmf9ZKgx58t++KrVSdO
TS1RSjKLo3xep/CJrSudXEOoXrMIpNkY3XHsAwOqo0jqAKCGr0IJRRmF/eoi
WyHbSjzpwXbuBC0JOk/Ncyez6Q2ceaF6P+iy31u7YG7Mzbp4awmdd4gFia8y
HVyGx0yi0ITQ/HJL2Xt2zEnVVLZgQzcqZUldRkNfVy9qmq1VGGQQ++qIvidm
u01aa6ttqT9/6eYjdnYuDkj7FbtAb4ky1hhH1fZl0jQVNH+G47kmKUCFhOIZ
dVkB6DfdbpxhR15+1M2jchK69HzbZPEYsg8gCIjshcoYxYa9gOm0lRs0d4M6
R9wU6a/fB4P02KsILiKCGo7HKpA60klkisvwHzKl9+AYYm8IK+dhWuyG5PZv
RG5hcexTLyxPoR16R/8VwaW5Hm4KjMmYlBJyzvoab7rsjat3mA8hfTY1iC/9
1zXu9m1fZzafAYVsmbdUjCrto8UXj7UaVXAdCkIm9Wfcrs7ZylgYWt6yKXwj
AJhulw/bbZ/7uoVT+QTXBpiGbG2o8kbeLjVBwifgJ/hEwkIGH0VyKUptuhCM
CRqC5K9jcHwark4pGjf5QWoJsRyBx22SXdbI0+PkiXoHHPxoU3qSCjOLRxB9
T5MFVP3TlB6rsyvR/b/NYjh626a+mrZaYFMxPJdiTSz+MDVaxXdabeEmveaA
exlOjQgduy0LWqrDGBpEIo2XP8t6J2bbLailukZP5tLD8B7gBsfF7veD994N
73MHau90Oo0r6mMxuIdlxWxjzMKLaDXtoi4RrHa38W8ff1EDz7rPSIrwdPQm
ux2uzdD4g/aYJI7e0/ZC7BqyjktvI8ZugHgLNHerfyviPhL9tMVX5pZdBg4f
YNqXXc+wc6bcrLCTlgDc+K6ORSQ3QlNODjrRMgQ7SreoBRcQ5cn8lGXUFsFX
nbhAQKfA1KkbfgNK31mRoRFYTfWxCtE3s4/c54Z6+lKSr6YfxulbL4L3ILmw
I+g0hr2Xk2E0equADKbOEQBDV+3GKUoLzOCBtkqc2c7QhyK18Z4shHpeE50X
K9e1M2jXrMN10V8M1wreWgV6GLMVDJfaoU2XM26kDrSEVaK5pLnPV2yEKdL8
A5vVgxAkpljB5JZKVNUgRiomCjbav98yvB1Ph60/lFn/8uK8N63YkJ41X5e9
TrSTftL41brkmvsoEydljC/OBSHXn2WT1dJMkUsD5+8JfidiFZxBvuTC6OTT
p3gNE21/Kv37WKex5r9JaurUnJUhdXPjC39GlRUTTHijGFWsCUmtDdmB7Y6P
o5D4J+zO5C7eyOttCtTSEOCDpgi3Q6rqlBW07oUmLkiXO0Y1SFCxB81ppKHH
r+pOsrywgIwzAK4C13vHHy5UsWOrLLdfe7gD2Yaw77dxAgWqWu06dCJ/87D4
5ops61u3GU4AI1Oi2KJTLRBry5yxVFiqd0awItwMuko9Cdpii4dakbTp4QGq
KJBUwXfGLULzwK5JrxcsRrJjVQLiRKJOlcbgBd6NdfsZsOVl3nDROF5tTkdl
s6Yswo2OZ4Ad2eqb4GzCpIam3FhrHLIel5ar1BeVGrPZudhSucq2WpD5E0nb
nnxa6SCr92pQojtQC2akKWa2gnm1wFCAy4S7oYpl5McSQAr49fEWRpvePVmy
Hpk863lWYCN3jzEXb1+w+v55m8/fr6QPML7QG3OhKxah+6IsTKTbb+0RE9ij
3+Rzwul0PcsXArVXCmim+1VmuT6XGvEkHlrXWzI8cS7Wu038CPuqN4iHkIyn
ZITYPlOidOrNPbZZYgYhMu5AZHBGXitY+G7CQFrTbIrVjJmLNztwvSQq/MA3
RLCIbPiJdRa6XLtCF+DP3B6OtUKtPG/BfThhOtwr20K69C0Q1lWkmpxWVVld
9RjDGNXt/y3vufe1Av3r2Swin8rwtOCGL8iEFAAfl8bG0f6MXSA2AYNwxsyq
bBHpf58emh41WW8/gh71s/6SJRhDGfpihritAvVeWzE4dZ+n1Zqt9fSL0ORC
PzksEg7lOiQ1HW2+wi5fHH+KAC269oZzSJzAiCa5DxVQ++buuVueNU1w4grB
Bk7oIjRZX6cbTuBzsxe67ayHYXMDBBSXTGru4bwtOsnVzD+qFToiRw7eUL8O
qxdyT456YHIWaCuEuNutvpeQxdQf5M0tGFHyiQ2Q47CvFx4e2ihq/Mh6xs5X
Y3KMhV4Yzy11P848CaeETxjZpvUIKza2da2huPsFJKU1umYQMF1iBqKG6Ecz
rgF7ED34AJ5gxeaA1FuWHRf/J8G+woX7ES7iKi4aibRivG39yiaqmnlUoaXO
24RT3/g8I62B4NCYpbfbH3MOZCsFV52s1rwi3nWV0S4GPR5eSAjp3NKpcBtT
IEEu/ZS+NjZFCSbWjAay1CmWCu6dzkCKNTv+yl0P0629IwEU4Rmod8Rl+yWe
2RY8zZ78u1nmrXWqOyrZst/Pe8lxIgBBWuJqERV1oYqTKCQuaQ4jG9PkxAbG
vUY/mauxoy0Rnb9C1sGAMSrBYkj+OFOrZXyV3NMI3yn5Jppg6VtdZVQlIjk5
DSeupzUVeZVEais+uBXuWbkcoMS8w0rDPGJcAIMXSM1AeFmlmPp08OmT3KzJ
kj5BcERSOcsN08TAUq0zDnoSW/WKnQaS2pCIFGdOQMFNMuNXDBlO+HBpKm4J
kxWc6KrPcpbIcZBF8RKZQVhKB9U1UCki5kF+eriif3++V0ssfk4cztf4R+WK
vbSAqAw2B0EuioxbSmo5/rSdWX6GGtxgoQZ5gUOL1WF1U5mWVTzhRWKFER/q
rU4W9qF5xCHDqRNMLisB/KGYkqVqSH+AGEGOZ6n7nJSzv1LlnGp1vHf9W4R0
4/I+O6FznYdBIRacqF2qHep7NxtEeQtyLhTTyi0n70Bd7tncdVnkTUC5ZgYk
VS2Sjx2w1HiJofVytBuSlZgSBoebVBqlaYqy1GoZ27e7kSPRp1eoA5VUOWKq
uONM8eIDyTjHch+F8FGHGQRBWUZSzsa1ZIvOTqpSlzd7CcTwZoktUAJkwQAJ
Xn+2SinzgQcg2aL9DWybuD4HOAGOdmJOBhVb9WgUPuzKYFRCyLHx+mKCdDRh
i5ZLODggD8roxueChOvfVxjrKjQOsIxwQh0bD3VD81CpGinLDdELpyeg9ksZ
JE6Y8/bWTFKSyYhqp25rZGmKA02jUNE5yQE5mzb2MOlBcrU2Jhz19XG890mo
0Okex7BehDoRvh7+7wQ0m8zdDeF1voKWrsY6w6ub1+vAUzpHDs+ixCMtq29n
h5IGu7JAXaMxCn5rNQQOEG6qmMGWiScyLwk0wsg+dKuX9gqqT+4UxeukUQkK
FQgUp7JBukdqRXI0Int74iUpEO2QxqAqoqhi/ZQjwLrcu4hr8/dSys/OgHVk
ch6r83rka29hI14Cm3ICk4LjMluBN1HlcREFyGrfBWJJsuAWcQEn/icHOibr
bRrosnMIvz3EdgbO+ksrBKhcSVP2ngec070/FYDCYy2fLycRtDYbRQbav6qV
hlBjBzvBQxHjJmNBaxAqoYNj65QuLBiAXE75+AtQ+zgPhMDqMEw0NxZJ6XX6
mGlxHO1IZyhO5ypPUX28rsgIj7qj9AR3ipQKUPD6Zyn5+QlroEKvr96TA8c8
DqXXlb6fzNN5WcG+b8qC8/lNS9J5iHugZURK4dRs12QTpYoDJzsOxyHQswBZ
VWTaNTBGuLO1SHUmVTiyxBbSIcgQ9tBxsRidfLSO3DkL2uvhQZHmnQcEp81d
lv2YLGQs2iIJkqA8NhmlTrZLHGFoy+arJS3FaTNYij94W9EiQWKwPeNE2Qlc
kq1TRCKIX2e/L6jpFCnpnM+KzRSeTJ8cchxSlAzdnzr/TV1lIicwBCDopt0D
jzcXSVdnG2YyRDVkaWmuhbbgwb0Rx7a0WZXQRHSAA+YeyZfuvtoxwYNrMJ4x
IhPE4Tx0fOWzpuwzQ/8QuxCvLPkl1ujgIUW8WFgoVjI10CRv2kYnQe+6KiKL
TYn4cayMMaYSyVcascVeYecvSVmFH+njTjWVCfvHZdYngppjE59aSFGK5oNn
Qi3X8xiRaScdARgJ0ECq5GbDxtXW2Vq75qW0kaMM5CJysW53kDqavh+fmn0K
YXNTwGWc5WokDBwpRQ8LWIOrBQP40/2gKq6xu5rkUoMzeoBG+O7BeJQXdblM
K/G17AyZ6resKsN1Hzz7AGcHgsm161Tsrp7t5ywJAR3fVJnzGMeeIbbSVWjo
GlhUcF1RH2hNr7ToQuM05UbcB4GTCtKa80S1JsQt3vPacIh7RrEqg66Eoju+
CKchrnvvQ2VDUUVj1PFekYSlGrKc0TnZ/Q6jFpHGSsMSrpPMuc2TSL/f5quG
FUwnmcJPNOtBtPSea/fp4bq+noSkEqnbxUxDacyDAIeYJuExsjjiGO4zKR6Z
46LKEUOSk9mP7CgMHmfCM4UJTpIrmMprsJjQgr86YhHXP8BsR/XbVpJtvFv7
Af/zNuMw36ZFhi7mrK/yFTSoxg0/G/Cx+5ybsdWQCPoMGJCYCchbhsZZUPda
DlUGMLjFnnjWNpFS8wSHlO+stFY3lUZdZyKQDTkEK0C3ZOKwpzjIF1RR2i3B
6kiO2t7mjW1pXvlBp23Inbv3Q9yoNHYmLEo4LZrabnCtg5awvzxBrEkeIFhv
v8bgzqUQMCXGIYQ0O8SBfWUFJT4IatSzx8+wzEjFCEd+ihItZT5yo4G+s2fv
YHCNtM6x2/zyhuEGPnANfNol1xof/KqONyE6fNUt8uuirMia4vtyzg1sdnpf
XPtJ4rCyA3GrmzAD7mtLmoqu1LVT7t66/X59upYTQ/JzKsuXXQVSgmCwa2an
1jJHlrBLbhSYoKUq6o7rWlGvCEtrE223GmOpXbraWYZ0MIFV++7kNiny3pi9
2P2BndlbLjKGI5PsE84MX4JJo2hZwB5RYEiadYjdsyrBWzxBpZgSJ5ZdpVl3
wvICKAoiJ+OCt3fRbu/z96HNOl2CLvUu24DqiA+3V9tU2wAN5iOIRps+9Ib1
H84iNC9P4oqCZTsoJVqlK1X7JJOJtoelpDeDWGwH8+wF5JnGwghgJpQsAgzq
JeKvvwWZgNV1dTlu73jwSDXkNkNkkxoTN1gXcArEOHJwHdxaQQHbZpgtYyE7
J8tRBSflvNwccrMTYuVW2YwyOL5yqBtf0Dkk4SDk8HtZttzjnK4N5gnzDa3o
YTd/+UDWGhK/ZlnH4I19hUAYhBB6f2rAm5dVrEYRYXJ5xc5SpDzfirICqLmT
RO7mqxL36MDnhrRI3zzaN+lqOaEHPCCWqlKHjDZgG83ZiZwebaSLgTR4nayV
Jy9kRxYoKseUzGI84QTb4dTb9eusaO9NzTwT18xGhTQMQ/zSq5fbFeaVYH7J
dXbFOK6ZMH/CEdmu/TFFIp9phEICZF1bRFTmosWslK5ATtjXYIIfDiUKdnlH
axx6SaoK8z2E2ztpAwE7Iu3bt6EzIz8ZgOM7/EPhKKWZxC5kv6OeRwMKyyUA
iCWY49p3Qn9K7TvpDKwnk5B1r+lu2VDmiDDt1cZuTUO2Mgxnaazd/RyY33jg
lb0vNHprIdm3dpiLe6XYOwUCrikwj3RWib+da6fj6u9zPZZetPwAUmcC+UU7
iZcoPAT7BUTPsME7CgkF6pRwX1wAn5Y7Qvs6cjaKOLYPilKxJPARrCknd53U
4hu6NI6AuuK333z97efPnEzzPYuRUetdLkOQ6lw5RSAGh1H3pDmh9ChHPX7O
mvvGohB6cXJyHvmZ6QCL8iXcd1Nc4PQupD88bZzkakp4c0KSA+3H8MQ0MLDs
I1aYB8gKmc3/87/+d2jOo/j6WoCpgOKyp+hv45aBV6iHY/7lpSPQn+vrn9OP
yNn6aOVQlHzljmE/6ixM2Ar9mY5JQwyhqyLJiJtqnNUyNIJAr7YFB0q57702
BUye8/V5URZfNYnuKoKaR82smoCbUxYTihfDGNGWYv6FYBg859o7OqiLLDon
mqDgT3sOSLyxjm8y7qrox/8Ox+JIBB68VonDVjmO3LP9fVRoUxc6jE7V4WH2
k+l/qAN9KH4tq4stC0EH944se4uVERyweZomV/B0A1L66pTdDVdIxlemDUhq
66FHqTFLrTLTtmP7C6DOgD+O7oqrhhRzRpDA0AGCZcCSx+2cbz3Vjvd4m6GS
dwo0HOBpZIcxzgDHj9Qn33JhSQlMXkvRi/ri7XrgKiyVX8g/r1tOkZD/skBE
UXFiOBWbK7fJ/K7NFUqugDquIOqdiL3fEqJQStH2xR6Z/Tsfn1IETXm3k+WA
HbnKzeOjOVRPl+DNYe6dVsK6rpjiif3ehLBD4tStCt0XcRlgqVi3XI06I1Ej
BJaQQNffKR7zbUXNROgaozccFTHyJHrc1KygU1h4L70k0XqvYwumMjXA/RqY
B4I1hMSNUaeT+L5c5MOoiiCXrJ12Vp5mUhM14/uALdPl1qzpuh0dMUM8t2aT
rF309D1YUEMQuUfUWZ7j3rahoeKA3x5XGhC4rTqog1Ne6o3duY+9I/tfxxmf
UUdp047mmaKsWY6QNwDJY4WXB/Nb0ioPZTY6OWoqCtoXIg0WUsKG/qVuJxOK
RjmIUQSZA1lyJXVZVpgmnkQOlgRg25Z3G0e7yVabe15OAkK8oQQseJgjUKW5
LbgdLLoX7mpDSWb/bSousFBn1g4z7ssvdJgghKJJAWPdzwNlw2PxaJEIoTDI
IVc1pYYaItPXYkFz3uDNK3ozhti/6CoaOnPEfDc0iMgdm3Dj4aCvYj2Tlg0R
IjfaR6vchRUlIRadiK72+PdQKwc2Kwy2atZ6IMN+8qKCFFx+VfJtXFJZ09Iy
Y/nkZ2q77pRZq7nOBcCsyUmbZQvrhvtuO4yR7Q4tNIS0gbxZgcmciqfFbXqE
qWs01bkJGu+nWiJLWr2z3CdQ9a6jt+jMUWyIw53D3ksuaSLdUZI8JTlpYQAb
oc4gVGtyHaPtr3mE4noCyTXhAH9aNxNQdL075NND/BQ//Ixyi0t2wtfsKNEw
JTdIbNNTC86HXieVW62Uv6huYBxlIZqjUWDQvn3+5BlaoJycmDyZPjN8tOff
cLsmRQUVhFDfNzKtbc7/PavKybvLy+TgMf6fwxYySeqqzKVbLYecMPMFy6Sx
nIGA3xl6t31pDShH3Kp39f7oqs6CUMzwZo3i0hgCkq5DbmJNOVy0FLtSrl4J
I+HvmgasnKu+dqul+r+zeZRglRX9wt1nGiorMLSXaBqaVWXlzr8Cs/JqAMX5
pc1SaQkj0SDj6D1eFRLXoqWqdx3tPCeSXg2lS+DrJFVk7CcqXjd25qKZsmwJ
HivN0fSCWianChN+RfTmXEzjoANbS1D/vSXeIWkpKFswNSzvzefKFcBa0gUH
z2wwMmK1EE2hPkPK29h5X1xhJdkxOMOSnGqgCHB4jDat0WQ4Uf4Nfna1I1cd
f0zuakTzY9d6ZVs/Nk2OHBWSjomgCgKN1sb6Mmc5Urs//fsEVIXTUscvFP6b
nRW70Tx9hxnO3RW9+tZjHUlWh4emQTJQq8SJSukwKt5I3G2ecQx7lryJ/GsB
7y5k3JCU1ALTXvKnpAMUUDvnXa3ZB86pcW2jkxR/Dm2zeWqxGz5Tk7tWl0c1
8DhtDzhCEr3F2Oz20U5jYsh77ewaFLmo9rg1uRvG5SGjWbtF1VsFmSAJKZyN
dmBiqe4h5N0mnryW2qKA3rad1SjFi8bLvzM6XFJJDB57OYAbQG5Jt4oIEIvz
fPmEHMwKPUMQJm1R6AEdOhelKyWJ2/QLVY26214CQa83JakQIdtd1Wl2bUQq
dCxU56G+JjlZYWOd5EdgRyVvNOEb1J376FfDsiYT1/+eYFdnt7i2lLKRyZZm
XFDO+R/SAeZl+Z7S2ByMqNdXccJwYuhcZoxd1+dqgYUrOfBZSn/PJjANZLHv
s12dHJxf/FQfDgLkYn7PbcoQfTW2DUE2SajwFeZOV1RrYNKWguTvM/yGC2IC
urVBxlqtj4PVlLpXbhQlVfljd8t5YfgozDbqc6hRz7KFKacw09yComYRJEAJ
VcbZ7xqR1X0LXbkZhZPKy5lY63avo+8Yc+2/mfrF4bA2Og5JGReF5veE0iXJ
YzESiJK+kEuHy6eVd6HuL8g1Hph2kTPrOk/T+mPZhlDHu84NHFNuBqU7oioA
/6h2CJF/GF63Mq3pFiy3bp54bH5RblmrHtHSWO03SGLLbeGz1BnJcyQtxEjY
W+5kHSAb3fx1UBN7WFBrrmIXUSN912H+dmoo7RwJh5P+ijxFsauQ9FW2RHsi
310JPuqif/YwjoSZNreMBxME+fWeWH2L8prQq7G110dMAuK44xnsaRAf4o+o
kBNSc7DmWEK0D5M1VBehm46OdWdpr4o5vGS7opBFJcSGHItLlyy/YLTIoh/C
n4QdIyVOopzB20JGAoVw9cWcNA331GEC+RwNzbOgAqum7KOlkN0fyMdzcjTl
MkyZNStaN0OLhA+nWo++lnaxmkrOFrVlarHS29rLsfqcRpttxQaY6DI9pHB8
fqYpyXifKIVwGdui9ahlm9KVxLiLwF4tpbUzGKnoRNPpwE4yk8ejHUma8CLo
C8Gt8FXd8fRRe2cnh19fjPK643DPSc/TbhGc0mo++55LRKulzNjQomwesECI
87MDj3dOU3gDCAM6Jjgr9ufSAS0pGS9TyoimqmiOJN+WCQoMxNTO6iOM7P1I
idsTtFBzLKVBM7LiRkNp4zJ8NLBxudtkk9dc8/BHihofXL7+4yH617bYViXD
QV9olcNE/dw9I2rpA9bPUQer9vSFvjw7uoc5MR4xvuxgB1j2f8y3dQOiq//m
MxXhG0cdn6WUgXPuyibPGMKgBpUI1QzxQmhrG4WGx6xouAGquWJWMiM5Lxn6
onNpUk9x7P95MfDjEfCmNvf3TfHCYlhDMWuJFe+aY3X1iMNXy5b8UDxr5bZo
6qDFkIfnlZ0h6zIeiAQ6kksn6LQiHeWyBAElR6Gkzf1OgsltLqCR4DE86J3j
g1bxyl1k0yPDOsZJU2erJc++tcM0LatT4uoR5Ey2SJdmSzECX+jW428SN6Md
hgzstqaz4BBcVWvesEpnzO+yhbm7pUMQUZ5QVW3lV0qt6mAG0aIoaAVOJ9fS
5oiRjTzbNiqLkk+e3AHsK5O620VgpmtkcFpJ/oh3jRGtVQUD+VZwSUHr7Kgr
za6Y31Rlkf/G3kUedzQPPaFnGei+ednOEK+ldTXRirzKbhhWAAR5e16R10Xf
CnO7QOfEeVrXEj47xBZU+ZJvFBvJVKrAFqwIl1HNwW9Go2VIhDB9hyYdsA4X
Ju5cHUxLZVVAw8ij3osCwx1UuI852xTCmYVo+XJSkgCzmH5yFQi9btUnm6BW
XuuQg1MCqxt66W1n+jZYU1YFwY9PicD6J6SGSBOnW4aiX+wiidjRyvxGrnRE
e8C552JgFgeOybm9wJYCNiscON5xmpj3cyA8r/wpdDP5Ryab/xJMq3/s+0m5
iX5BOL9ywC3613yXmhI5cGzJ1xgPn97oRphv29uIjye3FSddBhgV8061NilE
2UYSrwzocxoA4HKd/nCaj3lqbEo9JkjjneaC7fajjANeR5tubs1+OmG3l0dE
rrMGyKKMgFmlyMNi53Al2vKEBV8TWPVShljZVRV3uOCJ9hHE9Gd4nQfihIEO
XGIdn7y7RLf3IYJyczcNJAM0gKcvrRgpT1iU00rAa2GncM+4qSR3wHINgBCO
rQ44ohSeD1yF8wvimOu+6xx2X7aa0oU4TLj48s3luXV395gdaNz5ZNlHqmgS
bguKuWNuSgNLp9QyoxOOrvbgSRNbSPNV5Pa2zLS+OWM7hvD8QeSCwYeUJNjr
NHy8iyxrNxc1cKsItjHZgrTMG44UyHq4HQDv7qDJQ5rCzGAq28zBmAbGhqRs
S3GapoIHU2mWhELmB7hDF2ttDUzKJL50mrzFp27zeuBHggTtfVNhNzRa1LpK
9GALfiTiq3BqP0iEuqP9Meh9V0eRZcf0Iq1mUAkfpYuFt0BV0au0CWYT+Ztj
3tryJlCBAVpGC3bDGiApOZdGlDB2cXn87hK/5MqzZ08ff/v5M3VhFBWmJ4PO
Wsykzr/NCbJCyHSGsuSj/5q8yW4j0j44bJF6pFJFlO5G0kva3lOOrfDFs4Ko
61J7WG+CXkadQaVCUXu/rUJbWs/4e9Cyg4lLoUXdOHINr1mdzqRXqUAP+pbP
0lBFSqE+eocLH8Tbk5/0FJ784el33LCdirBP3r55c3pyKV9++/TZY4yqt2qx
h12Fno0C58K+qSOvU4a0Jp+thV0oEOaZQ+wN9XKIuLCmNbhsLwL/yBZklXT5
WVtLPpADlaRV9Cq0vYI46KeHONmJmJE9Ltooz5ekjUtPdYwAh9HgrSX4X8aJ
VApQgcOM0hUwPxfJ9jHygZYnf5g+vbPlCS46Gfgv2rHBX/F/f7vj+z9izwVM
6JVB/4u/V67qftyqpB9jCtPbpTwlKucv2F4wUApXYLBiMeBckHbjGzS9JKw3
cp3XUNCGtq5tLzrhDwmN4jYzdzF1aiYAj12urd4CaWvNnb05UdWSvajbYICT
uSy167FiHaXU7HigkZc3VRutzTUwTEKiImVKO2CQx0QZkMbpMBqeU2OonnsC
sz0YOCu5MpdlpEKEMmcJSsQOTOD/PCfX/M9tHEclcA2C9nAr0HmUrkTa7lVM
SaZTsnGHYhXHMI9xhEXX+9JRlKchJwTnCtrk+zgYLzg0GNqDVxV9Q8u0VYzr
zo/8An2G6TCnkTU7ZuMzYdjASEMil2bO9Tn8u6Q5knz7eo+uZpwLmZT6f0JY
TichDpYBxlVLy3bspEiYsHZtgy2il7bD5Nr5dUN87tm9+FzHoKVst0zbDCBJ
d83bPbxmeOdYvnF/cVLcXTCG2PxIt1NcaBriDOGi+baqabuEjJX5bIsAPROG
8xag5CfWHpy0lVmSN8HbxbB9dqp5m8ZUKTYKwKBQSw1mYiQo+l4uco7fx2yE
8zfPCtVo2N0/1mRO/vPwDqlyD8FDsif68+De4kYZ3N5ztvhYuviQqpGvuaVy
iqU0c77BCBmfuDoUfPNoxPlIK/kuTjDTr5Qvjkp9lSaIBlxYegES/aVLmLb7
300yvouSJWqrCx3pmI4vNtLcCA1wrTgLr65YoxXisw2zZB1X0BkK2kjquv7Z
e3e4l+qO+edyv0/ohxERroTI4sde8LyPi8WdA7SJZyVEHBNR7/B7x4kotIci
Q9rY1ZfM/cr7vfpdcJT4VhG2MSdRu8L+QEMUUAwOlh2ZyyaJtOBBj7Lrc1Mw
hhGMSqAMVDQX9H3VTNgVrayv66kzUlJm6xB0afrTL1VP6PJ8kYLCZa2kpoyU
KEl4daWLqSoqEpMr4oxXKgZ7stpHUn7XnZGHw7KW5sqLpReytPW5FQDK1Wp0
1U8YJnOH3+E0JB7pLmIbGHNWLnw7zSAAR+GNY3PPsI5sRlKSxoU6cVKNM7B+
Tgv4OffffMswQLET3+WFDabpO2Qnnx6A55FL7+ywSjf8bCceCzJkKyVPZHDd
6lEqjjj2j5upbtYk+dhUobJOkdWaq6bKZdTtoxaNTDCge9+YGOZFqNbntHEu
SsWjvpZ/l60ISEqVLFE/8uHoG0a2RpLT0Xm39ER3jYMkN0G7MeAdCb4JF+6g
gOuJY6EDJ9ifBlw36hoOsxrlBX3ORReULNCeAM/TBaFavijXpc905/glrjKU
CCTvT4cMHd61mMFX1woar3V4L7kXOfLDkhVUyoLC6sufz+n/IATUOEIIRnCK
7xNO11Mt0drYTeJOGvBGjtvzoW/U6mHTd0JJvlxqAFybnHzYL0ak9CoD1uDK
9TFnIG+oe5fPiFyU8+2aade36gqlkx6k0Lu+fqkxP4XrKoWwqMCJLqn2sLsH
ZVCipCnF2401keguQbO7sWNsGTeLcRdMPIFKyT044pYX1E4FagM9uIYNCm82
ypsAdOjQ0zVDa+cJb9fJNA2TiFWs0BmY9oNHYmcFpvcEP4WvkviiqxcA9G0/
CT6m7it/M0aLEIr9rJPvJGc455Q54nzFezmggGhSA+k+Z4yGtMW3fVeh4U1a
u9IwyQLHLPh0RdQerFr88HhFdm2Aq2vjo40E505rSaihnABuWU85fEA+C7tJ
EP/qes4Ktuowww/W6eaDgVXpedVaykiWwZMSdC18oSSbh0F4V8jpK5WH7V2J
zUxMYZhcVyllMkSNMyXOygW998LHU5Thfaxiqp3kWX6i1NeYGUsuE3fhqnQK
ezo0WQl3Qeqiqp9J5352ZKa4j9DtInwv4CCLc4MgeCgqd40dtag3ZbdqUoF6
GCM1M0BkifyJfzzSdSjDiB8U2BWuTRakcQrgd5ibqRktGSetyURyewRi24UR
zUXcTqhCkf9TzUH4cN131eH69GgygrscuEaLO7R24uzk5/NEX0+5YmS61lK4
berRw4fJeVliRYjbqE8PN/SZhzX/zADXsfbnsmMprKUgc2bX+ODFffkj5m6E
GoRgC5GgFQBlr4QxR9duaXf0FaMkXOP+Dnmv1WYsekSzx7U7IKcMUq80NvaF
9uos4iR9zTSm98zBIkohE+OG6wejZmSYHCxKPR9uwY0/qFNwzx5xlo154RXT
HGeeJg86BPAglHfmBXOklMWSG5Pap9U6pnYnCvMA1XFG7A23tFEYQocuP1ak
xjY1a6oJZdx6wP4I1wlRw9sTr132Ccb1DAOjvzvdPfLjo8Rjn0xrC4dfljuT
eI8kuKIgziQ4NCVeE8p6r4k+WEuYkgVW3Ql4YL3L0LylnBtk0m/qdkg5rO5s
qjKFYbkhpKeo/FpB61JGJtEWEyietKZUb4CkvVEe3CrYeiRuSYysSw/f4S6l
u1etSutzHO6E++lYNpVrspOUc/RxjQWV0c727FzrhaTjQkBske48VGEt/U70
K21m23Lg3n0zuwE0MYQ68ClnWvyo3TZpNhrdDOviZDWYWLXdhKP6kKv0pN9y
tzASkR/amXDOreOzhdhWCVzQQ3yqCkxN1Kpw+pyZkG5cWO6WK7BcjebYwL5L
oOC7SgzC2DE8UGr+tDAVv/jvJXvrryiv0wA2uCnhKtPWhOe2HDcWB/2VfdFb
xB3QEa9esE63uGpNE3U9lLSkF/Q0dhChpxh7/Xs57ieHCJ66pbw4smAVJkaJ
gx/PqfUsesGtR42oZq7UjzwDNJaS+bYwQicClMweKjIRI3/L+GHSplc74WBf
FKyilqwNHZKIHQsqK857d+M79xjWNwjMh8tC68Guo557lB4nyECKDXZp9Skh
JLRyUyZzu5xhwcwiI6KbJqch5ZoKT47wYpyi/lNkuCK8traIbbFZba+vpYiZ
Zq0fzLiR9fdk8OPYIPIFkuvXfPIy1zQsxp1OcdcrkZmoaaO13KAqyukcaQNq
I4EcGeeiB2B3tYO3PvI951bL96XJqypd5GX81ioX/PsGjYlEI9rw9xbIY2VX
QhaA3mcJWVbZX0syujWHNvSxwzTZwFU5Mxh0ZJSovb1akUhCVwnMClgTlW1r
B8rNSEWabZP2sEkBiNcC0tQIbIebQNzd84cvtLcpWnd9jSviIBODtXrlIdf2
EHYJQme0lvYvpFVHDDb2oPdw2n/B9MkNmkuru14pk85Kgt0IDgDj3Twh5gUe
ZSAkjd2DbaphHn52Tpy4FwgQVQFazTpdZL2FzsexpU43z1zR2liJM/RLjb1r
KTDdNxOGtLWERoBKc4jgUgLoMmbs5uQd844qBu8MLuj7EDpE1Kp5o4X3egSS
oY+SEXNtyWEST9LttiROopVAUPOKE9ALfNrZ0r0ydaSu+KLrI5JkMM5Dxs5u
WOzgAEVxfg5glqZlDVpg2YwjZ3nSZtiQ1EV7P2+rpGbussey7TG4vzDm47wS
KBAYk5AZmayZZ5Yht0XJQbu4F0W55eiG/0b8XnIsrNG0stZVn2wFE4D5SVam
Y4VoxO5b/+/mFR3UXts0VgPoe/uOCboIPQVdU0h12GpHh8Hul2BfX1+LX97x
csGLoVeQ9tOqtU/7/AWfevwFn7/E3sdk2MhIj2+8rAbfQj3rhjhY4LSiJFId
UK8Z7pclxTL3VaDuArMSB4ash/wDfm30NjUFGc/VztnJKjeCrj3edSmdYXO7
rxsc+xqoC2l2vZOwCEqRQQqOJqEIO1yhZdqBlmrFinuAWN0bjLwUfxs6V4lb
cEXCFeLZ5wxBoK2y4loF7oB5dTwrMdG779f2kggUddypC+FgAQVm8kZVkpYD
Tao4uJf3qhQginRG4jx1/nfCEWoYWF0wfLTslFGAaiXNgSbNeNbJ9TaF7Wsy
sHvFf0FAFoq5X9zl1GqpGs6LZY3TqGH8XYQbwCKkJRBmXPmO9Y1WUaTJS6rz
kNTe7YYMVT1M8eNaWgvt46dPb06PLycoLCfS8I9qEh8mJ6j7U71ek2Hy/q4k
7bfjxvoKk7K5+864R6Ps1noK+A6XwZAwzDGwubNmJfjeEX9tqIyadbrcYoH1
cL3eYitq9IStEE6GlSw/sG9ZCxPv6zL9UJIZJI1+i0XbogxNrAnmKlc0yRqz
92WHeKZScttupBSEvLkprYyUNHofJB5E2dVIu6H685slt6ol4RVxXJFKKNqK
UDhVd3oWGfBOVA12O47D73PFDHN3/qObsm6wUVpfk+wDRAPiiw7379CpNS6B
GI1rzFYAoxTUxbl4lYmFkT2MNqoAvzR54KpBBRiRQridoSnpAKzYk26OQiEp
tGklNuqjnasVR4FQN5xgCEIeYC4kW4C2mexhrkWntnda+d4wjjcCBKHuSmVh
DBFMei2xyRFfFelVdUeTa44vEBxM0FBKBZ2UPvS56NPUwLZFICOzvtFc4y83
8b6oWY7gBSihXry5aEXt8DG8UAjIu3BoQAch4I22G4K65dkHTRs9JoI6hv8Q
fhmDU4fjDh2mFCNHYN7XaDscXF6+PsTyQd/IWq6+ERvNZMvSu5uRldaWn4Mr
kWlX3MtlimukehTyb+iNCSxJ744v35H3esBYPz0ysKkClEerdWUMX0SvRPx/
20lBg6KHkXsDacW9aYzDtE/KQxtwsxkuTRvkimzbC+tuI4o77D4tDw1FumnR
Agn4KoJyVFVX4zyhUKyFStYToL4tvZO4r9c2uRwaKVYbwdGS/bxRPIS+tk8E
5W3hZbUN05YujSaavDcA5GmWaC9oFxzGsQ+y+cLpgcwsEkMUflBVth2nIVgE
6t2WGhq2EAdVgETHPu1xinC34NBQB2c0d1JpRDfQP4c4rQp9SQ8zv9/7Ext/
hOM7Lio3PJ5X/KywRKEvK2KhmNEowqcMuyvdA3ImhBwpoSrtas4J5622PiaE
5D0Cs/i9Nkgj0E7M+uHEgACqhuri5cu3evNEPHgxJLLhrDBLU0CY3EGM9ziP
1ecfqhxSL+cmCDpDKEF8yph4gNoNdS5RBmdv60ZzpsmF+Ipsyq4ZqbKk6xTv
TLbQKDjdmlZA1uk5CgcD92qRs+8GUxiBvdQ+zBqegDcxpBupTSQw3s6Iyy2S
d1RIcFnlG+Lo8NUgU0JEqGK+2/cTShOtEYUWdVD2OucUUZOlChlyQCarJnqr
aeuwdoVVAjCbC/RR55rKknKTpYWtLuhplDAreNB+czvakL3U4A7SGuHkGbTO
xDtHA9ifYC/RR9j9vBaCVg3EeYaGdaRp8kNWU5fTLjmONbGALQi8R5z0hUY9
AUh26HSYSq2LIK1/yfmi7NxEwE/2e6NpQlm0fss4GYNzCNlLjqGptVRxsree
cok5VDCrynRBYIf0jjAOO5vIzEWOXu0k06f0XnSQMNxFDLVFtqmc5S/37QaB
aoRUFZdbvPObbeMCewI+5JqykMVqHhuc5m2+aG5QMHSkkNAKCwiKPbiOwdz9
RgzScSxue0RrEKniT2qp6qH8ecPx2+RUMUflEyY+trIUvihd0MkRnhGhAcLr
UDf1BEc9YoiQ6qjfitTDU8krr4Y5DgWSQy26oC3ad58/Hzr4mp73qV0UI29e
ktKZAi+ijVdb06u5fhC+vnyZ+luXUOd5O1L6PchWaaLa7e3c8sQNMyh2ebTR
N7RdTB/U7dgQ2THhdyFqGmWwYF+PkgOQuNgD2P6K5Bd7rg/3sRm2EDcsDh1Q
S3tq2mrB+m5R0gMo0PP3mNr1lreLOQm6nvlStTh8uE9wyVFzko7KrlZMmR1d
LGspI7/ThqCIwXxD8XBClMDAOxwNq41kX/DB7uuDIM1lKYPLvBx88cmClJVR
EimlvyTlykokRF1f4WnOsVHmAm/ho9sMHVNAhlxQ/ofHzx9//qzssw5Jzsyi
EJRV/PO4FSeSMvMDlWp6jmaX2+tdVmYvkEbkhrE26EHLNCI6ifKgsfr7rlRp
MARjI1Iho31PvC8ArObqPHKOTBQCCnVfcSVNR+4PwTF0+k1FJwmvScVGaWm4
Clwt2oZrlo0n+6ApNw+Utls5yrFHhJzQPAn9vRSoG1aZpKT77OzeybT9llbi
wxXzDo4w3mi2LDAlhZPTTzRPoACCmybnwT+5JCLgnKJR9DOapLbwbnYbvtlB
L4P9JGUsTHxFg8d/uwckXyLE9zRfzDBquhl2lDnFUKKSieSRLe4wRKdhdhjh
sn8mB4IFs0Jv+oNwK0wVeXDo5h0mvHeeeyY4xNBZ7Qs/F7uF0Z8VWV6xfTik
TrabNG9EU3qWM01wlArskCXe3tAlZcEYTsBhYGrziAxgd352iXV+q/o/94ny
N2kVlXIQO+v5Jc+S9puPm6hXgljYMSNq8RSZZaR0UVxVzbqov+uOUXC0YyhI
KhyqBXbG8ZHgseHIoBGebT0mErp+HbVWArs7hDVryS9wW9z9EV6ON8W+tovx
w67JxA0/9X90r4RgqGIeTrdXjPAQQVdNKV/K5A0111oGZz1wDvLbGVHgKb+Q
njxT+5efAr+7573aRQm9X0EDjtqHkqikAxEAfWkjdEA3lpu3HFrXjbjCiuhP
wT4MNDZQmAY6uxPzEGO1pr9awaUU6LrSON8BT+cCrxSFXF/AdXlm64l84btt
K1CEVB6NEl24GSchDgGtjimdnHNm003epCvzzC1gT6T12AMBjpliSAaYTcUd
uiTCGYqC4nQc8kNGcI/P8Uj+k+tL/5I8l9zeuAM2hXH9WiPrUfGShPfDi/Mi
rrqSWALMMLz8Wfxyqczq+/Y5BoJZogmMp4cJsZqiCGCab1XkhBY20Ftn5SQp
xlozzdyFSchC/vAUJ0lmAvwYlfSPyQv+fhgs4Yg5TUoRAaplyYvw+HFneD7q
joWGXecNHQpPsW52qCrQtlIQX/Zj+GhHnBGspWGJICHUceTGlJ8IHTRMUOC4
eh5oY/9S9x9xElo9GjrS0HtjjadEzUG/50q6on36pPujIb6Jfs2xvoek+nx6
2Mw3n0exznEURMhoZBz1yHPPka98ekvs/Wh0xM7unnR99PuiL70mxG7Tn+I0
dpESlOjAjXdwSL2jqGAlJ0BVuFJrzXPF5rso3iELjvoYcZGYNAAjIwuh+JCf
jQ1ABz7GJjj9CSluKtoDqDUlJjXDGUmuKFFQGNUVmOWUI9ntn6HAFcQ4+5Yg
ZApzG3d7SghgC2Eg4oSOO08r0qJBMjQ3VZZNEIQnKDpxg8FTrxNR5B6Hfin9
JVF99SehYQ10pNyagsplLj0KFyFHTs2wYfR+tmODNUAlWVigjib1xaUE9WiL
JG2NwtehIVekObTSDnDyVGQdFVXjtGnKNteoKnYebaFP7Q0VnhZtDk0WcbJR
iB2m85qyNXAWr88uLk/ftAiYv74yG2SWM/hWoFFx9ODtd7TMxfwK3oKkq52p
aQL48jraDC321+vJL7bWGloCFXdsqo1wdqyCIelKEJbS+sPrRazCPyfHJz/h
q0EH5Jura6VPBm4qJZEp6liESohBVlCeQbnjdDmF8tFM5Kh+pR3P0Cr1BQUG
kOtVAviD6W1uQkVyGugjCsyLGdGO31AnUS3sQNGC8TULuDXdqZn2gI26TdZT
g/VzBH7Mm93VOPhjojeeu9o9xbJHTwcVzqUE00JD91eTitkr3rymLLFwwKW4
cBekorTr1JsQGU2US+TRNHc5A3yPkckNpH+Qbjyc7ILe0OuitBwsebUk3Rhw
rHoDkQZrssJIBfXHDvoIoolnQcST/+kgrlPZieFkPwp9LWAUdLOJ1kt+b4dD
ya13aV3S+sp3s1ev3xy9dTWTtziD5iX2rCE9CQ86r9esArkiKpDYWLZ58vaX
89dnb14xvKGATj55Kg2sVQJdnL55EfiwpSxyZSVZKNr3srftpd1MdojYxXTs
j3rnmAeee1dKE2P4IUlOMXZ8ayX2GyJPKTKBDTh2TUWl9x0w0ZcE/UYciNOY
iDFrO77k5dmbILp62mWz0MIuqhX2pEMrfEf3myzl128vTkk45+t1tsi53TAl
RonrlvLMQv4b0mfYUdf/TJve5VEr3fYqXKZgALZt4ftqf4UWxG+EeERtqwSO
tZE2AJbD5pg/6Q6hWXB/apyeVDhSUhhoBKQg1GeSd6cnp2d/pL1i0Whw/GbK
WudSf8wGPBMd9EoQkMMqRYlRzDRpl65/nbP5pluknQ8CtI/kLvBMJrcekk59
mHIWfBAHW3Z2daE+uTXz4RQ1OwMusje2oNV16xw35EJ6MW2ZPA+IzCanfzx9
QyrRYUsDcHSETzqECnz634RmemIrkT+LhXXdEdb1gLDWlHbX3Nl9G6JFoVac
6XIhm8XbNNsFxH7aCzW4adfOGldw+69yDcjb19pqpYQc5ApycgXYi08Nw344
bLRfkgf7L9kvz6Zkw6JNQvXSbVJycPzD23dMdHqEpJp0z5E+7p+cP5K8lsQL
1D2b0jipIwaSzL7Wm/vJo5Xfk6LSynJkxUl2rzvV8PHAVMN6h6cazuHvMlWw
jwmo5veYxpfD+UFRWIRewBERvySSQvIdIpN6bcSl1Qe4kZGaJr7Ag5K028Us
46hVCA2I5euWDhusnKvjxYKtYRnqHQXa5CPeoF9eDG6PxB2iPVK354DvAKGA
/PkYzCQFFnPKcrfUVV8IImgr1DHMuRoG/AjwmmE/QjyH+/gRrCQEWblDWt5p
FGDAh8COAY4q9LzZhmQHeCHNxsl1mqKLndlY5EaILNnYGSD9JmKfQeuVXZ+B
qOcs/CTg27FQOcjFlQfahXfImdLvYmgfPKrb5MiOocZcsJS3iO1wTcBfYlTD
lFTpukAL6PcN3P1WH9DiCeSFYQOQHSk8hwzLaXLwlnOzUNcY944fA6h1oUWS
g9N3796+Qxo9DEKIvQwEI8IIueqa1bbq8O2S3TTG1ST8Pj3scUTEN8A7InDO
v88RgU8u5H7fyxWBD/xeV4ToYRpmE6BafKxLcvu9Ee37/ju9EcR0/GFHSay+
D3XbhovPwpljOLPIf1YIRrWCPXJNwm5Val9ti7P4s8AAC4MWBuB6tVuMxwj4
AXCZhqqihYZ0jK9qzSmH1RL2cFBN/LukSZQFEgihkbnzcpVeG20C7xYMR03o
Yyt5BZSRvLgAsXdwcXr5F/wX3YRx8uIlPnt2/uG5fPWSrwgOfXryhobnb+Av
+io2dtTOod3GKdNFN2PHds72CC+3GS3SkxU2WYMn5vU3G0X3IFBnrqfI/jnZ
Oe81jPcOd8bWYqZEZ6/KWcNQVQev4uXu1+RbhC4aFW0inldqAKPh1jPLd+1n
3POknZOyXHfqw+7UkvfM5Q5FdCw+tF59OnTKHaxBw5QtrhBLi75531eV/v0r
+DdXpf8DTJU1RYJ3/H3q4n31aX1LV6Wmi+8SvMcj+60V7JEFvq6vT26y+fua
4L5F9YVL+yH6NPhYR9qRr7ztqQHXWh0K0gmObrFdz7Iq+FVy36QKRxtpWxri
jGz6U4LWXKagQUgtZo50W0HRDKJePlBpI386jiifGGHI36aJ2ACBJfuPXrY+
EJYkn7xqfWLkwMktcwxpCaP9O5oS3qXf+65Iv/gdhsY0YS+CJXj0FtQrLp5W
1W+LKE1IRMVVAFp8TdzXcjX1eUocut5WoXCKSzRcJQ2jlBCydcvs2WPpdLel
a/uQM1/cE8lVV4G/oq3gglsqjw1ZhbgLmtPYG0ZtT02//PeZYssy2vvmO2yl
toIa/HCGiconqAS11zbaN5O4u0/f4r2VQMwKsWZYAVnbwDybJSNO5EtPLdI1
jgore8wovAakTXVFbojBEfu6z6a2DCxckrOx+qKq+42Z7vu65s3499o20rRc
taCwm+h+oG0GwkOsz04SdqiU1UwVvceSlouxVlYJCRkIPr0ot9U8C6ietrLA
PVogcHkdIzLAEQc0irahdOdE8wCK0Z3ccbGb1DTB3zEva50cTZApUl+nGkbM
ILlQQPCzPOKrhgxD7iXmOIYER8/9o8JsOYaDrD5spRNj9NXRquEc48CWxd++
UAg73fpCI4KzbT2mAua04KCZVx04Xo1D175K0CvgZZi0vYujclSbwylYxeKR
tbfJ7JuQJs/QXTAVAuHw3dKavegEoS2xw5rk4CwV4VuhBWdZCfJJqB12ljRj
1hJ3unj7l3env1ycHr948W6kKmWJxhOqeod7XQndi77HuRAVPv7rOhf2y6//
WO6GfVpSv6zFAb5MxPab5Jc3vrGSPRFs6L1T+/+lMb+XsL7QvCdO7cDvrIj3
72vz33vK/x/yAvy91vTv4hf4e01+9Hf0FGAq9j1jbtoqr98G7Ck/kFuHPgNL
ZcP3RegejJpgefw9P0GfKifc9rwDRqXfK561qc/JAxlUXBYPQvQk4JuJyiJw
x7Xk+QrXD0m/KHbTQjHKMRUKryQXyU8YesJ1DCd9BeFhURpEc9D3MX6d2wTK
32YLh8CYEnifK08l5YHeZkoev1VU4iYMHL6j/gOInoR1xFK1qFDAggAqOxQi
48adOd+mIygFeEuyQwcVFuxlg0+6k6GDIfkbB9vluNeWIkL2NmEgynMLxdNs
ypD+lcSHu7d7D5n1BhSMY2PcX+bSXVwPLj2Fhjhp3+UocOhWp840U1gH0Tpb
pwXh7ETz3pOX91UdYKQc4perT5DqI05Vl0MwvCr1WvCUDwjA6tAhWLXa9WCi
2zdfP/0as+OlN1ddWoOuUhXLcDcXgqxDA5MCefBgzhCtDw7dVChhMyyYm9FI
CWC6InQATxftifuZBY+OL52kNhiDVyLBUkzu+UWoFaQCTMrlBFOnuKEnEUxM
QHoHSLdp5RlSkhK9lKEA2jU6VDmB4hzH4el/9/Sbx25jGbKSiJ7vZY0l1dtV
FhUWhfT9Dkq/Qe/kirgT0uUYVodCUtxCTeclOay6ULagqEo2fmtZKJKBvM2V
SGOhsN/MEPg1VBolD7FiAtcMpEfGITJI3IDFEf+OKttbCcCuALQjKEI6Il/d
sWTlrm4xdZJRU5RSf8uqkjPkHLNva/AwOFho0qilIFiesBi8JKCX0UIIsZ7I
mjchtW1wtBGgx7Dkom32tFvsWG6RwOKI+2cRrZjWhwujXntubmR1S0yyYiuJ
EGHoAXw9ZqVGebpgkS/88qbJD4GgPUJOkzZbXoLCMegu+YdfKeTx2LFqAzCA
3ZF0YdSAbxGcJ4A6HNBiEERxsehBY8MZHYZ3fc/8o8K7QlQksU7adxy7og0R
fF8HHZFxml+PxtCGxQqci8mCM8JQdjsupWwC6xGMj5Lvw8jSswzaS2SUaaWV
XFhLzHjadVSC1oGkxHVyMTbx6X7oQO9yPtNhpNEzsrAesSYZnJ7q7Z4dxwpZ
a9HWswYvna/hc87K5HSFWRiSEUoDdx30gnOLnt8fCBSdLOJRjvAqgjeFr38n
jqRxSxPgrNIjgdcVP1RWEOy3nODIQZXGTlV1QQZrlzUi2o66rXPo7nT2kZFF
Q1DJ6Z1Fdl3aLWZ0BqlSUoh7zOqPNxB3zylxwTbGLqiLDOTW0jgtzx9B1sjz
x6D1KvzCjPqUZFc6ytr4qAfMrSOK2YElZQHVtiA3Nj4U1j1Ojl+8+MvF5bvT
4595RRZEUSd2Xyji70Cy6R0km9xFsuH2P/BFZA/CuSlRe9oYCRVyPYEjMZRe
0oJPiqr6d+xQHbXa3yGkmrBIlHmMyiJ6sY+Y+OBS1RfPqTLsM++TyLU5VD4F
TRU34iuU89uqVaJ24wqIFwSh37JUbNNIeqnRkn3Ma6yT7J4C7RUuOL6nLIBd
34Se42cEJMbNYSRiSasTRXTeE2rr240vqbXDnRkIvJz9fPr2FyEieA+Z65KO
Lk91giX0+RduIldK9u7jOARciHIYkab2MRSmmH3WVHIwRwRJdvbN56DbELZK
SxSSuk/XTspuu1ZEOis/ZMNeYrcFg+SYHKQCHiv2lBaLRDc2yvM/HDO4fWGw
3H2WYHST2OivKvIstm5VcpCLLwWHGzuvqFpEefGhfM+9tPe6n3tcG4P+ZiFw
CkeI/MmbzkH9XQ5I22CItCQoktZNDLfwTl4eObeZujWVwtXBhfTo+vq1QElp
gnR9/baiJjhXpGQ2pXO2m0JkJm+/D5tfjHL4gQIcoOOXcGr8b+TsyH3aXwQT
XL9/X4k0lqKoWOKEEN1AOcS+2pPghEBwL6u78hxIxFWv3oKzoIpGEUYCUTik
LLTtI3MihpW6llnvTjETZZhyxmbmYJFnHVifeZStto1AMLV1hId+NQ2c+mYH
WNjZTjEdgxwY9+Y4VIF9SgbxcWNT4W3j4/DLcfvLswPWYvC0tg62RIsa7ZHZ
jrz2ONfuvlBR6CWZbcj28Ees1g2902/ZnorO1j7mvEcF6CMzjRGax4g6nH7p
ZomSGi5Uu3bqNq1EjYmh5SRO8fe+X+wt7zdC/u0vQH2zbRZcBlrOKVgbGYrk
hlXnXivi0Rvv4NLpwEPGyVwbMPU7+Ds+8zgy0RuX4JeEjRx3CqO+7IUtQFf8
VZQy2JJMoT5YO3Kp16vfaN93FEoVYlMFgCQ31KZHQM3jWmuUUPjRhbjnsIE9
TQ/0kZdnr355dyo39C8XJz+evvjl9em7qb3SuB03kiMNzaw+wwg0e3FwGx8m
Z8dvjlu4c20cFFRpgE/6yiJ8itHssvkWF9QZog35gs4JrHveNugb1dQmDOfJ
AHM/gOANuYAJF5/vIibk2kcOsCx8K7YYApY93YdCEwAAFdoH8SG24u4swiy5
XCL/kM539Hqr19jbSUicsw5ZRt7mPIa+vXobDlESg0JCy0D0gZU8xYzKBjaX
CIL8iIZLZPAz3IJb4wvAuzEdod7Oar2Ssi+2T62RjZ9ZMhMQqBXG1/qxZv24
TeEQYUxGjCFoeKmvFHmU04YHaG/fUQA55EIPHXIQCoVXztDNFyBQiRZTbOXJ
inELCT3xrQop0cRld9gJBI4gjQGXhGrbbjuq+cHs/EU2f42+GcYV1ndxSrKi
cDIZC8istQ7BHeg26uBMLQbFpKll3IG9aOCiYev1Qj/lvrJhR3s6atzjxN7R
tqEuj/u9TOsGE594lwepM604ZcxtOeP1SV3zcSHboUrd+4JjHg6iNDTik2FU
BiuE7h24gdb+QwqTOZZhcCxyDdn0c2MIPj2qBVuq4drOFX9DZoRpYyjmFI4K
IzUwwALDePJ0aAtM2Jowg7V2+er8tmaKA0Kosz5i4w2S/C29s0JM0xYGqPnU
BdFXac327B7EHWgX0WwL7MH3G90heSWQAsHcahsXs7eVmlG6YVs4BHDIyMmV
9mwwwr3S6c62+aoJla0k5bk9BHsBUgIVk8a/3OfCgUpyLmGnpl7nEvrw9DW9
0ciDg10G3j2Rc1bX6fAuU6dVep8CV6dr7BXPkpuyfrk3qsk+9tQX5QIZBxUI
KHEFjywwOMIeWGCmXyaFpQimoegH1nLCEjWHzoIE/PEcbxdoGtwHW5UD2p8o
IXq55diKjXK6RaqArfulyKnNxI+gmvwG73v6+OnjELAAXjHKi6KUdCUgJUyz
WksrJ0J6x46ScN50L9+ATfPN8+fPnj1PDjBcwYVi+Ol3T75+8u13ycHXr07f
nF6cXRxO23Ol0EkU3n2d5bMi/w1YOiL+wLtJe8elENN78fJVMkleZQhFPXqn
M35JaCs426PkVdk0ywrl2a/56iZbrXXIyXmVwbufPn7yJDl4+dN/T16eJl9/
+/jR88mT+0wMN/CXn5JTxA3Kghg6v9nVlKhzMc+R39dhVifYmC9fRdt2ev7o
3ePnT/7f2q6kt20cCt/zK4zMpS1iW/viTAMESWe6DDJBm8NcSYqKhaaWITl1
NYP+93kLKVHe2ksvgeFY1NPT4+NbyO+Lon/m/k/edG88UMNd3WDllkfGdt/5
Q71eg1W2n8/PhhdmWVGpzP33zfXHd3fX51apcHu4v1h9NlC8EAUiU8PnCmGU
HsBk3kPCBB8/iOZp+r7G7Vt/wmOv9Jf6ArTcgMv7Q1TN8rnB7cdmplYN77lF
Cnvbe2Rfi5OyL/GMUA9nVgyquOGWns0zopLcQCC0pHz7fd0u4eYCFskn3V1M
bgUEa6DxJayH/1achL1pILT5gPLBYjNIs+MlCFyXZdFliYdL3In7FmKtbvKm
05KTXkZ1x94+rcQGQt6U782EnE6ntHTQ1ISIz+5WerDwgP/9dhwbEJfObg+Y
8EdBpXFX3Gvns6i4s9iOOtvb0fVifLhn3v97fhj09uVo59cLB25hbs8CzU3l
7+XBDWFOh/JAB8i2Mg4W5ver731l/WCt2dZlz/qxTcXQ1vZsDWKUd4/yY3x1
HwnxygBw8vlz58UxHlY75f98P3lI7lRSYzaD9LvgTQhkWERMWZxxp13yKQZX
70lKWZqeILQbKurEFN8w42rVDqCdT9RboAPDthtpl1jzaGA0rybvVhBHVMWN
2wdc0LOO+DttZEHT7gCp0O4mJbeOSU3byiYq2OasFFLTMSFFD5C4x2XN2wkw
RKtPH53garxhyKWDCET+dPgMjj0Iwsy6mC4YPiH++eEjZKSqu7qPqVtW0bh7
CtonXTJmxWqAk3O2KeyTovKuyRaGaM1BxoOKP6FgEu5jz9v1B1nMwlA8kM6I
4YDwGkzm15x8YVxJ3HAlkQM2usdo7rq3OV6n3AqiEzUB/AAx7tDDGmIiJ748
fITGSVuP6IAxWCAzXFYSMkwjnJHEsKQi8empYoX5tTmERFDnNr4zVI/GXI6L
cVdvyEHhU7MIuyS5BhUA2SSeyEgYiBPBvY2qjat9qOu/cIsXD2M7LxVhDU5k
dXLZGLD/uD3NKjKSuG/PYdzcEZTPq7l+wogw9H7Gkjk9ob0ZvyOnC6NIz9C5
dsfzwXnXx7eeonS3umyIBdR9LgJyoPV868bIZsDjT6165DAGCsYe5XDdGPmM
7j6sUbTE2Ps7Fo0CCDmK8QyK6Svi+wCvvji75WZQx+6ux1ATbC2997Y03hu+
jhKEN9hJJhCTnTTHWdB2qhzfTSjaLxiPvON0RXQLXyu9RTm0HXjn6gsLm07E
InjYAyue2I1Flo5j78opTb3AxQ4Xp0JjWvESS1G0YdO0PcdFKVATEsVpSGDu
TF6EL1zjp8XZZPJq/2tO3R0vQ9DuuFpTuso1kgsTvsCjT284qPy0rcoNwaT1
Oe9UdlMCJScCuhHf/eCr3TzclGZwkL7KiFtO2jVu8t4tNzGvCQHaXCCxGgS7
9Bcu/eYMZ6ClOJzQ3yA8osIowq+q53ZTo9NCk4R1HRVya7RncqTfl5vNul3M
5wXqAafeDP2WnsH6Oy/c385N5nlFvgyyO07u4MN9Z3SNX9q+zvNmzQ2WUbr5
dpxf2qTuHC89vzQ5vyClTFkrT5VssKaC76UnWnFOWu3st6dlYu3qjt8etTXI
hr4QzwBGUaUmciIHfEvY5YDQuXAi4nPdQMLuaOoRRnmWpCDak2ceYo6AjFf9
BXYiINbQFi37LcR1G5y5VOj86o4o+JtZa367ND+d1c3jvN0uF/4Cgo9FGqZZ
4GWRV2ahirTKozwUmfKUynIZ+nGuA+2LOL2EXB5S09c/I/Dl16qtNq/5Ju1q
vZBSJr4vvUiHcRyFeRGlOgoSnYkiLrxUFbJM4CvvUqzUsm7MlbB6LpI40DrP
fS8KFVyceCLRcerHpQhErALf92E0P1ZXg7EYSRxVbLfbGcplhUQVDBfcd2wf
991mibX3ZfWFWWBoNO7FMvs7WyF9begh+TzF4Evw0BpaTHK6PTApGvCsPzIE
uF48whKzFoXYitWchf2l1hDksVKFH2WqzP1MKZnrIhXwhYyFzpNMZEWgwtQ7
YQ2Hpd4ziQSsKhR5UUQqDgMpEuWVcaCyMg0j5QdxIrwEcmG1bxIKLCbLirRM
yzASns5llsRR7CeFSJXnBSqKikDnMfmU++7h+v4Tu5LrCX7eTdn7qph5/6Lt
VqqqcXEpuQ7zEx4Ci6AuuegRj0Gulmmbd2EAFTFSnzaI8hFE0Jv5miSdGkkp
DfylViFgwvlenhS5H8aBhAksvTzQpQ8696IyzDTM0jhOTljFCdH3TCPKIl/H
uYxDGWRShlmcgq9Ii1DESS619sDHpqWKDniLEHxDWaRgDoUIYj8KpPJFEqa+
zEo/9PJUSQHiXp39D5dDlYYaqAEA [rfced] Please review the "Inclusive Language" portion of the
     online Style Guide
     <https://www.rfc-editor.org/styleguide/part2/#inclusive_language>
     and let us know if any changes are needed.  Updates of this
     nature typically result in more precise language, which is
     helpful for readers.

Note that our script did not flag any words in particular, but this
should still be reviewed as a best practice.

In addition, please consider whether "traditional" (Section 4.1.1)
should be updated for clarity.  While the NIST website
<https://www.nist.gov/nist-research-library/nist-technical-series-publications-author-instructions#table1>
indicates that this term is potentially biased, it is also ambiguous.
"Tradition" is a subjective term, as it is not the same for everyone.

Original:
   When trying to connect to a hostname Endpoint
   Identifer on a traditional IP network, the implementation should send
   all applicable DNS queries.

Note that the resolution in RFC-to-be 9622 was to simily delete
"traditional".
-->

  </back>

</rfc>