<?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.31 (Ruby 3.2.3) -->
<?rfc rfcedstyle="yes"?>
<?rfc tocindent="yes"?>
<?rfc strict="yes"?>
<?rfc comments="yes"?>
<?rfc compact="yes"?>
<?rfc inline="yes"?>
<?rfc text-list-symbols="-o*+"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-mdt-quic-explicit-measurements-04" category="std" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="explicit-measurements">Application of Explicit Measurement Techniques for QUIC Troubleshooting</title>
    <seriesInfo name="Internet-Draft" value="draft-mdt-quic-explicit-measurements-04"/>
    <author initials="A." surname="Ferrieux" fullname="Alexandre Ferrieux" role="editor">
      <organization>Orange Labs</organization>
      <address>
        <email>alexandre.ferrieux@orange.com</email>
      </address>
    </author>
    <author initials="I." surname="Lubashev" fullname="Igor Lubashev" role="editor">
      <organization>Akamai Technologies</organization>
      <address>
        <email>ilubashe@akamai.com</email>
      </address>
    </author>
    <author initials="G." surname="Fioccola" fullname="Giuseppe Fioccola" role="editor">
      <organization>Huawei Technologies</organization>
      <address>
        <email>giuseppe.fioccola@huawei.com</email>
      </address>
    </author>
    <author initials="M." surname="Ihlar" fullname="Marcus Ihlar" role="editor">
      <organization>Ericsson</organization>
      <address>
        <email>marcus.ihlar@ericsson.com</email>
      </address>
    </author>
    <author initials="F." surname="Bulgarella" fullname="Fabio Bulgarella">
      <organization>Telecom Italia - TIM</organization>
      <address>
        <email>fabio.bulgarella@guest.telecomitalia.it</email>
      </address>
    </author>
    <author initials="M." surname="Cociglio" fullname="Mauro Cociglio">
      <organization/>
      <address>
        <email>mauro.cociglio@outlook.com</email>
      </address>
    </author>
    <author initials="M." surname="Nilo" fullname="Massimo Nilo">
      <organization>FiberCop</organization>
      <address>
        <email>massimo.nilo@fibercop.com</email>
      </address>
    </author>
    <author initials="I." surname="Hamchaoui" fullname="Isabelle Hamchaoui">
      <organization>Orange Labs</organization>
      <address>
        <email>isabelle.hamchaoui@orange.com</email>
      </address>
    </author>
    <date/>
    <area>Transport</area>
    <workgroup>QUIC</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 82?>

<t>This document defines a protocol that can be used by QUIC endpoints to signal
packet loss in a way that can be used by network devices to measure and locate
the source of the loss.</t>
      <t>Discussion of this work is encouraged to happen on the QUIC IETF mailing list
<eref target="mailto:quic@ietf.org">quic@ietf.org</eref> or on the GitHub repository which contains the draft:
<eref target="https://github.com/igorlord/draft-mdt-quic-explicit-measurements">https://github.com/igorlord/draft-mdt-quic-explicit-measurements</eref>.</t>
    </abstract>
  </front>
  <middle>
    <?line 92?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>Packet loss is a hard and pervasive problem of day-to-day network operation.
Proactively detecting, measuring, and locating it is crucial to maintaining high
QoS and timely resolution of crippling end-to-end throughput issues. To this
effect, in a TCP-dominated world, network operators have been heavily relying on
information present in the clear in TCP headers: sequence and acknowledgment
numbers, and SACKs when enabled. These allow for quantitative estimation of
packet loss by passive on-path observation.</t>
      <t>With QUIC, the equivalent transport headers are encrypted, and passive packet
loss observation is not possible, as described in <xref target="RFC9065"/>.</t>
      <t>Measuring TCP loss between similar endpoints cannot be relied upon to
evaluate QUIC loss. QUIC could be routed by the network differently and
the fraction of Internet traffic delivered using QUIC is increasing every
year. It is imperative to measure packet loss experienced by QUIC users
directly.</t>
      <t>The Alternate-Marking method <xref target="AltMark"/> defines a consolidated method to
perform packet loss, delay, and jitter measurements on live traffic. However,
as noted in <xref target="EXPLICIT-MEASUREMENTS"/>, applying <xref target="AltMark"/> to end-to-end
transport-layer connections is not easy because packet identification and
marking by network nodes is prevented when QUIC encrypted transport-layer header
is being used.</t>
      <t>This document defines the Explicit Flow Measurement Protocol (EFMP) which is
used by QUIC endpoints to enable packet loss measurements using Explicit
Host-to-Network Flow Measurement Techniques defined in <xref target="EXPLICIT-MEASUREMENTS"/>.</t>
      <t>Measurement bits are sent in dedicated EFMP packets that are coalesced with other
QUIC packets in UDP datagrams.</t>
      <section anchor="conventions">
        <name>Notational Conventions</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD",
"SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be
interpreted as described in <xref target="RFC2119"/>.</t>
      </section>
    </section>
    <section anchor="on-path-rtt-observation">
      <name>On-Path RTT Observation</name>
      <t><xref target="QUIC-TRANSPORT"/> already introduces an explicit per-flow transport-layer signal
for hybrid measurement of RTT. This signal consists of a Spin bit that toggles
once per RTT.</t>
    </section>
    <section anchor="on-path-loss-observation">
      <name>On-Path Loss Observation</name>
      <t>There are three sources of loss that network operators need to observe
to guarantee high QoS:</t>
      <ul spacing="normal">
        <li>
          <t><em>upstream loss</em> - loss between the sender and the observation point
(<xref target="upstreamloss"/>)</t>
        </li>
        <li>
          <t><em>downstream loss</em> - loss between the observation point and the destination
(<xref target="downstreamloss"/>)</t>
        </li>
        <li>
          <t><em>observer loss</em> - loss by the observer itself that does not cause downstream
loss (<xref target="observerloss"/>)</t>
        </li>
      </ul>
      <t>The upstream and downstream loss together constitute <em>end-to-end loss</em>
(<xref target="endtoendloss"/>).</t>
      <section anchor="on-path-loss-signaling-protocol">
        <name>On-Path Loss Signaling Protocol</name>
        <t><xref target="EXPLICIT-MEASUREMENTS"/> introduces several techniques for using explicit loss
bits in the clear portion of transport protocol headers to signal packet loss to
on-path network devices. The explicit loss bits used in this document are the
"sQuare signal" bit (Q) and the "Loss event" bit (L) (see <xref target="squarebit"/> and
<xref target="lossbit"/>). This approach follows the recommendations of <xref target="RFC8558"/> that
recommends explicit path signals.</t>
        <t>This document defines the Explicit Flow Measurement Protocol (EFMP) that takes
inspiration from <xref target="SCONE"/> that uses QUIC Long Header packets that are prepended
to QUIC v1 or v2 packets as carriers of path signals.</t>
        <t>While the exploitation of only Q can help in measuring the <em>upstream loss</em> and
only L can help in measuring the <em>end-to-end loss</em>, both are required to detect
and measure the other types of losses (<em>downstream loss</em> and <em>observer loss</em>).</t>
      </section>
      <section anchor="recommended-use-of-the-signals">
        <name>Recommended Use of the Signals</name>
        <t>The loss signal is not designed for use in automated control of the network in
environments where loss bits are set by untrusted hosts. Instead, the signal is
to be used for troubleshooting individual flows and for monitoring the network
by aggregating information from multiple flows and raising operator alarms if
aggregate statistics indicate a potential problem.</t>
      </section>
    </section>
    <section anchor="loss-bits">
      <name>Loss Bits</name>
      <t>The draft introduces two bits that are to be present in EFMP packets.</t>
      <ul spacing="normal">
        <li>
          <t>Q: The "sQuare signal" bit is toggled every N outgoing packets, as explained
below in <xref target="squarebit"/>.</t>
        </li>
        <li>
          <t>L: The "Loss event" bit is set to 0 or 1 according to the Unreported Loss
counter, as explained below in <xref target="lossbit"/>.</t>
        </li>
      </ul>
      <t>Each endpoint maintains appropriate counters independently and separately for
each connection 4-tuple and Destination Connection ID. Whenever this
specification refers to connections, it is referring to packets sharing the same
4-tuple and Destination Connection ID. A "QUIC connection", however, refers to
connections in the traditional QUIC sense.</t>
      <section anchor="squarebit">
        <name>Setting the sQuare Signal Bit on Outgoing Packets</name>
        <t>The sQuare bit (Q bit) takes its name from the square wave generated by its
signal. This method is based on the Alternate-Marking method <xref target="AltMark"/>.
The sQuare Value is initialized to the Initial Q Value (0 or 1) and is reflected
in the Q bit of every outgoing packet. The sQuare value is inverted after
sending every N packets (a Q run). Hence, Q Period is 2*N. The Q bit represents
"packet color" as defined by <xref target="RFC8321"/>.</t>
        <t>Observation points can estimate upstream losses by counting the number of
packets during one period of the square signal, as described in <xref target="usage"/>.</t>
        <section anchor="q-run-length-selection">
          <name>Q Run Length Selection</name>
          <t>The sender is expected to choose N (Q run length) based on the expected amount
of loss and reordering on the path. The choice of N strikes a compromise -- the
observation could become too unreliable in case of packet reordering and/or
severe loss if N is too small, while short connections may not yield a useful
upstream loss measurement if N is too large (see <xref target="upstreamloss"/>).</t>
          <t>The value of N MUST be at least 64 and be a power of 2. This requirement allows
an Observer to infer the Q run length by observing one period of the square
signal. It also allows the Observer to identify flows that set the loss bits to
arbitrary values (see <xref target="ossification"/>).</t>
          <t>If the sender does not have sufficient information to make an informed decision
about Q run length, the sender SHOULD use N=64, since this value has been
extensively tested in large-scale field tests and yielded good results.
Alternatively, the sender MAY also choose a random N for each connection,
increasing the chances of using a Q run length that gives the best signal for
some connections.</t>
          <t>The sender MUST keep the value of N constant for a given connection. The sender
can change the value of N during a QUIC connection by switching to a new
Destination Connection ID, if one is available.</t>
        </section>
      </section>
      <section anchor="lossbit">
        <name>Setting the Loss Event Bit on Outgoing Packets</name>
        <t>The Loss Event bit uses the Unreported Loss counter maintained by the QUIC
protocol. The Unreported Loss counter is initialized to 0, and the L bit of
every outgoing packet indicates whether the Unreported Loss counter is positive
(L=1 if the counter is positive, and L=0 otherwise). The value of the
Unreported Loss counter is decremented every time a packet with L=1 is sent.</t>
        <t>The value of the Unreported Loss counter is incremented for every packet that
the protocol declares lost, using QUIC's existing loss detection machinery. If
the implementation is able to rescind the loss determination later, a positive
Unreported Loss counter MAY be decremented due to the rescission, but it SHOULD
NOT become negative.</t>
        <t>This loss signaling is similar to loss signaling in <xref target="RFC7713"/>, except the
Loss Event bit is reporting the exact number of lost packets, whereas the Echo
Loss bit in <xref target="RFC7713"/> is reporting an approximate number of lost bytes.</t>
        <t>Observation points can estimate the end-to-end loss, as determined by the
upstream endpoint, by counting packets in this direction with the L bit equal
to 1, as described in <xref target="usage"/>.</t>
      </section>
    </section>
    <section anchor="usage">
      <name>Using Loss Bits for Passive Loss Measurement</name>
      <section anchor="endtoendloss">
        <name>End-To-End Loss</name>
        <t>The Loss Event bit allows an observer to calculate the end-to-end loss rate by
counting packets with the L bit value of 0 and 1 for a given connection. The
end-to-end loss rate is the fraction of packets with L=1.</t>
        <t>The assumption here is that upstream loss affects packets with L=0 and L=1
equally. If some loss is caused by tail-drop in a network device, this may
be a simplification. If the sender congestion controller reduces the
packet send rate after loss, there may be a sufficient delay before sending
packets with L=1 that they have a greater chance of arriving at the observer.</t>
      </section>
      <section anchor="upstreamloss">
        <name>Upstream Loss</name>
        <t>Blocks of N (Q run length) consecutive packets are sent with the same value of
the Q bit, followed by another block of N packets with an inverted value of the
Q bit. Hence, knowing the value of N, an on-path observer can estimate the
amount of loss after observing at least N packets. The upstream loss rate (<tt>u</tt>)
is one minus the average number of packets in a block of packets with the same Q
value (<tt>p</tt>) divided by N (<tt>u=1-avg(p)/N</tt>).</t>
        <t>The observer needs to be able to tolerate packet reordering that can blur the
edges of the square signal.</t>
        <t>The observer needs to differentiate packets as belonging to different
connections, since they use independent counters.</t>
      </section>
      <section anchor="losscorrelation">
        <name>Correlating End-to-End and Upstream Loss</name>
        <t>Upstream loss is calculated by observing packets that did not suffer the
upstream loss. End-to-end loss, however, is calculated by observing subsequent
packets after the sender's protocol detected the loss. Hence, end-to-end loss
is generally observed with a delay of between 1 RTT (loss declared due to
multiple duplicate acknowledgments) and 1 RTO (loss declared due to a timeout)
relative to the upstream loss.</t>
        <t>The connection RTT can sometimes be estimated by timing protocol handshake
messages. This RTT estimate can be greatly improved by observing a dedicated
protocol mechanism for conveying RTT information, such as the latency Spin bit
of <xref target="QUIC-TRANSPORT"/>.</t>
        <t>Whenever the observer needs to perform a computation that uses both upstream and
end-to-end loss rate measurements, it SHOULD use upstream loss rate leading the
end-to-end loss rate by approximately 1 RTT. If the observer is unable to
estimate RTT of the connection, it should accumulate loss measurements over time
periods of at least 4 times the typical RTT for the observed connections.</t>
        <t>If the calculated upstream loss rate exceeds the end-to-end loss rate calculated
in <xref target="endtoendloss"/>, then either the Q run length is too short for the amount of
packet reordering or there is observer loss, described in <xref target="observerloss"/>. If
this happens, the observer SHOULD adjust the calculated upstream loss rate to
match end-to-end loss rate.</t>
      </section>
      <section anchor="downstreamloss">
        <name>Downstream Loss</name>
        <t>Because downstream loss affects only those packets that did not suffer upstream
loss, the end-to-end loss rate (<tt>e</tt>) relates to the upstream loss rate (<tt>u</tt>) and
downstream loss rate (<tt>d</tt>) as <tt>(1-u)(1-d)=1-e</tt>. Hence, <tt>d=(e-u)/(1-u)</tt>.</t>
      </section>
      <section anchor="observerloss">
        <name>Observer Loss</name>
        <t>A typical deployment of a passive observation system includes a network tap
device that mirrors network packets of interest to a device that performs
analysis and measurement on the mirrored packets. The observer loss is the loss
that occurs on the mirror path.</t>
        <t>Observer loss affects upstream loss rate measurement, since it causes the
observer to account for fewer packets in a block of identical Q bit values (see
<xref target="upstreamloss"/>). The end-to-end loss rate measurement, however, is unaffected
by the observer loss, since it is a measurement of the fraction of packets with
the set L bit value, and the observer loss would affect all packets equally (see
<xref target="endtoendloss"/>).</t>
        <t>The need to adjust the upstream loss rate down to match end-to-end loss rate as
described in <xref target="losscorrelation"/> is a strong indication of the observer loss,
whose magnitude is between the amount of such adjustment and the entirety of the
upstream loss measured in <xref target="upstreamloss"/>. Alternatively, a high apparent
upstream loss rate could be an indication of significant reordering, possibly
due to packets belonging to a single connection being multiplexed over several
upstream paths with different latency characteristics.</t>
      </section>
    </section>
    <section anchor="implementation">
      <name>Implementation</name>
      <section anchor="efmp-packet">
        <name>EFMP Packet</name>
        <t>An EFMP packet is a QUIC long header packet that follows the QUIC invariants;
see <xref section="5.1" sectionFormat="of" target="INVARIANTS"/>.</t>
        <t><xref target="fig-EFMP-packet"/> shows the format of the EFMP packet using the conventions
from <xref section="4" sectionFormat="of" target="INVARIANTS"/>.</t>
        <figure anchor="fig-EFMP-packet">
          <name>EFMP Packet Format</name>
          <sourcecode type="artwork"><![CDATA[
EFMP Packet {
  Header Form (1) = 1,
  Reserved (1),
  Q Bit (1),
  L Bit (1),
  Spin Bit (1),
  Reserved (3),
  Version (32) = 0xTBD,
  Destination Connection ID Length (8),
  Destination Connection ID (0..2040),
  Source Connection ID Length (8),
  Source Connection ID (0..2040),
}
]]></sourcecode>
        </figure>
        <t>The most significant bit (0x80) of the packet indicates that this is a QUIC long
header packet.  The next bit (0x40) is reserved and can be set according to
<xref target="QUIC-BIT"/>.</t>
        <t>The six least significant bits of the first octet of an EFMP packet forms the
EFMP payload:</t>
        <dl>
          <dt>sQuare Signal Bit (Q):</dt>
          <dd>
            <t>The first bit of the EFMP payload (0x20) is is the sQuare signal
bit, set as described in <xref target="squarebit"/>.</t>
          </dd>
          <dt>Loss Event Bit (L):</dt>
          <dd>
            <t>The second bit (0x10) is the Loss event bit, set as described in <xref target="lossbit"/>.</t>
          </dd>
          <dt>Latency Spin Bit (S):</dt>
          <dd>
            <t>The third bit (0x8) is the latency spin bit. This bit is set to the value
of the spin bit in the QUIC Short Header packet that follows directly after the
EFMP packet in the same UDP datagram.</t>
          </dd>
        </dl>
        <t>The three least significant bits (0x7) are reserved for future use.</t>
        <t>An EFMP packet includes a Destination Connection ID field that is set to the same
value as other packets in the same datagram; see
<xref section="12.2" sectionFormat="of" target="QUIC-TRANSPORT"/>.</t>
        <t>The Source Connection ID field is set to match the Source Connection ID field of
any packet that follows. If the next packet in the datagram has a short header
(<xref section="5.2" sectionFormat="of" target="INVARIANTS"/>), the Source Connection ID field is empty.</t>
        <t>EFMP packets are always coalesced with other QUIC packets and SHOULD be included
as the first packet in a UDP datagram.</t>
      </section>
      <section anchor="tp">
        <name>Transport Parameter</name>
        <t>A QUIC endpoint indicates that it is willing to receive EFMP packets by including
the transport parameter:</t>
        <dl>
          <dt>efmp_supported (0xTBD):</dt>
          <dd>
            <t>efmp_supported transport parameter is an integer value, encoded as a
variable-length integer, that can be set to 0 or 1, indicating the level of
EFMP support. The value of 0 indicates that the endpoint is able to receive
EFMP packets but will not be sending any, while the value of 1 indicates
that the endpoint is also willing to send EFMP packets.</t>
          </dd>
        </dl>
        <t>A client MUST NOT use remembered value of efmp_supported for 0-RTT connections.</t>
        <t>Except for the cases outlined in <xref target="ossification"/>, it is RECOMMENDED for the
server to consistently include the efmp_supported parameter. This enables
clients to utilize loss bits at their discretion.</t>
      </section>
      <section anchor="efmp-packet-processing">
        <name>EFMP Packet Processing</name>
        <t>An EFMP packet is identified by the header form bit (0x80) of the first byte of
a UDP datagram payload and the 32-bit version field with the value (0xTBD) that
directly follows the first octet. Since the EFMP payload is part of the first
octet, an observer does not need to process a packet beyond the version field.</t>
      </section>
    </section>
    <section anchor="ossification">
      <name>Ossification Considerations</name>
      <t>Accurate loss reporting is not critical for the operation of the QUIC protocol,
though its presence in a sufficient number of connections is important
for the operation of networks.</t>
      <t>The use of EFMP is amenable to "greasing" described in <xref target="RFC8701"/> and MUST be
greased. The greasing should be accomplished similarly to the latency Spin bit
greasing in <xref target="QUIC-TRANSPORT"/>. Namely, implementations MUST NOT include
efmp_supported transport parameter for a random selection of at least one in
every 16 QUIC connections.</t>
      <t>It is possible to observe packet reordering near the edge of the square signal.
A middle box might observe the signal and try to fix packet reordering that it
can identify, though only a small fraction of reordering can be fixed using this
method. The Latency Spin bit signal edge can be used for the same purpose.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The measurements described in this document do not involve new packets injected
into the network causing potential harm to the network itself and to data
traffic. The measurements could be harmed by a malicious endpoint misreporting
losses or an attacker injecting artificial traffic. In the environments where
such attacks are possible and cannot be identified by on-path observers, loss
signal should not be used for automated control of the network.</t>
      <t>In the absence of packet loss, the Q bit signal does not provide any information
that cannot be observed by simply counting packets transiting a network
path. The L bit signal discloses internal state of the protocol's loss detection
machinery, but this state can often be gleaned by timing packets and observing
congestion controller response. Hence, loss bits do not provide a viable new
mechanism to attack QUIC data integrity and secrecy.</t>
      <section anchor="optimistic-ack-attack">
        <name>Optimistic ACK Attack</name>
        <t>A defense against an Optimistic ACK Attack <xref target="QUIC-TRANSPORT"/> involves a
sender randomly skipping packet numbers to detect a receiver acknowledging
packet numbers that have never been received. The Q bit signal may inform the
attacker which packet numbers were skipped on purpose and which had
been actually lost (and are, therefore, safe for the attacker to
acknowledge). To use the Q bit for this purpose, the attacker must first
receive at least an entire Q run of packets, which renders the attack
ineffective against a delay-sensitive congestion controller.</t>
        <t>For QUIC v1 connections, if the attacker can make its peer transmit data using a
single large stream, examining offsets in STREAM frames can reveal whether
packet number skips are deliberate. In that case, the Q bit signal provides no
new information (but it does save the attacker the need to remove packet
protection). However, an endpoint that communicates using <xref target="DATAGRAM"/> and uses
a loss-based congestion controller MAY shorten the current Q run by the number
of skipped packets. For example, skipping a single packet number will invert the
sQuare signal one outgoing packet sooner.</t>
      </section>
    </section>
    <section anchor="privacy-considerations">
      <name>Privacy Considerations</name>
      <t>To minimize unintentional exposure of information, loss bits provide an explicit
loss signal -- a preferred way to share information per <xref target="RFC8558"/>.</t>
      <t><xref target="QUIC-TRANSPORT"/> allows changing connection IDs in the middle of a QUIC
connection to reduce the likelihood of a passive observer linking old and new
subflows to the same device. Hence, a QUIC implementation would need to reset
all counters when it changes connection ID used for outgoing packets. It would
also need to avoid incrementing Unreported Loss counter for loss of packets sent
with a different connection ID.</t>
      <t>Accurate loss information allows identification and correlation of network
conditions upstream and downstream of the observer. This could be a powerful
tool to identify connections that attempt to hide their origin networks, if the
adversary is able to affect network conditions in those origin networks.
Similar information can be obtained by packet timing and inferring congestion
controller response to network events, but loss information provides a clearer
signal.</t>
      <t>Implementations MUST allow administrators of clients and servers to disable loss
reporting either globally or per QUIC connection. Additionally, as described in
<xref target="ossification"/>, loss reporting MUST be disabled for a certain fraction of all
QUIC connections.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document registers a new value in the QUIC Transport Parameter Registry:</t>
      <t>Value: 0xTBD (if this document is approved)</t>
      <t>Parameter Name: efmp_supported</t>
      <t>Specification: Indicates that the endpoint supports the explicit flow measurement
protocol.
   An endpoint that advertises this transport parameter can EFMP packets.
   An endpoint that advertises this transport parameter with value 1 can also
   send EFMP packets.</t>
    </section>
    <section anchor="contributors">
      <name>Contributors</name>
      <t>TBD</t>
    </section>
    <section anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The following people directly contributed key ideas that shaped this draft:
Kazuho Oku, Christian Huitema.</t>
    </section>
    <section anchor="change-log">
      <name>Change Log</name>
      <t>TBD</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="QUIC-TRANSPORT">
          <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="AltMark">
          <front>
            <title>Alternate-Marking Method</title>
            <author fullname="G. Fioccola" initials="G." role="editor" surname="Fioccola"/>
            <author fullname="M. Cociglio" initials="M." surname="Cociglio"/>
            <author fullname="G. Mirsky" initials="G." surname="Mirsky"/>
            <author fullname="T. Mizrahi" initials="T." surname="Mizrahi"/>
            <author fullname="T. Zhou" initials="T." surname="Zhou"/>
            <date month="December" year="2022"/>
            <abstract>
              <t>This document describes the Alternate-Marking technique to perform packet loss, delay, and jitter measurements on live traffic. This technology can be applied in various situations and for different protocols. According to the classification defined in RFC 7799, it could be considered Passive or Hybrid depending on the application. This document obsoletes RFC 8321.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9341"/>
          <seriesInfo name="DOI" value="10.17487/RFC9341"/>
        </reference>
        <reference anchor="EXPLICIT-MEASUREMENTS">
          <front>
            <title>Explicit Host-to-Network Flow Measurements Techniques</title>
            <author fullname="M. Cociglio" initials="M." surname="Cociglio"/>
            <author fullname="A. Ferrieux" initials="A." surname="Ferrieux"/>
            <author fullname="G. Fioccola" initials="G." surname="Fioccola"/>
            <author fullname="I. Lubashev" initials="I." surname="Lubashev"/>
            <author fullname="F. Bulgarella" initials="F." surname="Bulgarella"/>
            <author fullname="M. Nilo" initials="M." surname="Nilo"/>
            <author fullname="I. Hamchaoui" initials="I." surname="Hamchaoui"/>
            <author fullname="R. Sisto" initials="R." surname="Sisto"/>
            <date month="October" year="2023"/>
            <abstract>
              <t>This document describes protocol-independent methods called Explicit Host-to-Network Flow Measurement Techniques that can be applicable to transport-layer protocols between the client and server. These methods employ just a few marking bits inside the header of each packet for performance measurements and require the client and server to collaborate. Both endpoints cooperate by marking packets and, possibly, mirroring the markings on the round-trip connection. The techniques are especially valuable when applied to protocols that encrypt transport headers since they enable loss and delay measurements by passive, on-path network devices. This document describes several methods that can be used separately or jointly depending of the availability of marking bits, desired measurements, and properties of the protocol to which the methods are applied.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9506"/>
          <seriesInfo name="DOI" value="10.17487/RFC9506"/>
        </reference>
        <reference anchor="INVARIANTS">
          <front>
            <title>Version-Independent Properties of QUIC</title>
            <author fullname="M. Thomson" initials="M." surname="Thomson"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document defines the properties of the QUIC transport protocol that are common to all versions of the protocol.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8999"/>
          <seriesInfo name="DOI" value="10.17487/RFC8999"/>
        </reference>
        <reference anchor="RFC9065">
          <front>
            <title>Considerations around Transport Header Confidentiality, Network Operations, and the Evolution of Internet Transport Protocols</title>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="C. Perkins" initials="C." surname="Perkins"/>
            <date month="July" year="2021"/>
            <abstract>
              <t>To protect user data and privacy, Internet transport protocols have supported payload encryption and authentication for some time. Such encryption and authentication are now also starting to be applied to the transport protocol headers. This helps avoid transport protocol ossification by middleboxes, mitigate attacks against the transport protocol, and protect metadata about the communication. Current operational practice in some networks inspect transport header information within the network, but this is no longer possible when those transport headers are encrypted.</t>
              <t>This document discusses the possible impact when network traffic uses a protocol with an encrypted transport header. It suggests issues to consider when designing new transport protocols or features.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9065"/>
          <seriesInfo name="DOI" value="10.17487/RFC9065"/>
        </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="RFC8558">
          <front>
            <title>Transport Protocol Path Signals</title>
            <author fullname="T. Hardie" initials="T." role="editor" surname="Hardie"/>
            <date month="April" year="2019"/>
            <abstract>
              <t>This document discusses the nature of signals seen by on-path elements examining transport protocols, contrasting implicit and explicit signals. For example, TCP's state machine uses a series of well-known messages that are exchanged in the clear. Because these are visible to network elements on the path between the two nodes setting up the transport connection, they are often used as signals by those network elements. In transports that do not exchange these messages in the clear, on-path network elements lack those signals. Often, the removal of those signals is intended by those moving the messages to confidential channels. Where the endpoints desire that network elements along the path receive these signals, this document recommends explicit signals be used.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8558"/>
          <seriesInfo name="DOI" value="10.17487/RFC8558"/>
        </reference>
        <reference anchor="QUIC-BIT">
          <front>
            <title>Greasing the QUIC Bit</title>
            <author fullname="M. Thomson" initials="M." surname="Thomson"/>
            <date month="August" year="2022"/>
            <abstract>
              <t>This document describes a method for negotiating the ability to send an arbitrary value for the second-most significant bit in QUIC packets.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9287"/>
          <seriesInfo name="DOI" value="10.17487/RFC9287"/>
        </reference>
        <reference anchor="RFC8701">
          <front>
            <title>Applying Generate Random Extensions And Sustain Extensibility (GREASE) to TLS Extensibility</title>
            <author fullname="D. Benjamin" initials="D." surname="Benjamin"/>
            <date month="January" year="2020"/>
            <abstract>
              <t>This document describes GREASE (Generate Random Extensions And Sustain Extensibility), a mechanism to prevent extensibility failures in the TLS ecosystem. It reserves a set of TLS protocol values that may be advertised to ensure peers correctly handle unknown values.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8701"/>
          <seriesInfo name="DOI" value="10.17487/RFC8701"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="DATAGRAM">
          <front>
            <title>An Unreliable Datagram Extension to QUIC</title>
            <author fullname="T. Pauly" initials="T." surname="Pauly"/>
            <author fullname="E. Kinnear" initials="E." surname="Kinnear"/>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <date month="March" year="2022"/>
            <abstract>
              <t>This document defines an extension to the QUIC transport protocol to add support for sending and receiving unreliable datagrams over a QUIC connection.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9221"/>
          <seriesInfo name="DOI" value="10.17487/RFC9221"/>
        </reference>
        <reference anchor="SCONE">
          <front>
            <title>Standard Communication with Network Elements (SCONE) Protocol</title>
            <author fullname="Martin Thomson" initials="M." surname="Thomson">
              <organization>Mozilla</organization>
            </author>
            <author fullname="Christian Huitema" initials="C." surname="Huitema">
              <organization>Private Octopus Inc.</organization>
            </author>
            <author fullname="Kazuho Oku" initials="K." surname="Oku">
              <organization>Fastly</organization>
            </author>
            <author fullname="Matt Joras" initials="M." surname="Joras">
              <organization>Meta</organization>
            </author>
            <author fullname="Marcus Ihlar" initials="L. M." surname="Ihlar">
              <organization>Ericsson</organization>
            </author>
            <date day="14" month="December" year="2025"/>
            <abstract>
              <t>   This document describes a protocol where on-path network elements can
   give endpoints their perspective on what the maximum achievable
   throughput might be for QUIC flows.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-scone-protocol-04"/>
        </reference>
        <reference anchor="RFC8321">
          <front>
            <title>Alternate-Marking Method for Passive and Hybrid Performance Monitoring</title>
            <author fullname="G. Fioccola" initials="G." role="editor" surname="Fioccola"/>
            <author fullname="A. Capello" initials="A." surname="Capello"/>
            <author fullname="M. Cociglio" initials="M." surname="Cociglio"/>
            <author fullname="L. Castaldelli" initials="L." surname="Castaldelli"/>
            <author fullname="M. Chen" initials="M." surname="Chen"/>
            <author fullname="L. Zheng" initials="L." surname="Zheng"/>
            <author fullname="G. Mirsky" initials="G." surname="Mirsky"/>
            <author fullname="T. Mizrahi" initials="T." surname="Mizrahi"/>
            <date month="January" year="2018"/>
            <abstract>
              <t>This document describes a method to perform packet loss, delay, and jitter measurements on live traffic. This method is based on an Alternate-Marking (coloring) technique. A report is provided in order to explain an example and show the method applicability. This technology can be applied in various situations, as detailed in this document, and could be considered Passive or Hybrid depending on the application.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8321"/>
          <seriesInfo name="DOI" value="10.17487/RFC8321"/>
        </reference>
        <reference anchor="RFC7713">
          <front>
            <title>Congestion Exposure (ConEx) Concepts, Abstract Mechanism, and Requirements</title>
            <author fullname="M. Mathis" initials="M." surname="Mathis"/>
            <author fullname="B. Briscoe" initials="B." surname="Briscoe"/>
            <date month="December" year="2015"/>
            <abstract>
              <t>This document describes an abstract mechanism by which senders inform the network about the congestion recently encountered by packets in the same flow. Today, network elements at any layer may signal congestion to the receiver by dropping packets or by Explicit Congestion Notification (ECN) markings, and the receiver passes this information back to the sender in transport-layer feedback. The mechanism described here enables the sender to also relay this congestion information back into the network in-band at the IP layer, such that the total amount of congestion from all elements on the path is revealed to all IP elements along the path, where it could, for example, be used to provide input to traffic management. This mechanism is called Congestion Exposure, or ConEx. The companion document, "Congestion Exposure (ConEx) Concepts and Use Cases" (RFC 6789), provides the entry point to the set of ConEx documentation.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7713"/>
          <seriesInfo name="DOI" value="10.17487/RFC7713"/>
        </reference>
      </references>
    </references>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA61cW3fbxrV+n1+B2g+VekhGUpzEUeseK7Yca1WWbEluT5/i
ITEkpwYBBgNIZrXc336+vffMYABSStZZp2s1FknMbV++fR2Mx2PV2KYwx9nJ
el3YmW5sVWbVPDv9Qh9tk70z2rW1WZmyyW7MbFnaX1vjsnlVZx8+nr3Kbuqq
nRbGLauqseVC6em0NrfHmfETjFfdBE7l1azUKyyX13qO3/Jm/GtrZ+OdT48P
nqlcN3j6/vXJzelXhe2ZRVVvjjPX5ErZdX2cNXXrmqODgx8PjpSujT7GjnTp
1lXdqLuq/rzA/tbHvFf12WzwVX6cnZWNqUvTjF/TNpRrpyvrHI5+s1ljubPT
mzdKuUaX+S+6qEp8tTFOre2xyrJ6PjO5azaF/zbLmmqW/GnLHJsPXzjsozZz
Fz9vVr2PTW1n8eFZteKDJ5/XuvvZloUtu1XNl2ZcWNeMMee0KjBqXP3pv5TS
bbOsatrqGP+nYfjpZJK9MXVtTfuFv6wr2r/JbVPV/IWw5aQwX3Dq2vSfrurF
cXYJui5Mdq6njr80K22L40yHIZO5H/Ky4icn2H5/E2eT7Lydarc0t49t4gw8
7j/I65981lhRhLAqqoU1vX3YQka81Pzc9uo/gwS2ms2qQj+2+s+2dWa9Nv2H
eQdvW31nHt7Bwo+czP3Il0sesL2Vd5PsbFno+rF9vNP1rHXJc7yFU8iLc1WZ
rrviJyeWnnxp/APbi76ZZD+1xQJKUvhDyUJv9NRWw594sRtTGEyTnTW6sDob
Zzdn79KF5zRyMo0jXy4ADc2kkWGWR01ss3X2V9CSRWGr3mnbuur/EE+HX3Aa
+eVl1TZFVX3eSdMLW/TnhE6vqu5rPtQbOzX1q2rdX4OfnJR48uWcHphV653y
+1avZktdtTaVV6enOL4Z/PiY0lg/ZLIMQ1KlUWVVrwDFt4a0mKBrfHN1cnH9
/vLq5ji7evPqx4ODA/xyUjSQks/y1bfPDvHV6f+8Pz97dXYzfnd6cv3x6vTd
6cXNtTzw3cH3eODs4u8nV2cn4dvnP/74I5C0nKcrAm1Pfr46eSfjjo5o4utX
lxenOOv49cSaZj52M+DieF1XgLyqUGo8Hmc4ZFMDsJS6WVqXAexbthu5mQO4
XKaz8HzWLHWTzXSZTU0Grcmz6UbsiSnzdWUBgsDSzNlFqQsFEPxsmqyonAMj
MM2d3uycAZBOmI8Fb+3M8BTeoGSAKExAFkQ1SwNcbuuZIUtHn2jmiVKvrYMi
OW8CGzoDT4d/TTnDCL3AOph0qaHmeKjk0bxvshkZMRdGMCNYVn8hy/aSiDWB
KPwV8hAG/Gybt+00q826cqT1m+xuaWdL4H3ZaEgaP8QW8lj9Zdk0a3f8zTcL
2yzbKcnHNxYAWcCQffN7rOhfJ8Kclc3zwij1lKxfXeXtjGy9Uu9T4hKPlrrO
mVxrU99qB5kgtsHGr4gqud6Mm2qMfyK1KzzIjsNEva8r8B9Dig2Y0JgZ+QQj
zwT+M/KB6AT/AkvO6nZmdcHcwvGJBPTj0i6W6kN1zUMau6I5a+Oqog1Oyqy2
5LXgWUgN7crQk0tY/MVy3dLcDoA0yW4qZqYy8zl2NBIZunn1fpwDpUqIRE58
LvLR4EhV7UANnH9qwO2l0beW91BsaE0QL+oN9rPG3kjYrfB4Vhhd0wesQ0Nz
UwNBnIH3VM5EHEH4srorTL4gRqmyXQF4nJDo+uTV3yB9S6xrSg3i5zjGEivA
3hbVHftfv7a6hPfGapsBeO0quG89jYFerAnf8FBVjte6WWbV1BFvhWfqH5As
FuIR7xxbtLew6jhLE1ypcIIMQE+6UG/WoJpsNUwuaypeM1mAOFxWTQZZdxYH
wSBAg3Fg3hSEB4Xu7//AmPb9d1+/YjvvgrAw6eQIYAuxACBtYeQSkAAA0OTA
ALDFYr52TUpWKYMjtGCtaCcruPwJPS5yHgBTIrBBp47QYSEkNQ4PTuN0DBZz
AjUvc8F1JNrM53aGoxQ4fU1LO9o0L2IJqGZwR/krg983agOBgN1nkbcr0RmQ
LcGolGvQZZhykpUOGwFzNXxoW0OKi82EYNaQEcCGcNIx2QJabmXgAOYgq7cP
X78mCAyMgQrZnKXePwlyYTES5XQLIzqa3giT/2UbLJOlwEJoVvAJhBIwjtUd
HXWkNLM8cHenTfr6FRNDe1mV0q2CHp02qyiBY2wFG8D2S8PMcEGwsKUN+DnT
IE/YvyUf3M5DQEOMXHnqJGairCCHNA109xYDCAdI47wh8lKeDfcguqAsySXN
SNZn8pDNI/mJwdQbUt00onof7OHe6Zt37/e9HQBUPWwTBQ56stLjikhhWFK9
rRAhgJgX/sxbW0iCOtnz41yLCiqjp7YRUAjYl8ORnbFw0Yn8Np1Ya3puVgFa
HEn1HcFOBfrUik8ZHsUkH1+/h6Fp9KLWKzLMT59mF1XDvISdeFWVxC2WAfzv
/ums++KrKAUiPYL03GVP3n28vnkykn+zi0v+++oUK16dvqa/r9+enJ/HP8IT
128vP57jd+X/6ka+unwHUryWwe9O/vlEFOTJ5fubs8uLk/MnYgFSWaBzg3NT
A4MBLYK0EX12w+DR4eGPTOWn2WU5fk9ofXVzk112gKrU/X3fJ4TW6AJgk28w
j9h20vUyBuFkysdz4vxQlr2HReZkuZnWNk+FifAOi5PlwXHkUQYQuDeOftTZ
9Ro7hxAIg5tqsQB3VUUmDmvy6PQo5ySuvbOAW+SdEYWWtQmOGc/Oss3zbpvl
0ognJoYGPl2VLVqNwzWYgzyHDJ7DsVJ/yn5p1/BKjV7xfL8giumZFHYGoWDY
LPsZ+JgaL9Y7uL979/dhHhr+9es+z51Xd+Vvzb41XVwoJ6NdCiF4iW66dBF/
xnqwxCaZHT9CEU0xF3rllRFsFFDspsUyPBhrhYFxJdKbSCva4uBwxF1D6soi
AMcD5jP7JfG8eHsKU+NDU+E/fmpR4J4IXLMsEVC9jxHEg5CTCrUjA0O+Yj8V
JaAXxZ0WVgxNPW+M5D4499GziSFJcHFi3NHDWNjI4D0Nogx2zPprCywyhu8G
g6VRT9yHloGT13rCSrT3YT8KxxMmFNsl/+P5frbnIN739+5XGoovSfNh2+7v
aVX+vO+1FbaVfPElyEMOoxii2kiKKdeCniCEoM7z7757TrYXwqPiQy7BDzq3
7NT9P5k6AQz9GXCBkGdtJYSAr1WtsCkON/2OiJBOLOF5BTa/ZUZtmxbg6po0
OSc04MdvDynquj2Kz2ryGClLVfPhB8f6x9IWRnxgHKOyTUyHViXcwQ8cbi5N
sSauxpiGBwxRhrjCg84fGzRUnlE2hUHkw9TkhtcCchJJKZKM4Cqy6rMyNpt1
B5f4a28blGjgAEW8Ul4FXmOhjy7Gw6KeTjCBBdprhHe5AFz4jDGie4Yjqrap
Vmz4KYytwWg/WVAXWypT3tq6KsVRuWPk79RFvIiGgK0tOa2LuZZwX6BhZzgQ
uC4BStyLYqMqekY7afq5aKyY21ubt3h4zjpAhKAHV1VJcXfgg9+hwsp6sajN
wkenSXTHYrlqi8auISLdbLW2DD3BMsEQ63oF3JmrMBU2TIIExJw53hK5R5QL
gYcMp4VwRsJrsASmktX+JxBEqM8hfoqA2KrQK8q9UCGJP1PPa0Im5MMxY9Qu
yLHOW+1cwpTsIkNctKjoUH4KjthIIzR5hzAhU0PKzS5LgkS80rlfaQhe5D9Q
0FRlB6SShwh+Z/DPmAMVM+FjSfmQmphOgzn93ZK71F8+XTyCHpY+JawLjnLM
I3gcXNeWaO4nZC4IVIQwD5tbw3toKMcApiujJR3jY43s2bhpifH06OvOapMr
Gh45ez3J/oHogago6Qa3NrMuBqnN3FuXJIYZ+RQI/1h7agSwcksdRdTplVG/
cxcn2RMf6Yav4aMufWzW7UP1YimxkzCLufVuNs8BkXJGsOLaNE3cjgiS4ARJ
KwWDl0Fu3vsD3D/txEOk2Y8TW0f/7IsJIO+Fs6miaLwED83uKP+yAFlr7aN1
Ug2RYG/qfBRL8ZgmKPBZtt8TGE/SXf1dF62R0N2SXtp/C/zSZGfyFWyAPLUn
YizmWhhYgJZQD09JPh1BoGjVQKfEZ/Dr3nbr4lkODebYuiK3NKYPoJdBLvY0
Zq/bEqb+LSUIRvj43tRWaHD0pwuZXXYApRJgcOqJ92dghKv6icQfEvCBqvf3
/01+wLdHh6xOl0OnlVMtIcuUOIre6mAG1q4IqZzM6lJRWEvsXlVyZECb9fbB
M1pYuis71Dq9MBITQQw/ZFdtmZ2bcgFLeU2lhhhIBEfeSvpk1gj/ZrAHsFEX
JHIgW1bw2P2+tMQBekXnUCH+YJA3gCrjt89Pk+MgVMbkVhLJF1zN++yzLCvA
zspi2fGY3b00CggpKDxF6F3B3lH2iuN6nHimxRJ7diWrYzPfVCQYt9F0WlqY
QRxu60oXoOAduzGwgnXTy5esKGcL672xBstrspvztlA9VvbCv3RumLWFCf7n
IBTymSiRY6YEB9swSrBQ8Lxdk33/jCk5FcN3x6KRHXkF9r6OuMfsrcLX8WEi
gWlFpphR1WQpC0nqhK6PSVYEizOa3VV+CX6it4bkjDbeurN5ZZu1TL0U4Kau
8VetoZN8YheoQgnOAPdClbN5Gl/GqIxzyq6lpJkVk905GpwE/0wY77+GSOaw
I1SVUHoKHOmRYJQu4FMV5JBdvPj+2Qg6RYE4xx/CnKV2nMxW5gucDyeJ+sY4
n6tjJo/dTJOPw1JCv4kSsNTgsUVVkUY4+EJwLgLI8ky9zbw7+aeQ26ufhq9U
5gD3C3bBBhZ2pJJ8KUdsS136PIAEd7rPembPAssKI6fYZ3AMyYA7Uq1E+Cc9
gGDx/GzMmscmcsuRrQZLaIua5y+TaTxs8ySK8JB2uTDDWTzU6Wxghkle3Z1t
Zktv6TVczzv1oCkfkQaSWFM8d6ttQQjBXmLfGrOzdUrO1iOmODhLQohkCFkJ
jrB2eGHBZYoOVZcw546KEDwLYR4avG1SD0Yxzj33hlLtNJTRYeZ4QQKex1fi
mhr4pvbOXxwSAVmatn+XHZy/OJA46g5YvS/HiJwk3H5kJailgFb0nalKRQAn
W+cEJ2/CcXp0CJO/cRBWCD89awwv4efmSJ0tUQirsRuoL+gERjejpBjxR7KG
FH5QYZLW8IU5iMlKkyhiWoDjnKezKziYtGis3bBVAsswNfW2dHBI09SrILiF
Fle9o/9DRyNgmJoe9fLWBEeLl+EaLIJhquE1HtbUxeVNsJklh2i3JqQikhCV
AzcXK0WYdfhj6X2dH344/JaqEObLzKwZ5tVAK9g0cdLIK5r5omdN59swqbso
iQNa7fMgQD2Zjifqr9mfGDDCQcoX8awGs083kP3f4ZDx9vrpBO9LCZei4nb2
PkRLo573lqThJXHF5SZaluW5U1kYbV1QCH74uNOGmPYjC2OMbFmc3/uyIX+b
Jorun8pYwblTnOmmGp+WXoo44d9LMO4ENG/jQaEqMfEwbLO2eIBcGUUYIIXa
IsXg4FGBDxhCDh8zFmrnIlaEJK0r9tYCaHiwAJHa1Zof4nSJ9Y5J32nTXNh2
w0kOPMQdKuZVwWqesWkM5X5OEItowL6Mc8TKUh7vJzlHIgvwIBW7cI5wIjo7
PG1i+kGDBQkmu7qcCyrwbW18AgNU8ShGzwtFOOLxUtvwSclblbU6R4kLkvgW
BJfFqONwSDmfWVyajTha4AwoRdOLT8GFCwTb7DTKk1FIvHH9GKjrRQ4imXq8
Sv1UVLPPTqz9IKogF8LM2qYriScFsihJFM9HQVIxYBz5dK2wRJeS4pvSarJY
77DsI/qQsWe0eK4YHVKXQUCwzksZsXL0GgKIRANMURIOxXKM8KlzuqODH7cm
NrQvn8zivU/tp32qmpJHA0RqRQk0JfQXKe4lCKS7s28pI5Pwg5IT7X1af9rP
ON0ntLug9V4cjvXtYm+9/83FpxClxKNSCcn55Fkwck1VcKJhR+zV9RsVLTsh
yuQLcVC3otgHl4rdBbZbhLPSlNUqF94tjE+pXqooePMQbMm5xiRWzGx5+X1V
1QgoJYt5KgBEAEpoMBRt7xnOwgiELkp97HGPYcIDZ96PuXo5+NzmHN6Qwoqf
1o8tJ2EvnYGKWalH1nDtVNpmmqjqIoUd4vzRpX5Q4yP/0NgV9GAAxSSKklgC
MgZe+bK09lAD5oZS3iHXYfe868O+VnBcVEwM5610UZtBc4/b96bi6uZy9xxY
krxHuL/7SjhxG32iPhVFtpKogvZFgknATnOQNEUlFmyHN0TciqUubMYtEWYq
PE3G1vlInKaK6u+b6xg9QSFLKY3bIXd0V/GP0UC2MgS11q3YNHJ5nvs8aPok
2IVIt4gCvctErC9nm1hSVlydGla6uUwTs6y7dCy0skgWpvWebFdI4hJLWujc
baPTpopR54ay6u1AN6Bg7kF293yE552bB3oeSm3dm86ujuuytvR4pCIviHJV
iGVi0EzbckvOJunZrF2Jb7PdE1IxtSAaShIkUrwP0P0sE6nhBPBmDWYWvB6X
VLqt5YN42m88UdsdZCHnmvnykL/VDVfsN/Zrx+wMwCLZGPn1kgAh78WprrDd
aLHUNojLI+JH9Qpio6H/2i+P+/jIOt/6KV5KN4WXDZ3/q3XN7yALYYZupGKx
RRMP4q+7Ml50QwYNAnBEzLDE3/cIuQbZLCtnHsXqsEUVPbDd3Nr7ZGBmGZ+k
vXYLnhJbz7o13Jj/OaefXfZp73Dc7uM/+T5stfkUsfpT/mLP4Kdv+IFPniQx
XRcJ0mOTUidRgGEbi2oTulh01wKZxFFu4xqzokC7aHPO2wavt9FrJZ6vkGtl
61raTuT3QEtMzS09lH1iDE8HeSCiZKYuNs5KHq3XXyPZZJnd5H0XqiefIWRg
w8WzV1D42vWnkLx0CBbD0CALO/iUbCb4F9Z3jbgkbS3RE5XsWp8bm5u7pATf
99QkkTrjakmMlyRLqrZzx9I98RsI3PcUgI98JGDGsAtG5DeehBuaBx1Nj0Ve
0hsOzEgivdGgMSiQ9U5wl3dC8WacyAdb4cDb3TA3XHOWTFgCGTv4Q9ojKeGH
wAJapAbQNfTnvgoZMHnli+LdPa9t4qk7RouVXpS2gVpwXS1pZ+oCAjHevH9J
3XsyEfdr02xCNLKzwBDSBD1pmGSDfLKWXi5grmZ/eAeJYj8vR0Pp2cgX5xi1
TG3AKHQib5T3vALfej44xbjloug5WtLuGZy9L1Q8IrL5nqRuc6SFPlCJrnx0
b+AZkfBhL9wRIAmSs17aTRIfVMSX9K066dX0hZ2+r5ka5dN+GIGetOlHGpLL
W11bUML9WUm14tof6rvJIfc1x3sh7GPd38/tYkyLjmVeSBHMrJ9SPLggP+nW
2i6B3zVlqtDUE6rpOxb8z3/+gzBZ+jCSo2f3KgsNP2/Iq9s73M9eZIcjfH1l
vF+C7+jzB85++w/n6Qd2KZPP3chv+fPfETrRxva+PaLZD77c/PSavn8wMx/q
j3vP9x9/bu9gMjk6eHYg25BLJ4/NtPORZJKvRCh1f5w9HfAn43ucL56ktHvD
bHriM2SrypdIgk5wFf7gy/OD/cDJrZy7T6VYN5A51ZO5SZYJpH2Jk2KzkuX0
hCZs8PEEwWva/QFZ+wN7+T+d3bzgC0fPf2CR4FqL/eK91MHOY+A9t7Uja9gY
sfR9VWEDzCjkv90Ulc6PldruYNj7sI/vpX9FJvUV/ETGeTSd70jO561yr69G
cR6HT7mVFe23ywzqNnvn3Qacgf7kgZqHslqs9ZiQ53xonbQz5jyNq3id624d
8LaOyzyPqwSwcj4W8+Fhv5Mn5pNUyIGEZmCbXIy6Zuf87cMYFe4zdFG96oFd
2WV70r5wLyDSNfyAiOBMP+z7djoviOy8tA310LXc2TLE1s4ZfFirfW2UTtEn
B7fpSEYKTJHsXS+h7g8SDvHnTHyEgIyHR5MjErkdUS8ddic6yGa6fYiv0Dz+
OKIjXW528SNGpKzOfSaEbXMdWfu4y1+H2EtNytEQ4fdHv7UjatpYrRu61tK7
OUDc08Wd3riddwey3t0BvjolsdjUBF7mymcYRKu7I+mhQMHsxtvjAFF8SdUT
ijOaNUcXvesYQ5wU5bizReF9CMi1oZijdx7qYOJ9Ue66kZ6r0IocVoR6mvlq
/Ytr176Ctsc2SfR28NOO8YzWJYcmC3zybizdYczl4oFW7A5MCzMOobQ8O8rS
e5W9lr1RdK+8hS8AQ9TlKfzyGxqUUA+2jYlJCJiWF5lWfd5TAZDomfk7XqEj
CqIb2lx6Se3DbjW1ezVqSEg4xAWIQbvkSTYruNoQboxwyofiB0pQp6n2ASMI
Wg7GnI3rJUpOpcAY8hPU3uOozl10l236rSOhKzC5bBJGq6SYJRcxpIfRi7oc
uL+tKBUexOUCkVNySo7i28ZSaT5txmXa2RroDMNi/E3BvltKLd0z48jj2+Gh
hitYXceA9xk4Obfte3iTu2m4ItJXzWh5Q4jx7dGY4zPvtwmCxMqALwmIykip
PBqZ1DNOXIcJPAGfXe/beuoYgF/a26XiIaNedTE294TAbi3E6doBpmZT+e33
9i0XZBIBIHh0IF/tu/QpzZHKB0SUYv+Y6utKyb49G56AxN8xgxdu6IZjCGj6
dO0IukJXZrkJU7oFZ9LSndbeuvrM4A6eXdHysLlq53I+ZRLy1q30tjGNSSFX
JiQ7sycL3wD0ZNfFqOc/HBzKdYfQXab4eX8zNguDQ0KUIsIZZYAL65aYyHcE
UDqs2p1vjjPwmlsmOLvQKw5K+z0SrsMJr4RD7N4F0FIy9h1RLnQx9tKy3PhT
+raYw++HzUScgm18RwvfrE3uQ+2oX5V0A4bhIV/E9pNB1erE3xLPptUX/LlY
NnFCflqcZVbCmuk4h3v+QKkMBCUrErrqyLCwkHFGUkuvYi8Pk0zgzQ9mj9dq
uaNaGniF3+cD9oXd8fHS9wIEqWTHa93WIJekWDP4Ky1UZTNQOB8upQn0njz2
7/PkFescAuyquCWv6S7x+P4VeoK9zIX8IWXYuCIT7wAsNVBx8JS/0sX0rhgM
Vbxru7XFmAehmXz9GL4g3capWpe0xlsXAUP57l0SRqh709DGa79vNrQ136Ll
2/lh5TPfMLt1l0NJQohnEb8tSqYP/7wZ75uGYQ3ajSTL6fnp1dkPjRz9resm
pB0+YTUVQOs6arsk94dUciKEU50LeyQ3Iy1XqeAa+b3Eugi19REo7OiiYd23
Qst4z6TrHj7vrQ9Ti61RNzxfMqfDN7qJyhrw+o9u0MelYh+X9EyxgMpQUoQK
cZVU8gAsoRHIVwQTvznW9NRD/RsAMboNEHL0nbfgdSDSLbuVZmbqbuxqgZRV
Y+EQKCN5FreTdVBuYcDXmG38hcE1bZKSZNnJq79lJzyU3LPczOlWQqYXdMOD
8o67n90B4kFNyQP2zSqCweCd+2zX66Tz0L+PobuARYAtXmqdlHe7FpRuBMkJ
955InZJfH+GH5mlzvmc8tbqInEnLRdBDuQ0+mPyOyle8V2le94jG9JMBS50r
XhLYKplo7iTb43dO1MY32FAPzQigODdd5SwsTE3O8YDcFlmx4e5URoaQ8ZHl
R/0JVpTTFl8pBEHRrlGHCWeIfS2vS8GP/AFq5oxLpgSCyss7eKbAdynSj+mO
Crcc7m48gjS9CW8ruz0c3L6Z9/dN6sLt1+wKGSIFKfAKJ2Zx9a3IyueGpSle
sr7USKhX8uqSaj53PuS/vrk6PXlHho5KrDQ/vWsATPftrH3ZYcYKdtJ7Jabc
jOIhl7EnULonP17vCLwU2Z+0n3zPN1EyuDntLXnH6aQUAUtSde/xILQROu13
b3YQ5nlLIluqVqu29BGekOf+PrxAyPtrVE2CR094MZZLF7sRhjpDOafgSw2w
zpw6FzkJL+pgQlHKKShBrJoRm4kJa3rLSFTnmMnvU5rjSmmfksAqzeGx8zVs
RXYVvpUWMYQ+9lbPdngOFbU2AYsQTYEsZSMpcPJLvkBPKO3ENcOkB6KD0c7u
xJu3Kr19Sa9YIged7opREkSzD0bXxEyP53TzPr3XO3nglQEcCHELOztdaVIm
pqu8Q8g1VG75Th5jmaGmPvGn7WeI7LKS+xfDiiuVl2zJ17CqQgI5sg6unfrr
Fl0CzRdRo53xeedBa7KU3zrZhcIpcinjJT9+lQdVM7lH3/XP1zkSw9uOfE+E
J1ecLYiFutvK5l1TNo14qMOZpmW+JdVFav9TobcoFoV6e5oMA7uUp55b2y82
yZJSXxJvEZ/kKp978Fb/oP7n8wNdQU1u6tAdoaaqit4dmTQGlIuoTUPpO347
lpVEhAVxawvZijFgAFylc3L06ApNkgLypdToI3cHYFkkIzeYb6KufZ93Sirv
/FfT7sJCrJGs/DUquVFUe7n3WKR2eDu0sbAjTrs78bG2GBRBWMvbBugCX2gG
PNsVMcqLnHROeEHvTeP3WlB47fMy4hCxRyxNgY4Jxb5xF/L71phFUU2lj61m
9R8Ei5PsJA8XO7mu2g9p1HYGapBZCBe6/C68D57NgJ4gci+OwwpqR6xKVc6T
i5MdsVYaTdVmQTmtWpox7sLdyKSesCtBe8Wj6s2xUnw981hKeNmenQ+itfBm
BDhi+/TuszDDBb/Jrx+4K3Wd3uCl14Y+nMr0o3ynU3gLAr9zJQnTugsz9DbA
k6ExZbVorDRfWLczczDTwwve/9eZGI2EwIc8LeEdzbYrK0pNpVAOC9mHnIJt
P72mL0/6bY4SOkuOjTHVVNwWGbJvszAHJIje0QNB0OGq3VKvuWuT2CXvvvub
/ne7rLLLz+0oe7Xkgjl2+ba1gBote5L7V+fVQnb0vx66lJLRVgAA

-->

</rfc>
