<?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.23 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-tjohn-quic-multipath-dmtp-00" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.27.0 -->
  <front>
    <title>Deadline Aware Streams in MP-QUIC</title>
    <seriesInfo name="Internet-Draft" value="draft-tjohn-quic-multipath-dmtp-00"/>
    <author fullname="Tony John">
      <organization>Otto-von-Guericke University Magdeburg</organization>
      <address>
        <email>tony.john@ovgu.de</email>
      </address>
    </author>
    <author fullname="Till-Frederik Riechard">
      <organization>Otto-von-Guericke University Magdeburg</organization>
      <address>
        <email>riechard@ovgu.de</email>
      </address>
    </author>
    <date year="2025" month="March" day="03"/>
    <area/>
    <workgroup/>
    <keyword>deadline-aware</keyword>
    <keyword>multipath</keyword>
    <keyword>scheduling</keyword>
    <keyword>path aware networks</keyword>
    <abstract>
      <?line 47?>

<t>This document proposes the Deadline-aware Multipath Transport Protocol (DMTP) concept as an extension to the Multipath Extension for QUIC (MP-QUIC). This extension aims to support data streams with strict latency requirements by enabling the signaling of a stream's deadline and by combining multipath scheduling, congestion control adaptations, and optional forward error correction (FEC). Moreover, DMTP leverages MP-QUIC's path identifiers to distinguish different end-to-end paths as they may be offered in a Path Aware Network (PAN) such as SCION. This allows an application to select its preferred paths while maintaining interoperability with standard MP-QUIC endpoints. In combination, DMTP enables endpoints to exchange and schedule deadline-aware streams across multiple network paths.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://netsys-lab.github.io/mpquic-dmtp-draft/draft-tjohn-quic-multipath-dmtp.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-tjohn-quic-multipath-dmtp/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/netsys-lab/mpquic-dmtp-draft"/>.</t>
    </note>
  </front>
  <middle>
    <?line 51?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The Multipath Extension for QUIC <xref target="MP-QUIC"/> enhances performance by simultaneously utilizing multiple paths between endpoints. However, MP-QUIC currently lacks support for strict deadline requirements of real-time applications such as teleoperation, live video streaming, or interactive gaming, which are becoming increasingly important. These applications demand low and bounded latency, and can often tolerate no or only partial retransmission of missing data.</t>
      <t>Previous work on deadline-aware protocols for QUIC includes the Deadline-aware Transport Protocol <xref target="QUIC-DTP"/>, a single-path approach that introduced deadlines for streams but did not exploit multipath capabilities. Meanwhile, our DMTP <xref target="DMTP"/> approach allows to take advantage of multiple paths, combined with forward error correction (FEC) and intelligent retransmissions, to significantly increase the fraction of packets meeting their deadlines, especially in the presense of lossy or high-latency links.</t>
      <t>By integrating deadline-aware concepts into MP-QUIC, we seek to enable:</t>
      <ol spacing="normal" type="1"><li>
          <t>Multipath streams with Deadlines: Scheduling and transmitting data across multiple paths, with strict deadlines of streams driving scheduling decisions.</t>
        </li>
        <li>
          <t>Option for Path-Aware Networking: Support for path selection as offered in Path Aware Networks (e.g., <xref target="SCION"/>) by mapping each potential path to an MP-QUIC path identifier.</t>
        </li>
        <li>
          <t>Deadline-Based Retransmission / FEC: Combining optional adaptive FEC (such as <xref target="QUIC-AFEC"/>) and "smart" retransmissions only when there may still be time left to meet the deadline.</t>
        </li>
      </ol>
      <t>This draft specifies a minimal set of protocol extensions for MP-QUIC to exchange deadline information at the transport layer, so that endpoints can coordinate scheduling for multipath transmissions with strict time constraints. As the first version of our proposal, our goal is to gather community feedback and gauge interest to guide future refinements.</t>
      <section anchor="motivation-and-applications">
        <name>Motivation and Applications</name>
        <t>Real-time applications often produce data blocks (e.g., video frames or control messages) that are only valuable if delivered before a specific deadline. Example use cases include:</t>
        <ul spacing="normal">
          <li>
            <t>Teleoperation and Remote Control: Robotic control or telepresence systems require deterministic and low latency feedback. Missed control signals, sensor data or video frame deadlines can lead to system instability or degraded user experience.</t>
          </li>
          <li>
            <t>Live Streaming and Interactive Media: Latency-sensitive video or audio streams (e.g., for live concerts, online VR gaming, cloud rendering) benefit from leveraging multiple paths to sustain low-latency delivery even under varying network conditions.</t>
          </li>
          <li>
            <t>Online Gaming: Multiplayer networked games exchange frequent, time-critical state updates. Late updates are effectively wasted, so an approach to drop or deprioritize old data can save bandwidth and improve real-time responsiveness.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="conventions-and-definitions">
      <name>Conventions and Definitions</name>
      <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

<t>Within this document:
- "Deadline-aware streams" refers to streams in which an application indicates a time by which data must be delivered, beyond which data is no longer useful.
- "Path" aligns with the MP-QUIC concept: each path is identified by a unique Path ID and it may reference a specific combination of source and destination IP:port tuples or multiple paths as they may be offered in a path aware network, as defined by <xref target="RFC9473"/>.</t>
    </section>
    <section anchor="design-overview">
      <name>Design Overview</name>
      <section anchor="integrating-deadline-aware-streams-into-mp-quic">
        <name>Integrating Deadline-Aware Streams into MP-QUIC</name>
        <t>Our design goal is to extend MP-QUIC with minimal changes. The proposed extension enables endpoints to signal a stream's deadline. Implementations that support deadline-aware streams <bcp14>MUST</bcp14> implement:</t>
        <ol spacing="normal" type="1"><li>
            <t>Path Selection: Select paths for transmitting frames, retransmissions and acknowledgements based on metrics relevant to meeting deadlines, including:
            </t>
            <ul spacing="normal">
              <li>
                <t>Path latency measurements</t>
              </li>
              <li>
                <t>Estimation of available bandwidth</t>
              </li>
              <li>
                <t>Observed packet loss rates</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Packet Scheduling: Implement scheduling algorithms that:
            </t>
            <ul spacing="normal">
              <li>
                <t>Prioritize packets from streams with earlier deadlines</t>
              </li>
              <li>
                <t>Account for path characteristics when making scheduling decisions</t>
              </li>
              <li>
                <t>Consider current congestion state of available paths</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Retransmission Control: Implement retransmission policies that:
            </t>
            <ul spacing="normal">
              <li>
                <t>Evaluate whether retransmitted packets can meet remaining deadlines</t>
              </li>
              <li>
                <t>Skip retransmissions when deadlines cannot be met</t>
              </li>
              <li>
                <t>Consider path conditions when selecting retransmission paths</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Optional Forward Error Correction: <bcp14>MAY</bcp14> implement FEC mechanisms that:
            </t>
            <ul spacing="normal">
              <li>
                <t>Reduce retransmission overhead for deadline-sensitive streams</t>
              </li>
              <li>
                <t>Adapt FEC overhead based on path conditions</t>
              </li>
              <li>
                <t>Apply FEC selectively based on stream requirements (e.g., stream priority)</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Deadline Monitoring: Track deadline status and:
            </t>
            <ul spacing="normal">
              <li>
                <t>Detect when deadlines cannot be met</t>
              </li>
              <li>
                <t>Signal deadline misses to the application layer</t>
              </li>
              <li>
                <t>Allow applications to specify handling of missed deadlines</t>
              </li>
            </ul>
          </li>
        </ol>
        <section anchor="extensions-to-mp-quic">
          <name>Extensions to MP-QUIC</name>
          <t>Our extensions build on <xref target="MP-QUIC"/>'s multipath framework (e.g., paths, path IDs, and validation) and add only:</t>
          <ul spacing="normal">
            <li>
              <t>A transport parameter to enable deadline-aware streams.</t>
            </li>
            <li>
              <t>A DEADLINE_CONTROL frame to signal stream deadlines.</t>
            </li>
            <li>
              <t>An optional DMTP_ACK frame for improved per-path delay feedback.</t>
            </li>
            <li>
              <t>Optional AFEC support via an extra transport parameter and two frames for source and repair symbol metadata.</t>
            </li>
          </ul>
          <t>This preserves the original wire format, ensuring interoperability with <xref target="MP-QUIC"/> endpoints that do not implement these extensions.</t>
        </section>
      </section>
      <section anchor="support-for-path-aware-networks-pan">
        <name>Support for Path-Aware Networks (PAN)</name>
        <t>When operating over a path-aware network, endpoints can discover and utilize multiple disjoint or partially disjoint paths. This can be provided, for example, by <xref target="SCION"/> or other architectures such as <xref target="SR"/>. In such an environment, a single source–destination address pair may yield multiple distinct end-to-end paths, each with unique performance characteristics (e.g., latency, loss rate). These paths can be exposed to the transport layer via distinct Path IDs in <xref target="MP-QUIC"/>.</t>
        <t>This document does not prescribe how endpoints discover and enumerate available paths at the network layer. Rather, it assumes that a PAN can supply multiple viable routes between endpoints. Once discovered, each route is mapped to a unique Path ID, enabling the <xref target="DMTP"/> scheduling logic to treat them as distinct transport paths for deadline-aware streams.</t>
        <t>Multiple paths and path diversity provided by PAN enhance the effectiveness of <xref target="DMTP"/>'s scheduling, retransmission, and optional FEC mechanisms in meeting strict deadlines, making support for PAN essential to the design of the proposed extension.</t>
      </section>
      <section anchor="deadlines">
        <name>Deadlines</name>
        <section anchor="signalling-deadlines">
          <name>Signalling Deadlines</name>
          <t>To signal deadlines, endpoints use the DEADLINE_CONTROL frame (see <xref target="deadline-control-frame"/>). This frame associates a specific deadline with a stream, indicating the relative time by when the data should be delivered.</t>
        </section>
        <section anchor="deadline-semantics">
          <name>Deadline Semantics</name>
          <ul spacing="normal">
            <li>
              <t>Deadline Representation: Deadlines are represented as a relative time in milliseconds from the time the frame is sent.</t>
            </li>
            <li>
              <t>Stream Association: A deadline applies to a specific stream identified by its Stream ID</t>
            </li>
            <li>
              <t>Transport Behavior: Upon receiving a DEADLINE_CONTROL frame, the transport layer <bcp14>SHOULD</bcp14> attempt to schedule and retransmit packets carrying data for the specified stream to meet the indicated deadline.</t>
            </li>
            <li>
              <t>Retransmissions and Scheduling: Endpoints <bcp14>MAY</bcp14> implement custom schedulers and congestion controllers optimized for deadline-aware traffic, such as those based on DMTP concepts.</t>
            </li>
          </ul>
        </section>
        <section anchor="handling-missed-deadline">
          <name>Handling Missed Deadline</name>
          <t>If the transport layer determines that the deadline cannot be met, it <bcp14>MAY</bcp14> choose to:</t>
          <ul spacing="normal">
            <li>
              <t>Discard the data associated with the deadline-aware stream.</t>
            </li>
            <li>
              <t>Inform the application of the missed deadline.</t>
            </li>
            <li>
              <t>Continue delivering the data if it is still deemed useful.</t>
            </li>
          </ul>
          <t>The specific behavior is implementation-specific and <bcp14>MAY</bcp14> be configurable by the application.</t>
        </section>
      </section>
      <section anchor="adaptive-forward-error-correction-fec">
        <name>Adaptive Forward Error Correction (FEC)</name>
        <t>When deadlines are tight and packet losses frequent, relying solely on retransmissions may cause data to miss its deadline. To mitigate this risk, this extension optionally uses Adaptive FEC (AFEC) as proposed in <xref target="QUIC-AFEC"/>. AFEC can reduce the need for retransmissions, particularly in networks with random or bursty loss characteristics.</t>
        <t>When using AFEC with <xref target="MP-QUIC"/>, the Tag Type of the FEC_Tag <bcp14>MUST</bcp14> be set to 1 to indicate "Long Flow Usage". In turn, both source symbol packets and repair symbol packets <bcp14>MUST</bcp14> carry the FEC_Tag frame so that repair packets can be correctly matched to their corresponding source packets across different paths.</t>
        <t>If multiple paths are available, FEC repair packets <bcp14>SHOULD</bcp14> be sent over a path different from the one carrying the source data. This de-correlates losses and increases the likelihood that repair symbols arrive even if other paths experience congestion or packet loss. The coding rate (i.e., the ratio of repair symbols to source symbols) <bcp14>MAY</bcp14> be configured on a per-stream basis, depending on the stream's tolerance for overhead versus its deadline sensitivity.</t>
      </section>
      <section anchor="smart-retransmissions">
        <name>Smart Retransmissions</name>
        <t>Smart retransmissions in a deadline-aware context mean that lost frames are only retransmitted if there is still enough time left to meet the deadline via one or more paths. The sender computes whether the frames can arrive on time, factoring in the path's estimated one-way delay or RTT. If not, the sender discards the frames rather than wasting congestion window or scheduling capacity.</t>
      </section>
      <section anchor="path-metrics">
        <name>Path Metrics</name>
        <t>To schedule traffic effectively, the sender should gather:</t>
        <ul spacing="normal">
          <li>
            <t>One-Way Delays or RTT: For selecting the path(s) that can deliver data before the deadline.</t>
          </li>
          <li>
            <t>Loss Rate: For deciding whether to apply adaptive FEC or more aggressive retransmissions.</t>
          </li>
          <li>
            <t>Available Bandwidth: So that sending on path(s) with insufficient capacity does not cause additional delay.</t>
          </li>
        </ul>
        <section anchor="per-path-delay">
          <name>Per Path Delay</name>
          <t>A crucial metric for DMTP is the one-way or round-trip delay of each path. This is used to decide whether a new or retransmitted packet can arrive before its deadline. In a path-aware network, the one-way delay might be advertised or inferred from routing information. Otherwise, endpoints measure RTT or one-way delay themselves.</t>
          <t>For accurate one-way delay measurements, endpoints <bcp14>MAY</bcp14> use synchronized clocks; if full clock sync is not feasible, a fallback to round-trip time measurements is still acceptable. The DMTP_ACK frame (see <xref target="dmtp-ack-frame"/>) is introduced primarily for improved delay tracking.</t>
        </section>
        <section anchor="gathering-path-metrics">
          <name>Gathering Path Metrics</name>
          <ol spacing="normal" type="1"><li>
              <t>Path-Aware Networks might provide direct metrics, such as path latency or bandwidth as part of path metadata.</t>
            </li>
            <li>
              <t>Active Probing: If the underlying network does not provide metrics, the endpoint <bcp14>MAY</bcp14> send periodic PING frames or small test packets along each active path.</t>
            </li>
            <li>
              <t>Path Measurement Frames: This draft introduces an optional DMTP_ACK frame (<xref target="dmtp-ack-frame"/>) for deeper path measurements, including timestamps of packet receipts to estimate per path one-way delay.</t>
            </li>
            <li>
              <t>Congestion windows, RTT estimates, and packet loss detection from <xref target="MP-QUIC"/>'s standard loss recovery can inform scheduling.</t>
            </li>
          </ol>
        </section>
      </section>
    </section>
    <section anchor="extension-to-multipath-quic">
      <name>Extension to Multipath QUIC</name>
      <t>This extension builds upon <xref target="MP-QUIC"/>. Below we list the protocol additions and modifications. Unless otherwise noted, all rules of MP-QUIC remain.</t>
      <section anchor="transport-parameter">
        <name>Handshake Negotiation and Transport Parameter</name>
        <t>This extension defines a new transport parameter, used to negotiate the use of deadline-aware streams during the connection handshake, as specified in <xref target="QUIC"/>. The new transport parameter is defined as follows:</t>
        <ul spacing="normal">
          <li>
            <t>enable_deadline_aware_streams (value TBD): A zero-length value that, if present, indicates that the endpoint supports deadline-aware streams.</t>
          </li>
        </ul>
        <t>Endpoints negotiate the use of deadline-aware streams by including the enable_deadline_aware_streams transport parameter in the handshake. Both endpoints <bcp14>MUST</bcp14> include this transport parameter to enable the use of deadline-aware streams. If an endpoint receives a DEADLINE_CONTROL frame without having negotiated support, it <bcp14>MUST</bcp14> treat this as a connection error of type PROTOCOL_VIOLATION</t>
      </section>
      <section anchor="deadline-control-frame">
        <name>DEADLINE_CONTROL Frame</name>
        <t>The DEADLINE_CONTROL frame (type=TBD) is used to signal deadline-awareness for specific streams and to indicate their associated deadlines.</t>
        <artwork><![CDATA[
  DEADLINE_CONTROL Frame {
    Type (i) = TBD,
    Stream ID (i),
    Deadline (i),
  }
]]></artwork>
        <t>The DEADLINE_CONTROL frame contains the following fields:</t>
        <dl>
          <dt>Stream ID:</dt>
          <dd>
            <t>A variable-length integer indicating the Stream ID to which the deadline applies.</t>
          </dd>
          <dt>Deadline:</dt>
          <dd>
            <t>A variable-length integer representing the relative deadline in milliseconds from the time the frame is sent.
An endpoint sends a DEADLINE_CONTROL frame to indicate that data on the specified stream should be delivered by the given deadline. Upon receiving this frame, the peer <bcp14>MUST</bcp14> attempt to schedule and deliver the data on the specified stream within the indicated deadline.</t>
          </dd>
        </dl>
        <t>Usage Constraints:</t>
        <ul spacing="normal">
          <li>
            <t>Endpoints <bcp14>MUST NOT</bcp14> send the DEADLINE_CONTROL frame unless both endpoints have negotiated support via the enable_deadline_aware_streams transport parameter.</t>
          </li>
          <li>
            <t>If an endpoint receives a DEADLINE_CONTROL frame without having negotiated support, it <bcp14>MUST</bcp14> treat it as a connection error of type PROTOCOL_VIOLATION.</t>
          </li>
          <li>
            <t>The DEADLINE_CONTROL frame <bcp14>MUST</bcp14> only be sent in 1-RTT packets.</t>
          </li>
        </ul>
      </section>
      <section anchor="dmtp-ack-frame">
        <name>DMTP_ACK Frame</name>
        <t>The DMTP_ACK frame (type=TBD) is used to acknowledge the reception of a packet and feedback the reception time to the sender. If the received frame contains a PING (type=0x01) frame, the DMTP_ACK frame <bcp14>MUST</bcp14> be sent back on the same path that it was received at. The DMTP_ACK Frame contains the same information as a <xref target="QUIC"/> ACK frame, but adds a timestamp to it, in order to communicate if a packet has met its deadline or not.</t>
        <t>When using deadline-awareness the receiver <bcp14>SHOULD</bcp14> acknowledge each packet separately.</t>
        <artwork><![CDATA[
  DMTP_ACK Frame {
   Type (i) = TBD,
   Largest Acknowledged (i),
   ACK Delay (i),
   ACK Range Count (i),
   First ACK Range (i),
   ACK Range (..) ...,
   [ECN Counts (..)],
   Timestamp (i),
  }
]]></artwork>
        <t>The DMTP_ACK frame adds the Timestamp field to the <xref target="QUIC"/> ACK frame. It <bcp14>MUST</bcp14> be formatted according to <xref target="RFC3339"/> with a resolution down to the nanosecond, i.e. with 9 digits after the decimal point. If an endpoint uses a clock with a lower resolution, the remaining digits <bcp14>SHOULD</bcp14> be padded with zeros.</t>
      </section>
    </section>
    <section anchor="api">
      <name>API</name>
      <t>Though this draft primarily focuses on wire-level protocol changes, an implementation that exposes a user-level API might provide:</t>
      <ul spacing="normal">
        <li>
          <t>SetStreamDeadline(stream_id, deadline_ms):
Informs the transport that data on <tt>stream_id</tt> must arrive before <tt>deadline_ms</tt>.</t>
        </li>
        <li>
          <t>SetStreamPriority(stream_id, priority):
Assigns or updates the priority for a stream. Lower numerical priority can indicate higher reliability requirement.</t>
        </li>
        <li>
          <t>OnMissedDeadline(stream_id):
(Optional) callback that the transport can invoke if data is considered impossible to deliver on time. The application can choose to send new data, discard, or do nothing.</t>
        </li>
      </ul>
      <t>These calls let an application specify deadlines and priorities dynamically.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This extension retains all the security features and considerations of <xref target="QUIC"/>, <xref target="QUIC-TLS"/> and <xref target="MP-QUIC"/>.
Nevertheless, it introduces additional considerations:</t>
      <ul spacing="normal">
        <li>
          <t>Deadline Signaling: Knowledge of deadlines or priorities may be sensitive if it reveals application timing patterns or critical data intervals. Implementations <bcp14>SHOULD</bcp14> carefully handle metadata (e.g., by encrypting frames in 1-RTT packets).</t>
        </li>
        <li>
          <t>Resource Exhaustion and Flooding: The ability to manage multiple concurrent paths and to schedule or drop data based on deadlines must not weaken QUIC's anti-amplification measures. Endpoints <bcp14>MUST</bcp14> still follow QUIC path validation procedures, ensuring that an attacker cannot exploit deadline-aware frames to amplify traffic.</t>
        </li>
        <li>
          <t>When employing DMTP_ACK frames for one-way delay measurement with clock synchronization, the clock synchronization must also be secured. Otherwise, an attacker injecting false timestamps could mislead scheduling. Endpoints that rely heavily on these measurements should be aware of that risk and possibly cross-check with measured RTT or other heuristics.</t>
        </li>
      </ul>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document defines a new transport parameter for the negotiation of enable multiple paths for QUIC, and two new frame types. The draft defines provisional values for experiments.</t>
      <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">Value</th>
            <th align="left">Parameter Name.</th>
            <th align="left">Specification</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">TBD</td>
            <td align="left">enable_deadline_aware_streams</td>
            <td align="left">
              <xref target="transport-parameter"/></td>
          </tr>
        </tbody>
      </table>
      <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">Value</th>
            <th align="left">Frame Name</th>
            <th align="left">Specification</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">TBD (1)</td>
            <td align="left">DEADLINE_CONTROL</td>
            <td align="left">
              <xref target="deadline-control-frame"/></td>
          </tr>
          <tr>
            <td align="left">TBD (2)</td>
            <td align="left">DMTP_ACK</td>
            <td align="left">
              <xref target="dmtp-ack-frame"/></td>
          </tr>
        </tbody>
      </table>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="QUIC">
          <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="MP-QUIC">
          <front>
            <title>Multipath Extension for QUIC</title>
            <author fullname="Yanmei Liu" initials="Y." surname="Liu">
              <organization>Alibaba Inc.</organization>
            </author>
            <author fullname="Yunfei Ma" initials="Y." surname="Ma">
              <organization>Uber Technologies Inc.</organization>
            </author>
            <author fullname="Quentin De Coninck" initials="Q." surname="De Coninck">
              <organization>University of Mons (UMONS)</organization>
            </author>
            <author fullname="Olivier Bonaventure" initials="O." surname="Bonaventure">
              <organization>UCLouvain and Tessares</organization>
            </author>
            <author fullname="Christian Huitema" initials="C." surname="Huitema">
              <organization>Private Octopus Inc.</organization>
            </author>
            <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind">
              <organization>Ericsson</organization>
            </author>
            <date day="3" month="March" year="2025"/>
            <abstract>
              <t>   This document specifies a multipath extension for the QUIC protocol
   to enable the simultaneous usage of multiple paths for a single
   connection.

Discussion Venues

   This note is to be removed before publishing as an RFC.

   Discussion of this document takes place on the QUIC Working Group
   mailing list (quic@ietf.org), which is archived at
   https://mailarchive.ietf.org/arch/browse/quic/.

   Source for this draft and an issue tracker can be found at
   https://github.com/quicwg/multipath.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-quic-multipath-13"/>
        </reference>
        <reference anchor="QUIC-AFEC">
          <front>
            <title>Adaptive Forward Erasure Correction for Delay-Sensitive QUIC Connections</title>
            <author fullname="Dmitriy Moskvitin" initials="D." surname="Moskvitin">
              <organization>Huawei</organization>
            </author>
            <author fullname="Evgeny Onegin" initials="E." surname="Onegin">
              <organization>Huawei</organization>
            </author>
            <author fullname="Rachel Huang" initials="R." surname="Huang">
              <organization>Huawei</organization>
            </author>
            <author fullname="Hanlin Luo" initials="H." surname="Luo">
              <organization>Huawei</organization>
            </author>
            <author fullname="Qichang Chen" initials="Q." surname="Chen">
              <organization>Huawei</organization>
            </author>
            <date day="6" month="May" year="2024"/>
            <abstract>
              <t>   This document proposes a FEC supporting mechanism of QUIC protocol
   for both short flows and long flows protection in accordance to the
   sender observed packet loss rate.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dmoskvitin-quic-adaptive-fec-00"/>
        </reference>
        <reference anchor="RFC3339">
          <front>
            <title>Date and Time on the Internet: Timestamps</title>
            <author fullname="G. Klyne" initials="G." surname="Klyne"/>
            <author fullname="C. Newman" initials="C." surname="Newman"/>
            <date month="July" year="2002"/>
            <abstract>
              <t>This document defines a date and time format for use in Internet protocols that is a profile of the ISO 8601 standard for representation of dates and times using the Gregorian calendar.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3339"/>
          <seriesInfo name="DOI" value="10.17487/RFC3339"/>
        </reference>
        <reference anchor="RFC9473">
          <front>
            <title>A Vocabulary of Path Properties</title>
            <author fullname="R. Enghardt" initials="R." surname="Enghardt"/>
            <author fullname="C. Krähenbühl" initials="C." surname="Krähenbühl"/>
            <date month="September" year="2023"/>
            <abstract>
              <t>Path properties express information about paths across a network and the services provided via such paths. In a path-aware network, path properties may be fully or partially available to entities such as endpoints. This document defines and categorizes path properties. Furthermore, the document identifies several path properties that might be useful to endpoints or other entities, e.g., for selecting between paths or for invoking some of the provided services. This document is a product of the Path Aware Networking Research Group (PANRG).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9473"/>
          <seriesInfo name="DOI" value="10.17487/RFC9473"/>
        </reference>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="DMTP">
          <front>
            <title>DMTP: Deadline-aware Multipath Transport Protocol</title>
            <author fullname="Tony John" initials="T." surname="John">
              <organization>Networks and Distributed Systems Lab,OVGU Magdeburg</organization>
            </author>
            <author fullname="Adrian Perrig" initials="A." surname="Perrig">
              <organization>ETH Z&amp;#x00FC;rich,Network Security Group</organization>
            </author>
            <author fullname="David Hausheer" initials="D." surname="Hausheer">
              <organization>Networks and Distributed Systems Lab,OVGU Magdeburg</organization>
            </author>
            <date month="June" year="2023"/>
          </front>
          <seriesInfo name="2023 IFIP Networking Conference (IFIP" value="Networking)"/>
          <seriesInfo name="DOI" value="10.23919/ifipnetworking57963.2023.10186417"/>
          <refcontent>IEEE</refcontent>
        </reference>
        <reference anchor="SCION">
          <front>
            <title>SCION Control Plane</title>
            <author fullname="Corine de Kater" initials="C." surname="de Kater">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Nicola Rustignoli" initials="N." surname="Rustignoli">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Samuel Hitz" initials="S." surname="Hitz">
              <organization>Anapaya Systems</organization>
            </author>
            <date day="24" month="December" year="2024"/>
            <abstract>
              <t>   This document describes the Control Plane of the path-aware, inter-
   domain network architecture SCION (Scalability, Control, and
   Isolation On Next-generation networks).  One of the basic
   characteristics of SCION is that it gives path control to SCION-
   capable endpoints that can choose between multiple path options,
   enabling the optimization of network paths.  The Control Plane is
   responsible for discovering these paths and making them available to
   the endpoints.

   The main goal of the SCION Control Plane is to create and manage path
   segments which can then be combined into forwarding paths to transmit
   packets in the data plane.  This document discusses how path
   exploration is realized through beaconing and how path segments are
   created and registered.  Each SCION Autonomous System (AS) can
   register segments according to its own policy and can specify which
   path properties and algorithm(s) to use in the selection procedure.
   The document also describes the path lookup process whereby endpoints
   obtain path segments - a fundamental building block for the
   construction of end-to-end paths.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-controlplane-07"/>
        </reference>
        <reference anchor="QUIC-DTP">
          <front>
            <title>Deadline-aware Transport Protocol</title>
            <author fullname="Yong Cui" initials="Y." surname="Cui">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Chuan Ma" initials="C." surname="Ma">
              <organization>Tsinghua University</organization>
            </author>
            <author fullname="Hang Shi" initials="H." surname="Shi">
              <organization>Huawei</organization>
            </author>
            <author fullname="Kai Zheng" initials="K." surname="Zheng">
              <organization>Huawei</organization>
            </author>
            <author fullname="Wei Wang" initials="W." surname="Wang">
              <organization>Huawei</organization>
            </author>
            <date day="29" month="July" year="2024"/>
            <abstract>
              <t>   This document defines Deadline-aware Transport Protocol (DTP) to
   provide block-based deliver-before-deadline transmission.  The
   intention of this memo is to describe a mechanism to fulfill
   unreliable transmission based on QUIC as well as how to enhance
   timeliness of data delivery.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-shi-quic-dtp-10"/>
        </reference>
        <reference anchor="SR">
          <front>
            <title>Segment Routing Architecture</title>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
            <author fullname="L. Ginsberg" initials="L." surname="Ginsberg"/>
            <author fullname="B. Decraene" initials="B." surname="Decraene"/>
            <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
            <author fullname="R. Shakir" initials="R." surname="Shakir"/>
            <date month="July" year="2018"/>
            <abstract>
              <t>Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment can represent any instruction, topological or service based. A segment can have a semantic local to an SR node or global within an SR domain. SR provides a mechanism that allows a flow to be restricted to a specific topological path, while maintaining per-flow state only at the ingress node(s) to the SR domain.</t>
              <t>SR can be directly applied to the MPLS architecture with no change to the forwarding plane. A segment is encoded as an MPLS label. An ordered list of segments is encoded as a stack of labels. The segment to process is on the top of the stack. Upon completion of a segment, the related label is popped from the stack.</t>
              <t>SR can be applied to the IPv6 architecture, with a new type of routing header. A segment is encoded as an IPv6 address. An ordered list of segments is encoded as an ordered list of IPv6 addresses in the routing header. The active segment is indicated by the Destination Address (DA) of the packet. The next active segment is indicated by a pointer in the new routing header.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8402"/>
          <seriesInfo name="DOI" value="10.17487/RFC8402"/>
        </reference>
      </references>
    </references>
    <?line 310?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The authors thank the QUIC working group and the designers of both <xref target="MP-QUIC"/> and <xref target="QUIC-DTP"/> for paving the way for deadline-aware features in QUIC. The concept of scheduling data with deadlines over multiple paths builds on numerous discussions around partial reliability, adaptive FEC, and optimal path selection.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA7Vc/XbbyHX/H08xpf+I1ENyLdvJrtlsUlqSd9XIlirJycnJ
yfGCwJCcFQig+KCW6yin79AX6LP0Ufok/d17ZwYDkPJm22b/WIsgMHPnfv7u
BziZTKLGNJmeqdGZjtPM5FrNH+JKq9um0vGmViZX764n//rh4nQUJXGjV0W1
m+HqslDP1N3V2dVMvTWrFk8UbaOSoqp0gn/tnVGUFkkeb7BBWsXLZtJ8X6zz
yb+1Jpls2qwxZdysJ+mmKSfPn0d1u9iYujZF3uxKPHJxfvcWu8RZXYBAk6e6
1Phf3ozGaqRT0xSViTP6cDF/g3+KCn/d3L0dRXm7WehqFqWgYxYlRV7rvG7r
mWqqVkfbmXoZ4ZAxVh1FD0V1v6qKtuRP93qHC+ksUhOVWpZMYmIJXfE004c6
Weu0xQ0r+kRXFd+oct3QonW01XmL/ZVamWbdLrABvqp39SSLF19sSmYDH56Z
M8KNGQiuG9y4bpqynn3xRffAVBaZmmL/0S9+grvTdbPJRlEUt826qOhw2Eup
ZZtlIp3RXZHv1L/g8RF/U1SrODc/xg2EgW+vmqaYbIt88k2rK5Pca/UhN1td
1abZqXfxKtWLtlrJo3oTmwzPNFhxSgT9c7FdtdNUjw5ta7Js8rbSKZa9VzdG
J+u4Sv/faKjsgh0JUV5UGyy5ZbkoUuyZqpbJ6+dQQHthcnd56y6e0EVrAdDI
ydlUWG10sxxw2j8+f3veuzfdFPX91jTGyiZO45IomCx1Qg/dvD19+fLl65n9
+/WrL1/OoohsLCT17N3d9UydXV1MT55PX7x8ffL6i4u3F9fvRdmghb/88vWv
Xk5fPH/xEnecfPWrVydf0nO3pxdX73vk6HtoWTWpEzB2AuNoqiIrsxiK/vxL
f4gz2q17qF4bIT5tSl71Zka0fvXq+YsoiiaTiYoXdVPFSRNFd2tTKxh+u4Gt
qrIqyqLWtWrWWp31TEq9c7xTd1Wc12VRNeq6KpoiKTJ1RCc+hk/JE102Kq5V
nCv9QwNTBuGqKXjFbolz/xUYx4dQR1Zyx1PFRHVPxwbODUvUbcm7wlPEqrZO
7wGWRh8MXBlZZJ7sVKVx/ErTkWq12CmdxwuyfSaiNqs85k/FUrl1flF7DwLK
U3ooKTYLk9N9XmsCNzKms65g/0SglYtiZWEbqMe8TFHShzijU4KJqdJVhfNa
10uPHkH/cOJ3RaULGMiYVUdlGn/HWN6pM+hjAgy5VLM0MCXiSGpAQL5qTb3G
38ulrkiKcLwT2B/+4YdqEgdOvlObeKcW8P58Y0rxIlbXtKzEEaue6uh6/v4Y
3E7W9CTrpJVJnGXFA8s2LsvMJHxWFo3OKJYY8LusNJan9WXzh7XJNLY2eRML
P/GXhqLhhAuTkUewMgTHiEf2yHSMssC99VRd5FYcvKFlEksVLPL3ESH6BzgR
CIbZb8WlB9HB606cVEVdW/lmPhgI4VMxlY1J00xH0TMQASGnLcuNDOcn9PnT
J3uQx0eQCKIS0IpDs6fAB9Kx2tDesOairbOdahvw48dO5UCS8HABwrTOQ5Z8
WzxoVhjHrqStSPpYJouT+9pbCxFk7cOreM9AYAZgRzZpzEaHcq29CjSQLstL
uJ/BzaktVLGwnGR7wDYsWLgV+n5lL0P8tAi4vtCQocg/wVM1/gSxZkNUxnlD
KqbrAQUpogMECa0TsyxagIrUGboYWQJ1LJa4APlnRCQEWRA5RY71y7hqgDxw
xIbclgUtdGj+E+SQO4Gwryu9NZCDYhXALQOlKa2vqzsR4yBZmx52lwec5KdP
zls/Po7J9RAH9ETQSIn1Y3CqWccNMZJVDUd1VNROkKy5CwC41KQ4KMz9hzIr
TBO4qSQuxbSMhqa803HORggZtZXYzqdP9A800+9rTZs8dYx4HadbyAQuiDnV
08axtUUQx4b7ed/GIiLFyDKzIu/UFwRWI/cBnwyvBkmS/lr90MzWJSuUSKyE
YgNjqY3WjXXnpuo4NFa6LnUCafMi/Di8EeFJPkYGY9+RYqzNaj1xwQKP3pOx
v9kxmSvSctKKvjhtZCOQDXqtzUG74Uy0vmfPw+4IYOBkGjiGXphyKgJwe+sj
CTPIsqRpnELu+SbL+jDcdaqBw7mN0spsaZEuVOG+xDCvp9GLqbrimMTaRL5/
0vP9uB20BZ5DDsHenUNxHUaP/dhRqyM9XU3HUDCOG4+Px+TnNlAzokSTppVF
Q0EMNsmLg3WxT1yGUW4avZx2lvUGSpGqm74lf6EYwp36cO2DrsNudIM6cs7M
WiEBP6KOuD+qN/ASo6FqigN5WGtWpUpz/ETAzTKKouwuM71s6ASkkaxvTiZT
B60IkSlWS5wHIQduJzcbUFfjCdJp5x083hFLdwwJY5r33x5vkkhk48b7myze
UVyoC/ElXXgkR5kUyJgojupQQ2jDzn30mRBqHJ+ZUjTcImFoLs5vaaq6UYzw
xVTJ0wiajDPxO6sChzbsYVYx8ZPcyKbNCQAstU4XMG6WxipuV1piCfAV399C
I5CKNJS7Al6ABRy6wORnz4CdIGTLCzw+D+JHFN0cjmwSL0pxsmJwi6xIOv2V
8AbnsyHzqjzEw8eagNmxMJdUn7VkG2ct2b8yS4iJIiTZyEKDs5pcvShA0ukH
IEO8IcNu4ZySmEC3DSdwIRN1F4ZcPteN3sBwoOdMCBB9scDBE08ZiKQ4LQ4P
h0Iq2mg4BBvrsTMYSspX01Muqjov6CQA3wXBg3S3rMBleB5yo9iDeYV/AwYF
johULMMndupMAE4FZGeBHj1PHpZiOM5dUexCgkj0TnHoSzLWWwcpmMaLAFK8
06mJZ+pSSJ4QQabpsAgWj9vUFN4VWlGScjNkYR9eNTgLREZm9PsbD1OSrGhT
8Cqn7DZfwWvpHIoGJ1gVG4fHDyAzTktqQrbETh9UrAog9dhCzwi0gGNxtaMV
HMoEOalpxC9P1JWQ9A3TM7MRhE3ZPaDJNEgdvT9YkmxhCGM2zElSYbmEXEtD
9t2WVFKBjV4Gn1hjNVw4s5TcWwwppewuBNZbGILkAuYrEisrU9DaP0LZs1RU
gCRdx+DqAmJ6MClhGIr0Gyyw1QGihD6WOCN2g4KQyQJKQ4m35OLJFOmpM7Jp
Y02WkPU9shWq7dRq9O7D7R3Vjehf9f6K/745h2+8OT+jv2+/nV9e+j8ie8ft
t1cfLs+6v7onT6/evTt/fyYP46rqXYpG7+Z/HAmwHF1d3yGGzS9HgibCTJnY
CB4trKOC1YGLCC8R4CDksJAA+eb0+r/+8+QVYs4/IAF/cXLyGpBLPnx18uUr
fKDoYnNFF2zGnKxFEIWOK07SEHAA6UzDdogQVq+Lh1xRSAI7//FPxJk/z9Sv
F0l58uo39gIduHfR8ax3kXm2f2XvYWHigUsHtvHc7F0fcLpP7/yPvc+O78HF
X/+WzWNy8tVvfwMV+gOC0lAmM1jR6OxgpkehfWlz5rqrltrcpJ/NGlhlIqYi
8W6xszey3m9g7SR27+TH+LSDKYc3gSqkIBlVCCpydMs2IxsfEWAaQZ7wqTaw
clnEZXCCMWcWJjESqjswxFWJGM7EwOgFe12cidE1DE34jOz7g4AT5M0MExGK
E8mOU6pe2G8urmeMHZq2zCTgDfzc50oI++VU1tKUAzVT/emTrZU9PlLMhr1T
WFFXYODW6AcO4xcB+PZSHBa4O+wdRVct+SZeKMAWDKO6IgIz2UEucZs1Z5qu
1pUGhaaDFQUJgIcqRVN1QRGcdM/CCsYEvkx1uOjAxmncg5IvsDBvHcqe2T8t
6yl+9fIDQSXjPbhKQkUIz4uHTKcrV/5izIzDbTRhOMIDiGZItBxsDZMdLCog
hGIQlQ4nQpoLaxukZa2tG8jX59ChjdeueBubjGGQjwpy29UC0X7LNSFK4TgV
U5Sqw9+/oPPz1S4pmnWsDXFqnK0oEK03wmpHYheeXIbIUbuXe8GXZkgouqPK
s/MkKdo8yHWoBg28ARRAOKkW+L+J75/KqWSZU4pwFORtFSasDko07nGHBRtR
bjNIZjy6644/KFyUBTyV0T0GnDP6xCYglpG1f6ZpPM8FnHGiUlHNPe8JXha6
vTflnloxB3oQj6oOcALQqMHphYMe18ijNnvEbsOjCBdeuZwUVvbW1hLOuZZw
6msJAETzP3ZWwxndhvoFgLN9ZbjRDOmH5R54mjXh0mXRqUCAIK2qWJ2gvJG3
8I95Kxqc0D6A8LHjB+xZGVn5Z2TxftHNYlP7lQVYu+Mo+mWX7yKzyblxRvZw
V1F+5DNAUqqWTd6e+wwABC7jp4V1K/7Mr0Qs0rUr0YeRkNGnPWHGJbgwhSLX
yEFmpyCG1FXUN5I+dIoF3/6sq4/ycz0XHuS9i9ZkzLGgdvqLOshM2fNJjVr4
Z6sipQRDW3WHNZiUqZT0Pk4FXXFiNQ8y5TKm9WDrXf3mCa895SfPzudnlxfv
zz+eXr2/u7m6tOlPFySsOP3h+bG8q0hQ0e3j/PR39kFSRguYUyoNSykQyCIO
EjLKDdzzc9YxG1+2JrZdlio+eCguLD34LJbrh134r3QZG1zZbRac1zaxLYRy
3YLTSHhsSe+hg0h+QMADZZJSexgr6tNWTxf0+wVwH1EpRKYFVy47e2649Nup
gmT2YSFqv1ZVS6MCYJB03ibLpIRbOjvrxGSASvq1kNTUidwMdkjtXXe4B99+
T/cqjgxcRIZR+6vSI5C2CC22YERBmWgqKaeW/H4s+MdWw7gszS46rpK1IZNF
PO0q7bjxBhiJGh5yiUDJ1lRFvuE8zxWNrSD/+9//I0RxUHQsRq0iCJaQ2s5o
GFR4JNyb7HeIxgI5WWwWX4adimFMtMbnq/A+mh+7Ir4gF8sXJPkMtKyLGVSq
WI89ZRbWMjwPFGg67FSmha5Zh0hROeFSSIoCAfeEq3M8xZ2BQQx21TOXkzNF
iMpcoBoTsI7rut3YcEvtsvl7SX1b9vmetTgELVoVLWUOB/o1V8RIRxTpCHOc
7yfkShVSYdEQ4Y/77UtfuQ/ASFasgPSJvXA/fKANA3DH1NA5OET5lJ+L3g2A
v9URrOYa+E7PSbOJH7a7xeT50gIl+xQPHL3w42H3tB+fB93SQXQ3uQeqw8r3
2EOz0FUQTYhCUmS2WmczBVDUHAT/4nHO+mFLYmUWpiRUoPD+Pmw9eM1rbefi
iWhxVGuSoue/LbRN+NvHR9f+lpuhfUVibDa6V0QUg3WZydilrk5VgPR5JCFI
Y6WUbTvo66LN0l4uO5VjewByS+03MnmKnP7qjS0yNnbcw7OGqyKV+5brIaCu
TwYJ04CltSYUZZE6uwX61nZ8NmwTtAiFP0n/1NzygvecB/16QiWCYAIe2VDc
z56pP21XuzijKqs3jDd6HW8BwmbqQwlPCtippY8SPyHH8UFfZosiMXD3puQU
y/egJeY6XB6A8krKgiwTzvVoSME2DFJ3jrDH4CoUHcoiLt0cyAbDhOrcK2gf
Sidt3VCyZOms5Mn96Qb+ikx0gzCZHvIh2H8J1o+7vvEaNtbhYO48ukaaVbVv
HXS0ZWenS1F0sTzIYVfGdi45bLr04S67bzprsi6IjqZgAHgGH0wphrcDb2Np
V5I56B2JyxfcedmDytatDMAvPUAZnclbb2TOOKVOtCQaSdW5q5RqiCT1BSOu
hHqFXlgN5ZpQr+4w8feQ5OjECy52L2nYT7Lx3ZBicXdz3yF7Iu+SHq6FWGnP
zhuzWjc2PPicnmCmL0rD8Fmz6yKjfIjNqq+jhFGSmBwms4OUHF+xmXZFlju6
it0ofHPBDzDkfix/drUbFzxojILImPeaf3NpRded42d8EXQCpwKuKbZXkkIK
LrCqvte1ZkiYtFlcSbPZDRKKDuHeFEaFBxdtVSNmMkQa4Kip5WvLYwi8/RA4
i5e5i1fqbldqp2a48yNd41LSQnMrEbw7of8556BGlzBh9Zbytg/UshoxqgTc
RLRdFNTTk1zAJgDOH+2nBu4b3o3dVY8Icdeu22gfDUsOrIysUASY4oYcjY3K
xs4LUIcgFVVhmjwx0gTvRpvcZM7FcCiBVdKDuzFLfUCL9c3ML4L1XZoQbODD
UcHuxPpmdslCGidJEqJTCt4VhzconFV/GXeQAQZJnjJzD9OHD0p7LBLuEuEV
qSk3iuAPJDuQM3XdsdAfF1VocVLMTApmH0PcIzPVU1Ecbh/KgE9vT4pLofTr
46HbEI8dc1ZqQxD8uIHiy2QvJ1oCJnxdVMZviFqyGF87IdjY9o1aucoL4KRN
9agDP4xhUSSXh26Dq877AxoNvAGVKHPhM7jTuNzX92n7lTGztJ1974J1XrSr
9U809zllIQWhOjk1eH0yyCdLpbddcirgSnIe2YhRWKkTCw2BiSX8QmGTaUGo
WBI81VJfZXHoyUO8s+UB7HxzdweTXlIWJNK2W6cS4Opwyyq2RGBr6vjRRoFK
PcBrwE9QgaDLKmiKKPEC4mzkndSQBQI7YGPDfthV7NFjcaY0/TkEX+Eof8Ah
zugotT3LjIJQUCx0TDhyvXZO2SWI2o69dNf7YxcTdUku44amyXlFqtSyunpJ
FBwId/35ECfKeLWiHNpshzVEKeb49PGNK3DP1K31fXVnF45w9ucmr1vikGG4
ZbnaZbASAJG7G5v+sIQtPrrWUvoQXkXRXCVVSyNOtp7PpsbAytTOb7GaUMyi
abkJ7iqd0iy71pL1YYbzFfbHzKiuhhwjpLFKHComhzpsxdAP2hf5EyWYkEah
asNAYsEzZxpBldEiNT7tGCm7ZEqUxTr85AtyaiL0AQ+E6ZftUZBKyRBguBel
xlCxLZXmItKOOEla9poDmoJGR7g4eUmSVr3Lk3VV5AyFE54c+SfyJjQuL5/5
FmkEwgvRuCPHJUB8YBSedQHLAwmxxwm37XwSaARiJq0TFzOoIrqEkt4wwLo+
kWSg2A0SlhUcSWWg972yo+ULVZfBX6t137CtEr/7Zm9bVcM6nEjQlgXgf/i9
Ettv6rKBMuwkETLqBgdqhlMy4kf9Ol+MfAFYJsMf11WxkMaQYCCeqch6AxVB
TUgo8SRwZcIKkWVYc+kLR0TcTNT1xftvglmfekMdd3q5owMi1MsV47HDKGxD
1MGxHPKCU295oZkK5r+8GHh2+qly8NEhIUqehZhbOd6Emum7daw/dRNvyrqb
lJQ0trST0TaSKL9UT+Wn1Ic5HYYEbEF25J61BfawiZdy34EnCslO+5V7P9Mt
FULNxa8dOw8x5CDecGP4PHxloJuilG7B4LUA7hbAfZX9hsEUuTyB3gdCXnXj
yj0yZOe8rOC0DaS/dA2NqfqQZ1y0cl6FdIkqdaQNVZvJnKVrLEsPTWIjJbH1
msZm3+tV0ZhuaCuYAvZl+U/PfE478cX6x73jSfu8tn74QH1/7D13bneVWNjK
tOsT7ee09SkoAEBuZbd2J5D5El998FkS8fWOE6KDtCjT9ftjKjDyNDEHe+mr
fHTkfGRyPvoZLWpdIsN5c3ZMRZ0fdVVMMp2vIHT5hiLrmFyrrSqNgwENXwDw
tm3LgPUTp4e4ujLIz+HaYheaGu/4uVMd5JDgOs9p6CllYUFs4cEAmQGU7Pbz
naqfpJrRYdxVoW1Vi3XqieIk4RV6OZBKDexZLYtSx1kpqhClrtZsainzBdok
k+CUrFLSen1zdXd1enX58fcXV5dzmuyRUuuQAvabsI4nKqNSDnmqqEo7fU1a
FCKaQZVWuMOFae6F9UuF4hLCDFoS1KA8FPT1or/+9a+RevIQ/GYbp+xH5lh9
Tfo95mu++khfyCVfV7VXHnntz52WGAPnYxE+2xrPhVC3h4zObzKLyKi2CPuk
Mc6weMydNbJXLu5IAxNkmKmX9Ng6K87uKP788r4QvFePDuaYf2YxeB5oM8Xw
z6hyX5KxfW3M5azD+uqBYrirmq2omxFA20GBuPHVesEZpcbZ2UKeqgK7JMaX
AZ8i6sFNuR2u+UZc1+HpCzuPzQ73vO9RaPCO4c5nehKtRL5F3yGtabxz3wVw
9vu/8oFcQP27uyTT/GyHRIR9xt54cS4fuOIRpHIyIWRkAaLtHjk8511ZH85Z
ox6gvoOuK5jjsrZDOYAbs3IIjLTJz873bxMLKoJEfOqgs+V5OvQmsQBhIej5
D89PjkO9HpDd1R7BDt7faTF9K+8RrEUaD3Hd7Rk3gyTm7b5L4yV67zgQcQ6I
KE/EmN+DAqZzs5oMgNnyGScAzKcSMu2rBuwMTMDAdUwJY9MvTkFVgPz61dkD
MSRgZdf4CcRmU23ep9ZkBI3Odl3oGChLdDhiXMYVQXKkQX7l1McOepwLA70r
Nzwcfspzbe76W35Bo/t2//6j6fRYTadTvvyn89P3skLNX/yZr955Fh8IVX31
YKFw7do/w+HJqeS+MKGejdcqET23EJOE31hZ0ZM8R0rvX9PktPQ+EWKKrGUt
SWkq2q6fx3khUQWKMMXifPtrJKcrkjWSMueA4XNpNpTd0R5i4lZCbDN6uyOi
LUc3t68ttXYzdbJFV24uwQzXXCKAy95Cza8viHNSbuxSxTBNT3h7TsYqCq9b
nXWpjB1mpYxs0A+y7/38IK9yx/ymhX0am/azdY4Yt7qR4O8C+5E48Y8mHXvN
/7ipj2nWTDpg9aA514uw3/nHv5N56X6l6Ltgye+m4f52knMX7u9n42jzeV3z
7DRM1L3QIPmd3MO4zvXDp+qSJcWzH/xehL9NElALDuhtQBZoZtz8UjCqJ+9m
SHdynz1M1JGbzzrGwq64s957L0s23Rb38pKQnRNP7Oyk5ncnkCYbxvaFRwnW
l4vXDHuO/DqXa21KiKfsjBYeuyIwv5Yr01ZrybFlPoforFXGIaS3qBvpC3p9
eeoYR132dJfHG+Imu7JnkF3SMk/dEKh782qQzlbaBhkqrXBMss8tEbN5Bsq2
nYNFZH7EdcJsu+7u8pbeW8XNvfmg9/SKDhYmIMOIIKy5dLXV/gaz3lzDrftl
gJn6nffiQXbFahewws7Cd1Ok0s6tQElMjZ3wFXnDbzSV5NMq0V//to5oAo3Q
IeOt94fKrSOBOKktnNlxS+2rZG4ci3/oIKl2ZTAkvgdUjmVUwHZ/zn9Yx23t
qxVvs4L7SDPRNWsM1AGJc0KavuVGTXw76NxNCYUwl7SOXh+SOr0bAOgYyV6B
SnUPGqlwruxvHNCwyYTG5nxZxtW7wJcBrpXaqGQ/qnt3tBv+JBeXgJxKxnNq
V/iIRembhjhSuZkB9xb1IJW2bCRExmTtXLuD+Mj4ABA/K7gO2Q+BkmQ+WVaW
cNCViqWaHHcB5eBX1p1mdSGal1CnrlcID49m8u9tM2WJR3RYI0w43dmYmt/W
C6pwAZttt5I0TgN8SwtfJjV7heoudxKecZeaHjW1vNFp3Rr8LrVzJ9jMRVO7
Tuqr9dx6WOu2a5E/Uxfz9/PD7qUbB/ypYpmfrMmDCh31Q6SWMmgmuzf8x36G
lpa1eSUwmu31ScR2e3NErcXNcO2qtnOgVGd276ve9TJ2XKx2UmQ7UBOsacqv
4y2DCAtvRqzwB6qL/KrTCszDuvLaYXe7+yGCEckzlXDwey6y/a3//SUoY75n
zEbXbm0hhZlKP5rxM/77y990LQIa/puJJJI+n5rihoMMf3yMPs3UofIsjIF+
e+vr0dyGEhLEkzKADTUVIsTocSjwQIV8vZTFz19M+IuDUo86MUq+QKnC31fY
lpWyHUk7vPp/kfmTgn9S9EdIRX8W0XuJvBKhPzV1Kbu8+Lm7OIffu7rfxWGt
CiT8pDIFog11CGzgFJvTBp8HyltYn2byA2o6/XrEXt4pnfx+GHvxXIoD8kKc
/MqD4p9RE/fmp2N5wm8pZaBwel/AVvfjJfZtqa0r7FGAOzAP6JGdkQDvRlXk
N6LoZcTgfSoCChwSArRF8Hf4SzjS9AHPGNbT77UQ1G3d0CN3VIMfffGYftxr
93cDxxv3OxT+Ry6m0f8AonHhg2xPAAA=

-->

</rfc>
