<?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-zheng-quic-fec-extension-04" category="std" consensus="true" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="QUIC FEC">FEC Extension for QUIC</title>
    <seriesInfo name="Internet-Draft" value="draft-zheng-quic-fec-extension-04"/>
    <author initials="H." surname="Zheng" fullname="Zheng Huanhuan">
      <organization>Alibaba Inc.</organization>
      <address>
        <email>zhenghuanhuan.zhh@taobao.com</email>
      </address>
    </author>
    <author initials="Y." surname="Liu" fullname="Yanmei Liu">
      <organization>Alibaba Inc.</organization>
      <address>
        <email>miaoji.lym@alibaba-inc.com</email>
      </address>
    </author>
    <date/>
    <area>Transport</area>
    <workgroup>QUIC Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 47?>

<t>This document specifies a Forward Error Correction (FEC) extension
for the QUIC protocol, which provide protection against packet loss.</t>
    </abstract>
  </front>
  <middle>
    <?line 52?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>This document specifies an extension to QUIC version 1 <xref target="QUIC-TRANSPORT"/>
to supports Forward Error Correction (FEC).
FEC is a method of erasure control in data transmission by simultaneously
sending redundant data (see <xref target="RFC6363"/>). This redundancy allows the receiver
to detect and recover limited lost data without waiting for retransmission,
which can be beneficial in latency-sensitive scenarios.</t>
      <t>For instance, real-time communication frameworks like WebRTC, which is widely
applied in scenarios such as video conferenceing and voice call. FEC plays
an important role by recovering lost packets under unreliable network,
thereby optimizing user experience.</t>
      <t>QUIC-FEC might become a crucial foundation for MoQ (Media over QUIC),
which is primarily used for video stream transmission, which can migrate
the impact of packet loss on media transmission.</t>
      <t>This document defines how FEC framework take effects in QUIC transport process.
Since FEC extension introduce new QUIC frames and parameters, it requires
negotiation between two endpoints.</t>
      <t>This document does not define how the flows to be protected are determined,
nor does it defines how the redundant data are calculated via FEC schemes.</t>
      <t>This document also defines an optional Repair ACK frame (see <xref target="Repair-ACK-Frame"/>)
through which the receiver can notify the sender of source packets successfully recovered
via FEC decoding. This allows the sender to suppress unnecessary retransmissions,
thereby avoiding bandwidth waste, while ensuring that the notification does not
interfere with congestion control or RTT estimation.</t>
      <section anchor="definition">
        <name>Conventions and Definitions</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" 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>
        <t>We assume that the reader is familiar with the terminology used in
<xref target="QUIC-TRANSPORT"/>. In addition, we introduce the following FEC-related terms:</t>
        <ul spacing="normal">
          <li>
            <t>Source symbol: piece of information exchanged by two endpoints.
This document considers QUIC packets payloads as source symbols.</t>
          </li>
          <li>
            <t>Repair symbol: redundant information constructed from the combination
of several source symbols.</t>
          </li>
          <li>
            <t>Erasure: loss of one or more symbols</t>
          </li>
          <li>
            <t>Erasure correction code: algorithm generating repair symbols and reconstructing
missing source symbols from a set of source and repair symbols.</t>
          </li>
          <li>
            <t>Forward Erasure Correction: process of recovering erased symbols
before the detection of their erasure.</t>
          </li>
          <li>
            <t>FEC scheme: the conjunction of an erasure correction code and the specific protocol
elements required to use it with the design described in this document.</t>
          </li>
          <li>
            <t>Encoder: entity producing repair symbols using an erasure correction code.
The encoder can be a library used by the protocol implementation or a program
running in a separate process or machine.</t>
          </li>
          <li>
            <t>Decoder: entity reconstructing missing source symbols using an erasure correction code.
The decoder can be a library used by the protocol implementation or a program running
in a separate process or machine.</t>
          </li>
          <li>
            <t>Coding window: window of source symbols that are required to decode a repair symbol.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="architecture-overview">
      <name>Architecture Overview</name>
      <t>FEC Framework is designed as a module within QUIC-Transport layer.
The primary target of current draft is to establish
common mechanism for integrating FEC logic into the QUIC protocol,
thus ensuring interoperability across different QUIC instances.</t>
      <t>Endpoints use transport parameters in <xref target="QUIC-TRANSPORT"/> to negotiate
whether to enable the FEC mechanism. The FEC Framework specifies necessary
configuration information that needs to be exchanged between QUIC endpoints
using transport parameters during the QUIC handshake process.</t>
      <t>The FEC Framework operates within the QUIC-Transport layer. It facilitates
the transmission of FEC information and redundant data using QUIC frames.</t>
      <t>The FEC framework calls upon the FEC scheme to manage the detailed processes of FEC encoding and decoding.
The FEC scheme defines detailed algorithm process, and the procedures used to
identidy packet payload data in the context of FEC scheme. This draft will describe
the interface specification between FEC Framework and FEC scheme.</t>
      <t>FEC Framework MUST ensure compatibility with existing modules within the QUIC protocol.
Special attention is given to ensuring interoperability with the congestion control
and the ACK handling and retransmission decisions (see <xref target="QUIC-RECOVERY"/> and <xref target="RFC9265"/>).</t>
      <figure anchor="fig-fec-framework">
        <name>FEC Framework</name>
        <artwork><![CDATA[
        +------------------------------------------------------------+
        |                   Application layer                        |
        +------^-------------------------------^---------------------+
               |                               |
   Source data |                               | Recovered source data
               |                               |
 +-------------v-------------------------------|---------------------------+
 |                                             |                           |
 |          QUIC-Transport layer               |                           |
 |                                             |                           |
 |   +-------------------------------------v-------+                       |
 |   |              FEC Framework                  |                       |
 |   |                                             |       +-----------+   |
 |   |  +-----------+ +----------+ +-----------+   |<----->| FEC Scheme|   |
 |   |  | Handshake | |   SID    | |  Repair   |   |       |           |   |
 |   |  | Negotiate | |  Frame   | |  Packet   |   |       | - Encoder |   |
 |   |  |   (TP)    | | Handling | | Handling  |   |       | - Decoder |   |
 |   |  +-----------+ +----------+ +-----------+   |       +-----------+   |
 |   +---^-------------------------------^----------+                      |
 |       |                               |                                 |
 |   +---v-------------------------------v----------+                      |
 |   |   Congestion Control / ACK & Retransmission  |                      |
 |   +----------------------------------------------+                      |
 |                                                                         |
 +-------------^-------------------------------^---------------------------+
               |                               |
   Source pkts |                               | Repair packets
   (with SID)  |                               |
        +------v-------------------------------v---------------------+
        |                      UDP layer                             |
        +------------------------------------------------------------+
]]></artwork>
      </figure>
    </section>
    <section anchor="handshake-negotiation-and-transport-parameter">
      <name>Handshake Negotiation and Transport Parameter</name>
      <section anchor="transport-params">
        <name>Transport Parameter</name>
        <t>This extension defines several new transport parameters used to negotiate
the use of the FEC extension and specific FEC schemes during the connection handshake (see <xref target="QUIC-TRANSPORT"/>).
The new transport parameters are defined as follows:</t>
        <ul spacing="normal">
          <li>
            <t>fec_encode_schemes (current version uses 0xfece01): A list of variable-length integers
specifying the FEC schemes supported by endpoints for encoding. The presence of this transport parameter
indicates whether FEC functionality is enabled for encoding.</t>
          </li>
          <li>
            <t>fec_decode_schemes (current version uses 0xfecd02): A list of variable-length integers
defining the FEC schemes supported by endpoints for decoding. The content of this transport parameter
determines which FEC scheme is used for decoding.</t>
          </li>
        </ul>
        <t><xref target="fig-transport-param"/> introduce the transport parameter format of fec_encode_schemes and fec_decode_schemes:</t>
        <figure anchor="fig-transport-param">
          <name>Transport Parameter for FEC</name>
          <artwork><![CDATA[
FEC_ENCODER_SCHEMES TRANSPORT_PARAM{
  0xfece01 (i),
  Transport Parameter Length (i),
  Transport Parameter Value {
    FEC Encoder Schemes Length (i),
    FEC Scheme1 ID(i),
    FEC Scheme2 ID(i),
    ...
  }
}

FEC_DECODER_SCHEMES TRANSPORT_PARAM{
  0xfecd02 (i),
  Transport Parameter Length (i),
  Transport Parameter Value {
    FEC Decoder Schemes Length (i),
    FEC Scheme1 ID(i),
    FEC Scheme2 ID(i),
    ...
  }
}
]]></artwork>
        </figure>
        <ul spacing="normal">
          <li>
            <t>fec_max_symbol_num (current version uses 0xfecb02): A variable-length integer indicating
the block size (i.e., the number of symbols in each encoding group) used in block encoding.
This is an optional transport parameter and SHOULD be sent only when an endpoint uses block code schemes
for encoding. For coding methods such as convolutional codes that do not require a fixed block size,
this parameter SHOULD NOT be included.</t>
          </li>
        </ul>
        <t>For a single endpoint, FEC encoding and decoding are independent processes. By negotiating these separately,
the framework can support distinct FEC schemes for encoding and decoding, or enable unidirectional
encoding/decoding only. This flexibility allows FEC operations to adapt to diverse requirements
and configurations.</t>
        <t>The scheme identifiers used in these parameters are defined in
<xref target="fec-scheme-ids"/>.</t>
        <t>During negotiation, if a receiver's encoder scheme matches any of the sender's encoder schemes,
the negotiation for that direction is considered successful.</t>
      </section>
      <section anchor="handshake-nego">
        <name>Handshake Negotiation</name>
        <t>Endpoints negotiate the transport parameters for FEC during the connection handshake,
as outlined in Section 3.1.</t>
        <t><xref target="fig-fec-handshake"/> illustrates an example of the negotiation process:</t>
        <figure anchor="fig-fec-handshake">
          <name>Handshake negotiation for FEC</name>
          <artwork><![CDATA[
Client                                       Server
        ------------------------------------>

        fec_encode_schemes={REED_SOLOMON,XOR}

        fec_decode_schemes={XOR}

        fec_max_symbol_num=10

        <------------------------------------

                     fec_encode_schemes={XOR}

            fec_decode_schemes={REED_SOLOMON}

                         fec_max_symbol_num=5
]]></artwork>
        </figure>
        <t>Please note that in the actual process, the Client first declare the list of encoder/decoder algorithms
it can handle. When the server receive the fec_encode_schemes and fec_decode_schemes,
it chooses one proper scheme for each direction, and set fec_decode_schemes and fec_encode_schemes params
as corresponding scheme for decoding and encoding.</t>
        <t>Note that if the client wants to specify the FEC algorithm, it can provide only one FEC algorithm
for fec negotiation process, the server could choose to support or not; otherwise, the algorithm selection
SHOULD be based on the server's priority.</t>
        <t>For example, if the client's FEC schemes parameter is set as follows:</t>
        <ul spacing="normal">
          <li>
            <t>fec_encode_schemes {Algorithm1, Algorithm2, Algorithm3, ...}</t>
          </li>
          <li>
            <t>fec_decode_schemes {Algorithm1, Algorithm2, Algorithm3, ...}</t>
          </li>
        </ul>
        <t>The encoder/decoder algorithm used in practice is chosen and returned by the Server:</t>
        <ul spacing="normal">
          <li>
            <t>supported_fec_encode_schemes {Algorithm1}</t>
          </li>
          <li>
            <t>supported_fec_decode_schemes {Algorithm3}</t>
          </li>
        </ul>
        <t>Note that the encoding/decoding option and the selected algorithm may differ after
negotiation.</t>
      </section>
      <section anchor="fec-scheme-ids">
        <name>FEC Scheme Identifiers</name>
        <t>FEC Scheme IDs are QUIC variable-length integers. Endpoints MUST use IDs from
the QUIC FEC Scheme IDs registry (<xref target="iana-fec-scheme-ids"/>) in
fec_encode_schemes and fec_decode_schemes. An endpoint MUST NOT select an
unrecognized scheme ID during negotiation.</t>
        <t>The QUIC FEC Scheme IDs registry is distinct from the FECFRAME FEC Encoding
IDs registry created by <xref target="RFC6363"/>. The initial QUIC assignments appear in
<xref target="fec-scheme-assignments"/>.</t>
        <ul spacing="normal">
          <li>
            <t>Reed-Solomon (8) reuses the FECFRAME value assigned in Section 8 of
<xref target="RFC6865"/> for the Simple Reed-Solomon FEC Scheme, which builds on the
Reed-Solomon code in <xref target="RFC5510"/>.</t>
          </li>
          <li>
            <t>XOR (11) is a new QUIC assignment for XOR parity. Section 4 of
<xref target="RFC5109"/> describes the parity operation.</t>
          </li>
          <li>
            <t>Packet Mask (12) is a new QUIC assignment for XOR parity over a subset
of source packets identified by a bitmask. Section 4.2.2.1 of <xref target="RFC8627"/>
describes this use of a bitmask.</t>
          </li>
        </ul>
        <t>The assignments define the values used for QUIC negotiation. Each scheme
needs a QUIC specification for its symbol construction and any
scheme-specific encoding in the Repair Symbol frame (<xref target="Repair-Symbol-Frame"/>).</t>
      </section>
    </section>
    <section anchor="transport-mechanism">
      <name>Transport mechanism</name>
      <t>The FEC module directly participates in and influences the sending and receiving stages
of packet transmission:</t>
      <t>As the sender, the FEC Framework takes the original data frame as source symbols and provides
the required source symbols to the FEC scheme module. The FEC scheme can encode the data grouped
by streams, or mixed data from different streams.</t>
      <t>FEC Framework retrieves the following information from the FEC scheme:</t>
      <ol spacing="normal" type="1"><li>
          <t>Source Symbol ID (SID) frame: SID frame is viewed as an unique identification for source symbol,
which is composed of block ID and symbol index typically.</t>
        </li>
        <li>
          <t>Repair packets: When the incoming source symbols meets the encoding conditions, the FEC scheme
could generate original source symbol with repair packets. Repair packet contains FEC Payload ID,
repair symbol, and optional repair key.</t>
        </li>
      </ol>
      <t>At the sender, FEC Framework is required to acquire and insert the SID frame into the packet
that includes the source symbols. Subsequently, FEC Framework SHOULD generate and transmit repair packets
to the receiver after processing a sufficient number of source symbols. Generally, the repair packets
SHOULD be sent immediately following the source packets from the same block.</t>
      <t>As the receiver, the source packets can be normally parsed by ignoring SID frame, but it might be
necessary to store source symbols and identifications to perform FEC decoding after receiving
repair packets from the same block.</t>
      <figure anchor="fig-fec-work-flow">
        <name>Work Flow for FEC</name>
        <artwork><![CDATA[
+-------------------------------------------------------------------------------+
|                               Application                                     |
+-------------------------------------------------------------------------------+
            |                                                      ^
            | Application data                Received & recovered |
            |                                     application data |
            |                                                      |
      +-----v-----+                                          +-----|-----+
|-----| Send API  |------------------------------------------| Recv API  |------|
|     +-----|-----+                                          +-----^-----+      |
|           |                                                      |            |
|           |                                       Source packets |            |
|           | Source packet                     & recovered source |            |
|           |                                              packets |            |
|    +------v------+                QUIC                    +------|------+     |
|    | FEC Encoder |                                        | FEC Decoder |     |
|    +------|------+                                        +------^------+     |
|           |                                                      |            |
|           | Source packets                        Source packets |            |
|           | with SID frame                        with SID frame |            |
|           | & Repair packets                    & Repair packets |            |
|           |                                                      |            |
|   +-------v-------+                                      +-------|-------+    |
----| Packet Sender |--------------------------------------|Packet Receiver|-----
    +---------------+                                      +-------^-------+
            |                                                      |
            | QUIC packets                            QUIC packets |
            v                                                      |
+-------------------------------------------------------------------------------+
|                                 Network                                       |
+-------------------------------------------------------------------------------+
]]></artwork>
      </figure>
      <section anchor="sender-operation">
        <name>Sender Operation</name>
        <t>### Define FEC-protected QUIC payload</t>
        <t>Endpoints can decide which types of data require FEC protection.
As applying equal protection to all data types may result in inefficient bandwidth utilization,
it is RECOMMENDED that protocol implementations selectively prioritize protection for critical data,
such as restricting FEC to stream frames and datagram frames.
For retransmitted frames or non-time-sensitive data, FEC SHOULD NOT be applied.</t>
        <section anchor="identify-source-symbols-using-sid-frame">
          <name>Identify source symbols using SID frame</name>
          <t>In the context of packets that require protection through FEC (Forward Error Correction),
it is necessary to define a SID (Source Identifier) frame that conveys the identity information
of the data. This is intended to help the receiver clarify the following information
during the decoding process:</t>
          <ul spacing="normal">
            <li>
              <t>Which part of data insides the packet will be taken part in the FEC decode process.</t>
            </li>
            <li>
              <t>Which block and the index inside the block the source symbol belongs to.</t>
            </li>
          </ul>
          <t>Therefore, it's recommended to append the SID frame after the fec-protected QUIC packet data
to indicate that the data preceding this frame is identified by the current SID frame and
is involved in the decoding process at the receiver.</t>
          <t>Based on the above reason, generating and inserting the SID frame SHOULD occur
before the encryption process of packets.</t>
          <t>As the FEC module requires an additional data frame to be appended after the protected packet,
developers MUST consider reserving space for the FEC data frames within the packet.
This ensures that the length of the packet does not exceed the MTU (Maximum Transmission Unit) limit.
Additionally, the SID MUST include Explicit Source Payload ID information to facilitate
the resolution of the current data's identity, as shown in Figure 6.</t>
        </section>
        <section anchor="generate-and-send-repair-symbols">
          <name>Generate and send repair symbols</name>
          <t>The sender generates repair symbols from the source data identified by SID
frames. The Repair Symbol frame (<xref target="Repair-Symbol-Frame"/>) identifies the flow
and block to which the repair symbol belongs.</t>
          <t>The specific encoding process is carried out by the FEC scheme module, which typically requires
the sender to pre-set the following parameters:</t>
          <ul spacing="normal">
            <li>
              <t>Block size: How many original packets are involved in the calculation for a computing unit,
which directly affects the frequency of Repair symbol generation.</t>
            </li>
            <li>
              <t>Redundancy level of FEC: How many redundant packets can be generated from the block.</t>
            </li>
            <li>
              <t>Repair key (optional): The encoding key required by the FEC scheme module, which usually
needs to be included in the Repair package for the receiver to use for decoding.</t>
            </li>
          </ul>
        </section>
        <section anchor="fec-admission">
          <name>FEC gate (optional)</name>
          <t>In addition to the sending procedures above, a sender using block-based
FEC can apply an admission policy (an FEC gate) before protecting a new
block. The policy can consider queued source data, congestion-control
state, and expected repair overhead. If protection is declined, source
data can be transmitted without FEC, subject to ordinary QUIC sending
constraints. This decision does not change the negotiated FEC capability
or scheme.</t>
          <t>A sender can limit repair overhead with a local redundancy budget.
Such a budget does not replace the applicable congestion-control rules
for sending repair traffic (see <xref target="QUIC-RECOVERY"/> and <xref target="RFC9265"/>).</t>
        </section>
      </section>
      <section anchor="receiver-operation">
        <name>Receiver Operation</name>
        <section anchor="process-recovered-symbols">
          <name>Process recovered symbols</name>
          <t>In the FEC module, the block triggering the decoding module generally needs to satisfy the following conditions:</t>
          <ol spacing="normal" type="1"><li>
              <t>The block receives a sufficient number of source symbols;</t>
            </li>
            <li>
              <t>The block receive at least one repair symbol.</t>
            </li>
          </ol>
          <t>However, the specific required amounts of source symbols and repair symbols SHOULD be
determined by the FEC schemes module.</t>
        </section>
      </section>
      <section anchor="fec-recovery-optimization">
        <name>Repair ACK (optional)</name>
        <t>The optional Repair ACK mechanism in <xref target="Repair-ACK-Frame"/> can reduce
redundant retransmissions through cooperation between the receiver and
sender. After reconstructing source packets, the receiver can report
their packet numbers. The sender can then associate these numbers with
data still awaiting retransmission and avoid sending that data again.</t>
        <t>This optimization follows the sender-processing rules in
<xref target="Repair-ACK-Frame"/>, keeping retransmission suppression separate from
RTT estimation, loss detection, and congestion control. FEC recovery does
not establish that the original packet arrived over the network (see
also <xref target="RFC9265"/>). Suppression concerns the information carried by
packets, since QUIC retransmits information in new packets
(see <xref target="QUIC-TRANSPORT"/>, Section 13.3).</t>
      </section>
    </section>
    <section anchor="fec-frame-types">
      <name>FEC Frame Types</name>
      <t>FEC will introduce three new frames into QUIC protocol: the Source Symbol ID (SID) frame,
which SHOULD be attached to the original packet; the Repair Symbol frame,
which contains repair data and SHOULD be encapsulated and transmitted independently;
and the optional Repair ACK frame, which allows the receiver to notify the sender
of source packets that have been successfully recovered via FEC decoding.</t>
      <t>Fields marked (i) use QUIC variable-length integer encoding
(<xref target="QUIC-TRANSPORT"/>, Section 16). The Type field uses the shortest
encoding as specified in Section 12.4 of <xref target="QUIC-TRANSPORT"/>.
Frame diagrams are schematic; trailing ellipses indicate variable-length
fields. The 32-bit value illustration below shows a decoded Payload ID.</t>
      <section anchor="SID-Frame">
        <name>Source Symbol ID Frame</name>
        <t>FEC SID FRAME contains the identification of the current source packet,
which declares the encoding flow and the block current symbol is involved.</t>
        <t>SID Frame SHOULD be inserted after the fec-protected QUIC frame to indicate
the range of FEC protected data.
Since the maximum length of the repair symbol is equal to that of the source symbol,
it is necessary to restrict the content length of the source packet to prevent
the content length of the repair packet from exceeding the MTU limit.</t>
        <t>SRC_SYMBOL_ID Frame Structure:</t>
        <figure anchor="fig-src-symbol-id-frame">
          <name>SRC_SYMBOL_ID Frame</name>
          <artwork><![CDATA[
SRC_SYMBOL_ID Frame {
  Type (i) = 0xfec5,
  Flow ID (i),
  Explicit Source Payload ID(i),
}
]]></artwork>
        </figure>
        <figure anchor="fig-src-symbol-id-lengths">
          <name>SRC_SYMBOL_ID Frame Layout</name>
          <artwork><![CDATA[
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Type (i) = 0xfec5                        ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                         Flow ID (i)                         ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                Explicit Source Payload ID (i)               ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <ul spacing="normal">
          <li>
            <t>Flow ID (i): A variable-length integer that identifies which data stream the symbol belongs to.</t>
          </li>
          <li>
            <t>Explicit Source Payload ID (SID): A variable-length integer that serves as a unique identifier
for the source symbol. It MUST includes the block id and the symbol index of current source symbol.
This can be formatted as follows.</t>
          </li>
        </ul>
        <t>The Explicit Source Payload ID is encoded as a single QUIC variable-length
integer. Its value is formed as follows:</t>
        <artwork><![CDATA[
payload_id = (block_id << 8) | symbol_idx
]]></artwork>
        <t>The symbol_idx occupies the least significant 8 bits (1 byte). After decoding
the QUIC variable-length integer, the components are recovered as follows:</t>
        <artwork><![CDATA[
block_id   = payload_id >> 8
symbol_idx = payload_id & 0xff
]]></artwork>
        <t>The following 32-bit illustration is an example of the decoded value layout.
It does not impose a 24-bit limit on block_id or a four-byte wire encoding.</t>
        <figure anchor="fig-explicit-source-payload-id">
          <name>Example Decoded Explicit Source Payload ID</name>
          <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    block_id                   |  symbol_idx   |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
      </section>
      <section anchor="Repair-Symbol-Frame">
        <name>Repair Symbol Frame</name>
        <t>A Repair Symbol frame carries one repair symbol and identifies the flow and
block it protects. The frame has the following format, where (i) denotes a
QUIC variable-length integer (<xref target="QUIC-TRANSPORT"/>):</t>
        <figure anchor="fig-repair-symbol-frame">
          <name>REPAIR_SYMBOL Frame</name>
          <artwork><![CDATA[
REPAIR_SYMBOL Frame {
  Type (i) = 0xfec6,
  Repair ID {
    Flow ID (i),
    Explicit Repair Payload ID {
      Block Number (i),
      Repair Index (i),
    },
  },
  Repair Key {
    Repair Key Length (i),
    Repair Key (..),
  },
  Repair Symbol {
    Repair Symbol Length (i),
    Repair Symbol (..),
  },
}
]]></artwork>
        </figure>
        <t>Braces group the existing fields without adding bytes. The length
fields count only the corresponding byte strings.</t>
        <t>The Explicit Repair Payload ID consists of Block Number followed by
Repair Index, encoded as two separate QUIC variable-length integers.
Unlike the Explicit Source Payload ID, the block number and index
are not combined into a single integer.</t>
        <artwork><![CDATA[
Explicit Repair Payload ID = varint(Block Number) || varint(Repair Index)
]]></artwork>
        <t>Here, varint denotes QUIC variable-length integer encoding and || denotes
concatenation of the encoded byte strings, in the order shown.</t>
        <figure anchor="fig-repair-symbol-lengths">
          <name>REPAIR_SYMBOL Field Lengths</name>
          <artwork><![CDATA[
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Type (i) = 0xfec6                        ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                         Flow ID (i)                         ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                       Block Number (i)                      ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                       Repair Index (i)                      ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Repair Key Length (i)                    ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|             Repair Key (Repair Key Length bytes)            ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Repair Symbol Length (i)                  ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|          Repair Symbol (Repair Symbol Length bytes)         ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <ul spacing="normal">
          <li>
            <t>Flow ID: The flow to which this repair symbol belongs, using the same
identifier as the SID frames for the protected source symbols.</t>
          </li>
          <li>
            <t>Block Number: The block identifier represented by the Explicit Source
Payload IDs in the SID frames for the protected source symbols within
the flow.</t>
          </li>
          <li>
            <t>Repair Index: The index of this repair symbol within the block. The Flow ID,
Block Number, and Repair Index together identify the repair symbol.</t>
          </li>
          <li>
            <t>Repair Key Length: The length of the Repair Key in bytes. A value of zero
indicates that the Repair Key is absent.</t>
          </li>
          <li>
            <t>Repair Key: Exactly the indicated number of bytes. The negotiated FEC
scheme defines the contents and whether a key is required.</t>
          </li>
          <li>
            <t>Repair Symbol Length: The length of the Repair Symbol in bytes. This value
MUST be greater than zero.</t>
          </li>
          <li>
            <t>Repair Symbol: Exactly the indicated number of bytes of repair data. Any
subsequent QUIC frame starts after these bytes.</t>
          </li>
        </ul>
        <t>A receiver MUST treat a zero Repair Symbol Length or a length that exceeds
the remaining packet payload at the start of the corresponding byte string as a
connection error of type FRAME_ENCODING_ERROR.</t>
      </section>
      <section anchor="Repair-ACK-Frame">
        <name>Repair ACK Frame</name>
        <t>The Repair ACK frame is an OPTIONAL mechanism that allows the receiver to notify the sender
which QUIC packets have been successfully received through FEC recovery.
Its semantics mirror those of the standard QUIC ACK frame (see <xref target="QUIC-TRANSPORT"/> Section 19.3):
the receiver acknowledges packet numbers using the same packet number space,
but the acknowledgment is triggered by FEC decoding rather than direct network reception.</t>
        <t>When the sender receives a Repair ACK, it can determine that the data carried in those packets
has been successfully delivered to the remote endpoint via FEC recovery, and therefore
SHOULD suppress any pending retransmissions for those packets, avoiding bandwidth waste.</t>
        <t>Support for sending and processing Repair ACK frames is OPTIONAL. An endpoint that does not
implement Repair ACK MUST silently ignore received Repair ACK frames.</t>
        <section anchor="distinction-from-standard-ack">
          <name>Distinction from Standard ACK</name>
          <t>Although the Repair ACK frame conveys the same packet number information as a standard
ACK frame, it MUST be treated differently by the sender:</t>
          <ul spacing="normal">
            <li>
              <t>An endpoint MUST NOT use a Repair ACK frame to update RTT estimates or to trigger
loss detection. RTT estimation and loss recovery MUST rely solely on standard QUIC
ACK frames as specified in <xref target="QUIC-RECOVERY"/>.</t>
            </li>
            <li>
              <t>An endpoint MUST NOT update its congestion window or pacing rate upon receiving a
Repair ACK frame. A recovered packet was never successfully received by the network
in the normal sense, so its timing carries no meaningful congestion signal.</t>
            </li>
            <li>
              <t>The sender MUST NOT remove packets from its loss detection state solely based on a
Repair ACK. Instead, it SHOULD only cancel scheduled retransmissions for those packets.</t>
            </li>
          </ul>
          <t>The separate frame type (0xfec7) ensures that existing QUIC implementations and
congestion control modules can unambiguously distinguish Repair ACK from standard ACK.</t>
        </section>
        <section anchor="repair-ack-frame-structure">
          <name>Repair ACK Frame Structure</name>
          <t>The Repair ACK frame follows the same range-encoding structure as the standard QUIC ACK
frame, but omits the ACK Delay field (which is used for RTT calculation and is not
applicable here) and the ECN Counts field.</t>
          <figure anchor="fig-repair-ack-frame">
            <name>REPAIR_ACK Frame</name>
            <artwork><![CDATA[
REPAIR_ACK Frame {
  Type (i) = 0xfec7,
  Largest Acknowledged (i),
  ACK Range Count (i),
  First ACK Range (i),
  ACK Range (..) ...,
}

ACK Range {
  Gap (i),
  ACK Range Length (i),
}
]]></artwork>
          </figure>
          <figure anchor="fig-repair-ack-lengths">
            <name>REPAIR_ACK Field Lengths</name>
            <artwork><![CDATA[
 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|1 0|               Frame Type = 0xfec7 (30 bits)               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                   Largest Acknowledged (i)                  ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                     ACK Range Count (i)                     ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                     First ACK Range (i)                     ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                           Gap (i)                           ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                     ACK Range Length (i)                    ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
          </figure>
          <t>The Gap and ACK Range Length fields repeat ACK Range Count times.</t>
          <ul spacing="normal">
            <li>
              <t>Largest Acknowledged (i): A variable-length integer representing the largest packet
number among the packets recovered via FEC and being acknowledged in this frame.
The semantics are identical to the Largest Acknowledged field in a standard ACK frame.</t>
            </li>
            <li>
              <t>ACK Range Count (i): A variable-length integer specifying the number of ACK Range
fields that follow.</t>
            </li>
            <li>
              <t>First ACK Range (i): A variable-length integer indicating the number of contiguous
packets recovered, counting down from Largest Acknowledged (inclusive).
A value of zero means only the packet with number Largest Acknowledged was recovered.</t>
            </li>
            <li>
              <t>ACK Range: Each entry describes a contiguous range of recovered packet numbers
preceded by a gap of unacknowledged packet numbers:  </t>
              <ul spacing="normal">
                <li>
                  <t>Gap (i): The number of unacknowledged packets between the end of the previous
acknowledged range and the start of this one, minus one.</t>
                </li>
                <li>
                  <t>ACK Range Length (i): The number of contiguous packets recovered in this range,
minus one.</t>
                </li>
              </ul>
            </li>
          </ul>
        </section>
        <section anchor="sender-behavior-upon-receiving-repair-ack">
          <name>Sender Behavior upon Receiving Repair ACK</name>
          <t>Upon receiving a Repair ACK frame, the sender SHOULD:</t>
          <ol spacing="normal" type="1"><li>
              <t>Identify the QUIC packets whose packet numbers are covered by the acknowledged ranges.</t>
            </li>
            <li>
              <t>Cancel any pending retransmission scheduled for those packets.</t>
            </li>
            <li>
              <t>Not alter the congestion control state, RTT estimates, or loss detection timers as a
result of processing the Repair ACK.</t>
            </li>
          </ol>
          <t>If a packet number acknowledged by a Repair ACK has already been acknowledged by a
standard QUIC ACK frame, the Repair ACK SHOULD be silently ignored for that packet number.</t>
        </section>
      </section>
    </section>
    <section anchor="operation-management-consideration">
      <name>Operation &amp; Management Consideration</name>
      <t>The QUIC-FEC protocol are expected to be a universal solution against packet loss.</t>
      <section anchor="fec-block-grouping">
        <name>Block grouping</name>
        <t>When implemented, the QUIC packets will be finally divided into different FEC blocks according to the
stream size or fixed size. Since that, the FEC Framework only needs to focus on whether the symbols
within the block satisfy the encoding/decoding conditions, regardless of the upper layer protocols.</t>
        <t>It's important for FEC Framework to determine how to group QUIC packets into blocks, which needs to consider
the optimisation effects at the application layer and the FEC scheme support.</t>
        <t>For example, dividing data into fixed-size blocks is a more convenient approach and allows better control over
the packet repair rate.</t>
        <t>However, this may result in some repair packets arriving too late for the source packets to be protected,
just as for source packet 4 belows, repair packet of packet 4 will not be send until stream 2 finish the sending:</t>
        <figure anchor="fig-fix-block-implementation-steps">
          <name>FIXED BLOCK Implementation Steps</name>
          <artwork><![CDATA[
              +-------------------------------------------------+
              |                Application Data                 |
              +-------------------------------------------------+
                                   |
                                   |
                                   v
              +----------+ +----------+ +----------+ +----------+
   Stream 1   | Source   | | Source   | | Source   | | Source   |
              | packet 1 | | packet 2 | | packet 3 | | packet 4 |
              +----------+ +----------+ +----------+ +----------+

              +----------+ +----------+
   Stream 2   | Source   | | Source   |
              | packet 1 | | packet 2 |
              +----------+ +----------+
                                   |
                                   |
                             +-----v-----+        +-----------+
   block size = 3 ---------> | FEC       <--------> FEC       |
                             | Framework |        | Scheme    |
                             +-----|-----+        +-----------+
                                   |
                                   v
              +----------+ +----------+ +----------+    +----------+
   Block 1    | Source   | | Source   | | Source   |    | Repair   |
              | packet 1 | | packet 2 | | packet 3 |    | packet 1 |
              +----------+ +----------+ +----------+    +----------+

              +----------+ +----------+ +----------+    +----------+
   Block 2    | Source   | | Source   | | Source   |    | Repair   |
              | packet 4 | | packet 1 | | packet 2 |    | packet 2 |
              +----------+ +----------+ +----------+    +----------+
]]></artwork>
        </figure>
        <t>Dividing the block according to the QUIC Stream can avoid the problem of long time difference
between the generation of repair packets and the arrival of protected packets.</t>
        <t>But not all the fec schemes supports variable-length block codecs. It requires the fec scheme to carry
the block size information with the FEC frame. For instance, certain algorithms employ a repair key field
to specify the number of packets and their indices within a block, enabling the receiver to determine
when decoding is possible. Without this information, the receiver cannot support encoding schemes with
flexible block sizes.</t>
        <figure anchor="fig-flex-block-implementation-steps">
          <name>FLEXIBLE BLOCK Implementation Steps</name>
          <artwork><![CDATA[
              +------------------------------------------------+
              |               Application Data                 |
              +------------------------------------------------+
                                   |
                                   |
                                   v
              +----------+ +----------+ +----------+ +----------+
   Stream 1   | Source   | | Source   | | Source   | | Source   |
              | packet 1 | | packet 2 | | packet 3 | | packet 4 |
              +----------+ +----------+ +----------+ +----------+

              +----------+ +----------+
   Stream 2   | Source   | | Source   |
              | packet 1 | | packet 2 |
              +----------+ +----------+
                                   |
                                   |
                             +-----v-----+        +-----------+
   block size = 3 ---------> | FEC       <--------> FEC       |
                             | Framework |        | Scheme    |
                             +-----|-----+        +-----------+
                                   |
                                   v
              +----------+ +----------+ +----------+ +----------+    +----------+
   Block 1    | Source   | | Source   | | Source   | | Source   |    | Repair   |
              | packet 1 | | packet 2 | | packet 3 | | packet 4 |    | packet 1 |
              +----------+ +----------+ +----------+ +----------+    +----------+

              +----------+ +----------+    +----------+
   Block 2    | Source   | | Source   |    | Repair   |
              | packet 1 | | packet 2 |    | packet 2 |
              +----------+ +----------+    +----------+
]]></artwork>
        </figure>
        <t>In short, the FEC scheme determines which block partitioning method can be chosen,
and the application layer optimization effect determines which partitioning method should be chosen.
And the specific codec flow and repair key design should be decided by the fec scheme.</t>
        <t>The both steps can be applied to most application layer requests based on the QUIC protocol,
and it's been proven to work with the HTTP/3 and MoQ protocols as the above steps.</t>
      </section>
      <section anchor="fec-selective-protection">
        <name>Selective protection</name>
        <t>However, FEC should not protect all application layer data without discrimination in the QUIC connection.
In order to reduce the bandwidth overhead, the FEC module should provide the upper layers with an interface
to switch off the FEC module at the Stream level.</t>
        <t>It did make differences on when and how to switch off FEC among different application layer.
We offers an abstract steps as an example here:</t>
        <figure anchor="fig-close-fec-implementation-steps">
          <name>CLOSE FEC Implementation Steps</name>
          <artwork><![CDATA[
      Client-APP                                      Server-APP
          |
          v
set_fec_close_API(stream_id)
          |
          v
stream_state.enable_fec = false
          |
          v
generate close_fec_frame to packet
          |
          v
            --------------------------------------------->
            QUIC_Packet {                                 |
              ...Frames,                                  |
              CLOSE_FEC_FRAME{stream_id}                  |
            }                                             |
                                            parse close_fec_frame from packet
                                                          |
                                                          v
                                            stream_state.enable_fec = false
]]></artwork>
        </figure>
      </section>
      <section anchor="fec-moq-policy">
        <name>FEC policy for MoQ</name>
        <t>The block-grouping considerations in <xref target="fec-block-grouping"/> and the
data-selection considerations in <xref target="fec-selective-protection"/> also apply
to MoQ. An application can choose which track data to protect according
to media importance and delivery deadlines. For stream-based delivery,
that policy can be applied to the QUIC streams carrying the selected data.</t>
        <t>This protection policy identifies candidate data within the FEC
capability and scheme negotiated for the sending direction. When a
block-based scheme is used, the sender can additionally apply the optional
admission strategy in <xref target="fec-admission"/> according to current sending
conditions.</t>
        <t>With block-based protection, MoQ object boundaries, QUIC stream boundaries,
and FEC block boundaries need not coincide. A stream can carry multiple
objects, and its data can span multiple FEC blocks, subject to the grouping
supported by the FEC scheme. Recovered STREAM data is processed through
QUIC stream reassembly and MoQ parsing. Object completion depends on MoQ
framing and receipt of the required object data.</t>
      </section>
    </section>
    <section anchor="security-consideration">
      <name>Security Consideration</name>
      <t>TBD</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document defines three new transport parameters for the negotiation of enable fec for QUIC, and three new frame types.</t>
      <section anchor="new-transport-parameters">
        <name>New transport parameters</name>
        <t>The following entry in <xref target="transport-parameters"/> should be added to the "QUIC Transport Parameters" registry under the "QUIC Protocol" heading.</t>
        <table anchor="transport-parameters">
          <name>Addition to QUIC Transport Parameters Entries</name>
          <thead>
            <tr>
              <th align="left">Parameter ID</th>
              <th align="left">Parameter name</th>
              <th align="left">Specification</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">0xfece01</td>
              <td align="left">fec_encode_schemes</td>
              <td align="left">
                <xref target="transport-params"/></td>
            </tr>
            <tr>
              <td align="left">0xfecd02</td>
              <td align="left">fec_decode_schemes</td>
              <td align="left">
                <xref target="transport-params"/></td>
            </tr>
            <tr>
              <td align="left">0xfecb02</td>
              <td align="left">fec_max_symbol_num</td>
              <td align="left">
                <xref target="transport-params"/></td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="new-frames">
        <name>New frames</name>
        <t>The following frame types defined in <xref target="frame-types"/> should be added to the "QUIC Frame Types" registry under the "QUIC Protocol" heading.</t>
        <table anchor="frame-types">
          <name>Addition to QUIC Frame Types Entries</name>
          <thead>
            <tr>
              <th align="left">Frame ID</th>
              <th align="left">Frame name</th>
              <th align="left">Specification</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">0xfec5</td>
              <td align="left">SID Frame</td>
              <td align="left">
                <xref target="SID-Frame"/></td>
            </tr>
            <tr>
              <td align="left">0xfec6</td>
              <td align="left">Repair Frame</td>
              <td align="left">
                <xref target="Repair-Symbol-Frame"/></td>
            </tr>
            <tr>
              <td align="left">0xfec7</td>
              <td align="left">Repair ACK Frame</td>
              <td align="left">
                <xref target="Repair-ACK-Frame"/></td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="iana-fec-scheme-ids">
        <name>QUIC FEC Scheme IDs</name>
        <t>IANA is requested to create a "QUIC FEC Scheme IDs" registry in the QUIC
registry group. The registry covers integers from 0 to 2^62 - 1. New
registrations use the Specification Required policy (<xref target="RFC8126"/>). Each
registration records a numeric ID, a scheme name, and a reference. A
registration specification needs to describe the coding algorithm and its
scheme-specific wire details, including the contents of the Repair Key when
one is used.</t>
        <t>The initial entries are listed in <xref target="fec-scheme-assignments"/>.</t>
        <table anchor="fec-scheme-assignments">
          <name>Initial QUIC FEC Scheme IDs</name>
          <thead>
            <tr>
              <th align="left">Scheme ID</th>
              <th align="left">Scheme name</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">8</td>
              <td align="left">Reed-Solomon</td>
              <td align="left">
                <xref target="fec-scheme-ids"/></td>
            </tr>
            <tr>
              <td align="left">11</td>
              <td align="left">XOR</td>
              <td align="left">
                <xref target="fec-scheme-ids"/></td>
            </tr>
            <tr>
              <td align="left">12</td>
              <td align="left">Packet Mask</td>
              <td align="left">
                <xref target="fec-scheme-ids"/></td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
    <section anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The specification has been materially improved through technical discussions with Ian Swett.
Thanks to his recommendations with the draft and FEC mechanism.</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="QUIC-TLS">
          <front>
            <title>Using TLS to Secure QUIC</title>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <author fullname="S. Turner" initials="S." role="editor" surname="Turner"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document describes how Transport Layer Security (TLS) is used to secure QUIC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9001"/>
          <seriesInfo name="DOI" value="10.17487/RFC9001"/>
        </reference>
        <reference anchor="RFC6363">
          <front>
            <title>Forward Error Correction (FEC) Framework</title>
            <author fullname="M. Watson" initials="M." surname="Watson"/>
            <author fullname="A. Begen" initials="A." surname="Begen"/>
            <author fullname="V. Roca" initials="V." surname="Roca"/>
            <date month="October" year="2011"/>
            <abstract>
              <t>This document describes a framework for using Forward Error Correction (FEC) codes with applications in public and private IP networks to provide protection against packet loss. The framework supports applying FEC to arbitrary packet flows over unreliable transport and is primarily intended for real-time, or streaming, media. This framework can be used to define Content Delivery Protocols that provide FEC for streaming media delivery or other packet flows. Content Delivery Protocols defined using this framework can support any FEC scheme (and associated FEC codes) that is compliant with various requirements defined in this document. Thus, Content Delivery Protocols can be defined that are not specific to a particular FEC scheme, and FEC schemes can be defined that are not specific to a particular Content Delivery Protocol. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6363"/>
          <seriesInfo name="DOI" value="10.17487/RFC6363"/>
        </reference>
        <reference anchor="RFC2199">
          <front>
            <title>Request for Comments Summary RFC Numbers 2100-2199</title>
            <author fullname="A. Ramos" initials="A." surname="Ramos"/>
            <date month="January" year="1998"/>
          </front>
          <seriesInfo name="RFC" value="2199"/>
          <seriesInfo name="DOI" value="10.17487/RFC2199"/>
        </reference>
        <reference anchor="RFC9174">
          <front>
            <title>Delay-Tolerant Networking TCP Convergence-Layer Protocol Version 4</title>
            <author fullname="B. Sipos" initials="B." surname="Sipos"/>
            <author fullname="M. Demmer" initials="M." surname="Demmer"/>
            <author fullname="J. Ott" initials="J." surname="Ott"/>
            <author fullname="S. Perreault" initials="S." surname="Perreault"/>
            <date month="January" year="2022"/>
            <abstract>
              <t>This document describes a TCP convergence layer (TCPCL) for Delay-Tolerant Networking (DTN). This version of the TCPCL protocol resolves implementation issues in the earlier TCPCL version 3 as defined in RFC 7242 and provides updates to the Bundle Protocol (BP) contents, encodings, and convergence-layer requirements in BP version 7 (BPv7). Specifically, TCPCLv4 uses BPv7 bundles encoded by the Concise Binary Object Representation (CBOR) as its service data unit being transported and provides a reliable transport of such bundles. This TCPCL version also includes security and extensibility mechanisms.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9174"/>
          <seriesInfo name="DOI" value="10.17487/RFC9174"/>
        </reference>
        <reference anchor="RFC5226">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <author fullname="H. Alvestrand" initials="H." surname="Alvestrand"/>
            <date month="May" year="2008"/>
            <abstract>
              <t>Many protocols make use of identifiers consisting of constants and other well-known values. Even after a protocol has been defined and deployment has begun, new values may need to be assigned (e.g., for a new option type in DHCP, or a new encryption or authentication transform for IPsec). To ensure that such quantities have consistent values and interpretations across all implementations, their assignment must be administered by a central authority. For IETF protocols, that role is provided by the Internet Assigned Numbers Authority (IANA).</t>
              <t>In order for IANA to manage a given namespace prudently, it needs guidelines describing the conditions under which new values can be assigned or when modifications to existing values can be made. If IANA is expected to play a role in the management of a namespace, IANA must be given clear and concise instructions describing that role. This document discusses issues that should be considered in formulating a policy for assigning values to a namespace and provides guidelines for authors on the specific text that must be included in documents that place demands on IANA.</t>
              <t>This document obsoletes RFC 2434. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5226"/>
          <seriesInfo name="DOI" value="10.17487/RFC5226"/>
        </reference>
        <reference anchor="RFC9265">
          <front>
            <title>Forward Erasure Correction (FEC) Coding and Congestion Control in Transport</title>
            <author fullname="N. Kuhn" initials="N." surname="Kuhn"/>
            <author fullname="E. Lochin" initials="E." surname="Lochin"/>
            <author fullname="F. Michel" initials="F." surname="Michel"/>
            <author fullname="M. Welzl" initials="M." surname="Welzl"/>
            <date month="July" year="2022"/>
            <abstract>
              <t>Forward Erasure Correction (FEC) is a reliability mechanism that is distinct and separate from the retransmission logic in reliable transfer protocols such as TCP. FEC coding can help deal with losses at the end of transfers or with networks having non-congestion losses. However, FEC coding mechanisms should not hide congestion signals. This memo offers a discussion of how FEC coding and congestion control can coexist. Another objective is to encourage the research community to also consider congestion control aspects when proposing and comparing FEC coding solutions in communication systems.</t>
              <t>This document is the product of the Coding for Efficient Network Communications Research Group (NWCRG). The scope of the document is end-to-end communications; FEC coding for tunnels is out of the scope of the document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9265"/>
          <seriesInfo name="DOI" value="10.17487/RFC9265"/>
        </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>
        <reference anchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="M. Cotton" initials="M." surname="Cotton"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="June" year="2017"/>
            <abstract>
              <t>Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t>To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t>This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC5109">
          <front>
            <title>RTP Payload Format for Generic Forward Error Correction</title>
            <author fullname="A. Li" initials="A." role="editor" surname="Li"/>
            <date month="December" year="2007"/>
            <abstract>
              <t>This document specifies a payload format for generic Forward Error Correction (FEC) for media data encapsulated in RTP. It is based on the exclusive-or (parity) operation. The payload format described in this document allows end systems to apply protection using various protection lengths and levels, in addition to using various protection group sizes to adapt to different media and channel characteristics. It enables complete recovery of the protected packets or partial recovery of the critical parts of the payload depending on the packet loss situation. This scheme is completely compatible with non-FEC-capable hosts, so the receivers in a multicast group that do not implement FEC can still work by simply ignoring the protection data. This specification obsoletes RFC 2733 and RFC 3009. The FEC specified in this document is not backward compatible with RFC 2733 and RFC 3009. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5109"/>
          <seriesInfo name="DOI" value="10.17487/RFC5109"/>
        </reference>
        <reference anchor="RFC5510">
          <front>
            <title>Reed-Solomon Forward Error Correction (FEC) Schemes</title>
            <author fullname="J. Lacan" initials="J." surname="Lacan"/>
            <author fullname="V. Roca" initials="V." surname="Roca"/>
            <author fullname="J. Peltotalo" initials="J." surname="Peltotalo"/>
            <author fullname="S. Peltotalo" initials="S." surname="Peltotalo"/>
            <date month="April" year="2009"/>
            <abstract>
              <t>This document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a communication path where packets are either received without any corruption or discarded during transmission). This document also describes a Fully-Specified FEC Scheme for the special case of Reed-Solomon codes over GF(2^^8) when there is no encoding symbol group. Finally, in the context of the Under-Specified Small Block Systematic FEC Scheme (FEC Encoding ID 129), this document assigns an FEC Instance ID to the special case of Reed-Solomon codes over GF(2^^8).</t>
              <t>Reed-Solomon codes belong to the class of Maximum Distance Separable (MDS) codes, i.e., they enable a receiver to recover the k source symbols from any set of k received symbols. The schemes described here are compatible with the implementation from Luigi Rizzo. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5510"/>
          <seriesInfo name="DOI" value="10.17487/RFC5510"/>
        </reference>
        <reference anchor="RFC6865">
          <front>
            <title>Simple Reed-Solomon Forward Error Correction (FEC) Scheme for FECFRAME</title>
            <author fullname="V. Roca" initials="V." surname="Roca"/>
            <author fullname="M. Cunche" initials="M." surname="Cunche"/>
            <author fullname="J. Lacan" initials="J." surname="Lacan"/>
            <author fullname="A. Bouabdallah" initials="A." surname="Bouabdallah"/>
            <author fullname="K. Matsuzono" initials="K." surname="Matsuzono"/>
            <date month="February" year="2013"/>
            <abstract>
              <t>&lt;p&gt;This document describes a fully-specified simple Forward Error Correction (FEC) scheme for Reed-Solomon codes over the finite field (also known as the Galois Field) GF(2^^m), with 2</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6865"/>
          <seriesInfo name="DOI" value="10.17487/RFC6865"/>
        </reference>
        <reference anchor="RFC8627">
          <front>
            <title>RTP Payload Format for Flexible Forward Error Correction (FEC)</title>
            <author fullname="M. Zanaty" initials="M." surname="Zanaty"/>
            <author fullname="V. Singh" initials="V." surname="Singh"/>
            <author fullname="A. Begen" initials="A." surname="Begen"/>
            <author fullname="G. Mandyam" initials="G." surname="Mandyam"/>
            <date month="July" year="2019"/>
            <abstract>
              <t>This document defines new RTP payload formats for the Forward Error Correction (FEC) packets that are generated by the non-interleaved and interleaved parity codes from source media encapsulated in RTP. These parity codes are systematic codes (Flexible FEC, or "FLEX FEC"), where a number of FEC repair packets are generated from a set of source packets from one or more source RTP streams. These FEC repair packets are sent in a redundancy RTP stream separate from the source RTP stream(s) that carries the source packets. RTP source packets that were lost in transmission can be reconstructed using the source and repair packets that were received. The non-interleaved and interleaved parity codes that are defined in this specification offer a good protection against random and bursty packet losses, respectively, at a cost of complexity. The RTP payload formats that are defined in this document address scalability issues experienced with the earlier specifications and offer several improvements. Due to these changes, the new payload formats are not backward compatible with earlier specifications; however, endpoints that do not implement this specification can still work by simply ignoring the FEC repair packets.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8627"/>
          <seriesInfo name="DOI" value="10.17487/RFC8627"/>
        </reference>
        <reference anchor="RFC5052">
          <front>
            <title>Forward Error Correction (FEC) Building Block</title>
            <author fullname="M. Watson" initials="M." surname="Watson"/>
            <author fullname="M. Luby" initials="M." surname="Luby"/>
            <author fullname="L. Vicisano" initials="L." surname="Vicisano"/>
            <date month="August" year="2007"/>
            <abstract>
              <t>This document describes how to use Forward Error Correction (FEC) codes to efficiently provide and/or augment reliability for bulk data transfer over IP multicast. This document defines a framework for the definition of the information that needs to be communicated in order to use an FEC code for bulk data transfer, in addition to the encoded data itself, and for definition of formats and codes for communication of that information. Both information communicated with the encoded data itself and information that needs to be communicated 'out-of-band' are considered. The procedures for specifying new FEC codes, defining the information communication requirements associated with those codes and registering them with the Internet Assigned Numbers Authority (IANA) are also described. The requirements on Content Delivery Protocols that wish to use FEC codes defined within this framework are also defined. The companion document titled "The Use of Forward Error Correction (FEC) in Reliable Multicast" describes some applications of FEC codes for delivering content. This document obsoletes RFC 3452. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5052"/>
          <seriesInfo name="DOI" value="10.17487/RFC5052"/>
        </reference>
        <reference anchor="QUIC-RECOVERY">
          <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>
      </references>
    </references>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+19+1PkRpLw7/or6jwRXgh39wIzHo/xI44BxiZuZmABn9d3
8S1RtKpBO2qpV1LDtIH92y9f9ZLUDYyxL76Lba/XtLpUlZWVlZXvGg6HSZM1
udlWb/Z31f7HxhR1VhZqUlbqLz8d7Cb6/LwyV9v0BdskaTku9BReSCs9aYa/
XpriYviPeTYeTsx4aGwPw40XSaobaHezt3O6f5eM4ctFWS22Vd2kSZLNqm3V
VPO62drY+HpjK9GV0dvqtNJFPSurJrkuqw8XVTmfydg/w/esuFA/4LPkg1lA
g3RbHRSNqQrTDPcQnCSpG12kZzovCxh6Yepklm2r/27K8UDV0G1lJjX8tZji
H/8vSfS8uSyr7WSYKJUV9bb6caT+C6cE33ma9E39ONfFJfwLj8vqYlvt5Nm5
Ptcw/HgEz8xUZ/m2ImRcStPRr5eX/97o8lyXo3E59UP8MlJvs7kb4BddTE0m
j1Z0Ps10+fdslC+m/665wTCDBth1khRlNdVNdmW24QXE1/D0eOf9ydHh8em2
qibjrzc2Ntwvb0/ss014dvxm9+Xzl8+3+c+tza+/lj+/3vzqhfz55dbWS/t0
6+WX27B+xSQcEttsbtg3v4S/5c+Xr7A5/fnq5dZXtsHGl1sO0uP93cP/3D/+
xQK1BfMZDodKn9dNpcewqKeXWa2A8OZTUzSqnplxNslMrbR6U1bXukrVflUB
xe6WVWXGDRLwGtDqunLkmCBBN5eGaWlWlUARZT5Q15fZ+BK/X2Wpoefyvr7Q
sFiNmunxB9OovKzrEYM1zdI0NwDjMyS+qkzn9MYKKAsPh2pKBuHKVPR9U93c
xOt1d5dAo3o+w21Q3zPDUYL7NkNUTA2QcqrKiTKVrueVUeMS4cuB6hRsRQ3b
DTbXNKtp4POFqrPpPIf9Ysp5nS+S2hQp7rDKpPMi1TAHemutNgaAFDK5u1sf
KZqpbTZeKJ3n5XVN+AXoDNBEhXNIDWIT5p/i4xKeqjybZo1JEZ/S/XUGYM8b
da2zBkfHhapMCOog4VUaAyLPDfyvMJNsnGmaWA5sBUAY1ohfpEZVj02hq6zE
9QLk4Z6DOY7NALrV+bDJpoiZ6XReZMCTiNlVsBGR39QA3wejfjbnx6e7ljhg
qtdAHIAgPZvlGQAPw7pBYKGgja4VElCJKJ+YCiAyOBec+VWZjWFAQNGIeOws
14s6galkU1xgRDOskcH1ECThm4Qfpr1aAZoBdfOiMnmmz6Et8DsEd5AAxisD
b5YzmFb2K745r6Gt+TiDfhAMQAKRFw49zS4uG8AfzN4AwYyrOWFxUuI6Npbt
vyv/otbemTTTipYMX1+3awDImFXZFKaeL3ColF7hucNuNXoaUZnFIS4djF7B
YiHMOHfY2Eirwf5SAMCUxg27GLU3VgqrX8C2uiyvCaFu9VSjYfHMBM4hQBos
Em20xp4ouLvHBrfxCfBNQ+/6fZnJVkbkXvOb1HFNizjT+DecNHB4ZLBgBg68
Cg6XAo60JmPcncOiGAM7/LpUsJNmJXRZd6EvocuitNOgWSBGJryDSqRwYUOA
XDgUaRdVU2ibDpDNcw9ZjAfeedG2xVeB6sZz3CFAhoBWnHE9vjQwqw5cOq9L
1yWsFlJUWQB1HJuZziq1s/sfjBDHD+j5EJ4P3+BzYAywtHA4X1zKoofsgCgA
pp1NFvQceQ08BQKoy3kFWLe0DtsJF2kyz3O3IUyaWPBTeIJMSnhQwHikR2Gd
sDi4bwqDnelq0WIptd86GjYosb1zWGjY6A2Ar+vGEOnCXgP6mNOWbC51QyPR
NCzvsOsJByIsE+594mjICC5MTU0sG4a1Oz49Vfh0Si/DIjx7Biy9uIIVQKiI
1vZwETL+fvMsdd/ucMmMAslHoehTq8/e/XRy+tmA/6veH9Lfx/tAu8f7e/j3
yY87b9+6P7hFAl8Of3orv+Nf/s3dw3fv9t/v8cvwVLUevdv5Bf4DMCafHR6d
Hhy+33n7Ge6zJqYkQAHTMaEEloIoGVqYelxl58xAX+8eqc0Xyc3Nv5HQsfn1
3Z3iL69A7IAv1yBL0WDAFoAU+CugH1ZsNjMa+TouP8iVs6wB6h3gEDVshkLh
ygJufwYmV9cAlF86YFBIJADuRE8z4KYVrxb+xruszMsL4WxZkXTP5hEc+kqn
KS0J0IgJOAft4xJJEukFyHUIHJt2H/Zdg9Q0VCdM7iCBnpcg1M0yoFDcBk6e
KlFaGF9qIJ8UD4UWO1Eq3rdAXDVw36oWyUa20Uwv8lIDkSBSwiFJirGb2kLh
WUcIBnYNEjoxoklVTml+cHacZwU1QHEV9q+BHQp8omeUfZZDtoW7T2AlDe6C
aVm5hkE76NsJN7DL4T2dg8YA6zNVF3Dow+nB4kkAe+2kC4E1I9Gdtjm0jYHi
WWgAuQk4D3cQ9knAe7mLgfOS17Y9SbCT4MxGsQtQZSemYAtMcKaINhaFcGbw
DjyAwURK48EcZ94WLBd/nxfuBZQg+3FE0BP7Y3Fz7GRbVBxygzRS2/MqxX0J
pI2nhyN72JXZRRFvzmhD81IWOBqobMipmgWOAiTfsxzzmgWfZQAzBSNbpQ6t
UKdB8jqvkFHT1jvnU8LOBeUFngtTJtCQxh9BoJhCfxUwehwVOQIsLh7WjfGL
BASnx5dwsNFM9kw8k5h2llHOQ6eVmiealp0UKY0PmNYuHYuwrEVaXm/LfwMq
txMhVogsOqQJhhpGiRZzRDrOTgWDIPHirA+B1K8yc52Q2vHGSV5ZLXTEnB6U
ESCPnI9CEcSGTrUHmX1hqhGdZixMAlp0dcG7cjwHxKIQg/o8dgzwwZEJcm9W
XyYouJOYiBwyq6ckfuI5cyHcAeECFg4bAZ6WPSofHPzz2p/qdEaVIC3rczgP
gB70uEJulWYTEuQbft0qEcgb9i03pr0UyJdOSMQl6x4dOBMrMBqQpw2KIDS9
gqR6hJXEdDu5EZFUjGmvVjrZJkGlI7uYV0xFIQun1S6MSa1oGRwtIq7S9NwB
kzCh904qtXKQoBQ6SutLlLmdZJ10ASbcNqa2tGBf79CDOmjgVB7jKmB70hMi
jRWIg5TdYH7MuyO5lycQCPABVF5VQH0M1m9WFg7tzH8RT1Nd6AvHtzVIgamd
oqktGMTArJLnxFI3lPRmJWrXjz/SpMeBY+H0AJBsauYWTZnAyQ5cKl1YNUmO
dZ6pIBPFS9BjLFw8sMjHvImuszx3DJ71LxJW9difG7EOEy8hAhh03d78JH7S
hiLxYAZdyV6iQ8Z8zGpmrcQTOoTgtiYoZggMyBK6aVgixv1/AfpDwdtk2Z51
h1lX6k4sdlGBQYrN7ZrFGgEuYUaqgVVwItsU7F58h8wgaAFDM0iS/POf/wT+
zJ8vhr/h84Xr5lZ1Pztod5AVor3S04ZfbkPzt3vG7f/dQ7MCqM64ItkSad77
AkigotrZAwrf+4RxY7Rf3TPf29VrcN94D4fuNuqsj999cmdPA9nDyNXi84vV
nbXGi9nDg6Hr7+yej20dzueLqLP4ly+WfOGXvqU/v7+lKZwQu7uNOrtVP7pT
75YenhzsMRzwRdQqFc3jtgVt2Nl7Kw7w+4Q029kRs/x2Z04W73Sm1Nrp0boF
5kfL66Ivnc5EHG519hicrV4AfPwILrSE0IIdcD9rue8TQHYfvwh+Xw0Z/rvr
D59dMfn8mY6dz4EworNmGZCP2puPwNlv/3Q47aedLALwbzlfZh9A8H7I+UJb
Uewh+P4aSQmwXdcfOCB9vugQQu+n//fVxzp8fto7Wn2i90PzaZ8vSF652VbP
QFsgb21gOkcn8HefRZz7sztSAD3Dex9Yu1Ea8ifakdUSyKLZ81zdPHM6xZB0
ivpOTNDeBm+FZWtSQkt8ryYi4nGgTaGEh9oYW1datn2E1dlHAiN4qNGAuFiI
Pu/1mlASDBS5dRbzl4LHVnucC2nDbBJk8x9g/YxNH2cWiDWr8VqX4By1jI2P
0NRsbK5vqx0Fqi/J91e6IgfQMDfFBRAzKb7wFtAHz29hpxPOUlyJbH9wmh5p
zlaJYU0TreboM2IsourdnR3ZI1KURlGSFx2WdCuxV2mSyHFdSatN43EsDtji
8BAcpBtbD8UB28ofh4HQoSC6VNHcgwDnkanF0xEofFnt3WJeK0xubnDPtbYA
KBWx8bhnOMXKLkLUQztI2V10brNmAlCd7b/fPdzbPz472f1x/93+iXJUfHa0
c7zz7gZmYylNrWXrAzRj9ezet4zrFS3+U+dz2CvEqSiURISUE4E07kEFAtam
OtjrebwVPh6N0MB2l9yR7nm2t/+wWQHtPO2srLT01LMKGXOLSCxr7gMPiQz6
RkbN22qqP56x8e6smE9Xbatz2VZLtpPd5GyBRNo8z8vxB1VnvwJbzEZmNGBf
2Hx6Ln48MTCCZm807AlnH6EgnnXrUpF+PEMQh0YWex37dgISu7iszsnf13jX
EJlmZWPzLHkcsmvKtoChYp6H0QECJAdPeG8+MIKrMp8LNNiLmE7Tkry3Yj1V
Wk2yj8hXHHYGhC/0kzvAvZ+NvWLjfJ6aVMITtEKDFTkaGfzBcvMSnSywMmaG
zs6i8VapkXq9cMehsMDaOKtxviCHZ2QAKyxbVCkZaMZNxDNDVEVADBT9QibL
eZGlmdjBdZ7Y9n92AOMCiS1qkpuP1jAkflscj+2DZHiBE12netaQSRq9xrUz
U5Mfg2w5kbHTGvcs8yVz2SRzMgKbmWqz7HQmFx9KQtzBMEvruzvoc48Fg8C9
P1DZhAzk7M/+U+08GDI2MGn4A6l4YaUQdkl3mrLzOexccXQSkpfFJm4I69tD
I4lzi5NVfplUdvPMCS9D7P8utFY7aWnZWVNbhnKfYDRIYIuU8yYXJKoTafF8
tOkOO0SrewOPujyfY0BXY0OiNHo/LK5CbAhVyzG2m2dI6g/7nJjqis5o/jxE
LP4+cc27J+x3N8f7+3tnJ4dvD98dvh/89fD4Lm4en7zf3XRbxDz5u80N//O3
D4HPN48+fbDGgy8DMZzR3ZLelwD/ZUeF8MKynFOeMNsELidVcpQbXVMYhXjm
xRisx80cmK2zi+MzWfxJVmG8mBnnWhyqVhyUrfVn63hz9vU6yRricmT0NSP1
Mx4TvC2RRuxWZq/9Q0WrAfV6WZbkCSjIaD/zTICYJp5+bh+zeR89zj1irx2j
NTTrRwkdQ3B+wy7lwLxgEH8iQBeBdP3eI5X31ZgReK2RA2BwDOsJTkR2+KLA
JsSXDYaksxWnGDWjQEqAuW/DDkL0jst5ngqqlA9oxMMDVv4bVaLmcJ3Vht/y
fpHa5Iy6xB/25+RZL8P1+xNFouE7CzlJhaMM4qn/qY6ONX8qZzUty/0K2s2O
hW1zoNzfW8Hfzwcoy9316zYPfz0JHONdgnYn2gyDYjGoEI+IS0Cv9YM186rw
XmZmhTQpp/+crZ7eXaft0rk8vwuJrbGAx4f/zJkKeN1yiWpzU5rqhXhalZ6g
chVQFUdHedFZHQSn+82z1qnNTinbco+PeY60XaIwjpQ/GsmFhfYDfBOjRBLn
nWp1W5kL4DzVQq3d3GS60MO29LCOQsWD+clI7QSCqw3kElTBOwlGfY7LiwIk
y9QygIM9e0DH6Dq9D2b0CFpZz0X0QOM3oDTte7UNhf7ovXFltGjPQSAwq8wU
nQZsmwbWNQYBcNCJC9OKRaygCYlaGIxk0uFJmZfo2V97tQ7jkgQfAXdFmhi/
HMscr+AYgEOMAXuFrjllg71PKMAiHsDjxganns+zPK2Fu2B8eticFAhy50tc
OwI9VHDSqrXNzXUOvXYho35yBAO2AoaDLMqB+yIAF0PmAVzrmuUp8wteLsbh
xBfwTtcfYNitBw/LEbygYszPgddJwFYccOlkZlperc6zZgrDBACPtuCfTXyV
gMYw/rs7MoN4sNnsQbFKrgcmyJAkJOYVZ0nrGdhKaB4hOat9PEeZaBIOYdDc
KnZZUwAIBo6SlOKD1iznAXk8EdJzNkCn14jkIcbiE+5CwlxdiCs/dlGuyJcC
Y4GL1vBhBhL8wjJAjs77Cvh1NiPRN2OwsmICCMCIEqcqeMc0CiZ04Df6AvRW
HyYdehGAs++Eoa8Dd6Z73xtGRHMbYLgXGeqy5J/lKXZiAznWmc9/DsBwUULt
MKKyHTfBk/YhK/J4TIo57SKKp8DRySJg0gRTEChmvCadckqatMAHzMmH4Eir
TuQBuvAzcyVT9KGXYYhIyOdsjF2SbI6sP0EWHXjqGvkGCDXb5NZjLGUY22+u
JbKpQJ33H3OvawZkGOEoiJjHoIiSBJiJGAqgcxILeWzU6D+qZjHLMCwFxZmt
UcuBse3FV+De5bQnRG1qcDuHJzFuBg5UrQctFCQsnklYZUAeUaccWFFFkLQg
I5MppspQ50cSn3KwN0iiWDKJ5LXmHfntg8HJ7jQRFXciy8JINT0WuwttIZAE
+d1gtWzUF4OXiIJBJhfZLXGgqjpB3ggrWsBWbY8uEqhDE4kyvAebFl4SGddF
vJNAY0Vj2tvAhieYuYIkHRjOWvD8QIPlCAz3F43SMoBlU8qYQAtPQP/BNC2b
d9ugRiwRFY4cA7EwD/relFBGyjDLmZtJLCPw9ZLEEIf+ARymDSoSNtUk8RH4
qAM0FPnb5TnxZiL2AscfbuIo6l9w6hhkEiNnySRRZf1NjrOezxfJfS7EMGjn
IZ/b3wHGqP8HQdH5/K3VSTgtYtWtzzGTUqo+99kbgQPz4ZDo9kCf0knnYzth
XLPXdllwS8+HX7u1JMDfQFICEt45OoDuH746FAJ1Fb12K0QVjfJY4P4WvnYb
kemn4iz68kk9nsQsZWWPUdve3kLSEmbyBDDKZxWMcTBAZ2lIOu35yGu34WvS
423kLHswqLeRN+q2B8bbJTAu+8QBgxGMbsxP+jx8retlXTyGemyQh4gDSz6t
Vit7/LwlivX112nzdPTY+xr3aA+M+6L0Wh/72m342m3CTEk0zRPOpnsgP7uV
t4T5V/xaEg5mP4+E0YYRPclZ1j5BooypFZ+oXdzJ1adC8scLJEq957Th/0UY
294DBGeIqa/We4BVHtQbfBB4DJ49s/R4aI0i8OwZZ0qSVjP0KbOyWKSHhN4v
FGMxxhsUUUlPXcw4mp+kC+vQpRRtVwZghBIySiIUWANN2D9hc7lQIclFpebu
0KBZmXqek1cDoHMCv08vnTdZnv3KXkV0J4CKEyRaskF1SYpQba3jVyjwi/0b
XfIBUIi4MT4ei7Y/SKxXGyADhXnsEmUal7Qd5DrjK5SBZNMn3oQZ+Q1nA1Jr
MuUXlFEf5N/TkGxmi/zekj1PZt1n1pi76E+0cqw5SQ46WQ52JxKi7LqFqyJZ
yAjC2rLyCesW9ZGCIgYqTQCsybnj7c5iHeCRMUTALFiBYv0F45685SERzybi
Y+SCHND6DKRMyuylyWetLOlcV9Y702vOSALPrNOKvL90qH7mgha6ahxpZ+RF
rgOtmDNCYE3QPlRw68xnwkg6mMvqsb2y7cKa89lqwZ0HESIdFRvGycviApU6
NglWlBaJ/qY/1STJgQ5rUYJGY+nfH8+s9YmfrrvVaUaUPgAd2OA075cgHMwQ
xSljDmMRrGUntn4SoUnITDB8kSa0cldlfuWCCjroVy7HmBcTJvs6dFvpcxBZ
MQO5Rq9gkNDqbRl2Zf3YsoXKMYCVBPmkphhXi1nofAt2hlfsA2ukrVmAJiyb
vxybAzlDjFcArV0O6x7jPMAgSQ0wILRQi+vERiogh8EMQbROzTC9yFriiazc
UFEOEPc5kmBQSiOq/eqJ00b2kl1sW0TBfBwbw+Ty7vQntfZOf8ym8ymbZ220
9U9F1qxz5RHg527q1sCCyKZJiJVI7X9EzRO4g+x/b9SKc+vKIF1NjKW1xAxZ
eF0yI0z9T7VjE0GuOiDhDYazGPVSOOMPobEJjWKtFFuJeOED0Vqm6nYerjeF
BGk5MbXDxBPh8WS1fZQV3PclxlfgVRSfI1ygjIpABKBZdmAjdzo2eUvPaDjV
VYXAYn2Yc++zjizOA3+cs/nUV+fwVkUyKFV4SjUt3uqDX4h9vnZxXNvqR5BC
phTOY42j9uThMKyYHdhaG/YI1mT2ndOengMFYlwYQ+r8AlpKlXBkFtkgxxQ8
FKXnO1bBrqBjX3Ynx10oeX8BuD4hsmXCs8QSpPOLjcxVBMDqEmvWTLu+7VO1
cRr4ozPG3rce83qOq4FlroL8Uxv81vK8IKCYcmnZhTsQJWG9FU37TBzDF7hN
PLjiFdap7Pw7kh4ss7M+C+tqCdItiTUPKMuaS+2QEEK4GVLoAfkdEIskCzIL
texlVgK3AKzpwsG0blP/rVRC1t/CXCeMb4625vewV8c+gQTmcUrcIMhpHNqc
xhpZDpvUsdIPsWbZZGgWuTQ6HamDSSgUUYb2mAK2BtJ/QjxBaCMU72xJJpjO
AF2Hf0dfNGCvrABxKCmxG47xmLDHTVN5Csk6lVRKz6c56TgK9DKcUzrWM8ni
TMrKZ5ju2KVA8Ih1tyfIOrxWgFByKLhdcT5PL/A8OSGhV756UKCbXEu8tdgY
MZKxi2VVYbYqxbv4ylgEAswWxfpHJIoCvVrdONBhiI6PhN0FJi3h8wdF6wwf
hGIW8KQL05UF5bS/sE4Ev/tqGLTuyJbeRcResVM3guzB+mF+i2/QZ9V5GWUi
jPZqKJCoXV0AOJbxXgd7EDgOo6flHDW3bhGDbskOHxic+HpJXR5VWzelLIkr
bdRhIrIci6GU1tJBCZ6+2ki+IgEHC3SqIxElI5nCxvMculWWyOku49L5/31h
qci7BEIpb5GR2rFekbCQRezFGcRvMyxUZ7GhYiQiWPHqijwQ7MCGQqzruhzb
+NHaxn6zLMe8BPYP6BXalnJrZViTNx6rLbn9xCGvVK0Ky+3ZolQhym1wVuAi
HAY+NdqjHGPSRfkATiwz64HEVoiiv21hDQr7iQs0DbhyjSvewiy3m2TOld0s
yRCvSUg8tXUrvDzbkiUUSjgoRVCgBvNHNtIgc0moKlfES9RJADsMPzZVITpo
WLpHBKfzReIIoKaqZ8S6vTZfR68B6WJMifU1Lkl/GrjQkM3no+ccD+HcpuoU
7SDsqCctM8xwqQxnTYkSQL7aqAQAV79Z5Zm3bnXvB9VNo2Fzp/Z8b2H4m2UR
Hq6soHVgC0dheoxyDUAC0rNaKqmFPuCGJBkXj58vvnH1BpYWULMCUk/RRMpp
axdJS7oxO0RNl/oKiyGaYknNNNWpmQarkhkMdZrq6gM0WMsoLWNlmJyT/pK1
lZTwcp2ZBi6/muAwygVxgaZTgYrSJD6foHaFTKJYrs2t0QsONOrU3UqYvNKM
jFMsgxNTB9Idf4MrklGGs8nzbFYTdYkloDWzhKATHvd8a3gOsgVHl7kIdea6
aIVEJQ1PQDaJpIEuyEdIh1QZyptnQLHChiQyEX+jSDZHb95w5KJIWmpjtOyW
XiUKuhXqQUZUS3uS+2J7kSgTb8IA2E8crJ7M2QgRqf49BhdnLLAIZt2XBDyp
QeLfIOOXFFzEZlNR0GO1PlYQ0QxAllba0Lpx6RRxeE2P+c7aN73FsGhaQ0Uo
FbUQy+8ly1+JggxYdWK7gxW+0PQg5oXk5Hj37OSXd68P3555DNOhjJXQOBih
rw3mmNHewU35HedofYk6IxnDkQdy1thy4wQ1iFPJ6mo8ZHQNs3QoC8eG9h4Y
0NTOsRK/8Z9+V0RndsscD5gW9zvBQJ8Ao0vb/E4wrDAtdaF5GhiW0wNTeb2C
ItRbvQBFkPMLA7StShzkgCtvHBKmxeIhF4i97DUND1diByWAe4elzICaK5C1
wvQoKciaFyJOQoWnQgNgHfDQLPXh62GwXlCoLO7M5jOKWs2yVRMlgovla5WZ
0aaMSTU1yRDsO6cTQQDOorbnGCVyTdvZ50gJ4hg7g3l9p9Zojvj3t9+qV+vq
ViYBTz5Sa7bQuWdkhp5Zix/rdRjcS+cXYOIVhv7Wam0T5M7GrFvFxMofPqZ+
ySIOhG9PZ6AtFmJn8/JMZzIOfAWTCWb2/ffqVRKAHf34OXKfiZ+eV4VFFoik
gKwvV80KA4ztnPbIKDkIjAwZBXzCym29oD7ZglFK9iuCQRbCCaz8EHEFonJl
wjweqiy10cOYNnuebfU8e46vb8JPz9UL9aV6qb6C5fn6Mc9+Lx4crFr7A+2D
ZWMX9FPyPyNbbsh7dihkAczQMsF9Wek9WeLlm1Qc07FiYaW/Pps5GrX6TOys
q9VdC0kUGRmY2Un3F/bUWFlL5Fnu8lK3I6KZD6HqgRWK8ayBfktKxUxWiv89
Uv+6bL/j/aOdg2M5M1aIMS8HiSuNBMxNsuljsSY4GqVlwA5vJOSCjfPv2QLl
XvR9E2d2z+/wP3fB2P9hFtJV8KCdwR/8tDYarbf7kJWLupFnS3qSX4POYhmN
l9wey5GM1oNgpLrXlca0AYqiZyXAVthjzcbZb9HyjXZsYDBCHpEGhCl6Noee
GW+YbEhsCcVp76tZsURkwa7ZWBctE5MgmyLCdRqEJxzWOHZ2mNVJW8lPBdXo
b1aeoKGlVCyW7GWFkfGmETZKUyljUkDR82xPWXugMpGvmPN3BGXRrIUThlP0
1j4P57vOJ86PBj3f/Lvbgg/Sv2kC0Le8hGZ3VL6KSHG0OA0Xb2B9LWVFOejo
dhz9oZL+y75G+Pk/LOmrfpb1vwFDmz3+4TD0sts/CoaQoXcBId64/nvDEEHS
OS7+ADy0zqJeSFqoeHrtMz7pWtpn66wjAyIDVkfqJ7ukOWTQxxhkrfgHq1gO
xJVrc0KwepVTCJVISS7apnYKojdgtcvaD6MtvR24vIKOARYqpdV4H1TrrEpU
cJLUlkM/AhKJoJHiPIiPwItPW31b0nNFXe1BUhCEE/ilBdEorIRTZd9HxEua
8oLrf2U2mK9jzAuA8rtuO5BF7MkVNMIiQSyy7IiKBW1+NVUZ1R5zHpXwTXTl
11SzPhx2G7CvKeJC4taoizTwZQYiUuyfxspqcSXnwE7IjkhbBE1TfESQrxYA
Ee20FdM/sTYGD1EmWj1AQkYKjOOgdGyyeRSEmM5ID5wxX2DgvB6YjI4BG7XL
iAstvnWj8T4qZxuujQCJio3zYBCMaOcB8ZNg62d7pP4KCmgl2aJqk06nmgu5
tcpey4oTJM5WvkxqJdNJEpSvMRQCiq+hfELGeK6PdvD+h7P94+PD445buKXP
ed8iC8Sdu3HYXGAvRwmcwlx2/6EeH2ZrUdj5cm8Pp1uFQa/WEYk2CYwYnmrY
neNaTTPCQIM1I5w9HO/LwwBZGq1zy0+nhr3z1Hw9eg6KYOyTHn8oyuvcpBdU
aCP0KLf4cPwrxwoOEswdpLAM1w+ltFMdPop2YHYaZQSCynBptwIHVjkPKsI1
k9IIQfGXIvXFX9C45hfRlUBxIQStKFLrViWmWdbOIZegwt1dnNTkGZuuXG7o
FEtmuHoP1kNnF8zVgucQWZvs6S40wuiumYtFiSMHJm5lncd32dVG6KaQaixh
dIskf1vXepu4KSLPknZct0Iqo9mbkGzIetgF8YU6y8lLypmjxlNvZywJ8tqT
ahUukfvEkis0Bb6To6J7cRmyUE/CYYB2D9FF9wiQlVX6TgJXbdY4rttIEQyX
lg7zOA+3LQUQ9pbzmJMtsAMgBrfN8JLM8F4ojqtHgmGaB34cByGMWrdI0bpR
ExeAQANXmCJQl7mhMj7xRodOg3Vte2M7IU2j5TNj+NHsG4RF2NtHyGkmu9Tw
bQu+uIH2VhUHCx753uBrg9U1uvmQwfSzPlkE2fZ8YQo9oIxlXBwsMlSXBCVG
lmDYkxjdihKYtMazBjoNp4B2bZ3TxINYGDdv3MlXrexq7D5eKkWBenYRXBGj
eOZ4oxRsSp0StdmAbzTKjPHGkZwEEAxaal9Z0LPnbVCtj2khOiN9nFTxr9bj
EGtnOuJbTlrJJmho7LnIzF7kMKZqCHp6nl3M6QpJqS5zMceQl2htAT11sHVl
e3dOWucpXXK+RsFA+IDczkNnI6nt+1a27xxvSZCnXlIADDbDEfZMrhcSurDm
aje4AiW46cIYX7InMcMLwgiRda87l9H+7nu1y0Fs1O8oMpwGAkaP1fQrFMDf
4rU4daN2/MmaWgsjvn5MXncawj5+Q6XS/I+d1miJRO0ODZGJf4ww/KBn3fah
XbPXdAmk12u3dPOzjuX/Aw6NTbXRVu192JNbOrX2fIN8YW3d/ikcGn2mhWV0
8geYFoJPD0X2tvs9Yegh/z8cBv7IZlrR4o9Ziz/C5LaEK/TbeIgvtA08yO4R
Y8g6O7CLvwJ6Rr2yTWaYf8h39i3bBqsCB5ytxuonuXQiBWSUcyBMS2lhT/1u
qB0lwPDVvyEI9ko9lnHkqjivl1E6CZlQxjbqyfTPhU8nvhAuOE5txyildffg
qtm3ysZ7+4DrB8MmGP0kMPAJzJcWdrfawypKt4ZCsYIliER1cTtgNxW+lmLC
FMkSSxYa4zdqkAnXEcct4xHJebX3drlMSABRYOnt9VoHwMQo3uYaZbBwGPTr
qqHpYEY+Lq4j1opmjHOm5ERbgO0CdgG0B8EqBCN+Ce9OH1oOw/Ykj8/eN+so
jByzymxKXWWuMsa9iqmWQXfhL97okpGzeqBAkp7TnyMCp4/ltGELMNPdRXab
0MDsRA2GIIlR8sBfm0sNUFesUxw7ncILjEnyU0vd6AnEDQwCLHdzDsRBaM6M
rDDXgbDtTBt007JMQXSRLh6BQW2N1C5L9Mv1+EDY7xHun4/U+xLtSDY8s0c4
l9ygSKOk8mot1QS5ZsWxUohpSVovJ6EJIFarYQkOsL5frEZHUyUCDvCMdhGd
4627C7aPdFonSwxQg7ZOHxS+iq0IFlO6iSGjuHSXbKM+V+/oWj8yTOxKwpXk
4ZzKOg9t8Cql3uO6uvQqSY7FsDIsTE6V0iTXk3IX3IFBeGZDIpvPyU+P2OTE
Es4qsw/vxDTlNC9keF2yk3TtSUZ5q1gcPUut49qXyUPoqXtA+nhM2VoXcpwk
EntH9fuxgi/V2sNvI2WjczE+pLns3N9YhElEk3JM+9FZvX1kXJ20/QlRylG3
PGxYna4yF0ADueQxY/v5DOsq8+U4dkkQrweYNY7xVVWjpd5lq+ZhGdjvLtlP
xLESEU4Jd4wtG5HvZmnz8RIbyA+7U65mlpRNsQrqzs18ll0GeZFSUbddpZgW
kY41TtJH7OKqDGmNZB0zvky1EmtWQTlYMGpV4slDGTWsEQN3b6jqstw1fiXQ
C1GKlR+NAnHiVdauWVGX03bROU5SYWIqVU6GhTiS0iUmxPfXD5K/z2spsVy1
Qq9fcIQ9rX0YX+2LXb5gusdQDS53lyoUBHIbR7qF+4GTa1xW53Z8KSN/Hl/H
pH1DVUfGDsug7fWUQWuViXkKGHo/7WE+vdHVcoCX3wAXf6FbunhtUKt35Z34
QrqHfOmgXUhhk9rJl63wy/Pwy4tVaH/wLB7aRTDdrVXTfeikHjPufZ+noIve
GnnRNX/4fnAvzHewGu7H76VIGX++9Y/9w3vGvw2Y+q1/KIWtHwr/7T3w3/f5
PTdPqyV2wjLDpkz1IftHBdfdffIWarV8muk8MVK2nh4pL0I8dDAUtnzE/lw9
nagEVvZR5MHY8j6sGzNzZpM3B3/d31Ov3x6CFHwQ3xh/gu3QfLJnhQkvfLVF
QBZ/hGFRLQPKxZUgE1DYp3j25mTkyCjTjuXKsUlC1dFXowiiB5ygINIPCQw6
F3UiKh6DMtzreUPHOhbPkiyz9l1tdceO4C90GteUs+Eq2sRdkAAHACySQBBF
9hQ6/NyN0e5acL4Oyt7zPlBjU2GaXnChiDKA/HJBtwC5YhlkG0laF2t4fbeF
mEzMIL4CjmYIB3yjkl3BMDzACbMJXXTlxGe8YgpUjeycLjeRkF8S6IKJdvO+
Ee/2Lg7vNxHkUyo3X9SUh7irR08iV90nVv3+UtW/hKp/CVVLx73v8y+h6v8H
oerpJaynF7ciAaT12u8w6wd3uRRd98hen4qU8MfHSFhtOCOhCo6vh0hVb/f/
evD67f49gtVBweUL2hcodC+B5T1Ld31gF/5WSZsLync1DVyFiK7xKCp8wqam
7jh9IwCIeJ2DG2SU7FizvS2rQ4KTLxMQiDCpwWCXoA8uk+qM2V60kvCS8xKE
J0amTE1qe6K4Mi3rpmdqVN4ME4Siq7yi4h+MGaoKSbZivIjEUNku4lZOZPvx
9PToz89pFu/Kv3jjoI354EKLBJ8UabA1U8OCWHKDlP1p6H+6CwxktOCMGBSc
pBEJrt05kiHPJl+lGfqDYOFcaRU3YR+TOkL64rwcKl/gbgL2EXu23pUnQCnx
JGDZ69paNtNa6mMV5H+rJhrEeJRS4ekYo44n7e7EoilnL5WWI2srTCRVU7zP
zysE1gLMUTBiYw26JlcouUu9cbqDrlHyMzrGJuSFKDBwu8GLzYSwdJR4i2E1
kWmP7wUc7hwdLTs94g9fhobtAx4T8purpDYNXXk2zmEHne0cHayxnfEsS9eX
v8RNyOky4ktRsRM4tSc6r83S99yNIjwajutiAp3juf/VcFrDx3y+j15FSjyT
ut039+KvzZpHoxHJEfXg3lc77+6+PTzZP8N7nCkG+8ah+e6+d3saPGLc1R+6
1qSzHORt7izIYz+PgyT+tKWg1Z/76DE8KGmuVIZ71TlJq0U7etkRKcUYpZ4h
WvqRLTN/nZb/GPIPEuMRu7+cp0UCDin4tMdLdmcVaKozNnRXRC59v5evQy9Y
T4tqOCIzBDApjjlkTVSOkS+tlOQiYEofpMR36Q8Aa1zBfugKHueTGhu5LpmC
v/F41SnWXazZwsArxGUlXaMB31MUlISMD1V3dMhNWGzgcBH19mJFrrbDRdSC
o066DVLJYQRg68h/3Jnl6z8nviYj16BlgSdIjHHeH/Fhu9tO5ZZVnQS1M93l
zBxMGXndx1ExYqysSfU1rduNLpX2lTb59uCLhV9mX+rzLrZ3ueIcvkil+Box
GSCz5iSB0ONqQLRbcsnL8xKr9GGc8CDEfvicRBbndw1+IWeipBlnBcpTGNtc
e+sbraCazvMmg22V8JA1ZwBgWKorzlnP4P9su8DHG5XmJMuc7JbEXeHZLYCI
t3fZWIWT0+P9nXfifqzdXeIulyQJ54x1q2szPc8XXvACjkn3qB8yGFi4Izd8
YQ9VRCMxAVpSzG10u93Mpe+4ao+CcyFhFNpgDZEEY1/96es9/PVg5/1O/Est
dJ+W4zn5+H3Cli07t/TK6+Yyvq2Y7hWmeF7knfZ6QpudEVWx47r/LGe+XzJG
u9AIBwwREbvmQ98caNnL4rA7PAv4jFbE3z145N75zF/WOeeCx675kcjHnykU
I7m8iHsRs6NvfT+qsJemgHoXXrOYRJJE77UgfQ8Tioc1G5vSZ8+9qLddLAAG
+MV0Yyt4sXUX7aoXz6MX40usl72Ix2LfctiDcCeoI7x0HdR+gVcS2nPxvSt2
2KaBgHiC2+iRreEPQ/rhPkIICi4+cv35TVh7RpL05Bb/idf/S9+nqyyl/EA3
N75YnqzfS/ejGBXCl27VkqLkiURft971cfbRu0GhUBaJPOKXLnmA8dZK9927
e/Os74ZgUKqQeUmiKOjEvKx8x67Sdm2jroLlDRTJxD0k1s/5q/7SXmTztauc
waLsBg619beXW2qoNkdIn7YTkaAwVYn0wOiS1WPLpW2x65ubf8OrYDe3XlJR
UoyDjDqiqL6K7myFLWeqbExVObQTJijEi+JXoKmolXBCxp3EN7268Bwbaikh
cJy85u6UlgO0c+krlVhKTaOznGpiYK0vK0G5hN5uNjKquQnW5hH5RWwg9tpj
w1RAwWJ4J73bxstvPHbL6u2uvPOQYq3Lbem+6t17yatgP0X3F9/GsNAV1cnm
pm+NlwVHm7Hbesv/HF5E3N+atlLv5O2uOghvjG7ROW6mIP6W3osvCmBacAmX
GN9YZSQ7ggCOFiOfCwsy3WXB1+Bk9XguSVNkFzkAmerk2jR074QuPhBdcYa8
3Eci+8FZndJKTxplxT2X2Qvr+T+cSrDPRasAAA==

-->

</rfc>
