<?xml version='1.0' encoding='utf-8'?>
<!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.43 (Ruby 3.4.12) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-quic-receive-ts-04" category="std" consensus="true" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="QUIC Receive Timestamps">QUIC Extended Acknowledgement for Reporting Packet Receive Timestamps</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-quic-receive-ts-04"/>
    <author initials="I." surname="Swett" fullname="Ian Swett" role="editor">
      <organization>Google LLC</organization>
      <address>
        <email>ianswett@google.com</email>
      </address>
    </author>
    <author initials="J." surname="Beshay" fullname="Joseph Beshay" role="editor">
      <organization>Meta Platforms, Inc.</organization>
      <address>
        <email>jbeshay@meta.com</email>
      </address>
    </author>
    <date year="2026" month="November" day="16"/>
    <area>Transport</area>
    <workgroup>QUIC</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 45?>

<t>This document defines an extension to the QUIC transport protocol which supports
reporting multiple packet receive timestamps for post-handshake packets.</t>
    </abstract>
  </front>
  <middle>
    <?line 51?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The QUIC Transport Protocol <xref target="RFC9000"/> provides a secure, multiplexed
connection for transmitting reliable streams of application data.</t>
      <t>This document defines an extension to the QUIC transport protocol which supports
reporting multiple packet receive timestamps.</t>
    </section>
    <section anchor="motivation">
      <name>Motivation</name>
      <t>QUIC congestion control (<xref target="RFC9002"/>) supports sampling round-trip time (RTT)
by measuring the time from when a packet was sent to when it is acknowledged.
However, more precise delay signals measured via packet receive timestamps have
the potential to improve the accuracy of network bandwidth measurements and the
effectiveness of congestion control, especially for latency-critical
applications such as real-time video conferencing or game streaming.</t>
      <t>Numerous existing algorithms and techniques leverage receive timestamps
to improve transport performance. Examples include:</t>
      <ul spacing="normal">
        <li>
          <t>The WebRTC congestion control algorithm described in <xref target="I-D.ietf-rmcat-gcc"/>
uses the difference between packet inter-departure and packet inter-arrival
times as the input to its delay-based controller.</t>
        </li>
        <li>
          <t>The pathChirp (<xref target="RRBNC"/>) technique estimates available bandwidth by measuring
inter-arrival time of multiple packets.</t>
        </li>
      </ul>
      <t>Notably, these techniques require receive timestamps for more than one packet
per round-trip in order to best measure the network.</t>
      <t>Additionally, receive timestamps can provide valuable network telemetry, even
if they are not used by the congestion controller.</t>
    </section>
    <section anchor="conventions-and-definitions">
      <name>Conventions and Definitions</name>
      <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

</section>
    <section anchor="frame">
      <name>New ACK_RECEIVE_TIMESTAMPS Frame Wire Format</name>
      <t>Once the receive timestamps extension is negotiated (see <xref target="negotiation"/>), an
endpoint <bcp14>MAY</bcp14> use the ACK_RECEIVE_TIMESTAMPS frame defined below to report
receive timestamps to its peer. An endpoint <bcp14>MAY</bcp14> continue to use the existing
ACK frames as specified in <xref section="19.3" sectionFormat="of" target="RFC9000"/> if it does not have any
receive timestamps or does not want to report them.</t>
      <t>Endpoints send ACK_RECEIVE_TIMESTAMPS frames in 1-RTT packets, with 0
or more receive timestamps following the Ack Ranges and optional ECN Counts.
Similar to the ACK frame types (0x02..0x03), the ACK_RECEIVE_TIMESTAMPS
frame defines two frame types (0x03178307..0x03178308) to indicate whether the frame
includes ECN counts.
ACK frames are never sent in 0-RTT packets, so the same applies to
ACK_RECEIVE_TIMESTAMPS frames. Receipt of an ACK_RECEIVE_TIMESTAMPS or
PATH_ACK_RECEIVE_TIMESTAMPS frame in a packet other than a 1-RTT packet <bcp14>MUST</bcp14> be
treated as a connection error of type PROTOCOL_VIOLATION.</t>
      <figure anchor="fig-frame">
        <name>ACK_RECEIVE_TIMESTAMPS Frame Format</name>
        <artwork><![CDATA[
ACK_RECEIVE_TIMESTAMPS Frame {
  Type (i) = 0x03178307..0x03178308,
  Largest Acknowledged (i),
  ACK Delay (i),
  ACK Range Count (i),
  First ACK Range (i),
  ACK Range (..) ...,
  [ECN Counts (..)],       // included iff Type == 0x03178308
  Receive Timestamps (..)
}
]]></artwork>
      </figure>
      <t>The fields Largest Acknowledged, ACK Delay, ACK Range Count, First ACK Range,
ACK Range and ECN Counts are the same as for ACK (type=0x02..0x03) frames
specified in <xref section="19.3" sectionFormat="of" target="RFC9000"/>.</t>
      <t>The format of the Receive Timestamps field is shown in
<xref target="fig-receive-timestamps"/>.</t>
      <figure anchor="fig-receive-timestamps">
        <name>Receive Timestamps Fields</name>
        <artwork><![CDATA[
Receive Timestamps {
  Timestamp Range Count (i),
  Timestamp Range (..) ...
}
]]></artwork>
      </figure>
      <dl>
        <dt>Timestamp Range Count:</dt>
        <dd>
          <t>A variable-length integer specifying the number of Timestamp Range fields in
the frame. A value of 0 is permitted, in which case the frame does not report
any receive timestamps.</t>
        </dd>
        <dt>Timestamp Ranges:</dt>
        <dd>
          <t>Ranges of receive timestamps for contiguous packets in descending packet
number order; see <xref target="ts-ranges"/>.</t>
        </dd>
      </dl>
      <section anchor="ts-ranges">
        <name>Timestamp Ranges</name>
        <t>Each Timestamp Range describes a series of contiguous packet receive timestamps
in descending sequential packet number (and descending timestamp) order.
Timestamp Ranges consist of a Delta Largest Acknowledged indicating the
largest packet number in the range, followed by a list of Timestamp Deltas
describing the relative receive timestamps for each contiguous packet in the
Timestamp Range (descending). Packets within a range are in descending
packet number and timestamp order. Ranges are in descending timestamp order
but do not have to be in descending packet number order.</t>
        <t>Each packet in a range <bcp14>MUST</bcp14> be an acknowledged packet,
i.e., the packet number <bcp14>MUST</bcp14> have been included in an ACK Range
in the current or a previously sent ACK, ACK_RECEIVE_TIMESTAMPS, PATH_ACK,
or PATH_ACK_RECEIVE_TIMESTAMPS frame.</t>
        <t>Timestamp Ranges are structured as shown in <xref target="fig-ts-range"/>.</t>
        <figure anchor="fig-ts-range">
          <name>Timestamp Range Format</name>
          <artwork><![CDATA[
Timestamp Range {
  Delta Largest Acknowledged (i),
  Additional Timestamp Delta Count (i),
  Timestamp Delta (i) ...,  // (Additional Timestamp Delta Count + 1) times
}
]]></artwork>
        </figure>
        <t>The fields that form each Timestamp Range are:</t>
        <dl>
          <dt>Delta Largest Acknowledged:</dt>
          <dd>
            <t>A variable-length integer indicating the largest packet number in the
Timestamp Range as a delta to subtract from the Largest Acknowledged in the
ACK frame. For example, 0 indicates the range starts with the
Largest Acknowledged. If any packet number in a Timestamp Range is negative,
the endpoint <bcp14>MUST</bcp14> treat this as a connection error of type
FRAME_ENCODING_ERROR.</t>
          </dd>
          <dt>Additional Timestamp Delta Count:</dt>
          <dd>
            <t>A variable-length integer indicating the number of Timestamp Deltas that
follow the first Timestamp Delta in the current Timestamp Range. Every
Timestamp Range contains at least one Timestamp Delta: the first reports the
receive timestamp of the packet indicated by Delta Largest Acknowledged, and
each additional Timestamp Delta reports the receive timestamp of the next
smaller packet number.</t>
            <t>The total number of Timestamp Deltas in the frame, i.e. the sum of
Additional Timestamp Delta Count plus one for all Timestamp Ranges in the
frame, <bcp14>MUST NOT</bcp14> exceed max_receive_timestamps_per_ack as specified in
<xref target="negotiation"/>.</t>
          </dd>
          <dt>Timestamp Deltas:</dt>
          <dd>
            <t>Variable-length integers that encode the receive timestamps of the packets in
the Timestamp Range, in descending packet number order. Each value is decoded
by multiplying it by 2 to the power of the receive_timestamps_exponent
transport parameter received by the sender of the frame (see <xref target="negotiation"/>).</t>
            <t>Taken in order across all Timestamp Ranges in the frame, the reported receive
timestamps never increase. The first Timestamp Delta in the frame is the
receive timestamp of its packet relative to receive_timestamp_basis (see
<xref target="ts-basis"/>). Each subsequent Timestamp Delta, whether in the same or a later
Timestamp Range, is the time by which its packet was received before the
packet of the previous Timestamp Delta.</t>
          </dd>
        </dl>
        <t>When the receiver receives packets out-of-order, it <bcp14>SHOULD</bcp14> report them with
other packets in a single ACK_RECEIVE_TIMESTAMPS or PATH_ACK_RECEIVE_TIMESTAMPS
frame, starting with the most recently received packet regardless of the packet
number order. See <xref target="examples"/> for examples of reporting timestamps of
out-of-order packets.</t>
        <t>When truncation is necessary to fit within the max_receive_timestamps_per_ack
limit or reduce the size of the frame, the receiver <bcp14>SHOULD</bcp14> retain timestamps
for the most recently received packets and omit timestamps for older packets.</t>
      </section>
    </section>
    <section anchor="mp-frame">
      <name>PATH_ACK_RECEIVE_TIMESTAMPS Frame Wire Format</name>
      <t>When both the receive timestamps extension and the multipath extension
<xref target="MULTIPATH"/> are negotiated, an endpoint <bcp14>MAY</bcp14> use the
PATH_ACK_RECEIVE_TIMESTAMPS frame defined below to report receive timestamps
for packets received on a specific path. An endpoint <bcp14>MAY</bcp14> continue to use the
existing PATH_ACK frames as specified in <xref section="4.1" sectionFormat="of" target="MULTIPATH"/> if it
does not have any receive timestamps or does not want to report them.</t>
      <t>Endpoints send PATH_ACK_RECEIVE_TIMESTAMPS frames in 1-RTT packets, with 0
or more receive timestamps following the Ack Ranges and optional ECN Counts.
Similar to the PATH_ACK frame types (0x3e..0x3f), the
PATH_ACK_RECEIVE_TIMESTAMPS frame defines two frame types (0x03178309..0x0317830a) to
indicate whether the frame includes ECN counts.</t>
      <figure anchor="fig-mp-frame">
        <name>PATH_ACK_RECEIVE_TIMESTAMPS Frame Format</name>
        <artwork><![CDATA[
PATH_ACK_RECEIVE_TIMESTAMPS Frame {
  Type (i) = 0x03178309..0x0317830a,
  Path Identifier (i),
  Largest Acknowledged (i),
  ACK Delay (i),
  ACK Range Count (i),
  First ACK Range (i),
  ACK Range (..) ...,
  [ECN Counts (..)],       // included iff Type == 0x0317830a
  Receive Timestamps (..)
}
]]></artwork>
      </figure>
      <t>Compared to the ACK_RECEIVE_TIMESTAMPS frame defined in <xref target="frame"/>, the
following field is added:</t>
      <dl>
        <dt>Path Identifier:</dt>
        <dd>
          <t>The path ID associated with the packet number space of the 1-RTT packets
which are acknowledged by this frame, as specified in
<xref section="4.1" sectionFormat="of" target="MULTIPATH"/>.</t>
        </dd>
      </dl>
      <t>All other fields are the same as for the ACK_RECEIVE_TIMESTAMPS frame
(<xref target="frame"/>). The Receive Timestamps field follows the same format described
in <xref target="ts-ranges"/>.</t>
    </section>
    <section anchor="negotiation">
      <name>Extension Negotiation</name>
      <dl>
        <dt>max_receive_timestamps_per_ack (0x1fed5311 temporary value for draft use):</dt>
        <dd>
          <t>A variable-length integer indicating the maximum number of receive
timestamps the sending endpoint would like to receive in an
ACK_RECEIVE_TIMESTAMPS or PATH_ACK_RECEIVE_TIMESTAMPS frame.
If this transport parameter is absent, this extension is not supported, which
is equivalent to a value of 0.</t>
          <t>Each ACK_RECEIVE_TIMESTAMPS or PATH_ACK_RECEIVE_TIMESTAMPS frame sent <bcp14>MUST
NOT</bcp14> contain more than the peer's maximum number of receive timestamps.</t>
          <t>An endpoint <bcp14>MUST NOT</bcp14> send ACK_RECEIVE_TIMESTAMPS or
PATH_ACK_RECEIVE_TIMESTAMPS frames to a peer whose
max_receive_timestamps_per_ack is not present or 0.
A value of 0 does not permit sending these
frames with zero timestamps; it prohibits sending them entirely.</t>
          <t>An endpoint that receives a frame violating either of these requirements
<bcp14>MUST</bcp14> treat this as a connection error of type PROTOCOL_VIOLATION.</t>
        </dd>
        <dt>receive_timestamps_exponent (0x1fed5312 temporary value for draft use):</dt>
        <dd>
          <t>A variable-length integer indicating the exponent to be used when encoding and
decoding timestamp delta fields in ACK_RECEIVE_TIMESTAMPS and
PATH_ACK_RECEIVE_TIMESTAMPS frames sent by the
peer (see <xref target="ts-ranges"/>). If this value is absent, a default value of 0 is
assumed (indicating microsecond precision). Values above 20 are invalid; an
endpoint that receives such a value <bcp14>MUST</bcp14> treat this as a connection error of
type TRANSPORT_PARAMETER_ERROR. If the receive_timestamps_exponent transport
parameter is present and max_receive_timestamps_per_ack is absent or has a
value of 0, receive timestamps are not supported and
receive_timestamps_exponent <bcp14>MUST</bcp14> be ignored, regardless of its value.</t>
        </dd>
      </dl>
      <section anchor="ts-basis">
        <name>Receive Timestamp Basis</name>
        <t>Endpoints which negotiate the extension need to determine a value,
receive_timestamp_basis, relative to which all receive timestamps for the
session will be reported (see <xref target="ts-ranges"/>).</t>
        <t>The value of receive_timestamp_basis <bcp14>MUST</bcp14> be less than the smallest receive
timestamp reported, and <bcp14>MUST</bcp14> remain constant for the entire duration of the
session. The receive_timestamp_basis is a local value that is not communicated
to the peer.</t>
        <t>Receive timestamps are reported relative to the basis, rather than in absolute
time to avoid requiring clock synchronization between endpoints and to make
the frame more compact.</t>
        <t>Endpoints <bcp14>SHOULD</bcp14> choose a receive_timestamp_basis close to the start of the
connection to keep reported values small. Because the basis remains constant,
reported timestamps still grow over the lifetime of the connection, and decoded
values can exceed the range of a 64-bit integer. Endpoints <bcp14>MUST NOT</bcp14> allow this
to cause arithmetic overflow, and <bcp14>MAY</bcp14> ignore timestamps they cannot represent.
An endpoint <bcp14>MUST NOT</bcp14> send a Timestamp Delta whose decoded value exceeds 2^62-1
microseconds, so that any valid timestamp can be represented as a signed 64-bit
count of microseconds. An endpoint that receives a Timestamp Delta whose decoded
value exceeds this limit <bcp14>MUST</bcp14> treat this as a connection error of type
FRAME_ENCODING_ERROR.</t>
      </section>
    </section>
    <section anchor="discussion">
      <name>Discussion</name>
      <section anchor="best-effort">
        <name>Best-Effort Behavior</name>
        <t>Receive timestamps are sent on a best-effort basis. Endpoints <bcp14>MUST</bcp14> gracefully
handle scenarios where the receiver does not communicate receive timestamps for
acknowledged packets. Examples of such scenarios are:</t>
        <ul spacing="normal">
          <li>
            <t>A packet containing an ACK_RECEIVE_TIMESTAMPS or PATH_ACK_RECEIVE_TIMESTAMPS
frame is lost.</t>
          </li>
          <li>
            <t>The receiver truncates the number of timestamps sent in order to (a) avoid
sending more than max_receive_timestamps_per_ack (<xref target="negotiation"/>); or (b) fit
the ACK_RECEIVE_TIMESTAMPS or PATH_ACK_RECEIVE_TIMESTAMPS frame into a packet.</t>
          </li>
          <li>
            <t>The receiver is unable to measure the arrival timestamp of a packet with
sufficient accuracy, for example due to a scheduling delay in a userspace
implementation, and omits the packet from the Timestamp Ranges while still
acknowledging it in the ACK Ranges.</t>
          </li>
        </ul>
      </section>
      <section anchor="frame-size">
        <name>Frame Size</name>
        <t>The addition of receive timestamps increases the size of ACK frames. Receivers
<bcp14>SHOULD</bcp14> use receive timestamps to fill available space in packets that would
already be sent, rather than sending additional packets solely to report
timestamps. In such cases, the receiver would send fewer timestamps than the
maximum allowed by max_receive_timestamps_per_ack.</t>
      </section>
      <section anchor="plausibility">
        <name>Validating Receive Timestamps</name>
        <t>A sender can use its own send and acknowledgement times to check whether the
receive timestamps reported by its peer are plausible. A packet is always
received after it was sent and before the sender receives the first
acknowledgement for it. Therefore, for two packets A and B, where B was
received after A, the time between their reported receive timestamps:</t>
        <ul spacing="normal">
          <li>
            <t>cannot be greater than the time from when the sender sent A to when it first
received an acknowledgement for B; and</t>
          </li>
          <li>
            <t>cannot be less than the time from when the sender first received an
acknowledgement for A to when it sent B.</t>
          </li>
        </ul>
        <t>Timestamps that fail this check are implausible. For example, if a peer reports
timestamps that advance faster or slower than real time, this check fails once
the two packets are more than about one round-trip time apart.</t>
        <t>When applying this check, senders need to allow for the precision of the
reported timestamps, the granularity of their own clock, and small differences
in clock rate between the endpoints. The effect of clock rate differences grows
over time, so the check works best on packets sent close together.</t>
        <t>Passing this check does not guarantee that timestamps are accurate, since a peer
can still report any values within these bounds. Estimates derived from receive
timestamps, such as available bandwidth, need to remain consistent with what the
sender observes locally, such as its delivery rate.</t>
      </section>
    </section>
    <section anchor="examples">
      <name>Examples</name>
      <t>To illustrate the usage of the Receive Timestamps fields, consider a peer
that sent 14 packets with numbers 87 to 100.</t>
      <t>Assume the receiver receives packets 87 to 91 and 96 to 100 at the following
timestamps relative to the basis:</t>
      <table>
        <thead>
          <tr>
            <th align="left">Packet Number</th>
            <th align="left">Relative Timestamp</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">87</td>
            <td align="left">300</td>
          </tr>
          <tr>
            <td align="left">88</td>
            <td align="left">305</td>
          </tr>
          <tr>
            <td align="left">89</td>
            <td align="left">310</td>
          </tr>
          <tr>
            <td align="left">90</td>
            <td align="left">320</td>
          </tr>
          <tr>
            <td align="left">91</td>
            <td align="left">330</td>
          </tr>
          <tr>
            <td align="left">96</td>
            <td align="left">350</td>
          </tr>
          <tr>
            <td align="left">97</td>
            <td align="left">355</td>
          </tr>
          <tr>
            <td align="left">98</td>
            <td align="left">360</td>
          </tr>
          <tr>
            <td align="left">99</td>
            <td align="left">370</td>
          </tr>
          <tr>
            <td align="left">100</td>
            <td align="left">380</td>
          </tr>
        </tbody>
      </table>
      <t>When it's time to acknowledge these packets, the receiver will send an
ACK frame with two ranges, as follows:</t>
      <artwork><![CDATA[
Largest Acknowledged: 100
...
Timestamp Range Count: 2

Timestamp Range 1:
  Delta Largest Acknowledged: 0 // Starting at packet 100
  Additional Timestamp Delta Count: 4 // 5 timestamps
  Timestamp Deltas: 380, 10, 10, 5, 5

Timestamp Range 2:
  Delta Largest Acknowledged: 9 // Starting at packet 91
  Additional Timestamp Delta Count: 4 // 5 timestamps
  Timestamp Deltas: 20, 10, 10, 5, 5
]]></artwork>
      <t>After that assume that the receiver receives packets 92 to 95 out-of-order at
the following timestamps relative to the basis:</t>
      <table>
        <thead>
          <tr>
            <th align="left">Packet Number</th>
            <th align="left">Relative Timestamp</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">92</td>
            <td align="left">390</td>
          </tr>
          <tr>
            <td align="left">93</td>
            <td align="left">392</td>
          </tr>
          <tr>
            <td align="left">94</td>
            <td align="left">394</td>
          </tr>
          <tr>
            <td align="left">95</td>
            <td align="left">395</td>
          </tr>
        </tbody>
      </table>
      <t>The receiver can send a new ACK frame with all of the timestamps,
as follows:</t>
      <artwork><![CDATA[
Largest Acknowledged: 100
...
Timestamp Range Count: 3

Timestamp Range 1:
  Delta Largest Acknowledged: 5 // Starting at packet 95
  Additional Timestamp Delta Count: 3 // 4 timestamps
  Timestamp Deltas: 395, 1, 2, 2

Timestamp Range 2:
  Delta Largest Acknowledged: 0 // Starting at packet 100
  Additional Timestamp Delta Count: 4 // 5 timestamps
  Timestamp Deltas: 10, 10, 10, 5, 5

Timestamp Range 3:
  Delta Largest Acknowledged: 9 // Starting at packet 91
  Additional Timestamp Delta Count: 4 // 5 timestamps
  Timestamp Deltas: 20, 10, 10, 5, 5
]]></artwork>
      <t>In this particular scenario, the receiver can also choose to report the first
timestamp range only since the timestamps for the other two ranges have already
been reported.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The security properties described in <xref section="21" sectionFormat="of" target="RFC9000"/> apply, as this
extension only defines frames sent in 1-RTT packets, which are authenticated and
integrity-protected.</t>
      <t>As noted in <xref section="8.1" sectionFormat="of" target="RFC9002"/>, congestion control relies on signals
from unauthenticated entities. Receive timestamps are integrity-protected but
remain under the peer's control and could be crafted to influence the sender's
congestion control or bandwidth estimation.</t>
      <t>A malicious peer could report incorrect timestamps to cause the sender to
over- or under-estimate available bandwidth. Implementations that use receive
timestamps <bcp14>SHOULD</bcp14> perform plausibility checks, such as those described in
<xref target="plausibility"/> to ignore implausible timestamps, and can reduce the
impact of ignoring them by using other signals (loss, ECN, RTT).</t>
      <t>Processing and storing timestamps requires additional state. Endpoints <bcp14>SHOULD</bcp14>
bound the resources dedicated to this extension, advertise a
max_receive_timestamps_per_ack they are willing to handle, and be prepared to
truncate or ignore excess timestamps as described in <xref target="best-effort"/>. The size
of ACK_RECEIVE_TIMESTAMPS and PATH_ACK_RECEIVE_TIMESTAMPS frames is bounded by
the peer's advertised limit and the packet size, limiting amplification as
discussed in <xref section="21.9" sectionFormat="of" target="RFC9000"/>.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document uses temporary values for the transport parameters
max_receive_timestamps_per_ack (0x1fed5311) and receive_timestamps_exponent
(0x1fed5312), and for the frame types ACK_RECEIVE_TIMESTAMPS
(0x03178307..0x03178308) and PATH_ACK_RECEIVE_TIMESTAMPS
(0x03178309..0x0317830a). Prior to publication, these will be replaced with
permanent registrations in the "QUIC Transport Parameters"
(<xref section="22.3" sectionFormat="of" target="RFC9000"/>) and "QUIC Frame Types"
(<xref section="22.4" sectionFormat="of" target="RFC9000"/>) registries.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="MULTIPATH">
          <front>
            <title>Managing multiple paths for a QUIC connection</title>
            <author fullname="Yanmei Liu" initials="Y." surname="Liu">
              <organization>Alibaba Inc.</organization>
            </author>
            <author fullname="Yunfei Ma" initials="Y." surname="Ma">
              <organization>Uber Technologies Inc.</organization>
            </author>
            <author fullname="Quentin De Coninck" initials="Q." surname="De Coninck">
              <organization>University of Mons (UMONS)</organization>
            </author>
            <author fullname="Olivier Bonaventure" initials="O." surname="Bonaventure">
              <organization>UCLouvain and WELRI</organization>
            </author>
            <author fullname="Christian Huitema" initials="C." surname="Huitema">
              <organization>Private Octopus Inc.</organization>
            </author>
            <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind">
              <organization>Ericsson</organization>
            </author>
            <date day="17" month="March" year="2026"/>
            <abstract>
              <t>   This document specifies a multipath extension for the QUIC protocol
   to enable the simultaneous usage of multiple paths for a single
   connection.  It introduces explicit path identifiers to create,
   delete, and manage multiple paths.  This document does not specify
   address discovery or management, nor how applications using QUIC
   schedule traffic over multiple paths.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-quic-multipath-21"/>
        </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="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RRBNC">
          <front>
            <title>pathChirp: Efficient Available Bandwidth Estimation for Network Paths</title>
            <author initials="R. V. R. R. B. R. N. J. and L." surname="Cottrel" fullname="Ribeiro, V., Riedi, R., Baraniuk, R., Navratil, J., and L. Cottrel">
              <organization/>
            </author>
            <date year="2003"/>
          </front>
        </reference>
        <reference anchor="RFC9002">
          <front>
            <title>QUIC Loss Detection and Congestion Control</title>
            <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar"/>
            <author fullname="I. Swett" initials="I." role="editor" surname="Swett"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document describes loss detection and congestion control mechanisms for QUIC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9002"/>
          <seriesInfo name="DOI" value="10.17487/RFC9002"/>
        </reference>
        <reference anchor="I-D.ietf-rmcat-gcc">
          <front>
            <title>A Google Congestion Control Algorithm for Real-Time Communication</title>
            <author fullname="Stefan Holmer" initials="S." surname="Holmer">
              <organization>Google</organization>
            </author>
            <author fullname="Henrik Lundin" initials="H." surname="Lundin">
              <organization>Google</organization>
            </author>
            <author fullname="Gaetano Carlucci" initials="G." surname="Carlucci">
              <organization>Politecnico di Bari</organization>
            </author>
            <author fullname="Luca De Cicco" initials="L." surname="De Cicco">
              <organization>Politecnico di Bari</organization>
            </author>
            <author fullname="Saverio Mascolo" initials="S." surname="Mascolo">
              <organization>Politecnico di Bari</organization>
            </author>
            <date day="8" month="July" year="2016"/>
            <abstract>
              <t>   This document describes two methods of congestion control when using
   real-time communications on the World Wide Web (RTCWEB); one delay-
   based and one loss-based.

   It is published as an input document to the RMCAT working group on
   congestion control for media streams.  The mailing list of that
   working group is rmcat@ietf.org.


              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-rmcat-gcc-02"/>
        </reference>
      </references>
    </references>
    <?line 520?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The editors would like to thank Connor Smith for writing the initial draft.
The editors would also like to thank Sharad Jaiswal, Ilango Purushothaman, and
Brandon Schlinker for their contributions to the design of this QUIC extension.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA9Vc/VbkNpb/X0+hhT8Cu64aCrqThkwmU9BkQrYbWCCdk5OT
5ahcqioPLrti2ZAKIc+yz7JPtvdDkmWXq6Bncja7OZMJGFm6up+/e3XlXq8n
yqRM9ZHc+o9vz07k6c+lzsZ6LIfxXZY/pHo81XOdlXKSF/JKL/KiTLKpvFTx
nS7hQayTey1vkrk2pZovzJZQo1Gh7918XSPGeZypOSw5LtSk7CW6nPR+qpK4
V/DgXml6e69ErEo9zYvlkTTlWIhkURzJsqhMub+3d7i3L1Sh1ZG8KVRmkCzx
kBd30yKvFkcSlxZ3egmPxkfyLCt1kemy9xbXEwLoyMa3Ks0zoGGpjTBzVZS3
P1V5qc2RzHKxSI7kD2UeR9LAzIWeGPhpOccffhRCVeUsL46EkD0h4Z8iR/7p
cVLmBT1IMpjmrC+vH3RZ0hPe75nKgmd5MT2Sf8vzaarlu3cn9EzPVZIeyQT2
hOP+OqU/9+N8vnmxb/ryWJuZWgarfZMbvZiFz2nF97pU8jJVJUh0Dvs6y+J+
uPbfR/TCX+cwjhYWGQxUJQgGtyzff/vu5uxyePM17Kf3tl9Lb16lZbJQ5Qxk
lU0a71xdHZ+fHNEqTttw4MksKUBap5NJEieoZMN7IEGNgCHHIKKHZFzO5Kkp
E5wqz0gHz3WJggYNLGegSzjlGBTlSIJWHNCvTjxS1rzYukpGOinySH7oR/Iq
Af7Bf+DHYwX6k1R3/Nu5ui9gqTQChkYSSJDv+vIkL0EFUl5rUY3SJCZyYNZL
ZQxqN44cxrhd+T7PUDRoJN8BnWaWL7aEEL1eT6qRKQsVgwbezBIjwQwqMq2x
niSZNjCL1Gh+Bvda5rKcadJk0Hqr43JR5KCWeSofZkk8k6Za4GMjCm+ZLAXg
4IJN1NoU8N0ZILFxkZuyNwO6QdZ3brDpW0rnyXicaiG20XaKfFzFuGGk21Lk
rU5eOooeH//l6quTw729vacnpPM+GeOepNFxVejIE/azHos4zzIde5nS/uZJ
SRsAViekAsAsreZG5hOpFgvHdZS26v/BLEQ+bYOoQeKKOUOLwLamMALXhh+B
canceXz8ktmy//S061eTBqZJabt5lY17ZZEsaH65c3VzsytGSznXylSkR7gJ
+tukyOdAts6ArZa2BwVzIQdgs/SXpJTAGFV773FffJ0/6HtdgAzyAnYF+0mM
Bp6lailNMs1Uauxy4PjvE7VBd2bqXgskaAHOMisTleLKyRwFrolSFYO8VbxE
uWXWWEfemu0yKDRDZgOvCD2ZaLIeECHJe5WRkdRmAXSrNF2SzoAD01m87MVF
UoJqpCLQEWBJBaIF1oAGpT3iHapjjrNNdAEvIl9hlil4B6to8ATEeg76BCIx
oEaJIW1QKQShpJzNLb06nmXJTxUoW4pMVVPdwScRMqVWPV2QX8xi3YdIiyoA
0yRZnFZjdJQ9iQb2nR5d3XQqkycFZGdg4yMQV5KB5X3pPXExBxb0pnH89AT+
qjIwPwplnEx431qOQCYaFMXKOMHg2BvrBYRAEAztsfEnVRSg5amQvD3kKs6Y
ZIuKtC4BQZIq9UbKAEGW2FQXfbcj7+vRHCgWoC14TkrNLh4n9wGgVpnQFoRs
UsV2ARrTslm00PO8hJmWEZIL6h4IrtAQsIouuZFqkZWU4BwlIAQ7oQDZhbYK
bAdsAc+AAxAwS6fYxBur9kDDcAyBGkSIaht1rRfDKtZZSthPRXt3ZlPqFCyl
LOBVULVMJBOcfikB+QBKKVG8Y2QPrrmqLiyBbYhf2T2aKtoFSvct+kqiyrBH
B6AkESkZufX+2+ubrYj/K88v6OerU3BuV6dv8efrr4fv3vkfhB1x/fXFt+/e
1j/Vb55cvH9/ev6WX4ansvFIbL0ffr/FgXbr4vLm7OJ8+G4LeVs2vDvul/jM
wgcHVsLGlRENMzg+ufzv/xq8soFofzA4hEDEv7wZfPYKfkEHyavlGbgR/hU5
is5DqwJnAUmBUBZJCU4xQmWHCP6QyRlYD3DzX39Azvx4JP88iheDV3+xD3DD
jYeOZ42HxLPVJysvMxM7HnUs47nZeN7idJPe4feN3x3fg4d//hJCk5a9wZsv
/0KR7lw/yOHJv9/CnKdnH05vb87en17fDN9fXsuvCnSh36E5fUWYTz5uT/DZ
kxAX6G9QOTsUvw7TIOkMgD7EEpTqjtEapOaewADwFSg0AXnJIgcFkLADVH2a
eQ1VRIFFBWAiOs0fUIM4xosOcqwjW2gwGjkEFBEuhgaVZBUpoVvYxQcBFPBy
5BopSE0S55ivLcoZHPYP0E0FEAmMGWL1OIf30JYxsMIul13EgU/y4x4UB3ve
CpIyB708teQSGBhv5AoGHDnoAcxwvjKSDxBU5J5wvq/TL6bAQ4dGIDmUVwod
DlvTgn2cPD05B3dTZeh/r5M5uPLCoTDPJlkuF/Dezt7Pe/v9Pvz/wW60QZQi
FCXI6SFfmeZg8Nmbg73PeDL6+c0uCTQbIyDQaOiwQEGr0MvCxlxDFMeW4lCS
6GExvDO4Ao7tNTlmeFcGKSHkgbTlYiPj+5wNL0qCtNk6KUFeh+nV7UbVTgIM
mNvNKXwWSlaSbxoBYAOAwy4TRgTgWxcFyByoQWbKy6uLm4uTi3e3H84u3g3R
K4Bm/fbbb+t2xab/CDH5Bl/fSXblF7JbHhEMeqcKjFBhZWGML+HfkPVvCY8G
D0jDWJ/c46+SAmfwf1wZvdPv78p+v49Pf6jVkZ7/GHFKKP/0Jwe6wEwnEyb/
i4D2N5izrlQuaBLxRCx5PJLbk2Tas7qISe0XWxv5xN5x64ljLriIFAJuF0+i
mhtRmw9RmwORqEegKQZbVhaNsI4ytMHBOyjsLwLzs+opXuy7+nYP7O9zQiVd
/KJNon/nGJpk4vERmebrPH4ozYl87ZiFFMz92qUU7T86HWiJanVVJ7eORb8i
+ZC0upYGsH4kh4DYCspVe6nOpuBCEZ5M0WkQJ5fOXWbVfKTJztqTWTUAzsja
O/Vp5rQiYLuH/APwiekx6gaIhhPXWNlIZB2kCxA2xkkMJt2pa4sIQ5ux7hxW
XIOKKQhOK8yNrBdEWhCBQcTBnVqgLP12ER9/Ljmel6ZX0AokabG93WYFyHm7
HgQRTcEe2+xyeI/rCkWiXbbYpKwrIWvSaiADsOmrfcUSvYNGFAz0M+zyfvor
3MPlDWABcupotqXqdnU2HFmlEKkd01yfsC9EYLJtG3UZ5CuZ2lVqCmg1D4Od
uhXgOqgWtUaSGlm7yjReekXfd2pu7PZt4dcQYqAYVLDrKXRTG0RzW5Q5+4mZ
kx5BtN9tjxSjCoFSDZNcLrCqfQ3d61stqvfnyLVxEYNwWCmxIyOR9HWfQUlz
WnqPSBhhCl0HkczGc96TsFKMq6JA+AA8V1h2uU+A3ZB4EKaA0dEaCBBJBwAi
xGTPooEOmyaumrKo4pKqOqp2wpKdsDM273rbgke/u0GdXej1GW5bL9c5af4j
ogWM0xSNd56d5d/kYJf1ouXV3TacL2/vojPsAlaiE40520L7HeAd+MT1e3/G
+zcNXW4y9I7oRRhtTGuDnptqRDVjrv3hdGt8i53NY9g+7hyyFCoyRRhGLBo2
tYMBBVGFNWb7ftfsfXk2oWiysgO1Qj0nc+R+IhvT6lQKrYegKOf3G9Eogr2r
4fvT29Pzk4u3Z+d/uz29urq4atRUunXl46TTFZvZrZKWABnshDnUEvhqr9qy
9hZL+vIU8ohlh6TRBasEqzKlTLVC557p9uxHwcIc2o0V1Yp3d0jM+zsWOEWP
9cpMBRGYjixBredtsPj6pTNI62EuM1dYfmoqTB9PgtAIy7yE+Tcw3jKU9BgQ
DzhjBrLVHIa/xOcsUghryEwMd1jRWXGP3mDsIq6KAxYTa2DZXP18a3d5W4fP
WwBit7CndqYP87RKFg2XzNsivfzQrZXWJekszsdrSyYN8QagsbW56AWRUVJg
ZJCJlTaN66IWYLGVS6mEXpMSn+y7JH4BYKRwdHSwR/+8AK5nqAJB1Vshi0us
n/IbvmaJtYp6PsaxnfUfVh11RzHXFl5VXOTGbJKuky0Ti7TA0pYGV85mznKq
D+EcnJMBbbt5ztZtEr7RFKme5PCoRWRUuGmx7XakAD/SxkmPIKLRE9w3ywmC
gAWsbXoiX9uwhFGyR3gDD0iKVa8TWaq5cj5a2mwiIPaBzk2cpPSEq+FIm6s3
WD20gKZNEwjrOzyJCnTEi77OHfKq7OWTHskyQj2zJc6grkVxSXB1I0g5APqD
aqZra3+bEZOwSkGhD1XcBT85zw1nDlmZLmsOeBFOVTFO7QFVbYeiaVfXpL02
7IIIGXC7ox7KrtwxY8OyRciP4BCDOVlUmT39pPgaAxWqWKI2TYBzFovTHja6
LZEmkEYigwASVrY2a5JfdMMEo6bkvFwwVoUZFZ3cPsc3WyDEZVtZSJ42d7q9
Eed2lZnni56rNBObRrmV5MZysz10lL5dof6beHz03Q0gOi4Cusp0RIfLHTXo
F1Tr1hSiu/JUOpy3rPO8zEnrOeDEdJz2oiK18IeYjsTnK9Wv+gPUhpAPVKkW
K5XqzhD1sZXqZ3n3B5Wrmwyri80HGotmBxOuWb9Y9JsK14dBoVRh4VqsL1zL
zsI1JUTPW8+6Sm2DAETt2Fsjz8ZYIAEFKVwK9/+ogKteXMB1TsTlj8+zsc4o
T/I5gBugoT7jeN4HcAJOfuuJlahWVl8wBRxOaWZLEgQh3Ym6PHsLdmzymA/O
fBxr4j0Dv3r/3rAjYBHHfvRzjTIIwTOgwoaDLrC73l1ghgaYjMO2zbe7StHP
MUzseDbtMiJbW2FmBpp6CVuZ9sfDgpjerEFuc68jxYTzGm1CXAmxpxDPZAJg
x4OJHr8+GAxkqefg6jAyM7LGbVKPIzrk3Y/LS2HZZA4JT50mdSJXB6PxNR8O
HvIKuJImdyHg5CIV29rHwyZXaJJYCyDl6AL4qLkjrG5FPKZ5yAsxwfY/YTQl
3cN+Dhj2U4XNHLaNSQXFbwL+hIH/Caq53oYZHkyGOZ5NvINGD7IbrYtPzHrG
N4voshmAXfq46fiVGjZfEPCIB0gN8Cg3KPBndNAyFwC5seXGPZRU4xTBh2U+
S/BKQ80xLg+2paBfdJEHu/0c4fmiyGfJKLFx2745l+iZILtZrnCE8lmP+pWV
BCQMKeu4TshBsGMy2vXkUGMYdZl+RK2o++RyQ34aWO3+72q1fgEuUVODDrXl
UWZP7WRUbKGEu1nq5pKfPxBap0T8/gu0iFSBE21M3VCddlbOYnb73p59McBZ
MFYhJwpQcvMwCk+WjKnmFPvr3c8TzMdhW9g/Rh2GICaY/gO+i5NiK9z+nq32
w4zJ+HP2R2tUhlv47NovVQd0jqgQN1fD8+vLi6ub28shVhFvTq9s/ZD3u7F6
Ubs2ynkD5+YsDFHk8zbJjERznCG9MFnNyM5mMNfX5b2klfYmWt1RRjLNwJuN
o1aiigZLq/bp0G0lhMpjKj7Q2RtXHUKIzvjA50BWxZ1PzzRDnzGyZ44dQ1Zc
0artcZEjalRCLPoAsLDmoApV18BGcLGHBMaNgkJOlzJzkd9zeV2pxfGMmOT9
PxctjVdBUdumW5Sbx+j1AtvlqdcOrxOUHtKwQ5TjqmA4wQ7ObYOBzDq6UGdk
mseQmvAeyCKsd4/z+bzKuKIrXD1OU1n1qluVgppXzXR8zclC1Y0jCA5GJk+r
kvdNQeg+T8bWMaOJx0DanTTLLJ4VeZb8wht0/aTaaw1l2DkYyB23CrPrp2Ab
I2KOy0YeaAsM8SwH/4FHdGu4A8sbvwUq3zjmBo4A/nyndS0xZqRh4eIliVi5
Di6eleVovCAj4V8N2AlZNKjftIDsPb+3CVmaTLRrP7UdmJYKVhNXVLUUxNSb
TsXl+gCGzow/fdUbJaULKX1Zs8bDCmWPIBLqLOY9KGoFBhJiomkCI6x+Dr+3
7qCFFJdIhO0RYE/WF+tRjFopfhIccfuyKspbMnL/Pz/d7w1EEAZcl5QqqVpA
Lj+Id8gPtmcmxbUnYUM6/MxMEZTiUoNvMHF/I9LYSLVoUk3BhKtiH3c6teZs
alu+TUxcka2Twz0GUnqnkwni5GM9UwCACvC22DLc0/T4aa39cvTA0k8wnNV2
RUmmBaR5kypNlwJvdeD1iVhnoCI5enFdNA4VgiJN4FXWeGHRcUJugvZ14AiF
6no9Pj7tAWqyqajF2wx//sGyraxr7uAHSt9b7rdki6T2fLNG76EV214+37m9
o3bZy+GZlYW1dVLwXObXPqX4HPewM9rFoqw9mvlnshYQbu6b/Fb3C4yoMmoX
R18bdJ+HrfH+MKK+MII1ddht5S9duQsbUVirhgDGMQDkOtPjiu6q8I0RKsGD
AyqotIAZHL6AwF3Vzg8rviYsR/jz65XDGoABdNsHPCxiS69t9vzJVrZ9hcgw
kuFazHXyi+ag704u13QwubMd06h51xXRvoNGhRE2IFWm0ySo6A7BoL6qwCWW
JPN1W/JIlIQLlcKy4yV6OkbVYdB1KhecuropIBRDVhX0LAfJpzzL2OSwBcy0
yvWc+5MDn2g8rWuEAIY6wuW4qm4v2qzszPMP6MIZ7nf16W0vUghMkCSmSbkE
tzZ0B3zo6pGbqBLYg8LhBf9tXTLlGyYY4WYaLCwof3a1RftADeS75m1ynJaO
lDrp3Gk4HhU+qKVxM8HqE4L1wSUqpKk+8XLk+9jiT+JFm3C0nKQkdFfQ+2xM
WPR1Eh3S7MeRdcfHuGqblmEUHM1ZXAUPkmLl/DLgA/laG9hBzabU61vUuLZ1
dSzYGPchhVfHeHc+4xi3OqT8Xo8/p9SksXATTa9f1fUy+BUaVl+v0SCMSD0O
T9VdFw9YIQds1hnKL+eBBjTaYJKJK63YdgZRtuZT43u8nwXzmpKO9aRJ6dSb
dob3yWhrUbgm0oD9BjHj3VDqSE4dUSALrrjLo33tT+H9K3fehw3ltnnUrRFZ
7hmfdTEkdGmHT7kdJu5AsaxcgBSyKkXwuLRjQb3QKgnes/cmtBxcGqP2SYb/
BSKFQDdr3M+5Dd/lo7bMenwwE4FoIxhFEyNtK701ebwzyzeq8tqhkvQd/p+S
U+hjcdyYJpdqXDOt8GJvqW0O1UJWHPJKXDxBYbNOCPRTjPTtmZXFrZU2wSEr
EDFC6SEI8hfXQDSkzaTxKwkkQmF7I7HjhlvkZRoklYnB+5Vcj3ugLVAWyQ0T
I4i+6JAoV8SbZW52exkPI8GSWG8L3RarPW77k2mwpFzCViu8k2xT+8qoqU9n
1lXbYS9EH/VgMN+IxSSjwSsvM6KcYZiRbz7D7Q32sKA7pOrRM+0B/MLhgNTx
8FP7tmQ+1Md7ohEOOrJccI6/uq8VnDMmhH9+hd3ZwTUc+RVG9lr/yNVH+BBG
AoHNf36VB0Bg+yGOfNMx8nXnyMPVkYPOOQ/bT2HkfvfIwerIg+6Rn66OfN09
smPvrzt3dNix90+75+zY+2edIwdtNsPINx0j2Zcm5SdG+opGHWasJfsz5SaI
Qh9gUUp9LcgesYF354pTxEdZdPZ0xIewnd2iSLHA+wjdVwnk/uolg8HRxubb
I7mHZ6DXrodF+e5SXOr5Brkj+Qrffx02Hqy06Joj5GsEU/K/r+F/q5TuP0fp
4RpKDwe/I6H7bTpRGGI4sUCotCVrGww2ep5D6nY7fN3oUAK6RcPxyD/M8QB9
K+q/4g545EHHyPbbPPJVx8j2Mx7ZNnMc2WH6opGrxsqBfgh1D7JlUYg1bNAJ
Iqb4fYzr4B8wrtfrVPb1i1T2AF9/9axtHYKiDiK5H3U5gGfN6n/HAQyetf+D
/8P2f2YvkiO2TmIEvb5K1XL4qKAqNbmrQjfalmxWFBwHcO0W75Azfmyqrgfl
9mKmDxi2dYpLAoKukDiYTjjtGj+Vgrj8xAIsFdzSN+6PiyKHrLxMCHU2PgPh
mjL2B627xpRQRPzphsSI+giH9uBalMKDw46mq7pXpIJ9ZaVtLsc8kErXSFwP
v64CVNCGhgTF28S94Y6R+qsoUdenLvArMFhczNwHSgQh6yprLo4/ISd8+aaN
9Dsok6MKr4AT0q4ITwen//5TGxl+yQJLKZDZxngazAg9ySaQDjiZMx7/xIiO
HYAO1N+w0P4jRsgXCelVElPvLOWivJBVOFCovCgwh2oWneqDC5sFlDllUT1c
ifbRs6voriSjL88aZTqb7gZFrhBL2xKY/WCJDAs7nGkFGU1p6+u1KorHx0Yp
6Ik4xycSQW7eSE2J4ZRhu85UkdBZEZ1i4ru+52C0BLLpAy5kX+4LNjuQH8JE
pyfnkcSP6GCGWOTYK2vP3SG3s7OEsZvaDkxYg4M/lTqssDM3BGV91m+YvCpi
skB3yYKCf9jzEmEtAQ0Vz2qeayMq3Xc9EHoSjbnkQn5kq1KY4rtuM+GK3Sh7
y1g80jCmof8rDiI8dnjifB1LoYJLoWvaDV7Uo2k4J6ZinAjsybNgbI9ZXPut
jQK4fMR/IinhV5Em7lNPeLWRj1NWPVz/cOVOMn6uang+7PCe4cdE+Js4zZ6P
2mV3dDWZj2gB26X9bboZEXSe7LJo3dJhd+iaQ5C1Xzt4RkxiXbdpX14WeCIF
2hZ82cx9Mic4c09VbHsM8Us4c0W9B4WeJlQ+IH9iC/Vb7Q+EeT5uYUufl+B+
+1Y574Jf5+o+tnWuvPWq/ZalItH+82Uj7HUHbaiBCLcVPR5xPUKPv9iagMvQ
7logf07PtBrnsGR3h9oE9iWv5whVUVYPReL7fehDOuAyqF+o3zEXgYrmhNcz
4MhYfqMS86DSSJ6lAA5yeVkVlZmBS1PAXb6UdQxMHMOur+MZ+IQ7rJ2yriR8
HRssu7K+nDMPMHfwBgymQeeJld4f9cX/AH+/ObLuUQAA

-->

</rfc>
