<?xml version='1.0' encoding='utf-8'?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" version="3" ipr="trust200902" docName="draft-ietf-tsvwg-multipath-dccp-16" category="std" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" prepTime="2024-05-04T08:39:53" indexInclude="true" scripts="Common,Latin" tocDepth="3">
  <!-- xml2rfc v2v3 conversion 3.21.0 -->
  <front>
    <title abbrev="Multipath DCCP">DCCP Extensions for Multipath Operation with Multiple Addresses</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-tsvwg-multipath-dccp-16" stream="IETF"/>
    <author initials="M." surname="Amend" fullname="Markus Amend" role="editor">
      <organization abbrev="DT" showOnFrontPage="true">Deutsche Telekom</organization>
      <address>
        <postal>
          <street>Deutsche-Telekom-Allee 9</street>
          <city>Darmstadt</city>
          <code>64295</code>
          <country>Germany</country>
        </postal>
        <email>Markus.Amend@telekom.de</email>
      </address>
    </author>
    <author initials="A." surname="Brunstrom" fullname="Anna Brunstrom">
      <organization showOnFrontPage="true">Karlstad University</organization>
      <address>
        <postal>
          <street>Universitetsgatan 2</street>
          <city>Karlstad</city>
          <code>651 88</code>
          <country>Sweden</country>
        </postal>
        <email>anna.brunstrom@kau.se</email>
      </address>
    </author>
    <author initials="A." surname="Kassler" fullname="Andreas Kassler">
      <organization showOnFrontPage="true">Karlstad University</organization>
      <address>
        <postal>
          <street>Universitetsgatan 2</street>
          <city>Karlstad</city>
          <code>651 88</code>
          <country>Sweden</country>
        </postal>
        <email>andreas.kassler@kau.se</email>
      </address>
    </author>
    <author initials="V." surname="Rakocevic" fullname="Veselin Rakocevic">
      <organization showOnFrontPage="true">City, University of London</organization>
      <address>
        <postal>
          <street>Northampton Square</street>
          <city>London</city>
          <country>United Kingdom</country>
        </postal>
        <email>veselin.rakocevic.1@city.ac.uk</email>
      </address>
    </author>
    <author initials="S." surname="Johnson" fullname="Stephen Johnson">
      <organization showOnFrontPage="true">BT</organization>
      <address>
        <postal>
          <street>Adastral Park</street>
          <city>Martlesham Heath</city>
          <code>IP5 3RE</code>
          <country>United Kingdom</country>
        </postal>
        <email>stephen.h.johnson@bt.com</email>
      </address>
    </author>
    <date month="05" year="2024" day="04"/>
    <area>transport</area>
    <workgroup>Transport Area Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract pn="section-abstract">
      <t indent="0" pn="section-abstract-1">DCCP communications as defined in RFC 4340 are restricted to a single path per
connection, yet multiple paths often exist between peers.  The
simultaneous use of available multiple paths for a DCCP session could
improve resource usage within the network and, thus, improve user
experience through higher throughput and improved resilience to
network failures.
Use cases for Multipath DCCP (MP-DCCP) are mobile devices (e.g., handsets, vehicles) and residential home gateways simultaneously connected to distinct networks as, e.g., 
a cellular and a Wireless Local Area (WLAN) network
or a cellular and a fixed access network. Compared to existing multipath protocols such as MPTCP, MP-DCCP offers special support for latency-sensitive services with different requirements for reliability and in-order delivery.</t>
      <t indent="0" pn="section-abstract-2">This document specifies a set of extensions to
DCCP to support multipath operations. The protocol offers
the same type of service to applications as DCCP and provides the
components necessary to establish and use multiple DCCP flows across
different paths simultaneously.</t>
    </abstract>
    <boilerplate>
      <section anchor="status-of-memo" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.1">
        <name slugifiedName="name-status-of-this-memo">Status of This Memo</name>
        <t indent="0" pn="section-boilerplate.1-1">
        This Internet-Draft is submitted in full conformance with the
        provisions of BCP 78 and BCP 79.
        </t>
        <t indent="0" pn="section-boilerplate.1-2">
        Internet-Drafts are working documents of the Internet Engineering Task
        Force (IETF). Note that other groups may also distribute working
        documents as Internet-Drafts. The list of current Internet-Drafts is
        at <eref target="https://datatracker.ietf.org/drafts/current/" brackets="none"/>.
        </t>
        <t indent="0" pn="section-boilerplate.1-3">
        Internet-Drafts are draft documents valid for a maximum of six months
        and may be updated, replaced, or obsoleted by other documents at any
        time. It is inappropriate to use Internet-Drafts as reference
        material or to cite them other than as "work in progress."
        </t>
        <t indent="0" pn="section-boilerplate.1-4">
        This Internet-Draft will expire on 5 November 2024.
        </t>
      </section>
      <section anchor="copyright" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.2">
        <name slugifiedName="name-copyright-notice">Copyright Notice</name>
        <t indent="0" pn="section-boilerplate.2-1">
            Copyright (c) 2024 IETF Trust and the persons identified as the
            document authors. All rights reserved.
        </t>
        <t indent="0" pn="section-boilerplate.2-2">
            This document is subject to BCP 78 and the IETF Trust's Legal
            Provisions Relating to IETF Documents
            (<eref target="https://trustee.ietf.org/license-info" brackets="none"/>) in effect on the date of
            publication of this document. Please review these documents
            carefully, as they describe your rights and restrictions with
            respect to this document. Code Components extracted from this
            document must include Revised BSD License text as described in
            Section 4.e of the Trust Legal Provisions and are provided without
            warranty as described in the Revised BSD License.
        </t>
      </section>
    </boilerplate>
    <toc>
      <section anchor="toc" numbered="false" removeInRFC="false" toc="exclude" pn="section-toc.1">
        <name slugifiedName="name-table-of-contents">Table of Contents</name>
        <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1">
          <li pn="section-toc.1-1.1">
            <t indent="0" pn="section-toc.1-1.1.1"><xref derivedContent="1" format="counter" sectionFormat="of" target="section-1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-introduction">Introduction</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.1.2">
              <li pn="section-toc.1-1.1.2.1">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.1.1"><xref derivedContent="1.1" format="counter" sectionFormat="of" target="section-1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-multipath-dccp-in-the-netwo">Multipath DCCP in the Networking Stack</xref></t>
              </li>
              <li pn="section-toc.1-1.1.2.2">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.2.1"><xref derivedContent="1.2" format="counter" sectionFormat="of" target="section-1.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-terminology">Terminology</xref></t>
              </li>
              <li pn="section-toc.1-1.1.2.3">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.3.1"><xref derivedContent="1.3" format="counter" sectionFormat="of" target="section-1.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-requirements-language">Requirements Language</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.2">
            <t indent="0" pn="section-toc.1-1.2.1"><xref derivedContent="2" format="counter" sectionFormat="of" target="section-2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-operation-overview">Operation Overview</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2">
              <li pn="section-toc.1-1.2.2.1">
                <t indent="0" pn="section-toc.1-1.2.2.1.1"><xref derivedContent="2.1" format="counter" sectionFormat="of" target="section-2.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp-dccp-concept">MP-DCCP Concept</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.3">
            <t indent="0" pn="section-toc.1-1.3.1"><xref derivedContent="3" format="counter" sectionFormat="of" target="section-3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp-dccp-protocol">MP-DCCP Protocol</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2">
              <li pn="section-toc.1-1.3.2.1">
                <t indent="0" pn="section-toc.1-1.3.2.1.1"><xref derivedContent="3.1" format="counter" sectionFormat="of" target="section-3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-multipath-capable-feature">Multipath Capable Feature</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.2">
                <t indent="0" pn="section-toc.1-1.3.2.2.1"><xref derivedContent="3.2" format="counter" sectionFormat="of" target="section-3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-multipath-option">Multipath Option</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2.2.2">
                  <li pn="section-toc.1-1.3.2.2.2.1">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.1.1"><xref derivedContent="3.2.1" format="counter" sectionFormat="of" target="section-3.2.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_confirm">MP_CONFIRM</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.2">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.2.1"><xref derivedContent="3.2.2" format="counter" sectionFormat="of" target="section-3.2.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_join">MP_JOIN</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.3">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.3.1"><xref derivedContent="3.2.3" format="counter" sectionFormat="of" target="section-3.2.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_fast_close">MP_FAST_CLOSE</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.4">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.4.1"><xref derivedContent="3.2.4" format="counter" sectionFormat="of" target="section-3.2.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_key">MP_KEY</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.5">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.5.1"><xref derivedContent="3.2.5" format="counter" sectionFormat="of" target="section-3.2.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_seq">MP_SEQ</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.6">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.6.1"><xref derivedContent="3.2.6" format="counter" sectionFormat="of" target="section-3.2.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_hmac">MP_HMAC</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.7">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.7.1"><xref derivedContent="3.2.7" format="counter" sectionFormat="of" target="section-3.2.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_rtt">MP_RTT</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.8">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.8.1"><xref derivedContent="3.2.8" format="counter" sectionFormat="of" target="section-3.2.8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_addaddr">MP_ADDADDR</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.9">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.9.1"><xref derivedContent="3.2.9" format="counter" sectionFormat="of" target="section-3.2.9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_removeaddr">MP_REMOVEADDR</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.10">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.10.1"><xref derivedContent="3.2.10" format="counter" sectionFormat="of" target="section-3.2.10"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_prio">MP_PRIO</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.11">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.11.1"><xref derivedContent="3.2.11" format="counter" sectionFormat="of" target="section-3.2.11"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-mp_close">MP_CLOSE</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.2.2.12">
                    <t indent="0" pn="section-toc.1-1.3.2.2.2.12.1"><xref derivedContent="3.2.12" format="counter" sectionFormat="of" target="section-3.2.12"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-experimental-multipath-opti">Experimental Multipath option MP_EXP for private use</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.3.2.3">
                <t indent="0" pn="section-toc.1-1.3.2.3.1"><xref derivedContent="3.3" format="counter" sectionFormat="of" target="section-3.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mp-dccp-handshaking-procedu">MP-DCCP Handshaking Procedure</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.4">
                <t indent="0" pn="section-toc.1-1.3.2.4.1"><xref derivedContent="3.4" format="counter" sectionFormat="of" target="section-3.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-address-knowledge-exchange">Address knowledge exchange</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2.4.2">
                  <li pn="section-toc.1-1.3.2.4.2.1">
                    <t indent="0" pn="section-toc.1-1.3.2.4.2.1.1"><xref derivedContent="3.4.1" format="counter" sectionFormat="of" target="section-3.4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-advertising-a-new-path-mp_a">Advertising a new path (MP_ADDADDR)</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.4.2.2">
                    <t indent="0" pn="section-toc.1-1.3.2.4.2.2.1"><xref derivedContent="3.4.2" format="counter" sectionFormat="of" target="section-3.4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-removing-a-path-mp_removead">Removing a path (MP_REMOVEADDR)</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.3.2.5">
                <t indent="0" pn="section-toc.1-1.3.2.5.1"><xref derivedContent="3.5" format="counter" sectionFormat="of" target="section-3.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-closing-an-mp-dccp-connecti">Closing an MP-DCCP connection</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.6">
                <t indent="0" pn="section-toc.1-1.3.2.6.1"><xref derivedContent="3.6" format="counter" sectionFormat="of" target="section-3.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-fallback">Fallback</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.7">
                <t indent="0" pn="section-toc.1-1.3.2.7.1"><xref derivedContent="3.7" format="counter" sectionFormat="of" target="section-3.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-state-diagram">State Diagram</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.8">
                <t indent="0" pn="section-toc.1-1.3.2.8.1"><xref derivedContent="3.8" format="counter" sectionFormat="of" target="section-3.8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-congestion-control-consider">Congestion Control Considerations</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.9">
                <t indent="0" pn="section-toc.1-1.3.2.9.1"><xref derivedContent="3.9" format="counter" sectionFormat="of" target="section-3.9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-maximum-packet-size-conside">Maximum Packet Size Considerations</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.10">
                <t indent="0" pn="section-toc.1-1.3.2.10.1"><xref derivedContent="3.10" format="counter" sectionFormat="of" target="section-3.10"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-maximum-number-of-subflows">Maximum number of Subflows</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.11">
                <t indent="0" pn="section-toc.1-1.3.2.11.1"><xref derivedContent="3.11" format="counter" sectionFormat="of" target="section-3.11"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-path-usage-strategies">Path usage strategies</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2.11.2">
                  <li pn="section-toc.1-1.3.2.11.2.1">
                    <t indent="0" pn="section-toc.1-1.3.2.11.2.1.1"><xref derivedContent="3.11.1" format="counter" sectionFormat="of" target="section-3.11.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-path-mobility">Path mobility</xref></t>
                  </li>
                  <li pn="section-toc.1-1.3.2.11.2.2">
                    <t indent="0" pn="section-toc.1-1.3.2.11.2.2.1"><xref derivedContent="3.11.2" format="counter" sectionFormat="of" target="section-3.11.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-concurrent-path-usage">Concurrent path usage</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.4">
            <t indent="0" pn="section-toc.1-1.4.1"><xref derivedContent="4" format="counter" sectionFormat="of" target="section-4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-security-considerations">Security Considerations</xref></t>
          </li>
          <li pn="section-toc.1-1.5">
            <t indent="0" pn="section-toc.1-1.5.1"><xref derivedContent="5" format="counter" sectionFormat="of" target="section-5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-interactions-with-middlebox">Interactions with Middleboxes</xref></t>
          </li>
          <li pn="section-toc.1-1.6">
            <t indent="0" pn="section-toc.1-1.6.1"><xref derivedContent="6" format="counter" sectionFormat="of" target="section-6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-implementation">Implementation</xref></t>
          </li>
          <li pn="section-toc.1-1.7">
            <t indent="0" pn="section-toc.1-1.7.1"><xref derivedContent="7" format="counter" sectionFormat="of" target="section-7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-acknowledgments">Acknowledgments</xref></t>
          </li>
          <li pn="section-toc.1-1.8">
            <t indent="0" pn="section-toc.1-1.8.1"><xref derivedContent="8" format="counter" sectionFormat="of" target="section-8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-iana-considerations">IANA Considerations</xref></t>
          </li>
          <li pn="section-toc.1-1.9">
            <t indent="0" pn="section-toc.1-1.9.1"><xref derivedContent="9" format="counter" sectionFormat="of" target="section-9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-references">References</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.9.2">
              <li pn="section-toc.1-1.9.2.1">
                <t indent="0" pn="section-toc.1-1.9.2.1.1"><xref derivedContent="9.1" format="counter" sectionFormat="of" target="section-9.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-normative-references">Normative References</xref></t>
              </li>
              <li pn="section-toc.1-1.9.2.2">
                <t indent="0" pn="section-toc.1-1.9.2.2.1"><xref derivedContent="9.2" format="counter" sectionFormat="of" target="section-9.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-informative-references">Informative References</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.10">
            <t indent="0" pn="section-toc.1-1.10.1"><xref derivedContent="Appendix A" format="default" sectionFormat="of" target="section-appendix.a"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-differences-from-multipath-">Differences from Multipath TCP</xref></t>
          </li>
          <li pn="section-toc.1-1.11">
            <t indent="0" pn="section-toc.1-1.11.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.b"/><xref derivedContent="" format="title" sectionFormat="of" target="name-authors-addresses">Authors' Addresses</xref></t>
          </li>
        </ul>
      </section>
    </toc>
  </front>
  <middle>
    <section anchor="intro" numbered="true" removeInRFC="false" toc="include" pn="section-1">
      <name slugifiedName="name-introduction">Introduction</name>
      <t indent="0" pn="section-1-1">Datagram Congestion Control Protocol (DCCP) <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> is a
transport protocol that provides bidirectional unicast connections of
congestion-controlled unreliable datagrams. DCCP communications are restricted to one single path. 
This document specifies a set of protocol changes that add multipath
support to DCCP; specifically, support for signaling and setting up
multiple paths (a.k.a, "subflows"), managing these subflows, reordering of
data, and termination of sessions.</t>
      <t indent="0" pn="section-1-2">Multipath DCCP (MP-DCCP) 
enables a DCCP connection to simultaneously establish a flow across multiple paths. This can be  beneficial to applications that transfer
large amounts of data, by utilizing the capacity/connectivity offered by 
multiple paths. In addition, the multipath extensions enable to tradeoff timeliness and reliability,
which is important for low-latency applications that do not require
guaranteed delivery services, such as Audio/Video streaming.</t>
      <t indent="0" pn="section-1-3">In addition to the integration into DCCP services, implementers or future specification could choose MP-DCCP for other use cases like
3GPP 5G multi-access solutions (e.g., Access Traffic Steering, Switching, and Splitting (ATSSS) specified in <xref target="TS23.501" format="default" sectionFormat="of" derivedContent="TS23.501"/>) or hybrid access networks
<xref target="I-D.lhwxz-hybrid-access-network-architecture" format="default" sectionFormat="of" derivedContent="I-D.lhwxz-hybrid-access-network-architecture"/><xref target="I-D.muley-network-based-bonding-hybrid-access" format="default" sectionFormat="of" derivedContent="I-D.muley-network-based-bonding-hybrid-access"/>, in
which MP-DCCP can be used for load balancing, seamless session handover and bandwidth aggregation
using a framework such as <xref target="I-D.amend-tsvwg-multipath-framework-mpdccp" format="default" sectionFormat="of" derivedContent="I-D.amend-tsvwg-multipath-framework-mpdccp"/>.
More details on potential use cases for MP-DCCP are provided in <xref target="multipath-dccp.org" format="default" sectionFormat="of" derivedContent="multipath-dccp.org"/>, <xref target="IETF115.Slides" format="default" sectionFormat="of" derivedContent="IETF115.Slides"/>, and <xref target="MP-DCCP.Paper" format="default" sectionFormat="of" derivedContent="MP-DCCP.Paper"/>.
All these use cases profit from an Open Source Linux reference implementation provided under <xref target="multipath-dccp.org" format="default" sectionFormat="of" derivedContent="multipath-dccp.org"/>.</t>
      <t indent="0" pn="section-1-4">The encapsulation of non-DCCP traffic (e.g., UDP or IP) in MP-DCCP to enable the above-mentioned use cases is not considered in this specification; such matters are further detailed in <xref target="I-D.amend-tsvwg-multipath-framework-mpdccp" format="default" sectionFormat="of" derivedContent="I-D.amend-tsvwg-multipath-framework-mpdccp"/>.
Also out of scope is the encapsulation of DCCP traffic in UDP to pass middleboxes that do not support DCCP. A possible method is defined in <xref target="RFC6773" format="default" sectionFormat="of" derivedContent="RFC6773"/> or is considered in <xref target="I-D.amend-tsvwg-dccp-udp-header-conversion" format="default" sectionFormat="of" derivedContent="I-D.amend-tsvwg-dccp-udp-header-conversion"/> to achieve the same with less overhead.</t>
      <t indent="0" pn="section-1-5">Similar to MP-DCCP, MP-QUIC is designed to enable the simultaneous usage of 
multiple paths for a single connection <xref target="I-D.ietf-quic-multipath" format="default" sectionFormat="of" derivedContent="I-D.ietf-quic-multipath"/>. MP-QUIC is based on QUIC 
in a similar way as MP-DCCP is based on DCCP.
MP-QUIC inherits the properties of QUIC with its various facets of encryption, multi-streaming and the STREAM and DATAGRAM transport characteristic. This makes a practical multipath implementation very complex. In contrast, MP-DCCP is based exclusively on the lean concept of DCCP. For traffic that is already encrypted, MP-DCCP is the more efficient choice as it does not apply its own encryption mechanisms. Also, the procedures defined by MP-DCCP, which allow subsequent reordering of traffic, improve performance, as shown in <xref target="MP-DCCP.Paper" format="default" sectionFormat="of" derivedContent="MP-DCCP.Paper"/>, and are not available in MP-QUIC.</t>
      <section anchor="mpdccp_network_stack" numbered="true" removeInRFC="false" toc="include" pn="section-1.1">
        <name slugifiedName="name-multipath-dccp-in-the-netwo">Multipath DCCP in the Networking Stack</name>
        <t indent="0" pn="section-1.1-1">MP-DCCP provides a set of features to DCCP; <xref target="ref-comparison-of-standard-dccp-and-mp-dccp-protocol-stacks" format="default" sectionFormat="of" derivedContent="Figure 1"/> illustrates this layering. 
MP-DCCP operates at the transport layer and can be used as a transport for
both higher and lower layers. 
The protocol is
designed to be used by applications in the same way as DCCP with no
changes to the application itself.</t>
        <figure anchor="ref-comparison-of-standard-dccp-and-mp-dccp-protocol-stacks" align="left" suppress-title="false" pn="figure-1">
          <name slugifiedName="name-comparison-of-standard-dccp">Comparison of standard DCCP and MP-DCCP protocol stacks</name>
          <artwork align="left" pn="section-1.1-2.1"><![CDATA[
                             +-------------------------------+
                             |           Application         |
+---------------+            +-------------------------------+
|  Application  |            |            MP-DCCP            |
+---------------+            + - - - - - - - + - - - - - - - +
|      DCCP     |            |Subflow (DCCP) |Subflow (DCCP) |
+---------------+            +-------------------------------+
|      IP       |            |       IP      |      IP       |
+---------------+            +-------------------------------+
]]></artwork>
        </figure>
      </section>
      <section anchor="terminology" numbered="true" removeInRFC="false" toc="include" pn="section-1.2">
        <name slugifiedName="name-terminology">Terminology</name>
        <t indent="0" pn="section-1.2-1">This document uses terms that are either specific
for multipath transport or are defined in the context of MP-DCCP,
similar to <xref target="RFC8684" format="default" sectionFormat="of" derivedContent="RFC8684"/>, as follows:</t>
        <t indent="0" pn="section-1.2-2">Path: A sequence of links between a sender and a receiver, defined in
this context by a 4-tuple of source and destination address/port pairs.</t>
        <t indent="0" pn="section-1.2-3">(MP-DCCP) Connection: A set of one or more subflows, over which an
application can communicate between two hosts. The MP-DCCP connection is
exposed as single DCCP socket to the application.</t>
        <t indent="0" pn="section-1.2-4">Connection Identifier (CI): A locally unique identifier given to a multipath connection by a
host.</t>
        <t indent="0" pn="section-1.2-5">Host: An end host operating an MP-DCCP implementation, and either
initiating or accepting an MP-DCCP connection.</t>
        <t indent="0" pn="section-1.2-6">Subflow: A subflow refers to a DCCP flow transmitted using a specific path (4-tuple of source and destination address/port
pairs) that forms one of the multipath flows used by a single connection.</t>
        <t indent="0" pn="section-1.2-7">In addition to these
terms, within the framework of MP-DCCP, the interpretation of, and effect on,
regular single-path DCCP semantics is discussed in <xref target="protocol" format="default" sectionFormat="of" derivedContent="Section 3"/>.</t>
      </section>
      <section anchor="requirements-language" numbered="true" removeInRFC="false" toc="include" pn="section-1.3">
        <name slugifiedName="name-requirements-language">Requirements Language</name>
        <t indent="0" pn="section-1.3-1">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" format="default" sectionFormat="of" derivedContent="RFC2119"/> <xref target="RFC8174" format="default" sectionFormat="of" derivedContent="RFC8174"/> when, and only when, they appear in all
   capitals, as shown here.</t>
      </section>
    </section>
    <section anchor="op_overview" numbered="true" removeInRFC="false" toc="include" pn="section-2">
      <name slugifiedName="name-operation-overview">Operation Overview</name>
      <t indent="0" pn="section-2-1">DCCP transmits congestion-controlled unreliable datagrams over a single path.<br/>
Various congestion control mechanisms have been specified to optimize
DCCP performance for specific traffic types in terms of profiles denoted
by a Congestion Control IDentifier (CCID).
However, DCCP does not provide built-in 
support for managing multiple subflows within one DCCP connection.</t>
      <t indent="0" pn="section-2-2">The extension of DCCP for Multipath-DCCP (MP-DCCP) is 
described in detail in <xref target="protocol" format="default" sectionFormat="of" derivedContent="Section 3"/>.</t>
      <t indent="0" pn="section-2-3">At a high level of the MP-DCCP operation, the data 
stream from a DCCP application is split 
by MP-DCCP operation into one or more subflows which can be 
transmitted via different - also physically isolated - paths.
The corresponding control information allows the receiver to optionally 
re-assemble and deliver the received data in the originally transmitted order to the 
recipient application. This may be necessary because DCCP does not guarantee in-order delivery.
The details of the transmission scheduling mechanism and 
optional reordering mechanism are up to the sender and receiver, respectively,
and are outside the scope of this document.</t>
      <t indent="0" pn="section-2-4">A Multipath DCCP connection provides a bidirectional connection of datagrams 
between two hosts exchanging data using DCCP. It does not require 
any change to the applications. Multipath DCCP enables the 
hosts to use multiple paths with different IP addresses to transport 
the packets of an MP-DCCP connection. MP-DCCP manages the request, 
set-up, authentication, prioritization, modification, and removal of
the DCCP subflows on different paths as well as the exchange of performance 
parameters.<br/>
The number of DCCP subflows can vary during the 
lifetime of a Multipath DCCP connection. The details of the path management decisions for
when to add or remove subflows are outside the scope of this document.</t>
      <t indent="0" pn="section-2-5">The Multipath Capability for MP-DCCP is negotiated with a new DCCP 
feature, as specified in <xref target="mp_capable" format="default" sectionFormat="of" derivedContent="Section 3.1"/>. Once 
negotiated, all subsequent MP-DCCP operations for that connection are signalled with a 
variable length multipath-related option, as described in <xref target="protocol" format="default" sectionFormat="of" derivedContent="Section 3"/>.
All MP-DCCP operations are signaled by Multipath options described in <xref target="MP_OPT" format="default" sectionFormat="of" derivedContent="Section 3.2"/>. Options that 
require confirmation from the remote peer are retransmitted by the sender until confirmed or until 
confirmation is no longer considered relevant.</t>
      <t indent="0" pn="section-2-6">The following sections define MP-DCCP behavior in detail.</t>
      <section anchor="concept" numbered="true" removeInRFC="false" toc="include" pn="section-2.1">
        <name slugifiedName="name-mp-dccp-concept">MP-DCCP Concept</name>
        <t indent="0" pn="section-2.1-1"><xref target="ref-example-mp-dccp-usage-scenario" format="default" sectionFormat="of" derivedContent="Figure 2"/> provides a general overview of the MP-DCCP working mode, whose main 
characteristics are summarized in this section.</t>
        <figure anchor="ref-example-mp-dccp-usage-scenario" align="left" suppress-title="false" pn="figure-2">
          <name slugifiedName="name-example-mp-dccp-usage-scena">Example MP-DCCP usage scenario</name>
          <artwork align="left" pn="section-2.1-2.1"><![CDATA[
           Host A                               Host B
------------------------             ------------------------
Address A1    Address A2             Address B1    Address B2
----------    ----------             ----------    ----------
  |             |                      |             |
  |         (DCCP subflow setup)       |             |
  |----------------------------------->|             |
  |<-----------------------------------|             |
  |             |                      |             |
  |             |  (DCCP subflow setup)|             |
  |             |--------------------->|             |
  |             |<---------------------|             |
  | merge individual DCCP subflows to one MP-DCCP connection
  |             |                      |             |
]]></artwork>
        </figure>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-2.1-3">
          <li pn="section-2.1-3.1">
            <t indent="0" pn="section-2.1-3.1.1">An MP-DCCP connection begins with a 4-way handshake, between 
two hosts. In <xref target="ref-example-mp-dccp-usage-scenario" format="default" sectionFormat="of" derivedContent="Figure 2"/>,
an MP-DCCP connection is established between addresses A1 and B1 on Hosts
A and B, respectively. In the handshake, a Multipath Capable feature is used to negotiate multipath support for the connection. Host specific keys are also exchanged between Host A and Host B during the handshake. The details of the MP-DCCP handshaking procedure is described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/>. MP-DCCP does not require both peers to have 
more than one address.</t>
          </li>
          <li pn="section-2.1-3.2">
            <t indent="0" pn="section-2.1-3.2.1">When additional paths and corresponding addresses/ports are available, additional DCCP subflows can be created on 
these paths and attached to the existing MP-DCCP connection. An MP_JOIN option is used to connect a new DCCP subflow to an existing MP-DCCP connection. It contains a Connection Identifier during the setup of the initial subflow and is exchanged in the 4-way handshake for the subflow together with the Multipath Capable feature. The example in <xref target="ref-example-mp-dccp-usage-scenario" format="default" sectionFormat="of" derivedContent="Figure 2"/> illustrates creation of an additional DCCP subflow between Address A2 on Host A and Address B1 on Host B. The two subflows
continues to provide a single connection to the applications at both
endpoints.</t>
          </li>
          <li pn="section-2.1-3.3">
            <t indent="0" pn="section-2.1-3.3.1">MP-DCCP identifies multiple paths by the presence of multiple
addresses/ports at hosts.  Combinations of these multiple addresses/ports
indicate the additional paths.  In the example, other potential
paths that could be set up are A1&lt;-&gt;B2 and A2&lt;-&gt;B2.  Although the
additional subflow in the example is shown as being initiated from A2, an additional subflow could
alternatively have been initiated from B1 or B2.</t>
          </li>
          <li pn="section-2.1-3.4">
            <t indent="0" pn="section-2.1-3.4.1">The discovery and setup of additional subflows is achieved
through a path management method including the logic and details of the procedures for adding/removing subflows;
this document describes measures to allow a host to initiate new subflows and signal available addresses 
between peers. The definition of a path management method is, however, out of scope of this document and subject to a 
corresponding policy and the specifics of the implementation. If a MP-DCCP peer host limits  the maximum number of paths that can be maintained (e.g., similar to what is discussed in Section 3.4 of <xref target="RFC8041" format="default" sectionFormat="of" derivedContent="RFC8041"/>, the creation of new subflows from that peer host needs to be avoided and incoming subflow requests terminated.</t>
          </li>
          <li pn="section-2.1-3.5">
            <t indent="0" pn="section-2.1-3.5.1">Through the use of multipath options, MP-DCCP adds connection-level sequence numbers and exchange of
Round-Trip Time (RTT) information to enable optional reordering features. As a hint for scheduling decisions, a multipath option that allows a peer to indicate its priorities for what path to use is also defined.</t>
          </li>
          <li pn="section-2.1-3.6">
            <t indent="0" pn="section-2.1-3.6.1">Subflows are terminated in the same way as regular DCCP connections, as described
in (<xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, Section 8.3). MP-DCCP connections are closed by including an MP_CLOSE option in subflow DCCP-CloseReq or DCCP-Close messages. An MP-DCCP connection may also be reset through the use of an MP_FAST_CLOSE option. Key data from the initial handshake is included in the MP_CLOSE and MP_FAST_CLOSE to protect from unauthorized shutdown of MP-DCCP connections.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="protocol" numbered="true" removeInRFC="false" toc="include" pn="section-3">
      <name slugifiedName="name-mp-dccp-protocol">MP-DCCP Protocol</name>
      <t indent="0" pn="section-3-1">The DCCP protocol feature list (<xref section="6.4" sectionFormat="of" target="RFC4340" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4340#section-6.4" derivedContent="RFC4340"/>) is
updated by adding  a new Multipath feature with Feature number 10, as
shown in <xref target="ref-feature-list" format="default" sectionFormat="of" derivedContent="Table 1"/>.</t>
      <table anchor="ref-feature-list" align="center" pn="table-1">
        <name slugifiedName="name-multipath-feature">Multipath feature</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Number</th>
            <th align="left" colspan="1" rowspan="1">Meaning</th>
            <th align="center" colspan="1" rowspan="1">Rec'n Rule</th>
            <th align="center" colspan="1" rowspan="1">Initial Value</th>
            <th align="center" colspan="1" rowspan="1">Req'd</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">10</td>
            <td align="left" colspan="1" rowspan="1">Multipath Capable</td>
            <td align="center" colspan="1" rowspan="1">SP</td>
            <td align="center" colspan="1" rowspan="1">0</td>
            <td align="center" colspan="1" rowspan="1">N</td>
          </tr>
        </tbody>
      </table>
      <dl indent="3" newline="false" spacing="normal" pn="section-3-3">
        <dt pn="section-3-3.1">Rec'n Rule:</dt>
        <dd pn="section-3-3.2">
          <t indent="0" pn="section-3-3.2.1">The reconciliation rule used for the feature. SP indicates the server-priority.</t>
        </dd>
        <dt pn="section-3-3.3">Initial Value:</dt>
        <dd pn="section-3-3.4">
          <t indent="0" pn="section-3-3.4.1">The initial value for the feature. Every feature has a known initial value.</t>
        </dd>
        <dt pn="section-3-3.5">Req'd:</dt>
        <dd pn="section-3-3.6">
          <t indent="0" pn="section-3-3.6.1">This column is "Y" if and only if every DCCP implementation MUST
understand the feature. If it is "N", then the feature behaves like an extension, and it is safe to respond to Change options for the feature
with empty Confirm options.</t>
        </dd>
      </dl>
      <t indent="0" pn="section-3-4">This specification adds a DCCP protocol option as defined in (<xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, Section 5.8) providing
a new Multipath related variable-length option with option type 46, as
shown in <xref target="ref-option-list" format="default" sectionFormat="of" derivedContent="Table 2"/>.</t>
      <table anchor="ref-option-list" align="center" pn="table-2">
        <name slugifiedName="name-multipath-option-set">Multipath option set</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Type</th>
            <th align="center" colspan="1" rowspan="1">Option Length</th>
            <th align="center" colspan="1" rowspan="1">Meaning</th>
            <th align="center" colspan="1" rowspan="1">DCCP-Data?</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">46</td>
            <td align="center" colspan="1" rowspan="1">variable</td>
            <td align="center" colspan="1" rowspan="1">Multipath</td>
            <td align="center" colspan="1" rowspan="1">Y</td>
          </tr>
        </tbody>
      </table>
      <ul empty="true" bare="false" indent="3" spacing="normal" pn="section-3-6">
        <li pn="section-3-6.1">
          <t indent="0" pn="section-3-6.1.1">Note to the RFC Editor: Please update the Number and Type with the value assigned by IANA.</t>
        </li>
      </ul>
      <section anchor="mp_capable" numbered="true" removeInRFC="false" toc="include" pn="section-3.1">
        <name slugifiedName="name-multipath-capable-feature">Multipath Capable Feature</name>
        <t indent="0" pn="section-3.1-1">A DCCP endpoint negotiates the Multipath Capable Feature to determine whether multipath extensions can be enabled for a DCCP connection.</t>
        <t indent="0" pn="section-3.1-2">The Multipath Capable feature (MP_CAPABLE) has feature number 10 and follows the structure for features given in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> Section 6. Beside the negotiation of the feature itself, also one or several values can be exchanged. The value field specified here for the Multipath Capable feature has a length of one-byte and can be repeated several times within the DCCP option for feature negotiation if required for example to announce support of different versions of the protocol. For that, the leftmost four bits in <xref target="ref-mp-capable-format" format="default" sectionFormat="of" derivedContent="Figure 3"/> specify the compatible version of the
MP-DCCP implementation and MUST be set to 0 following this specification. The four bits following the Version field are unassigned in version 0 and MUST be set to zero by the sender and MUST be ignored by the receiver.</t>
        <figure anchor="ref-mp-capable-format" align="left" suppress-title="false" pn="figure-3">
          <name slugifiedName="name-format-of-the-multipath-cap">Format of the Multipath Capable feature value field</name>
          <artwork align="left" pn="section-3.1-3.1"><![CDATA[
    0  1  2  3   4  5  6  7
   +-----------+------------+
   |  Version  | Unassigned |
   +-----------+------------+
]]></artwork>
        </figure>
        <t indent="0" pn="section-3.1-4">The setting of the MP_CAPABLE feature MUST follow the server-priority reconciliation rule described
in (<xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, Section 6.3.1). This allows multiple versions to be
specified in order of priority.</t>
        <t indent="0" pn="section-3.1-5">The negotiation MUST be a part of the initial handshake procedure
 described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/>. No subsequent re-negotiation of
the MP_CAPABLE feature is allowed for the same MP-DCCP connection.</t>
        <t indent="0" pn="section-3.1-6">Clients MUST include a Change R option during the initial handshake request to
supply a list of supported MP-DCCP protocol versions, ordered by preference.</t>
        <t indent="0" pn="section-3.1-7">Servers MUST include a Confirm L option in the subsequent response to agree on
an MP-DCCP version to be used from the Client list, followed by its own
supported version(s), ordered by preference. Any subflow added to an existing MP-DCCP connection MUST use the
version negotiated for the first subflow.</t>
        <t indent="0" pn="section-3.1-8">If no agreement is found, the Server MUST reply with an empty Confirm L option
with feature number 10 and no values.</t>
        <t indent="0" pn="section-3.1-9">An example of successful version negotiation is shown hereafter and follows the negotiation example shown in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> Section 6.5. For better understanding, this example uses the unspecified MP-DCCP versions 1 and 2 in addition to the MP-DCCP version 0 specified in this document:</t>
        <figure anchor="ref-mp-capable-example" align="left" suppress-title="false" pn="figure-4">
          <name slugifiedName="name-example-of-mp-dccp-support-">Example of MP-DCCP support negotiation using MP_CAPABLE</name>
          <artwork align="left" pn="section-3.1-10.1"><![CDATA[
      Client                                             Server
      ------                                             ------
      DCCP-Req + Change R(MP_CAPABLE, 1 0)
                     ----------------------------------->

                      DCCP-Resp + Confirm L(MP_CAPABLE, 1, 2 1 0)
            <-----------------------------------

                 * agreement on version = 1 *
]]></artwork>
        </figure>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-3.1-11"><li pn="section-3.1-11.1" derivedCounter="1.">
            <t indent="0" pn="section-3.1-11.1.1">The Client indicates support for both MP-DCCP versions 1 and 0, with a preference
for version 1.</t>
          </li>
          <li pn="section-3.1-11.2" derivedCounter="2.">
            <t indent="0" pn="section-3.1-11.2.1">Server agrees on using MP-DCCP version 1 indicated by the first value, and supplies its own preference list with the following values.</t>
          </li>
          <li pn="section-3.1-11.3" derivedCounter="3.">
            <t indent="0" pn="section-3.1-11.3.1">MP-DCCP is then enabled between the Client and Server with version 1.</t>
          </li>
        </ol>
        <t indent="0" pn="section-3.1-12">Unlike the example in <xref target="ref-mp-capable-example" format="default" sectionFormat="of" derivedContent="Figure 4"/>, this document only allows the negotiation of MP-DCCP version 0, which means that client and server must support it.</t>
        <t indent="0" pn="section-3.1-13">If the version negotiation fails or the MP_CAPABLE feature is not present in the DCCP-Request or DCCP-Response packets of the initial handshake procedure, the MP-DCCP connection SHOULD fallback to regular DCCP or MUST close the connection. Further details are specified in <xref target="fallback" format="default" sectionFormat="of" derivedContent="Section 3.6"/></t>
      </section>
      <section anchor="MP_OPT" numbered="true" removeInRFC="false" toc="include" pn="section-3.2">
        <name slugifiedName="name-multipath-option">Multipath Option</name>
        <t indent="0" pn="section-3.2-1">MP-DCCP uses one single option to signal various multipath-related operations. The format of this multipath option is shown in <xref target="ref-mp-option-format" format="default" sectionFormat="of" derivedContent="Figure 5"/>.</t>
        <figure anchor="ref-mp-option-format" align="left" suppress-title="false" pn="figure-5">
          <name slugifiedName="name-multipath-option-format">Multipath option format</name>
          <artwork align="left" pn="section-3.2-2.1"><![CDATA[
            1          2          3         
 01234567 89012345 67890123 45678901 23456789
+--------+--------+--------+--------+--------+
|00101110| Length | MP_OPT | Value(s) ...
+--------+--------+--------+--------+--------+
 Type=46
]]></artwork>
        </figure>
        <t indent="0" pn="section-3.2-3">The fields used by the multipath option are described in <xref target="ref-mp-option-list" format="default" sectionFormat="of" derivedContent="Table 3"/>. MP_OPT refers to an Multipath option.</t>
        <table anchor="ref-mp-option-list" align="center" pn="table-3">
          <name slugifiedName="name-mp_opt-option-types">MP_OPT option types</name>
          <thead>
            <tr>
              <th align="left" colspan="1" rowspan="1">Type</th>
              <th align="left" colspan="1" rowspan="1">Option Length</th>
              <th align="left" colspan="1" rowspan="1">MP_OPT</th>
              <th align="left" colspan="1" rowspan="1">Meaning</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">0 =MP_CONFIRM</td>
              <td align="left" colspan="1" rowspan="1">Confirm reception and processing of an MP_OPT option</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">12</td>
              <td align="left" colspan="1" rowspan="1">1 =MP_JOIN</td>
              <td align="left" colspan="1" rowspan="1">Join path to an existing MP-DCCP connection</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">2 =MP_FAST_CLOSE</td>
              <td align="left" colspan="1" rowspan="1">Close an MP-DCCP connection unconditionally</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">3 =MP_KEY</td>
              <td align="left" colspan="1" rowspan="1">Exchange key material for MP_HMAC</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">9</td>
              <td align="left" colspan="1" rowspan="1">4 =MP_SEQ</td>
              <td align="left" colspan="1" rowspan="1">Multipath Sequence Number</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">23</td>
              <td align="left" colspan="1" rowspan="1">5 =MP_HMAC</td>
              <td align="left" colspan="1" rowspan="1">HMA Code for authentication</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">12</td>
              <td align="left" colspan="1" rowspan="1">6 =MP_RTT</td>
              <td align="left" colspan="1" rowspan="1">Transmit RTT values</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">7 =MP_ADDADDR</td>
              <td align="left" colspan="1" rowspan="1">Advertise additional Address</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">4</td>
              <td align="left" colspan="1" rowspan="1">8 =MP_REMOVEADDR</td>
              <td align="left" colspan="1" rowspan="1">Remove Address</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">4</td>
              <td align="left" colspan="1" rowspan="1">9 =MP_PRIO</td>
              <td align="left" colspan="1" rowspan="1">Change subflow Priority</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">10 =MP_CLOSE</td>
              <td align="left" colspan="1" rowspan="1">Close an MP-DCCP subflow</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">var</td>
              <td align="left" colspan="1" rowspan="1">11 =MP_EXP</td>
              <td align="left" colspan="1" rowspan="1">Experimental for private use</td>
            </tr>
            <tr>
              <td align="left" colspan="1" rowspan="1">46</td>
              <td align="left" colspan="1" rowspan="1">TBD</td>
              <td align="left" colspan="1" rowspan="1">&gt;11</td>
              <td align="left" colspan="1" rowspan="1">Reserved for future MP options.</td>
            </tr>
          </tbody>
        </table>
        <t indent="0" pn="section-3.2-5">Future MP options could be defined in a later version or extension to this specification.</t>
        <t indent="0" pn="section-3.2-6">These operations are largely inspired by the signals defined in <xref target="RFC8684" format="default" sectionFormat="of" derivedContent="RFC8684"/>.</t>
        <section anchor="MP_CONFIRM" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.1">
          <name slugifiedName="name-mp_confirm">MP_CONFIRM</name>
          <figure anchor="ref-mp-confirm-format" align="left" suppress-title="false" pn="figure-6">
            <name slugifiedName="name-format-of-the-mp_confirm-op">Format of the MP_CONFIRM option</name>
            <artwork align="left" pn="section-3.2.1-1.1"><![CDATA[
              1          2          3           4          5
   01234567 89012345 67890123 45678901 23456789 01234567 89012345
  +--------+--------+--------+--------+--------+--------+--------+
  |00101110|  var   |00000000| List of confirmations ...
  +--------+--------+--------+--------+--------+--------+--------+
   Type=46   Length  MP_OPT=0
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.1-2">Some multipath options require confirmation from the remote peer (see <xref target="ref-mp-option-confirm" format="default" sectionFormat="of" derivedContent="Table 4"/>). Such options will be retransmitted by the sender 
until an MP_CONFIRM is received or confirmation of options is identified outdated. The further processing of the multipath options in the
receiving host is not the subject of MP_CONFIRM.</t>
          <t indent="0" pn="section-3.2.1-3">Multipath options could arrive out-of-order, therefore multipath options defined in <xref target="ref-mp-option-confirm" format="default" sectionFormat="of" derivedContent="Table 4"/>
MUST be sent in a DCCP datagram with MP_SEQ <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/>. This allows a receiver to identify whether
multipath options are associated with obsolete datasets (information carried in the option header) that would otherwise conflict with newer datasets. In the case of MP_ADDADDR or MP_REMOVEADDR the same dataset is identified based on AddressID, whereas the same dataset for MP_PRIO is identified by the subflow in use. An outdated
multipath option is detected at the receiver if a previous multipath option referring to the same dataset contained a higher sequence number
in the MP_SEQ. An MP_CONFIRM MAY be generated for multipath options that are identified as outdated.</t>
          <t indent="0" pn="section-3.2.1-4">Similarly an MP_CONFIRM could arrive out of order. The associated
MP_SEQ received MUST be echoed to ensure that the most recent multipath option is confirmed. This protects from inconsistencies that could occur, e.g. if three MP_PRIO options are sent one after
the other on one path in order to first set the path priority to 0, then to 1 and finally to 0 again. Without an associated
MP_SEQ, a loss of the third MP_PRIO option and a loss of the MP_CONFIRM of the second update and the third update would
cause the sender to incorrectly interpret that the priority value was set to 0 without recognizing that the receiver has applied
priority value 1.</t>
          <t indent="0" pn="section-3.2.1-5">The length of the MP_CONFIRM option and the path over which the option is sent depend on the confirmed multipath options and the received
MP_SEQ, which are both copied verbatim and appended as a list of confirmations. The list is structured by first listing the received
MP_SEQ followed by the related multipath option or options to confirm. The same rules apply when multipath options with different MP_SEQs are confirmed at
once. This could happen if a datagram with MP_PRIO and a first MP_SEQ_1 and another datagram with MP_ADDADDR and a second MP_SEQ_2 are
received in short succession. In this case, the structure described above is concatenated resulting in MP_SEQ_2 + MP_ADDADDR + MP_SEQ_1 + MP_PRIO.
The order of the confirmed multipath options in the list of confirmations MUST reflect the incoming order at the host who sends the MP_CONFIRM, with the most
recent suboption received listed first. This could allow the host receiving the MP_CONFIRM to verify that the options were applied in the correct order
and to take countermeasures if they were not, e.g., if an MP_REMOVEADDR overtakes an MP_ADDADDR that refers to the same dataset.</t>
          <table anchor="ref-mp-option-confirm" align="center" pn="table-4">
            <name slugifiedName="name-multipath-options-requiring">Multipath options requiring confirmation</name>
            <thead>
              <tr>
                <th align="left" colspan="1" rowspan="1">Type</th>
                <th align="left" colspan="1" rowspan="1">Option Length</th>
                <th align="left" colspan="1" rowspan="1">MP_OPT</th>
                <th align="left" colspan="1" rowspan="1">MP_CONFIRM Sending path</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left" colspan="1" rowspan="1">46</td>
                <td align="left" colspan="1" rowspan="1">var</td>
                <td align="left" colspan="1" rowspan="1">7 =MP_ADDADDR</td>
                <td align="left" colspan="1" rowspan="1">Any available</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">46</td>
                <td align="left" colspan="1" rowspan="1">4</td>
                <td align="left" colspan="1" rowspan="1">8 =MP_REMOVEADDR</td>
                <td align="left" colspan="1" rowspan="1">Any available</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">46</td>
                <td align="left" colspan="1" rowspan="1">4</td>
                <td align="left" colspan="1" rowspan="1">9 =MP_PRIO</td>
                <td align="left" colspan="1" rowspan="1">Any available</td>
              </tr>
            </tbody>
          </table>
          <t indent="0" pn="section-3.2.1-7">An example to illustrate the MP-DCCP confirm procedure for the MP_PRIO option is shown in <xref target="ref-mp-dccp-confirm-good" format="default" sectionFormat="of" derivedContent="Figure 7"/>. The host A sends a 
DCCP-Request on path A2-B2 with an MP_PRIO option with value 1 and associated sequence number of 1. Host B replies on the same path in 
this instance (any path can be used) with a DCCP-Response containing the MP_CONFIRM option and a list containing the original sequence number (1)
together with the associated option (MP_PRIO).</t>
          <figure anchor="ref-mp-dccp-confirm-good" align="left" suppress-title="false" pn="figure-7">
            <name slugifiedName="name-example-mp-dccp-confirm-pro">Example MP-DCCP CONFIRM procedure</name>
            <artwork align="left" pn="section-3.2.1-8.1"><![CDATA[
          Host A                                     Host B 
------------------------                     ------------------------
Address A1    Address A2                     Address B1    Address B2
----------    ----------                     ----------    ----------
     |             |                                   |       |
     |             | DCCP-Request(seqno 1) + MP_PRIO(1)|       |
     |             |------------------------------------------>|
     |             |                                   |       |
     |             | DCCP-Response +                   |       |
     |             |<---- MP_CONFIRM(seqno 1, MP_PRIO) --------|
     |             |                                   |       |
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.1-9">A second example to illustrate the same MP-DCCP confirm procedure but where an out of date option is also delivered is shown in (<xref target="ref-mp-dccp-confirm-outdated" format="default" sectionFormat="of" derivedContent="Figure 8"/>.
Here, the first DCCP-Data is sent from Host A to Host B with option MP_PRIO set to 4. Host A subsequently sends the second DCCP-Data with option MP_PRIO
set to 1. In this case, the delivery of the first MP_PRIO is delayed in the network between Host A and Host B and arrives after the second MP_PRIO. Host B
ignores this second MP_PRIO as the associated sequence number is earlier than the first. Host B sends a DCCP-Ack confirming receipt of the MP_PRIO(1) with sequence number 2.</t>
          <figure anchor="ref-mp-dccp-confirm-outdated" align="left" suppress-title="false" pn="figure-8">
            <name slugifiedName="name-example-mp-dccp-confirm-proc">Example MP-DCCP CONFIRM procedure with outdated suboption</name>
            <artwork align="left" pn="section-3.2.1-10.1"><![CDATA[
          Host A                                     Host B 
------------------------                     ------------------------
Address A1    Address A2                     Address B1    Address B2
----------    ----------                     ----------    ----------
     |             |                                   |       |
     |             | DCCP-Data(seqno 1) +  MP_PRIO(4)  |       |
     |             |------------                       |       |
     |             |            \                      |       |
     |             | DCCP-Data(seqno 2) +  MP_PRIO(1)  |       |
     |             |--------------\--------------------------->|
     |             |               \                   |       |
     |             |                -------------------------->|
     |             |                                   |       |
     |             | DCCP-Ack +                        |       |
     |             |<---- MP_CONFIRM(seqno 2, MP_PRIO) --------|
     |             |                                   |       |
]]></artwork>
          </figure>
        </section>
        <section anchor="MP_JOIN" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.2">
          <name slugifiedName="name-mp_join">MP_JOIN</name>
          <figure anchor="ref-MP_JOIN" align="left" suppress-title="false" pn="figure-9">
            <name slugifiedName="name-format-of-the-mp_join-subop">Format of the MP_JOIN suboption</name>
            <artwork align="left" pn="section-3.2.2-1.1"><![CDATA[
              1          2          3
   01234567 89012345 67890123 45678901
  +--------+--------+--------+--------+
  |00101110|00001100|00000001| Addr ID|
  +--------+--------+--------+--------+
  | Connection Identifier             |
  +--------+--------+--------+--------+
  | Nonce                             |
  +--------+--------+--------+--------+
   Type=46  Length=12 MP_OPT=1
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.2-2">The MP_JOIN option is used to add a new subflow to an existing MP-DCCP
connection and REQUIRES a successful establishment of the first subflow using MP_KEY.
The Connection Identifier (CI) is the one from the peer host,
which was previously exchanged with the MP_KEY option.
MP_HMAC MUST be set when using MP_JOIN within a DCCP-Response packet (See
<xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/> for details).</t>
          <t indent="0" pn="section-3.2.2-3">The MP_JOIN option includes an "Addr ID" (Address ID) generated by the sender of the option, used to identify the source
address of this packet, even if the IP header was changed in
transit by a middlebox.  The value of this field is generated
by the sender and MUST map uniquely to a source IP address for the
sending host.  The Address ID allows address removal (<xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/>)
without needing to know what the source address at the receiver is,
thus allowing address removal through NATs.  The Address ID also
allows correlation between new subflow setup attempts and address
signaling (<xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/>), to prevent setting up duplicate subflows
on the same path, if an MP_JOIN and MP_ADDADDR are sent at the same
time.</t>
          <t indent="0" pn="section-3.2.2-4">The Address IDs of the subflow used in the initial DCCP Request/Response exchange of
the first subflow in the connection are implicit, and have the value
zero.  A host MUST store the mappings between Address IDs and
addresses both for itself and the remote host.  An implementation
will also need to know which local and remote Address IDs are
associated with which established subflows, for when addresses are
removed from a local or remote host. An Address ID always MUST be unique
over the lifetime of a subflow and can only be re-assigned if sender and
receiver no longer have them in use.</t>
          <t indent="0" pn="section-3.2.2-5">The Nonce is a 32-bit random value locally generated for every MP_JOIN option.
Together with the CI, the Nonce value builds the basis to calculate the
HMAC used in the handshaking process as described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/>.</t>
          <t indent="0" pn="section-3.2.2-6">If the CI cannot be verified by the receiving host during a handshake negotiation, 
the new subflow MUST be closed, as specified in <xref target="fallback" format="default" sectionFormat="of" derivedContent="Section 3.6"/>.</t>
        </section>
        <section anchor="MP_FAST_CLOSE" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.3">
          <name slugifiedName="name-mp_fast_close">MP_FAST_CLOSE</name>
          <t indent="0" pn="section-3.2.3-1">DCCP can send a Close or Reset signal to abruptly close a
connection.  Using MP-DCCP, a regular Close or Reset only has the scope of the
subflow over which a signal was received. 
As such, it will only close the subflow and does not
affect other remaining subflows or the MP-DCCP connection (unless it is the last
subflow).
This permits break-before-make handover between
subflows.</t>
          <t indent="0" pn="section-3.2.3-2">In order to provide an MP-DCCP-level
"reset" and thus allow the abrupt closure of the MP-DCCP connection, the MP_FAST_CLOSE suboption can be used.</t>
          <figure anchor="ref-MP_FAST_CLOSE" align="left" suppress-title="false" pn="figure-10">
            <name slugifiedName="name-format-of-the-mp_fast_close">Format of the MP_FAST_CLOSE suboption</name>
            <artwork align="left" pn="section-3.2.3-3.1"><![CDATA[
              1          2          3
   01234567 89012345 67890123 45678901 23456789
  +--------+--------+--------+--------+--------+
  |00101110|  var   |00000010| Key Data ...
  +--------+--------+--------+--------+--------+
   Type=46   Length  MP_OPT=2
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.3-4">When host A wants to abruptly close an MP-DCCP connection with host B, it will send out the MP_FAST_CLOSE. The MP_FAST_CLOSE suboption MUST be sent from host A on all subflows 
using a DCCP-Reset packet with Reset Code 13. The requirement to send the MP_FAST_CLOSE on all subflows increases the probability that host B will receive the MP_FAST_CLOSE to take the same action. To protect from unauthorized shutdown of a MP-DCCP connection, 
the selected Key Data of the peer host during the handshaking procedure 
is carried by the MP_FAST_CLOSE option.</t>
          <t indent="0" pn="section-3.2.3-5">After sending the MP_FAST_CLOSE on all subflows, host A will tear down all subflows 
and the multipath DCCP connection immediately terminates.</t>
          <t indent="0" pn="section-3.2.3-6">Upon reception of the first MP_FAST_CLOSE with successfully validated 
Key Data, host B will send a DCCP Reset packet response on all subflows to 
host A with Reset Code 13 to clean potential middlebox states. 
Host B will then tear down all subflows and terminate the MP-DCCP connection.</t>
        </section>
        <section anchor="MP_KEY" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.4">
          <name slugifiedName="name-mp_key">MP_KEY</name>
          <figure anchor="ref-MP_KEY" align="left" suppress-title="false" pn="figure-11">
            <name slugifiedName="name-format-of-the-mp_key-subopt">Format of the MP_KEY suboption</name>
            <artwork align="left" pn="section-3.2.4-1.1"><![CDATA[
                       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
  +---------------+---------------+---------------+---------------+
  |0 0 1 0 1 1 1 0|      var      |0 0 0 0 0 0 1 1|     resvd     | 
  +---------------+---------------+---------------+---------------+
  |                     Connection Identifier                     |
  +---------------+---------------+---------------+---------------+
  |  Key Type (1) |  Key Data (1) |  Key Type (2) |  Key Data (2) |
  +---------------+---------------+---------------+---------------+
  |  Key Type (3) | ...
  +---------------+---------------+
      Type=46          Length         MP_OPT=3
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.4-2">The MP_KEY suboption is used to exchange a Connection Identifier (CI) and key material between
hosts for a given connection.
The CI is a unique number that is configured per host during the initial exchange of a connection with MP_KEY and is necessary to connect other DCCP subflows to an MP-DCCP connection with MP_JOIN (<xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/>). Its size of 32-bits also defines the maximum number of simultaneous MP-DCCP connections in a host to 2^32.
According to the Key related elements of the MP_KEY suboption, the Length varies between 17 and 73 Bytes for a single-key message, and up to
115 Bytes when all specified Key Types 0-2 are provided. The Key Type field 
specifies the type of the following key data. 
The set of key types are shown in <xref target="ref-key-type-list" format="default" sectionFormat="of" derivedContent="Table 5"/>.</t>
          <table anchor="ref-key-type-list" align="center" pn="table-5">
            <name slugifiedName="name-mp_key-key-types">MP_KEY key types</name>
            <thead>
              <tr>
                <th align="left" colspan="1" rowspan="1">Key  Type</th>
                <th align="left" colspan="1" rowspan="1">Key Length (Bytes)</th>
                <th align="left" colspan="1" rowspan="1">Meaning</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left" colspan="1" rowspan="1">0 =Plain Text</td>
                <td align="left" colspan="1" rowspan="1">8</td>
                <td align="left" colspan="1" rowspan="1">Plain Text Key</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">1 =ECDHE-C25519-SHA256</td>
                <td align="left" colspan="1" rowspan="1">32</td>
                <td align="left" colspan="1" rowspan="1">ECDHE with SHA256 and Curve25519</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">2 =ECDHE-C25519-SHA512</td>
                <td align="left" colspan="1" rowspan="1">64</td>
                <td align="left" colspan="1" rowspan="1">ECDHE with SHA512 and Curve25519</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">3-255</td>
                <td align="left" colspan="1" rowspan="1"> </td>
                <td align="left" colspan="1" rowspan="1">Unassigned</td>
              </tr>
            </tbody>
          </table>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.4-4">
            <dt pn="section-3.2.4-4.1">Plain Text</dt>
            <dd pn="section-3.2.4-4.2">
              <t indent="0" pn="section-3.2.4-4.2.1">Key Material is exchanged in plain text between hosts, and the key
parts (key-a, key-b) are used by each host to generate the derived
key (d-key) by concatenating the two parts with the local key
in front (e.g. hostA d-key(A)=(key-a+key-b), hostB d-key(B)=(key-b+key-a)).</t>
            </dd>
          </dl>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.4-5">
            <dt pn="section-3.2.4-5.1">ECDHE-SHA256-C25519</dt>
            <dd pn="section-3.2.4-5.2">
              <t indent="0" pn="section-3.2.4-5.2.1">Public Key Material is exchanged via ECDHE key exchange with SHA256 and
Curve 25519 to generate the derived key (d-key) from the shared secret.
The full potential of ECDHE use is realized when it is combined with peer
authentication technologies to protect against men-in-the-middle attacks. This can
be achieved, for example, with separate use and verification of certificates
issued by a certificate authority.</t>
            </dd>
          </dl>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.4-6">
            <dt pn="section-3.2.4-6.1">ECDHE-SHA512-C25519</dt>
            <dd pn="section-3.2.4-6.2">
              <t indent="0" pn="section-3.2.4-6.2.1">Public Key Material is exchanged via ECDHE key exchange with SHA512 and
Curve 25519 to generate the derived key (d-key) from the shared secret.</t>
            </dd>
          </dl>
          <t indent="0" pn="section-3.2.4-7">Multiple keys are only permitted in the DCCP-Request message
of the handshake procedure for the first subflow. This allows the hosts to agree
on a single key type to be used, as described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/></t>
          <t indent="0" pn="section-3.2.4-8">It is possible that not all hosts will have all key types. If the key type cannot be agreed in the 
handshake procedure, the MP-DCCP connection MUST fall back to not using MP-DCCP, as 
indicated in <xref target="fallback" format="default" sectionFormat="of" derivedContent="Section 3.6"/>.</t>
        </section>
        <section anchor="MP_SEQ" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.5">
          <name slugifiedName="name-mp_seq">MP_SEQ</name>
          <figure anchor="ref-MP_SEQ" align="left" suppress-title="false" pn="figure-12">
            <name slugifiedName="name-format-of-the-mp_seq-subopt">Format of the MP_SEQ suboption</name>
            <artwork align="left" pn="section-3.2.5-1.1"><![CDATA[
              1          2          3           4          5
   01234567 89012345 67890123 45678901 23456789 01234567 89012345
  +--------+--------+--------+--------+--------+--------+--------+
  |00101110|00001001|00000100| Multipath Sequence Number         
  +--------+--------+--------+--------+--------+--------+--------+
                    |
  +--------+--------+
   Type=46  Length=9 MP_OPT=4
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.5-2">The MP_SEQ suboption is used for end-to-end 48-bit datagram-based sequence
numbers of an MP-DCCP connection. The initial data sequence
number (IDSN) SHOULD be set randomly <xref target="RFC4086" format="default" sectionFormat="of" derivedContent="RFC4086"/>.</t>
          <t indent="0" pn="section-3.2.5-3">The MP_SEQ number space is
independent from the path individual sequence number space and MUST be
sent with all DCCP-Data and DCCP-DataACK packets.</t>
          <t indent="0" pn="section-3.2.5-4">When the sequence number space is exhausted, the sequence number MUST
be wrapped. <xref target="RFC7323" format="default" sectionFormat="of" derivedContent="RFC7323"/> provides guidance on selecting an appropriately
sized sequence number space according to the maximum segment lifetime of
TCP. 64 bits is the recommended size for TCP to avoid the sequence number
space going through within the segment lifetime. For DCCP, the Maximum
Segment Lifetime is the same as that of TCP as specified in <xref section="3.4" sectionFormat="of" target="RFC4340" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4340#section-3.4" derivedContent="RFC4340"/>.
Compared to TCP, the sequence number for DCCP is incremented
per packet rather than per byte transmitted. For this reason, the 48 bits
chosen in MP_SEQ are considered sufficiently large.</t>
        </section>
        <section anchor="MP_HMAC" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.6">
          <name slugifiedName="name-mp_hmac">MP_HMAC</name>
          <figure anchor="ref-MP_HMAC" align="left" suppress-title="false" pn="figure-13">
            <name slugifiedName="name-format-of-the-mp_hmac-subop">Format of the MP_HMAC suboption</name>
            <artwork align="left" pn="section-3.2.6-1.1"><![CDATA[
              1          2          3           4
   01234567 89012345 67890123 45678901 23456789 01234567
  +--------+--------+--------+--------+--------+--------+
  |00101110|00010111|00000101| HMAC-SHA256 (20 bytes) ...
  +--------+--------+--------+--------+--------+--------+
   Type=46  Length=23 MP_OPT=5
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.6-2">The MP_HMAC suboption is used to provide authentication for the
MP_ADDADDR, and MP_REMOVEADDR suboptions. In addition, it provides
authentication for subflows joining an existing MP_DCCP connection,
as described in the second and third step of the handshake of a
subsequent subflow in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/>. For this specification of MP-DCCP,
the HMAC code is generated according to <xref target="RFC2104" format="default" sectionFormat="of" derivedContent="RFC2104"/> in combination
with the SHA256 hash algorithm described in <xref target="RFC6234" format="default" sectionFormat="of" derivedContent="RFC6234"/>, with the
output truncated to the leftmost 160 bits (20 bytes).</t>
          <t indent="0" pn="section-3.2.6-3">The "Key" used for the HMAC computation is the derived key (d-key)
described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/>, while the HMAC "Message" for MP_JOIN, MP_ADDADDR and MP_REMOVEADDR is a concatenation of:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.6-4">
            <li pn="section-3.2.6-4.1">
              <t indent="0" pn="section-3.2.6-4.1.1">for MP_JOIN: The nonces of the MP_JOIN messages for which authentication
   shall be performed. Depending on whether Host A or Host B performs the HMAC-SHA256 calculation, it is carried out as follows:
   MP_HMAC(A) = HMAC-SHA256(Key=d-key(A), Msg=RA+RB)
   MP_HMAC(B) = HMAC-SHA256(Key=d-key(B), Msg=RB+RA)
   An usage example is shown in <xref target="ref-mp-dccp-handshaking" format="default" sectionFormat="of" derivedContent="Figure 21"/>.</t>
            </li>
            <li pn="section-3.2.6-4.2">
              <t indent="0" pn="section-3.2.6-4.2.1">for MP_ADDADDR: The Address ID with associated IP address and if defined port,
   otherwise two octets of value 0. IP address and port MUST be used in network byte
   order (NBO). Depending on whether Host A or Host B performs the HMAC-SHA256 calculation,
   it is carried out as follows:
   MP_HMAC(A) = HMAC-SHA256(Key=d-key(A), Msg=Address ID+NBO(IP)+NBO(Port))
   MP_HMAC(B) = HMAC-SHA256(Key=d-key(B), Msg=Address ID+NBO(IP)+NBO(Port))</t>
            </li>
            <li pn="section-3.2.6-4.3">
              <t indent="0" pn="section-3.2.6-4.3.1">for MP_REMOVEADDR: Solely the Address ID.
   Depending on whether Host A or Host B performs the HMAC-SHA256 calculation,
   it is carried out as follows:
   MP_HMAC(A) = HMAC-SHA256(Key=d-key(A), Msg=Address ID)
   MP_HMAC(B) = HMAC-SHA256(Key=d-key(B), Msg=Address ID)</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.2.6-5">MP_JOIN, MP_ADDADDR and MP_REMOVEADDR can co-exist or be used multiple times
within a single DCCP packet. All these multipath options require an individual
MP_HMAC option. This ensures that the MP_HMAC is correctly associated.
Otherwise, the receiver cannot validate multiple MP_JOIN, MP_ADDADDR or
MP_REMOVEADDR. Therefore, a MP_HMAC MUST directly follow its associated multipath
option. In the likely case of sending a MP_JOIN together with a MP_ADDADDR, this
results in concatenating MP_JOIN + MP_HMAC_1 + MP_ADDADDR + MP_HMAC_2, whereas the
first MP_HMAC_1 is associated with the MP_JOIN and the second MP_HMAC_2 is associated with the
MP_ADDADDR suboption.</t>
          <t indent="0" pn="section-3.2.6-6">On the receiver side, the HMAC validation of the suboptions MUST be carried out according to
the sending sequence in which the associated MP_HMAC follows a suboption. If the suboption
cannot be validated by a receiving host because the HMAC validation fails, the subsequent handling depends
on which suboption was being verified. If the suboption to be authenticated was either
MP_ADDADDR or MP_REMOVEADDR, the receiving host MUST silently ignore it (see <xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/> and <xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/>). 
If the suboption to be authenticated was MP_JOIN, the subflow MUST be closed (see <xref target="fallback" format="default" sectionFormat="of" derivedContent="Section 3.6"/>).
In the event that an MP_HMAC cannot be associated with a suboption, unless it is an MP_HMAC sent
in DCCP-Ack in response to a DCCP-Response packet containing an MP_JOIN option, this MP_HMAC MUST be ignored.</t>
        </section>
        <section anchor="MP_RTT" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.7">
          <name slugifiedName="name-mp_rtt">MP_RTT</name>
          <figure anchor="ref-MP_RTT" align="left" suppress-title="false" pn="figure-14">
            <name slugifiedName="name-format-of-the-mp_rtt-subopt">Format of the MP_RTT suboption</name>
            <artwork align="left" pn="section-3.2.7-1.1"><![CDATA[
              1          2          3           4          5
   01234567 89012345 67890123 45678901 23456789 01234567 89012345
  +--------+--------+--------+--------+--------+--------+--------+
  |00101110|00001100|00000110|RTT Type| RTT
  +--------+--------+--------+--------+--------+--------+--------+
           | Age                               |
  +--------+--------+--------+--------+--------+
   Type=46  Length=12 MP_OPT=6
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.7-2">The MP_RTT suboption is used to transmit RTT values and age
(represented in milliseconds) that belong to the path over which this information is transmitted.
This information is useful for the receiving host to
calculate the RTT difference between the subflows and to estimate whether
missing data has been lost.</t>
          <t indent="0" pn="section-3.2.7-3">The RTT and Age information is a 32-bit integer. This covers a period of
approximately 1193 hours.</t>
          <t indent="0" pn="section-3.2.7-4">The Field RTT type indicates the type of RTT estimation, according to the following description:</t>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.7-5">
            <dt pn="section-3.2.7-5.1">Raw RTT (=0)</dt>
            <dd pn="section-3.2.7-5.2">
              <t indent="0" pn="section-3.2.7-5.2.1">Raw RTT value of the last Datagram Round-Trip</t>
            </dd>
          </dl>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.7-6">
            <dt pn="section-3.2.7-6.1">Min RTT (=1)</dt>
            <dd pn="section-3.2.7-6.2">
              <t indent="0" pn="section-3.2.7-6.2.1">Min RTT value over a given period</t>
            </dd>
          </dl>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.7-7">
            <dt pn="section-3.2.7-7.1">Max RTT (=2)</dt>
            <dd pn="section-3.2.7-7.2">
              <t indent="0" pn="section-3.2.7-7.2.1">Max RTT value over a given period</t>
            </dd>
          </dl>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.7-8">
            <dt pn="section-3.2.7-8.1">Smooth RTT (=3)</dt>
            <dd pn="section-3.2.7-8.2">
              <t indent="0" pn="section-3.2.7-8.2.1">Averaged RTT value over a given period</t>
            </dd>
          </dl>
          <t indent="0" pn="section-3.2.7-9">Each CCID specifies the algorithms and period applied for their corresponding RTT estimations.The availability of the above described types, to be used in the MP_RTT option, depends on the CCID implementation in place.</t>
          <dl newline="true" indent="3" spacing="normal" pn="section-3.2.7-10">
            <dt pn="section-3.2.7-10.1">Age</dt>
            <dd pn="section-3.2.7-10.2">
              <t indent="0" pn="section-3.2.7-10.2.1">The Age parameter defines the time difference between now - creation of the MP_RTT option -
 and the conducted RTT measurement in milliseconds. If no previous measurement
 exists, e.g., when initialized, the value is 0.</t>
            </dd>
          </dl>
          <t indent="0" pn="section-3.2.7-11">An example of a flow showing  the exchange of path individual 
RTT information is provided in
<xref target="ref-MP_RTT_example" format="default" sectionFormat="of" derivedContent="Figure 15"/>. 
RTT1 refers to the first path and RTT2 to the second path. The
RTT values could be extracted from the sender's Congestion Control procedure and are conveyed to the receiving host using the MP_RTT suboption. With the reception of RTT1
and RTT2, the receiver is able to calculate the path_delta which corresponds to
the absolute difference of both values.
In the case that the path individual RTTs are symmetric in the down- and uplink directions and there is no jitter, packets with missing sequence number MP_SEQ, e.g., in a reordering process, can be assumed lost after path_delta/2.</t>
          <figure anchor="ref-MP_RTT_example" align="left" suppress-title="false" pn="figure-15">
            <name slugifiedName="name-exemplary-flow-of-mp_rtt-ex">Exemplary flow of MP_RTT exchange and usage</name>
            <artwork align="left" pn="section-3.2.7-12.1"><![CDATA[
   MP-DCCP                   MP-DCCP
   Sender                    Receiver
   +--------+  MP_RTT(RTT1)  +-------------+
   |   RTT1 |----------------|             |
   |        |                | path_delta= |
   |        |  MP_RTT(RTT2)  | |RTT1-RTT2| |
   |   RTT2 |----------------|             |
   +--------+                +-------------+
]]></artwork>
          </figure>
        </section>
        <section anchor="MP_ADDADDR" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.8">
          <name slugifiedName="name-mp_addaddr">MP_ADDADDR</name>
          <t indent="0" pn="section-3.2.8-1">The MP_ADDADDR suboption announces additional addresses (and, optionally,
port numbers) by which a host can be reached. This can be sent at any
time during an existing MP-DCCP connection, when the sender wishes to
enable multiple paths and/or when additional paths become available.
Multiple instances of this suboption within a packet 
can simultaneously advertise new addresses.</t>
          <t indent="0" pn="section-3.2.8-2">The Length is variable depending on the address family (IPv4 or IPv6) and whether a port number is
used. This field is in range between 8 and 22 bytes.</t>
          <t indent="0" pn="section-3.2.8-3">The final 2 octets, optionally specify the DCCP port number to
use, and their presence can be inferred from the length of the option.
Although it is expected that the majority of use cases will use the
same port pairs as used for the initial subflow (e.g., port 80
remains port 80 on all subflows, as does the ephemeral port at the
client), there could be cases (such as port-based load balancing) where
the explicit specification of a different port is required.  If no
port is specified, the receiving host MUST assume that any attempt to
connect to the specified address uses the port already used by the
subflow on which the MP_ADDADDR signal was sent.</t>
          <t indent="0" pn="section-3.2.8-4">Along with the MP_ADDADDR option an MP_HMAC option MUST be sent for
authentication. The truncated HMAC parameter present in this MP_HMAC
option is the leftmost 20 bytes of an HMAC, negotiated and calculated
as described in <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/>. In the same way as for MP_JOIN,
the key for the HMAC algorithm, in the case of the message transmitted
by Host A, will be Key-A followed by Key-B, and in the case of Host B,
Key-B followed by Key-A.  These are the keys that were exchanged and
selected in the original MP_KEY handshake. The message for the HMAC is
the Address ID, IP address, and port number that precede the HMAC in the
MP_ADDADDR option.  If the port number is not present in the MP_ADDADDR option,
the HMAC message will include 2 octets of value zero.
The rationale for the HMAC is to prevent unauthorized entities from
injecting MP_ADDADDR signals in an attempt to hijack a connection.
Note that, additionally, the presence of this HMAC prevents the
address from being changed in flight unless the key is known by an
intermediary.  If a host receives an MP_ADDADDR option for which it
cannot validate the HMAC, it SHOULD silently ignore the option.</t>
          <t indent="0" pn="section-3.2.8-5">The presence of an MP_SEQ <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/> MUST be ensured in a DCCP datagram
in which MP_ADDADDR is sent, as described in <xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/>.</t>
          <figure anchor="ref-MP_ADDADDR" align="left" suppress-title="false" pn="figure-16">
            <name slugifiedName="name-format-of-the-mp_addaddr-su">Format of the MP_ADDADDR suboption</name>
            <artwork align="left" pn="section-3.2.8-6.1"><![CDATA[
                      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
  +---------------+---------------+-------+-------+---------------+
  |0 0 1 0 1 1 1 0|      var      |0 0 0 0 0 1 1 1|  Address ID   |
  +---------------+---------------+-------+-------+---------------+
  |          Address (IPv4 - 4 bytes / IPv6 - 16 bytes)           |
  +-------------------------------+-------------------------------+
  |   Port (2 bytes, optional)    | + MP_HMAC option
  +-------------------------------+
       Type=46         Length         MP_OPT=7
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.8-7">Each address has an Address ID that could be used for uniquely
identifying the address within a connection for address removal.
Each host maintains a list of unique Address IDs and it manages these as it wishes. The
Address ID is also used to identify MP_JOIN options (see <xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/>)
relating to the same address, even when address translators are in use.
The Address ID MUST uniquely identify the address for the sender of the
option (within the scope of the connection); the mechanism for
allocating such IDs is implementation specific.</t>
          <t indent="0" pn="section-3.2.8-8">All Address IDs learned via either MP_JOIN or MP_ADDADDR can be stored
by the receiver in a data structure that gathers all the
Address-ID-to-address mappings for a connection (identified by a CI
pair). In this way, there is a stored mapping between the Address ID,
the observed source address, and the CI pair for future processing of control
information for a connection. Note that an implementation
MAY discard incoming address advertisements - for example, to
avoid the required mapping state, or because advertised addresses
are of no use to it (for example, IPv6 addresses when it has IPv4
only).  Therefore, a host MUST treat address advertisements as soft
state, and the sender MAY choose to refresh advertisements periodically.</t>
          <t indent="0" pn="section-3.2.8-9">A host
MAY advertise private addresses, e.g., because there is a 
NAT on the path.  It is
desirable to allow this, since there could be cases where both hosts
have additional interfaces on the same private network.</t>
          <t indent="0" pn="section-3.2.8-10">The MP_JOIN handshake to
create a new subflow (<xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/>) provides mechanisms to minimize
security risks.  The MP_JOIN message contains a 32-bit CI that
uniquely identifies a connection to the receiving host. If the
CI is unknown, the host MUST send a DCCP-Reset.</t>
          <t indent="0" pn="section-3.2.8-11">Further security considerations around the issue of
MP_ADDADDR messages that accidentally misdirect, or maliciously direct,
new MP_JOIN attempts are discussed in <xref target="security" format="default" sectionFormat="of" derivedContent="Section 4"/>.
If a sending host of an MP_ADDADDR knows that no incoming subflows can
be established at a particular address, an MP_ADDADDR SHOULD NOT
announce that address unless the sending host has new knowledge about
the possibility to do so. This information can be obtained from local
firewall or routing settings, knowledge about availability of external
NAT or firewall, or from connectivity checks performed by the
host/application.</t>
          <t indent="0" pn="section-3.2.8-12">The reception of an MP_ADDADDR message is acknowledged using MP_CONFIRM
(<xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/>). This ensures reliable exchange of address
information.</t>
          <t indent="0" pn="section-3.2.8-13">A host MAY send an MP_ADDADDR message with an already assigned Address
ID, but the Address MUST be the same as previously assigned to this
Address ID, and the Port MUST be different from one already in use
for this Address ID.  If these conditions are not met, the receiver
SHOULD silently ignore the MP_ADDADDR.  A host wishing to replace an
existing Address ID MUST first remove the existing one (<xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/>).</t>
          <t indent="0" pn="section-3.2.8-14">A host that receives an MP_ADDADDR, but finds at connection set up
that the IP address and port number is unsuccessful, SHOULD NOT perform
further connection attempts to this address/port combination for this
connection. However, a sender that wishes to trigger a new incoming
connection attempt on a previously advertised address/port combination
can therefore refresh the MP_ADDADDR information by sending the option again.</t>
        </section>
        <section anchor="MP_REMOVEADDR" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.9">
          <name slugifiedName="name-mp_removeaddr">MP_REMOVEADDR</name>
          <t indent="0" pn="section-3.2.9-1">If, during the lifetime of an MP-DCCP connection, a previously announced
address becomes invalid (e.g., if an interface disappears), the
affected host SHOULD announce this. The peer can remove a previously 
added address with an Address ID from a connection
using the Remove Address (MP_REMOVEADDR) suboption. This
will terminate any subflows currently using that address.</t>
          <t indent="0" pn="section-3.2.9-2">Along with the MP_REMOVEADDR suboption a MP_HMAC option MUST be sent for
authentication. The truncated HMAC parameter present in this MP_HMAC
option is the leftmost 20 bytes of an HMAC, negotiated and calculated
as described in <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/>. In the same way as for MP_JOIN,
the key for the HMAC algorithm, in the case of the message transmitted
by Host A, will be Key-A followed by Key-B, and in the case of Host B,
Key-B followed by Key-A.  These are the keys that were exchanged and
selected in the original MP_KEY handshake. The message for the HMAC is
the Address ID.</t>
          <t indent="0" pn="section-3.2.9-3">The rationale for using a HMAC is to prevent unauthorized entities from
injecting MP_REMOVEADDR signals in an attempt to hijack a connection.
Note that, additionally, the presence of this HMAC prevents the
address from being modified in flight unless the key is known by an
intermediary.  If a host receives an MP_REMOVEADDR option for which it
cannot validate the HMAC, it SHOULD silently ignore the option.</t>
          <t indent="0" pn="section-3.2.9-4">A receiver MUST include a MP_SEQ <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/> in a DCCP datagram that sends
an  MP_REMOVEADDR. Further details are given in <xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/>.</t>
          <t indent="0" pn="section-3.2.9-5">The reception of an MP_REMOVEADDR message is acknowledged using MP_CONFIRM
(<xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/>). This ensures reliable exchange of address
information. To avoid inconsistent states, the sender releases 
the address ID only after MP_REMOVEADDR has been confirmed.</t>
          <t indent="0" pn="section-3.2.9-6">The sending and receiving of this message SHOULD trigger the closing procedure
described in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> between the client and the server, respectively on the affected
subflow(s) (if possible). This helps remove middlebox state, before
removing any local state.</t>
          <t indent="0" pn="section-3.2.9-7">Address removal is done by Address ID to allow the use of NATs and other
middleboxes that rewrite source addresses.  If there is no address
at the requested Address ID, the receiver will silently ignore the request.</t>
          <figure anchor="refMP_REMOVEADDR" align="left" suppress-title="false" pn="figure-17">
            <name slugifiedName="name-format-of-the-mp_removeaddr">Format of the MP_REMOVEADDR suboption</name>
            <artwork align="left" pn="section-3.2.9-8.1"><![CDATA[
                     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
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0|0 0 0 0 0 1 0 0|0 0 0 0 1 0 0 0|   Address ID  |
+---------------+---------------+---------------+---------------+
     Type=46        Length=4         MP_OPT=8

-> followed by MP_HMAC option
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.9-9">A subflow that is still functioning MUST be closed with a DCCP-Close
exchange as in regular DCCP, rather than using this option. For more
information, see <xref target="closing" format="default" sectionFormat="of" derivedContent="Section 3.5"/>.</t>
        </section>
        <section anchor="MP_PRIO" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.10">
          <name slugifiedName="name-mp_prio">MP_PRIO</name>
          <t indent="0" pn="section-3.2.10-1">The path priority SHOULD be considered as hints 
for the packet scheduler when making decisions which path to use for 
payload traffic.
When a single specific path from the set of available
paths is treated with higher priority compared to the others
when making scheduling decisions for payload traffic, a host can 
signal such change in priority to the peer.
This could be used when there are different costs for
using different paths (e.g., WiFi is free while cellular has limit on
volume, 5G has higher energy consumption). The priority of a path
could also change, for example, when a mobile host runs out
of battery, the usage of only a single path may be the preferred choice
of the user.</t>
          <t indent="0" pn="section-3.2.10-2">The MP_PRIO suboption, shown below, can be used to set a priority flag
for the subflow over which the suboption is received.</t>
          <figure anchor="ref-MP_PRIO" align="left" suppress-title="false" pn="figure-18">
            <name slugifiedName="name-format-of-the-mp_prio-subop">Format of the MP_PRIO suboption</name>
            <artwork align="left" pn="section-3.2.10-3.1"><![CDATA[
                        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
   +---------------+---------------+---------------+--------------+
   |0 0 1 0 1 1 1 0|0 0 0 0 0 1 0 0|0 0 0 0 1 0 0 1|(resvd)| prio |
   +---------------+---------------+---------------+--------------+
       Type=46         Length=4        MP_OPT=9
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.10-4">The following values are available for the Prio field:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.10-5">
            <li pn="section-3.2.10-5.1">
              <t indent="0" pn="section-3.2.10-5.1.1">0: Do not use. The path is not available.</t>
            </li>
            <li pn="section-3.2.10-5.2">
              <t indent="0" pn="section-3.2.10-5.2.1">1: Standby: do not use this path for traffic scheduling, if another
   path (secondary or primary) is available. The path will only be used if 
   other secondary or primary paths are not established.</t>
            </li>
            <li pn="section-3.2.10-5.3">
              <t indent="0" pn="section-3.2.10-5.3.1">2: Secondary: do not use this path for traffic scheduling, if the other
   paths are good enough. The path will be used occasionally for increasing 
   temporarily the available capacity, e.g. when primary paths are 
   congested or are not available. This is the recommended setting for
   paths that have costs or data caps as these paths will be used less
   frequently then primary paths.</t>
            </li>
            <li pn="section-3.2.10-5.4">
              <t indent="0" pn="section-3.2.10-5.4.1">3 - 15: Primary: The path can be used for packet scheduling decisions. The 
   priority number indicates the relative priority of one path over the 
   other for primary paths. Higher numbers indicate higher priority. 
   The peer should consider sending traffic first over higher priority paths. 
   This is the recommended setting for paths that do not have a cost or 
   data caps associated with them as these paths will be frequently used.</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.2.10-6">Example use cases include:</t>
          <t indent="0" pn="section-3.2.10-7">1) Setting Wi-Fi path to Primary and Cellular paths to Secondary. In this case
   Wi-Fi will be used and Cellular will be used only if the Wi-Fi path is congested or not
   available. Such setting results in using the Cellular path only temporally, 
   if more capacity is needed than the WiFi path can provide, indicating a 
   clear priority of the Wi-Fi path over the Cellular due to, e.g., cost reasons.
2) Setting Wi-Fi path to Primary and Cellular to Standby. In this case Wi-Fi
   will be used and Cellular will be used only if the Wi-Fi path is not available. 
3) Setting Wi-Fi path to Primary and Cellular path to Primary. In this case,
   both paths can be used when making packet scheduling decisions.</t>
          <t indent="0" pn="section-3.2.10-8">If not specified, the default behavior is to always use a path for 
packet scheduling decisions (MP_PRIO=3), when the path has been established and 
added to an existing MP-DCCP connection. At least one path ought to have a 
MP_PRIO value greater or equal to one for it to be allowed to send on the 
connection. It is RECOMMENDED to update at least one path to a non-zero MP_PRIO
value when an MP-DCCP connection enters a state where all paths remain with an
MP_PRIO value of zero. This helps an MP-DCCP connection to 
schedule when the multipath scheduler strictly respects MP_PRIO value 0.
MP_PRIO is assumed to be exchanged reliably using the MP_CONFIRM 
mechanisms (see <xref target="ref-mp-option-confirm" format="default" sectionFormat="of" derivedContent="Table 4"/>).</t>
          <t indent="0" pn="section-3.2.10-9">The relative ratio of the primary path values 3-15 depends on the path usage strategy, which is described in more detail in <xref target="path_usage_strategy" format="default" sectionFormat="of" derivedContent="Section 3.11"/>. In the case of path mobility (<xref target="path_mobility" format="default" sectionFormat="of" derivedContent="Section 3.11.1"/>), only one path can be used at a time and MUST be the appropriate one that has the highest available priority value including also the prio numbers 1 and 2. In the other case of concurrent path usage (<xref target="concurrent_usage" format="default" sectionFormat="of" derivedContent="Section 3.11.2"/>), the definition is up to the multipath scheduler logic.</t>
          <t indent="0" pn="section-3.2.10-10">A MP_SEQ (<xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/>) MUST be present in a DCCP datagram
in which MP_PRIO is sent. Further details are given in <xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/>.</t>
        </section>
        <section anchor="MP_CLOSE" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.11">
          <name slugifiedName="name-mp_close">MP_CLOSE</name>
          <figure anchor="ref-MP_CLOSE" align="left" suppress-title="false" pn="figure-19">
            <name slugifiedName="name-format-of-the-mp_close-subo">Format of the MP_CLOSE suboption</name>
            <artwork align="left" pn="section-3.2.11-1.1"><![CDATA[
              1          2          3           
   01234567 89012345 67890123 45678901 23456789 
  +--------+--------+--------+--------+--------+
  |00101110|  var   |00001010| Key Data ...
  +--------+--------+--------+--------+--------+
   Type=46   Length  MP_OPT=10
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.11-2">An MP-DCCP connection can be gracefully closed by sending and MP_CLOSE to the peer host. 
On all subflows, the regular termination procedure as described in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> 
MUST be initiated using MP_CLOSE in the initial packet (either a DCCP-CloseReq or a DCCP-Close). 
When  a DCCP-CloseReq is used, the following DCCP-Close MUST also carry the MP_CLOSE 
to avoid keeping a state in the sender of the DCCP-CloseReq. 
At the initiator of the DCCP-CloseReq, all sockets including the MP-DCCP connection socket, 
transition to CLOSEREQ state. 
To protect from unauthorized shutdown of a multi-path connection, the selected Key Data of 
the peer host during the handshaking procedure MUST be included in by the MP_CLOSE option 
and must be validated by the peer host. 
Note, the Key Data is different between MP_CLOSE option carried by DCCP-CloseReq or DCCP-Close.</t>
          <t indent="0" pn="section-3.2.11-3">On reception of the first DCCP-CloseReq carrying a MP_CLOSE with valid Key Data, 
or due to a local decision, all subflows transition to the CLOSING state 
before transmitting a DCCP-Close carrying MP_CLOSE. 
The MP-DCCP connection socket on the host sending the DCCP-Close reflects the state of 
the initial subflow during handshake with MP_KEY option. 
If the initial subflow no longer exists, the state moves immediately to CLOSED.</t>
          <t indent="0" pn="section-3.2.11-4">Upon reception of the first DCCP-Close carrying a MP_CLOSE with valid Key Data 
at the peer host, all subflows, as well as the MP-DCCP connection socket, 
move to the CLOSED state. After this, a DCCP-Reset with Reset Code 1 
MUST be sent on any subflow in response to a received DCCP-Close containing a valid MP_CLOSE option.</t>
          <t indent="0" pn="section-3.2.11-5">When the MP-DCCP connection socket is in CLOSEREQ or CLOSE state, new subflow requests using MP_JOIN MUST be ignored.</t>
          <t indent="0" pn="section-3.2.11-6">Contrary to a MP_FAST_CLOSE (<xref target="MP_FAST_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.3"/>), no single-sided abrupt termination is applied.</t>
        </section>
        <section anchor="MP_EXP" numbered="true" removeInRFC="false" toc="include" pn="section-3.2.12">
          <name slugifiedName="name-experimental-multipath-opti">Experimental Multipath option MP_EXP for private use</name>
          <t indent="0" pn="section-3.2.12-1">This section reserves a Multipath option to define and specify any experimental additional feature for improving and optimization of the MP-DCCP protocol. This
option could be applicable to specific environments or scenarios according to potential new requirements and is meant for private use only. MP_OPT 
feature number 11 is specified with an exemplary description as below:</t>
          <figure anchor="ref-MP_EXP" align="left" suppress-title="false" pn="figure-20">
            <name slugifiedName="name-format-of-the-mp_exp-subopt">Format of the MP_EXP suboption</name>
            <artwork align="left" pn="section-3.2.12-2.1"><![CDATA[
                     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
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0|      var      |0 0 0 0 1 0 1 1|   Data TBD    |
+---------------+---------------+---------------+---------------+
|   ...                                                         
+---------------------------------------------------------------+
     Type=46         Length         MP_OPT=11
]]></artwork>
          </figure>
          <t indent="0" pn="section-3.2.12-3">The Data field can carry any data according to the foreseen use by the experimenters with a maximum length of 252 Bytes.</t>
        </section>
      </section>
      <section anchor="handshaking" numbered="true" removeInRFC="false" toc="include" pn="section-3.3">
        <name slugifiedName="name-mp-dccp-handshaking-procedu">MP-DCCP Handshaking Procedure</name>
        <t indent="0" pn="section-3.3-1">An example to illustrate the MP-DCCP handshake procedure is shown in <xref target="ref-mp-dccp-handshaking" format="default" sectionFormat="of" derivedContent="Figure 21"/>.</t>
        <figure anchor="ref-mp-dccp-handshaking" align="left" suppress-title="false" pn="figure-21">
          <name slugifiedName="name-example-mp-dccp-handshake">Example MP-DCCP handshake</name>
          <artwork align="left" pn="section-3.3-2.1"><![CDATA[
          Host A                                         Host B 
------------------------                              ----------
Address A1    Address A2                              Address B1
----------    ----------                              ----------
     |             |                                       |
     |           DCCP-Request + Change R (MP_CAPABLE,...)  |
     |---- MP_KEY(CI-A + Key-A(1), Key-A(2),...) --------->|
     |<------------------- MP_KEY(CI-B + Key-B) -----------|
     |       DCCP-Response +  Confirm L (MP_CAPABLE, ...)  |
     |             |                                       |
     |   DCCP-Ack  |                                       |
     |---------------------------------------------------->|
     |<----------------------------------------------------|
     |   DCCP-Ack  |                                       |
     |             |                                       |
     |             |DCCP-Request + Change R(MP_CAPABLE,...)|
     |             |--- MP_JOIN(CI-B,RA) ----------------->|
     |             |<------MP_JOIN(CI-A,RB) + MP_HMAC(B)---|
     |             |DCCP-Response+Confirm L(MP_CAPABLE,...)|
     |             |                                       |
     |             |DCCP-Ack                               |
     |             |-------- MP_HMAC(A) ------------------>|
     |             |<--------------------------------------|
     |             |DCCP-ACK                               |
]]></artwork>
        </figure>
        <t indent="0" pn="section-3.3-3">The basic initial handshake for the first subflow is as follows:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.3-4">
          <li pn="section-3.3-4.1">
            <t indent="0" pn="section-3.3-4.1.1">Host A sends a DCCP-Request with the MP-Capable feature Change
request and the MP_KEY option with a Host-specific CI-A and a Key-A for
each of the supported key types as described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/>. CI-A is a unique identifier during the
lifetime of a MP-DCCP connection.</t>
          </li>
          <li pn="section-3.3-4.2">
            <t indent="0" pn="section-3.3-4.2.1">Host B sends a DCCP-Response with Confirm feature for
MP-Capable and the MP_Key option with a unique Host-specific CI-B and a single Host-specific Key-B.
The type of the key is chosen from the list of supported types
from the previous request.</t>
          </li>
          <li pn="section-3.3-4.3">
            <t indent="0" pn="section-3.3-4.3.1">Host A sends a DCCP-Ack to confirm the proper key exchange.</t>
          </li>
          <li pn="section-3.3-4.4">
            <t indent="0" pn="section-3.3-4.4.1">Host B sends a DCCP-Ack to complete the handshake and set both connection ends to the OPEN state.</t>
          </li>
        </ul>
        <t indent="0" pn="section-3.3-5">It should be noted that DCCP is protected against corruption of DCCP header data (section 9 of <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>), so no additional mechanisms beyond the general confirmation are required to ensure that the header data has been properly received.</t>
        <t indent="0" pn="section-3.3-6">Host A waits for the final DCCP-Ack from host B before starting any
establishment of additional subflow connections.</t>
        <t indent="0" pn="section-3.3-7">The handshake for subsequent subflows based on a successful initial
handshake is as follows:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.3-8">
          <li pn="section-3.3-8.1">
            <t indent="0" pn="section-3.3-8.1.1">Host A sends a DCCP-Request with the MP-Capable feature Change
request and the MP_JOIN option with Host B's CI-B,
obtained during the initial handshake. Additionally, an own random nonce
RA is transmitted with the MP_JOIN.</t>
          </li>
          <li pn="section-3.3-8.2">
            <t indent="0" pn="section-3.3-8.2.1">Host B computes the HMAC of the DCCP-Request and sends a DCCP-Response
with Confirm feature option for MP-Capable and the MP_JOIN option with
the CI-A and a random nonce RB together with the computed MP_HMAC.
The HMAC is calculated by taking the leftmost 20 bytes from the SHA256 hash
of a HMAC code created by using the nonce received with MP_JOIN(A) and the
local nonce RB as message and the derived key described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/> as key:  </t>
            <t indent="0" pn="section-3.3-8.2.2">
MP_HMAC(B) = HMAC-SHA256(Key=d-key(B), Msg=RB+RA)</t>
          </li>
          <li pn="section-3.3-8.3">
            <t indent="0" pn="section-3.3-8.3.1">Host A sends a DCCP-Ack with the HMAC computed for the DCCP-Response.
The HMAC is calculated by taking the leftmost 20 bytes from the SHA256 hash
of a HMAC code created by using the local nonce RA and the nonce received
with MP_JOIN(B) as message and the derived key described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/> as key:  </t>
            <t indent="0" pn="section-3.3-8.3.2">
MP_HMAC(A) = HMAC-SHA256(Key=d-key(A), Msg=RA+RB)</t>
          </li>
          <li pn="section-3.3-8.4">
            <t indent="0" pn="section-3.3-8.4.1">Host B sends a DCCP-Ack to confirm the HMAC and to conclude the
handshaking.</t>
          </li>
        </ul>
      </section>
      <section anchor="address-knowledge-exchange" numbered="true" removeInRFC="false" toc="include" pn="section-3.4">
        <name slugifiedName="name-address-knowledge-exchange">Address knowledge exchange</name>
        <section anchor="advertising-a-new-path-mpaddaddr" numbered="true" removeInRFC="false" toc="include" pn="section-3.4.1">
          <name slugifiedName="name-advertising-a-new-path-mp_a">Advertising a new path (MP_ADDADDR)</name>
          <t indent="0" pn="section-3.4.1-1">When a host (Host A) wants to advertise the availability of a new path, it should use the MP_ADDADDR option (<xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/>) as
shown in the example in <xref target="ref-mp-dccp-add-address" format="default" sectionFormat="of" derivedContent="Figure 22"/>. The MP_ADDADDR option passed in the DCCP-Data contains the following parameters:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.1-2">
            <li pn="section-3.4.1-2.1">
              <t indent="0" pn="section-3.4.1-2.1.1">an identifier (id 2) for the new IP address which is used as a reference in subsequent control exchanges.</t>
            </li>
            <li pn="section-3.4.1-2.2">
              <t indent="0" pn="section-3.4.1-2.2.1">the IP address of the new path (A2_IP)</t>
            </li>
            <li pn="section-3.4.1-2.3">
              <t indent="0" pn="section-3.4.1-2.3.1">A pair of octets specifying the port number associated with this IP address. The value of 00 here indicates that the port number is the same
as that used for the initial subflow address A1_IP</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.4.1-3">The following options MUST be included in a packet carrying MP_ADDADDR:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.1-4">
            <li pn="section-3.4.1-4.1">
              <t indent="0" pn="section-3.4.1-4.1.1">the leftmost 20 bytes of the HMAC(A) generated during the initial handshaking procedure described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/> and <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/></t>
            </li>
            <li pn="section-3.4.1-4.2">
              <t indent="0" pn="section-3.4.1-4.2.1">the MP_SEQ option with the sequence number (seqno 12) for this message according to <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/>.</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.4.1-5">Host B acknowledges receipt of the MP_ADDADDR message with a DCCP-Ack containing the MP_CONFIRM option. The parameters supplied in this
response are as follows:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.1-6">
            <li pn="section-3.4.1-6.1">
              <t indent="0" pn="section-3.4.1-6.1.1">an MP_CONFIRM containing the MP_SEQ number (seqno 12) of the packet carrying the option that we are confirming together with the MP_ADDADDR option</t>
            </li>
            <li pn="section-3.4.1-6.2">
              <t indent="0" pn="section-3.4.1-6.2.1">the leftmost 20 bytes of the HMAC(B) generated during the initial handshaking procedure <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/></t>
            </li>
          </ul>
          <figure anchor="ref-mp-dccp-add-address" align="left" suppress-title="false" pn="figure-22">
            <name slugifiedName="name-example-mp-dccp-addaddr-pro">Example MP-DCCP ADDADDR procedure</name>
            <artwork align="left" pn="section-3.4.1-7.1"><![CDATA[
          Host A                                         Host B 
------------------------                              -----------
Address A1    Address A2                               Address B1
----------    ----------                              -----------
     |             |                                       |
     |   DCCP-Data +  MP_ADDADDR(id 2, A2_IP, 00) +        |
     |------- MP_HMAC(A) + MP_SEQ(seqno 12) -------------->|
     |             |                                       |      
     |   DCCP-Ack + MP_HMAC(B) +                           |
     |<----- MP_CONFIRM(seqno 12, MP_ADDADDR) -------------|
]]></artwork>
          </figure>
        </section>
        <section anchor="removing-a-path-mpremoveaddr" numbered="true" removeInRFC="false" toc="include" pn="section-3.4.2">
          <name slugifiedName="name-removing-a-path-mp_removead">Removing a path (MP_REMOVEADDR)</name>
          <t indent="0" pn="section-3.4.2-1">When a host (Host A) wants to indicate that a path is no longer available, it should use the MP_REMOVEADDR option (<xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/>) as
shown in the example in <xref target="ref-mp-dccp-remove-address" format="default" sectionFormat="of" derivedContent="Figure 23"/>. The MP_REMOVEADDR option passed in the DCCP-Data contains the following parameters:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.2-2">
            <li pn="section-3.4.2-2.1">
              <t indent="0" pn="section-3.4.2-2.1.1">an identifier (id 2) for the IP address to remove (A2_IP) and which was specified in a previous MP_ADDADDR message.</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.4.2-3">The following options MUST be included in a packet carrying MP_REMOVEADDR:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.2-4">
            <li pn="section-3.4.2-4.1">
              <t indent="0" pn="section-3.4.2-4.1.1">the leftmost 20 bytes of the HMAC(A) generated during the initial handshaking procedure described in <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/> and <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/></t>
            </li>
            <li pn="section-3.4.2-4.2">
              <t indent="0" pn="section-3.4.2-4.2.1">the MP_SEQ option with the sequence number (seqno 33) for this message according to <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/>.</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.4.2-5">Host B acknowledges receipt of the MP_REMOVEADDR message with a DCCP-Ack containing the MP_CONFIRM option. The parameters supplied in this
response are as follows:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.4.2-6">
            <li pn="section-3.4.2-6.1">
              <t indent="0" pn="section-3.4.2-6.1.1">an MP_CONFIRM containing the MP_SEQ number (seqno 33) of the packet carrying the option that we are confirming, together with the MP_REMOVEADDR option</t>
            </li>
            <li pn="section-3.4.2-6.2">
              <t indent="0" pn="section-3.4.2-6.2.1">the leftmost 20 bytes of the HMAC(B) generated during the initial handshaking procedure <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/></t>
            </li>
          </ul>
          <figure anchor="ref-mp-dccp-remove-address" align="left" suppress-title="false" pn="figure-23">
            <name slugifiedName="name-example-mp-dccp-removeaddr-">Example MP-DCCP REMOVEADDR procedure</name>
            <artwork align="left" pn="section-3.4.2-7.1"><![CDATA[
          Host A                                         Host B 
------------------------                              -----------
Address A1    Address A2                               Address B1
----------    ----------                              -----------
     |             |                                       |
     |   DCCP-Data +  MP_REMOVEADDR(id 2) +                |
     |------- MP_HMAC(A) + MP_SEQ(seqno 33) -------------->|
     |             |                                       |      
     |   DCCP-Ack + MP_HMAC(B) +                           |
     |<----- MP_CONFIRM(seqno 33, MP_REMOVEADDR) ----------|
]]></artwork>
          </figure>
        </section>
      </section>
      <section anchor="closing" numbered="true" removeInRFC="false" toc="include" pn="section-3.5">
        <name slugifiedName="name-closing-an-mp-dccp-connecti">Closing an MP-DCCP connection</name>
        <t indent="0" pn="section-3.5-1">When a host wants to close an existing subflow but not the whole MP-DCCP
connection, it MUST initiate the regular DCCP connection termination procedure 
as described in Section 5.6 of <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, i.e., it sends a DCCP-Close/DCCP-Reset on the subflow. This
may be preceded by a DCCP-CloseReq. In the event of an irregular termination of a subflow,
e.g., during subflow establishment, it MUST use an appropriate DCCP reset code as specified in IANA <xref target="DCCP.Parameter" format="default" sectionFormat="of" derivedContent="DCCP.Parameter"/> for DCCP operations. This could be, for example, sending reset code 5 (Option Error) when an MP-DCCP
option provides invalid data or reset code 9 (Too Busy) when the maximum number of maintainable paths
is reached. Note that receiving a reset code 9 for secondary subflows SHOULD NOT impact already existing active
subflows. If necessary, these subflows are terminated in a subsequent step using the procedures described in
this section.</t>
        <t indent="0" pn="section-3.5-2">A host terminates an MP-DCCP connection using the DCCP connection termination specified in section 5.5 of
<xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> on each subflow with the first packet on each subflow carrying MP_CLOSE (see <xref target="MP_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.11"/>).</t>
        <artwork align="left" pn="section-3.5-3"><![CDATA[
  Host A                                   Host B
  ------                                   ------
                                   <-      Optional DCCP-CloseReq +
                                           MP_CLOSE [A's key] 
                                           [on all subflows]
  DCCP-Close + MP_CLOSE            ->
  [B's key] [on all subflows]
                                   <-      DCCP-Reset
                                           [on all subflows]
]]></artwork>
        <t indent="0" pn="section-3.5-4">Additionally, an MP-DCCP connection may be closed abruptly using the "Fast Close"
procedure described in <xref target="MP_FAST_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.3"/>, where a DCCP-Reset is sent on all
subflows, each carrying the MP_FAST_CLOSE option.</t>
        <artwork align="left" pn="section-3.5-5"><![CDATA[
  Host A                                   Host B
  ------                                   ------
  DCCP-Reset + MP_FAST_CLOSE       ->
  [B's key] [on all subflows]
                                   <-      DCCP-Reset
                                           [on all subflows]
]]></artwork>
      </section>
      <section anchor="fallback" numbered="true" removeInRFC="false" toc="include" pn="section-3.6">
        <name slugifiedName="name-fallback">Fallback</name>
        <t indent="0" pn="section-3.6-1">When a subflow fails to operate following MP-DCCP intended behavior, it is 
necessary to proceed with a fallback. This may be either falling back 
to regular DCCP <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> or removing a problematic subflow. The main reasons for 
subflow failing include: no MP support at peer host, failure to negotiate protocol
version, loss of Multipath options, faulty/non-supported MP-DCCP options or modification
of payload data.</t>
        <t indent="0" pn="section-3.6-2">At the start of an MP-DCCP connection, the handshake ensures exchange of MP-DCCP feature and
options and thus ensures that the path is fully MP-DCCP capable. If during the
handshake procedure it appears that DCCP-Request or DCCP-Response
messages do not carry the MP_CAPABLE feature, the MP-DCCP connection will not be 
established and the handshake SHOULD fallback to regular DCCP (if this is not 
possible it MUST be closed).</t>
        <t indent="0" pn="section-3.6-3">A connection SHOULD fallback to regular DCCP if the endpoints fail to agree on a
protocol version to use during the Multipath Capable feature negotiation. This is described in
<xref target="mp_capable" format="default" sectionFormat="of" derivedContent="Section 3.1"/>. The protocol version negotiation distinguishes between negotiation
for the initial connection establishment, and addition of subsequent subflows. If
protocol version negotiation is not successful during the initial connection establishment,
MP-DCCP connection will fallback to regular DCCP.</t>
        <t indent="0" pn="section-3.6-4">The fallback procedure to regular DCCP MUST be also applied if the MP_KEY <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/> Key Type cannot be negotiated.</t>
        <t indent="0" pn="section-3.6-5">If a subflow attempts to join an existing MP-DCCP connection, but MP-DCCP options or MP_CAPABLE
feature are not present or are faulty in the handshake procedure, that subflow MUST be closed.
This is especially the case if a different MP_CAPABLE version than the originally negotiated
version is used. Reception of a non-verifiable MP_HMAC (<xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/>) or an invalid
CI used in MP_JOIN (<xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/>) during flow establishment MUST cause the
subflow to be closed.</t>
        <t indent="0" pn="section-3.6-6">The subflow closing procedure MUST be also applied if a final ACK carrying MP_KEY with wrong Key-A/Key-B is
received or MP_KEY option is malformed.</t>
        <t indent="0" pn="section-3.6-7">Another relevant case is when payload data is modified by middleboxes. DCCP uses 
checksum to protect the data, as described in section 9 of <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>. A checksum will 
fail if the data has been changed in any way. All data from the start of the segment that
failed the checksum onwards cannot be considered trustworthy. DCCP defines that if 
the checksum fails, the receiving endpoint MUST drop the application data and report 
that data as dropped due to corruption using a Data Dropped option (Drop Code 3, 
Corrupt). If data is dropped due to corruption for an MP-DCCP connection, the affected
subflow MAY be closed.</t>
      </section>
      <section anchor="state-diagram" numbered="true" removeInRFC="false" toc="include" pn="section-3.7">
        <name slugifiedName="name-state-diagram">State Diagram</name>
        <t indent="0" pn="section-3.7-1">The MP-DCCP per subflow state transitions to a large extent follow the
state transitions defined for DCCP in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, with some modifications 
due to the MP-DCCP four-way handshake and fast close procedures. The state diagram below
illustrates the most common state transitions.  The diagram is illustrative.
For example, there are arcs (not shown) from several additional states 
to TIMEWAIT, contingent on the receipt of a valid DCCP-Reset.</t>
        <t indent="0" pn="section-3.7-2">The states transitioned
when moving from the CLOSED to OPEN state during the four-way handshake
remain the same as for DCCP, but it is no longer possible to transmit
application data while in the REQUEST state. The fast close procedure
can be triggered by either the client or the server and results in the transmission
of a Reset packet. The fast close procedure moves the state of the client and server
directly to TIMEWAIT and CLOSED, respectively.</t>
        <figure anchor="ref-mp-dccp-state-transition" align="left" suppress-title="false" pn="figure-24">
          <name slugifiedName="name-most-common-state-transitio">Most common state transitions of a MP-DCCP subflow</name>
          <artwork align="left" pn="section-3.7-3.1"><![CDATA[
   +----------------------------+    +------------------------------+
   |                            v    v                              |
   |                         +----------+                           |
   |           +-------------+  CLOSED  +-------------+             |
   |           | passive     +----------+   active    |             |
   |           |  open                       open     |             |
   |           |                          snd Request |             |
   |           v                                      v             |
   |     +-----------+                           +----------+       |
   |     |  LISTEN   |                           | REQUEST  |       |
   |     +-----+-----+                           +----+-----+       |
   |           | rcv Request             rcv Response |             |
   |           | snd Response              snd Ack    |             |
   |           v                                      v             |
   |     +-----------+                           +----------+       |
   |     |  RESPOND  |                           | PARTOPEN |       |
   |     +-----+-----+                           +----+-----+       |
   |           | rcv Ack             rcv Ack/DataAck  |             |
   |           | snd Ack                              |             |
   |           |             +-----------+            |             |
   |           +------------>|   OPEN    |<-----------+             |
   |                         +--+-+-+-+--+                          |
   |        server active close | | | |   active close              |
   |            snd CloseReq    | | | | or rcv CloseReq             |
   |                            | | | |    snd Close                |
   |                            | | | |                             |
   |     +-----------+          | | | |            +----------+     |
   |     | CLOSEREQ  |<---------+ | | +----------->| CLOSING  |     |
   |     +-----+-----+            | |              +----+-----+     |
   |           | rcv Close        | |         rcv Reset |           |
   |           | snd Reset        | |                   |           |
   |           |                  | | active FastClose  |           |
   |<----------+        rcv Close | | or rcv FastClose  v           |
   |   or server active FastClose | | snd Reset    +----+-----+     |
   |      or server rcv FastClose | +------------->| TIMEWAIT |     |
   |                    snd Reset |                +----+-----+     |
   +------------------------------+                     |           |
                                                        +-----------+
                                                    2MSL timer expires
]]></artwork>
        </figure>
      </section>
      <section anchor="congestion-control-considerations" numbered="true" removeInRFC="false" toc="include" pn="section-3.8">
        <name slugifiedName="name-congestion-control-consider">Congestion Control Considerations</name>
        <t indent="0" pn="section-3.8-1">Senders MUST manage per-path congestion status, and avoid to
sending more data on a given path than congestion control
for each path allows.</t>
      </section>
      <section anchor="mps" numbered="true" removeInRFC="false" toc="include" pn="section-3.9">
        <name slugifiedName="name-maximum-packet-size-conside">Maximum Packet Size Considerations</name>
        <t indent="0" pn="section-3.9-1">A DCCP implementation maintains the maximum packet size (MPS) during operation of a DCCP session. This procedure is specified for single-path DCCP in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, Section 14. Without any restrictions, this is adopted for MP-DCCP operations, in particular the PMTU measurement and the Sender Behaviour. The DCCP application interface SHOULD allow the application to discover the current MPS. This reflects the current supported largest size for the data stream that can be used across the set of all active MP-DCCP subflows.</t>
      </section>
      <section anchor="maximum-number-of-subflows" numbered="true" removeInRFC="false" toc="include" pn="section-3.10">
        <name slugifiedName="name-maximum-number-of-subflows">Maximum number of Subflows</name>
        <t indent="0" pn="section-3.10-1">In theory, an infinite number of subflows can be created within an MP-DCCP connection, as there is no element in the protocol that represents a restriction. In practical scenarios, however, there will be resource limitations on the host or use cases that do not benefit from additional subflows.</t>
        <t indent="0" pn="section-3.10-2">It is RECOMMENDED to limit the number of subflows in implementations and to reject incoming subflow requests with a DCCP-Reset using the Reset Code "too busy" as specified in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> if this limit is exceeded.</t>
      </section>
      <section anchor="path_usage_strategy" numbered="true" removeInRFC="false" toc="include" pn="section-3.11">
        <name slugifiedName="name-path-usage-strategies">Path usage strategies</name>
        <t indent="0" pn="section-3.11-1">MP-DCCP can be configured to realize one of several strategies for path usage, via selecting one DCCP subflow of the multiple DCCP subflows within a MP-DCCP connection for data transmission. This can be a dynamic process further facilitated by the means of DCCP and MP-DCCP defined options such as path preference using MP-PRIO, adding or removing DCCP subflows using MP_REMOVEADDR, MP_ADDADDR or DCCP-Close/DCCP-Reset and also path metrics such as packet-loss-rate, CWND or RTT provided by the Congestion Control Algorithm.
Selecting an appropriate method can allow MP-DCCP to realize different path utilization strategies that make MP-DCCP suitable for end-to-end implementation over the Internet or in controlled environments such as Hybrid Access or 5G ATSSS.</t>
        <section anchor="path_mobility" numbered="true" removeInRFC="false" toc="include" pn="section-3.11.1">
          <name slugifiedName="name-path-mobility">Path mobility</name>
          <t indent="0" pn="section-3.11.1-1">The path mobility strategy provides the use of a single path with a seamless handover function to continue the connection when the currently used path is deemed unsuitable for service delivery.
Some of the DCCP subflows of a MP-DCCP connection might become inactive due to either the occurrence of certain error conditions (e.g., DCCP timeout, packet loss threshold, RTT threshold, closed/removed) or adjustments from the MP-DCCP user.
When there is outbound data to send and the primary path becomes inactive (e.g., due to failures) or de-prioritized, the MP-DCCP endpoint SHOULD try to send the data through an alternate path with a different source or destination address (depending on the point of failure), if one exists. This process SHOULD respect the path priority configured by MP_PRIO or if not available pick the most divergent source-destination pair from the original used source-destination pair.</t>
          <ul empty="true" bare="false" indent="3" spacing="normal" pn="section-3.11.1-2">
            <li pn="section-3.11.1-2.1">
              <t indent="0" pn="section-3.11.1-2.1.1">Note: Rules for picking the most appropriate source-destination pair are an implementation decision and are not specified within this document.
Path mobility is supported in the current Linux reference implementation <xref target="multipath-dccp.org" format="default" sectionFormat="of" derivedContent="multipath-dccp.org"/>.</t>
            </li>
          </ul>
        </section>
        <section anchor="concurrent_usage" numbered="true" removeInRFC="false" toc="include" pn="section-3.11.2">
          <name slugifiedName="name-concurrent-path-usage">Concurrent path usage</name>
          <t indent="0" pn="section-3.11.2-1">Different to a path mobility strategy, the selection between MP-DCCP
subflows is a per-packet decision that is a part of the multipath
scheduling process. This method would allow multiple subflows to be
simultaneously used to aggregate the path resources to obtain higher
connection throughput.</t>
          <t indent="0" pn="section-3.11.2-2">In this scenario, the selection of congestion control, per-packet scheduling
and potential re-ordering method determines a concurrent path utilization
strategy and result in a particular transport characteristic.
A concurrent path usage method uses a scheduling design that could seek to 
maximize reliability, throughput, minimizing latency, etc.</t>
          <t indent="0" pn="section-3.11.2-3">Concurrent path usage over the Internet can have implications. When a 
Multipath DCCP connection uses two or more paths, there is no guarantee 
that these paths are fully disjoint.  When two (or more) subflows share 
the same bottleneck, using a standard congestion control scheme could 
result in an unfair distribution of the capacity with the multipath 
connection using more capacity than competing single path connections.<br/>
Multipath TCP uses the coupled congestion control Linked Increases 
Algorithm (LIA) specified in the experimental specification <xref target="RFC6356" format="default" sectionFormat="of" derivedContent="RFC6356"/> to solve this problem.  This 
scheme could also be specified for Multipath DCCP.  The same applies to 
other coupled congestion control schemes that have been proposed for 
Multipath TCP such as Opportunistic Linked Increases Algorithm <xref target="OLIA" format="default" sectionFormat="of" derivedContent="OLIA"/>.</t>
          <t indent="0" pn="section-3.11.2-4">The specification of scheduling for concurrent multipath and related the 
congestion control algorithms and re-ordering methods for use in the general
Internet are outside the scope of this document. If, and when, the IETF
specifies a method for concurrent usage of multiple paths for the
general Internet, the framework specified in this document could be used to 
provide an IETF recommended method for MP-DCCP.</t>
        </section>
      </section>
    </section>
    <section anchor="security" numbered="true" removeInRFC="false" toc="include" pn="section-4">
      <name slugifiedName="name-security-considerations">Security Considerations</name>
      <t indent="0" pn="section-4-1">Similar to DCCP, MP-DCCP does not provide cryptographic security
guarantees inherently. Thus, if applications need cryptographic security
(integrity, authentication, confidentiality, access control, and
anti-replay protection) the use of IPsec, DTLS over DCCP <xref target="RFC5238" format="default" sectionFormat="of" derivedContent="RFC5238"/> or other
end-to-end security is recommended;
Secure Real-time Transport Protocol (SRTP) <xref target="RFC3711" format="default" sectionFormat="of" derivedContent="RFC3711"/> is one candidate
protocol for authentication. Together with Encryption of Header
Extensions in SRTP, as provided by <xref target="RFC6904" format="default" sectionFormat="of" derivedContent="RFC6904"/>, also integrity would
be provided.</t>
      <t indent="0" pn="section-4-2">DCCP <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> provides protection against hijacking
and limits the potential impact of some denial-of-service attacks, but
DCCP provides no inherent protection against an on-path attacker snooping on data
packets. Regarding the security of MP-DCCP no additional risks should be
introduced compared to regular DCCP. Thereof derived are the
following key security requirements to be fulfilled by MP-DCCP:</t>
      <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-4-3">
        <li pn="section-4-3.1">
          <t indent="0" pn="section-4-3.1.1">Provide a mechanism to confirm that parties involved in a subflow
handshake are identical to those in the original connection setup.</t>
        </li>
        <li pn="section-4-3.2">
          <t indent="0" pn="section-4-3.2.1">Provide verification that the new address to be included in a MP
connection is valid for a peer to receive traffic at before using it.</t>
        </li>
        <li pn="section-4-3.3">
          <t indent="0" pn="section-4-3.3.1">Provide replay protection, i.e., ensure that a request to add/remove a
subflow is 'fresh'.</t>
        </li>
      </ul>
      <t indent="0" pn="section-4-4">To achieve these goals, MP-DCCP includes a hash-based handshake
algorithm documented in Sections <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/>, <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/> and <xref target="handshaking" format="default" sectionFormat="of" derivedContent="Section 3.3"/>. The
security of the MP-DCCP connection depends on the use of keys that are
shared once at the start of the first subflow and are never sent again
over the network. To ease demultiplexing while not revealing
cryptographic material, subsequent subflows use the initially exchanged
CI information. The keys exchanged once at the beginning are
concatenated and used as keys for creating Hash-based Message
Authentication Codes (HMACs) used on subflow setup, in order to verify
that the parties in the handshake of subsequent subflows are the same as in the original
connection setup. It also provides verification that the peer can
receive traffic at this new address. Replay attacks would still be
possible when only keys are used;
therefore, the handshakes use single-use random numbers (nonces) at both
ends -- this ensures that the HMAC will never be the same on two handshakes.
Guidance on generating random numbers suitable for use as keys is given
in <xref target="RFC4086" format="default" sectionFormat="of" derivedContent="RFC4086"/>. During normal operation, regular DCCP protection
mechanisms (such as header checksum to protect DCCP headers against
corruption) is designed to provide the same level of protection against attacks on
individual DCCP subflows as exists for regular DCCP.</t>
      <t indent="0" pn="section-4-5">As discussed in <xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/>, a host may advertise its private
addresses, but these might point to different hosts in the receiver's
network.  The MP_JOIN handshake (<xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/>) is designed to ensure that this
does not set up a subflow to the incorrect host.
However, it could still create unwanted DCCP handshake traffic.  This
feature of MP-DCCP could be a target for denial-of-service exploits,
with malicious participants in MP-DCCP connections encouraging the
recipient to target other hosts in the network.  Therefore,
implementations should consider heuristics at both the
sender and receiver to reduce the impact of this.</t>
      <t indent="0" pn="section-4-6">As described in <xref target="mps" format="default" sectionFormat="of" derivedContent="Section 3.9"/>, a Maximum Packet Size (MPS) is maintained for a MP-DCCP connection.
If MP-DCCP exposes a minimum MPS across all paths,
any change to one path impacts the sender for all paths.
To mitigate attacks that seek to force a low MPS, MP-DCCP
could detect an attempt to reduce the MPS less than a minimum MPS, and then
stop using these paths.</t>
    </section>
    <section anchor="middlebox" numbered="true" removeInRFC="false" toc="include" pn="section-5">
      <name slugifiedName="name-interactions-with-middlebox">Interactions with Middleboxes</name>
      <t indent="0" pn="section-5-1">Issues from interaction with on-path middleboxes such as NATs, firewalls, proxies,
intrusion detection systems (IDSs), and others have to be considered for all
extensions to standard protocols since otherwise unexpected reactions of
middleboxes may hinder its deployment. DCCP already provides means to
mitigate the potential impact of middleboxes, also in comparison to TCP (see
<xref target="RFC4043" format="default" sectionFormat="of" derivedContent="RFC4043"/>, Section 16). When both hosts are located behind a NAT or
firewall entity, specific measures have to be applied such as the <xref target="RFC5596" format="default" sectionFormat="of" derivedContent="RFC5596"/> specified
simultaneous-open technique that update the (traditionally asymmetric)
connection-establishment procedures for DCCP.  Further standardized technologies
addressing middleboxes operating as NATs are provided in <xref target="RFC5597" format="default" sectionFormat="of" derivedContent="RFC5597"/>.</t>
      <t indent="0" pn="section-5-2"><xref target="RFC6773" format="default" sectionFormat="of" derivedContent="RFC6773"/> specifies UDP Encapsulation for NAT Traversal of DCCP sessions,
similar to other UDP encapsulations such as for SCTP <xref target="RFC6951" format="default" sectionFormat="of" derivedContent="RFC6951"/>. Future
specifications by the IETF could specify other methods for DCCP encapsulation.</t>
      <t indent="0" pn="section-5-3">The security impact of MP-DCCP aware middleboxes is discussed in <xref target="security" format="default" sectionFormat="of" derivedContent="Section 4"/></t>
    </section>
    <section anchor="implementation" numbered="true" removeInRFC="false" toc="include" pn="section-6">
      <name slugifiedName="name-implementation">Implementation</name>
      <t indent="0" pn="section-6-1">The approach described above has been implemented in open source across different testbeds and a new scheduling algorithm has been extensively tested. Also 
demonstrations of a laboratory setup have been executed and have been published at <xref target="multipath-dccp.org" format="default" sectionFormat="of" derivedContent="multipath-dccp.org"/>.</t>
    </section>
    <section anchor="acknowledgments" numbered="true" removeInRFC="false" toc="include" pn="section-7">
      <name slugifiedName="name-acknowledgments">Acknowledgments</name>
      <t indent="0" pn="section-7-1"><xref target="RFC8684" format="default" sectionFormat="of" derivedContent="RFC8684"/> defines Multipath TCP and provided important
inputs for this specification.</t>
      <t indent="0" pn="section-7-2">The authors gratefully acknowledge significant input into this document from Dirk von Hugo, Nathalie Romo Moreno, Omar Nassef, Mohamed Boucadair, Simone Ferlin, Olivier Bonaventure, Gorry Fairhurst and Behcet Sarikaya.</t>
    </section>
    <section anchor="iana-considerations" numbered="true" removeInRFC="false" toc="include" pn="section-8">
      <name slugifiedName="name-iana-considerations">IANA Considerations</name>
      <t indent="0" pn="section-8-1">This section provides guidance to the Internet Assigned Numbers Authority (IANA) regarding registration of values related to the MP extension of the DCCP protocol 
in accordance with <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>.  This document defines one new value which is requested to be allocated in the IANA DCCP Feature Numbers registry and three new registries to be allocated in the DCCP registry group.</t>
      <t indent="0" pn="section-8-2">This document requests IANA to assign a new DCCP feature parameter for negotiating
the support of multipath capability for DCCP sessions between hosts
as described in <xref target="protocol" format="default" sectionFormat="of" derivedContent="Section 3"/>. The following entry in <xref target="ref-add-feature-list" format="default" sectionFormat="of" derivedContent="Table 6"/> should be
added to the Feature Numbers registry in the DCCP registry group according to <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, Section 19.4. under the "DCCP Protocol" heading.</t>
      <table anchor="ref-add-feature-list" align="center" pn="table-6">
        <name slugifiedName="name-addition-to-dccp-feature-nu">Addition to DCCP Feature Numbers registry</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Value</th>
            <th align="center" colspan="1" rowspan="1">Feature Name</th>
            <th align="center" colspan="1" rowspan="1">Specification</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">10 suggested</td>
            <td align="center" colspan="1" rowspan="1">Multipath Capable</td>
            <td align="center" colspan="1" rowspan="1">[ThisDocument]</td>
          </tr>
        </tbody>
      </table>
      <ul empty="true" bare="false" indent="3" spacing="normal" pn="section-8-4">
        <li pn="section-8-4.1">
          <t indent="0" pn="section-8-4.1.1">Note to RFC Editor: Please replace [ThisDocument] with a reference to the final RFC</t>
        </li>
      </ul>
      <t indent="0" pn="section-8-5">Sect. <xref target="mp_capable" format="default" sectionFormat="of" derivedContent="Section 3.1"/> specifies the new 1-Byte entry above includes a 4-bit part to specify the version of the used MP-DCCP implementation. This document requests IANA to create a new 'MP-DCCP Versions' registry within the DCCP registry group to track the MP-DCCP version. The initial content of this registry is as follows:</t>
      <table anchor="ref-add-version-list" align="center" pn="table-7">
        <name slugifiedName="name-mp-dccp-versions-registry">MP-DCCP Versions Registry</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Version</th>
            <th align="center" colspan="1" rowspan="1">Value</th>
            <th align="center" colspan="1" rowspan="1">Specification</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">0</td>
            <td align="center" colspan="1" rowspan="1">0000 suggested</td>
            <td align="center" colspan="1" rowspan="1">[ThisDocument]</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Unassigned</td>
            <td align="center" colspan="1" rowspan="1">0001 - 1111</td>
            <td align="center" colspan="1" rowspan="1"> </td>
          </tr>
        </tbody>
      </table>
      <ul empty="true" bare="false" indent="3" spacing="normal" pn="section-8-7">
        <li pn="section-8-7.1">
          <t indent="0" pn="section-8-7.1.1">Note to RFC Editor: Please replace [ThisDocument] with a reference to the final RFC</t>
        </li>
      </ul>
      <t indent="0" pn="section-8-8">Future MP-DCCP versions 1 to 15 are assigned from this registry using the Specification Required policy (Section 4.6 of <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>).</t>
      <t indent="0" pn="section-8-9">This document requests IANA to assign value 46 in the DCCP "Option Types" registry to "Multipath Options", as described in <xref target="MP_OPT" format="default" sectionFormat="of" derivedContent="Section 3.2"/>.</t>
      <t indent="0" pn="section-8-10">IANA is requested to create a new 'Multipath Options' registry within the DCCP registry group. The following entries in <xref target="ref-add-proto-opt-list" format="default" sectionFormat="of" derivedContent="Table 8"/> should be added to the new 'Multipath Options' registry. The registry in <xref target="ref-add-proto-opt-list" format="default" sectionFormat="of" derivedContent="Table 8"/> has an upper boundary of 255 in the numeric value field.</t>
      <table anchor="ref-add-proto-opt-list" align="center" pn="table-8">
        <name slugifiedName="name-multipath-options-registry">Multipath Options registry</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Multipath Option</th>
            <th align="center" colspan="1" rowspan="1">Name</th>
            <th align="center" colspan="1" rowspan="1">Description</th>
            <th align="center" colspan="1" rowspan="1">Reference</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=0</td>
            <td align="center" colspan="1" rowspan="1">MP_CONFIRM</td>
            <td align="center" colspan="1" rowspan="1">Confirm reception/processing of an MP_OPT option</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_CONFIRM" format="default" sectionFormat="of" derivedContent="Section 3.2.1"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=1</td>
            <td align="center" colspan="1" rowspan="1">MP_JOIN</td>
            <td align="center" colspan="1" rowspan="1">Join subflow to existing MP-DCCP connection</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_JOIN" format="default" sectionFormat="of" derivedContent="Section 3.2.2"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=2</td>
            <td align="center" colspan="1" rowspan="1">MP_FAST_CLOSE</td>
            <td align="center" colspan="1" rowspan="1">Close MP-DCCP connection</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_FAST_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.3"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=3</td>
            <td align="center" colspan="1" rowspan="1">MP_KEY</td>
            <td align="center" colspan="1" rowspan="1">Exchange key material for MP_HMAC</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=4</td>
            <td align="center" colspan="1" rowspan="1">MP_SEQ</td>
            <td align="center" colspan="1" rowspan="1">Multipath sequence number</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=5</td>
            <td align="center" colspan="1" rowspan="1">MP_HMAC</td>
            <td align="center" colspan="1" rowspan="1">Hash-based message auth. code for MP-DCCP</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_HMAC" format="default" sectionFormat="of" derivedContent="Section 3.2.6"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=6</td>
            <td align="center" colspan="1" rowspan="1">MP_RTT</td>
            <td align="center" colspan="1" rowspan="1">Transmit RTT values and calculation parameters</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_RTT" format="default" sectionFormat="of" derivedContent="Section 3.2.7"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=7</td>
            <td align="center" colspan="1" rowspan="1">MP_ADDADDR</td>
            <td align="center" colspan="1" rowspan="1">Advertise additional address(es)/port(s)</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=8</td>
            <td align="center" colspan="1" rowspan="1">MP_REMOVEADDR</td>
            <td align="center" colspan="1" rowspan="1">Remove address(es)/ port(s)</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=9</td>
            <td align="center" colspan="1" rowspan="1">MP_PRIO</td>
            <td align="center" colspan="1" rowspan="1">Change subflow priority</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_PRIO" format="default" sectionFormat="of" derivedContent="Section 3.2.10"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=10</td>
            <td align="center" colspan="1" rowspan="1">MP_CLOSE</td>
            <td align="center" colspan="1" rowspan="1">Close MP-DCCP subflow</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.11"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT=11</td>
            <td align="center" colspan="1" rowspan="1">MP_EXP</td>
            <td align="center" colspan="1" rowspan="1">Experimental suboption for private use</td>
            <td align="center" colspan="1" rowspan="1">
              <xref target="MP_EXP" format="default" sectionFormat="of" derivedContent="Section 3.2.12"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">MP_OPT&gt;11</td>
            <td align="center" colspan="1" rowspan="1">Unassigned</td>
            <td align="center" colspan="1" rowspan="1">Reserved for future Multipath Options</td>
            <td align="center" colspan="1" rowspan="1"> </td>
          </tr>
        </tbody>
      </table>
      <t indent="0" pn="section-8-12">Future Multipath options with MP_OPT&gt;11 are assigned from this registry using the Specification Required policy (Section 4.6 of <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>).</t>
      <t indent="0" pn="section-8-13">In addition IANA is requested to assign a new DCCP Reset Code value 13 suggested in the DCCP Reset Codes Registry, with the short description "Abrupt MP termination".  Use of this reset code is defined in section <xref target="MP_FAST_CLOSE" format="default" sectionFormat="of" derivedContent="Section 3.2.3"/>.</t>
      <t indent="0" pn="section-8-14">In addition IANA is requested to assign for this version of the MP-DCCP protocol a new 'Multipath Key Type' registry containing three different suboptions to the MP_KEY option to identify the MP_KEY Key types in terms of 8-bit values as specified in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/> according to the entries in <xref target="ref-mp_key-sub-opt-list" format="default" sectionFormat="of" derivedContent="Table 9"/> below. Values in range 3-255 (decimal) inclusive remain unassigned in this here specified version 0 of the protocol and are assigned via Specification Required <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/>
in potential future versions of the MP-DCCP protocol.</t>
      <table anchor="ref-mp_key-sub-opt-list" align="center" pn="table-9">
        <name slugifiedName="name-multipath-key-type-registry">Multipath Key Type registry with the MP_KEY Key Types for key data exchange on different paths</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Type</th>
            <th align="center" colspan="1" rowspan="1">Name</th>
            <th align="center" colspan="1" rowspan="1">Meaning</th>
            <th align="left" colspan="1" rowspan="1">Reference</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">0</td>
            <td align="center" colspan="1" rowspan="1">Plain Text</td>
            <td align="center" colspan="1" rowspan="1">Plain text key</td>
            <td align="left" colspan="1" rowspan="1">
              <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">1</td>
            <td align="center" colspan="1" rowspan="1">ECDHE-C25519-SHA256</td>
            <td align="center" colspan="1" rowspan="1">ECDHE with SHA256 and Curve25519</td>
            <td align="left" colspan="1" rowspan="1">
              <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">2</td>
            <td align="center" colspan="1" rowspan="1">ECDHE-C25519-SHA512</td>
            <td align="center" colspan="1" rowspan="1">ECDHE with SHA512 and Curve25519</td>
            <td align="left" colspan="1" rowspan="1">
              <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/></td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">3-255</td>
            <td align="center" colspan="1" rowspan="1">Unassigned</td>
            <td align="center" colspan="1" rowspan="1">Reserved for future use</td>
            <td align="left" colspan="1" rowspan="1">
              <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/></td>
          </tr>
        </tbody>
      </table>
    </section>
  </middle>
  <back>
    <references pn="section-9">
      <name slugifiedName="name-references">References</name>
      <references anchor="sec-normative-references" pn="section-9.1">
        <name slugifiedName="name-normative-references">Normative References</name>
        <reference anchor="DCCP.Parameter" target="https://www.iana.org/assignments/dccp-parameters/dccp-parameters.xhtml" quoteTitle="true" derivedAnchor="DCCP.Parameter">
          <front>
            <title>IANA Datagram Congestion Control Protocol (DCCP) Parameters</title>
            <author>
              <organization showOnFrontPage="true"/>
            </author>
            <date>n.d.</date>
          </front>
        </reference>
        <reference anchor="RFC2119" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc2119" derivedAnchor="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 indent="0">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="RFC4086" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc4086" derivedAnchor="RFC4086">
          <front>
            <title>Randomness Requirements for Security</title>
            <author fullname="D. Eastlake 3rd" initials="D." surname="Eastlake 3rd"/>
            <author fullname="J. Schiller" initials="J." surname="Schiller"/>
            <author fullname="S. Crocker" initials="S." surname="Crocker"/>
            <date month="June" year="2005"/>
            <abstract>
              <t indent="0">Security systems are built on strong cryptographic algorithms that foil pattern analysis attempts. However, the security of these systems is dependent on generating secret quantities for passwords, cryptographic keys, and similar quantities. The use of pseudo-random processes to generate secret quantities can result in pseudo-security. A sophisticated attacker may find it easier to reproduce the environment that produced the secret quantities and to search the resulting small set of possibilities than to locate the quantities in the whole of the potential number space.</t>
              <t indent="0">Choosing random quantities to foil a resourceful and motivated adversary is surprisingly difficult. This document points out many pitfalls in using poor entropy sources or traditional pseudo-random number generation techniques for generating such quantities. It recommends the use of truly random hardware techniques and shows that the existing hardware on many systems can be used for this purpose. It provides suggestions to ameliorate the problem when a hardware solution is not available, and it gives examples of how large such quantities need to be for some applications. 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="106"/>
          <seriesInfo name="RFC" value="4086"/>
          <seriesInfo name="DOI" value="10.17487/RFC4086"/>
        </reference>
        <reference anchor="RFC4340" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc4340" derivedAnchor="RFC4340">
          <front>
            <title>Datagram Congestion Control Protocol (DCCP)</title>
            <author fullname="E. Kohler" initials="E." surname="Kohler"/>
            <author fullname="M. Handley" initials="M." surname="Handley"/>
            <author fullname="S. Floyd" initials="S." surname="Floyd"/>
            <date month="March" year="2006"/>
            <abstract>
              <t indent="0">The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams. DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4340"/>
          <seriesInfo name="DOI" value="10.17487/RFC4340"/>
        </reference>
        <reference anchor="RFC6234" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc6234" derivedAnchor="RFC6234">
          <front>
            <title>US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)</title>
            <author fullname="D. Eastlake 3rd" initials="D." surname="Eastlake 3rd"/>
            <author fullname="T. Hansen" initials="T." surname="Hansen"/>
            <date month="May" year="2011"/>
            <abstract>
              <t indent="0">Federal Information Processing Standard, FIPS</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6234"/>
          <seriesInfo name="DOI" value="10.17487/RFC6234"/>
        </reference>
        <reference anchor="RFC8126" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8126" derivedAnchor="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 indent="0">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 indent="0">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 indent="0">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>
        <reference anchor="RFC8174" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8174" derivedAnchor="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 indent="0">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" pn="section-9.2">
        <name slugifiedName="name-informative-references">Informative References</name>
        <reference anchor="I-D.amend-iccrg-multipath-reordering" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-amend-iccrg-multipath-reordering-03" derivedAnchor="I-D.amend-iccrg-multipath-reordering">
          <front>
            <title>Multipath sequence maintenance</title>
            <author fullname="Markus Amend" initials="M." surname="Amend">
              <organization showOnFrontPage="true">Deutsche Telekom</organization>
            </author>
            <author fullname="Dirk Von Hugo" initials="D." surname="Von Hugo">
              <organization showOnFrontPage="true">Deutsche Telekom</organization>
            </author>
            <date day="25" month="October" year="2021"/>
            <abstract>
              <t indent="0">   This document discusses the issue of packet reordering which occurs
   as a specific problem in multi-path connections without reliable
   transport protocols such as TCP.  The topic is relevant for devices
   connected via multiple accesses technologies towards the network as
   is foreseen, e.g., within Access Traffic Selection, Switching, and
   Splitting (ATSSS) service of 3rd Generation Partnership Project
   (3GPP) enabling fixed mobile converged (FMC) scenario.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-amend-iccrg-multipath-reordering-03"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.amend-tsvwg-dccp-udp-header-conversion" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-amend-tsvwg-dccp-udp-header-conversion-01" derivedAnchor="I-D.amend-tsvwg-dccp-udp-header-conversion">
          <front>
            <title>Lossless and overhead free DCCP - UDP header conversion (U-DCCP)</title>
            <author fullname="Markus Amend" initials="M." surname="Amend">
              <organization showOnFrontPage="true">Deutsche Telekom</organization>
            </author>
            <author fullname="Anna Brunstrom" initials="A." surname="Brunstrom">
              <organization showOnFrontPage="true">Karlstad University</organization>
            </author>
            <author fullname="Andreas Kassler" initials="A." surname="Kassler">
              <organization showOnFrontPage="true">Karlstad University</organization>
            </author>
            <author fullname="Veselin Rakocevic" initials="V." surname="Rakocevic">
              <organization showOnFrontPage="true">City University of London</organization>
            </author>
            <date day="8" month="July" year="2019"/>
            <abstract>
              <t indent="0">   The Datagram Congestion Control Protocol (DCCP) is a transport-layer
   protocol that provides upper layers with the ability to use non-
   reliable congestion-controlled flows.  DCCP is not widely deployed in
   the Internet, and the reason for that can be defined as a typical
   example of a chicken-egg problem.  Even if an application developer
   decided to use DCCP, the middle-boxes like firewalls and NATs would
   prevent DCCP end-to-end since they lack support for DCCP.  Moreover,
   as long as the protocol penetration of DCCP does not increase, the
   middle-boxes will not handle DCCP properly.  To overcome this
   challenge, NAT/NATP traversal and UDP encapsulation for DCCP is
   already defined.  However, the former requires special middle-box
   support and the latter introduces overhead.  The recent proposal of a
   multipath extension for DCCP further underlines the challenge of
   efficient middle-box passing as its main goal is to be applied over
   the Internet, traversing numerous uncontrolled middle-boxes.  This
   document introduces a new solution which disguises DCCP during
   transmission as UDP without requiring middle-box modification or
   introducing any overhead.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-amend-tsvwg-dccp-udp-header-conversion-01"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.amend-tsvwg-multipath-framework-mpdccp" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-amend-tsvwg-multipath-framework-mpdccp-01" derivedAnchor="I-D.amend-tsvwg-multipath-framework-mpdccp">
          <front>
            <title>A multipath framework for UDP traffic over heterogeneous access networks</title>
            <author fullname="Markus Amend" initials="M." surname="Amend">
              <organization showOnFrontPage="true">Deutsche Telekom</organization>
            </author>
            <author fullname="Eckard Bogenfeld" initials="E." surname="Bogenfeld">
              <organization showOnFrontPage="true">Deutsche Telekom</organization>
            </author>
            <author fullname="Anna Brunstrom" initials="A." surname="Brunstrom">
              <organization showOnFrontPage="true">Karlstad University</organization>
            </author>
            <author fullname="Andreas Kassler" initials="A." surname="Kassler">
              <organization showOnFrontPage="true">Karlstad University</organization>
            </author>
            <author fullname="Veselin Rakocevic" initials="V." surname="Rakocevic">
              <organization showOnFrontPage="true">City University of London</organization>
            </author>
            <date day="8" month="July" year="2019"/>
            <abstract>
              <t indent="0">   More and more of today's devices are multi-homing capable, in
   particular 3GPP user equipment like smartphones.  In the current
   standardization of the next upcoming mobile network generation 5G
   Rel.16, this is especially targeted in the study group Access Traffic
   Steering Switching Splitting [TR23.793].  ATSSS describes the
   flexible selection or combination of 3GPP untrusted access like Wi-Fi
   and cellular access, overcoming the single-access limitation of
   today's devices and services.  Another multi-connectivity scenario is
   the Hybrid Access [I-D.lhwxz-hybrid-access-network-architecture][I-D.
   muley-network-based-bonding-hybrid-access], providing multiple access
   for CPEs, which extends the traditional way of single access
   connectivity at home to dual-connectivity over 3GPP and fixed access.
   A missing piece in the ATSSS and Hybrid Access is the access and path
   measurement, which is required for efficient and beneficial traffic
   steering decisions.  This becomes particularly important in
   heterogeneous access networks with a multitude of volatile access
   paths.  While MP-TCP has been proposed to be used within ATSSS, there
   are drawbacks when being used to encapsulate unreliable traffic as it
   blindly retransmits each lost frame leading to excessive delay and
   potential head-of-line blocking.  A decision for MP-TCP though leaves
   the increasing share of UDP in today's traffic mix
   (&lt;https://arxiv.org/abs/1801.05168&gt;) unconsidered.  In this document,
   a multi-access framework is proposed leveraging the MP-DCCP network
   protocol, which enables flexible traffic steering, switching and
   splitting also for unreliable traffic.  A benefit is the support for
   pluggable congestion control which enables our framework to be used
   either independent or complementary to MP-TCP.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-amend-tsvwg-multipath-framework-mpdccp-01"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.ietf-quic-multipath" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-ietf-quic-multipath-07" derivedAnchor="I-D.ietf-quic-multipath">
          <front>
            <title>Multipath Extension for QUIC</title>
            <author fullname="Yanmei Liu" initials="Y." surname="Liu">
              <organization showOnFrontPage="true">Alibaba Inc.</organization>
            </author>
            <author fullname="Yunfei Ma" initials="Y." surname="Ma">
              <organization showOnFrontPage="true">Uber Technologies Inc.</organization>
            </author>
            <author fullname="Quentin De Coninck" initials="Q." surname="De Coninck">
              <organization showOnFrontPage="true">University of Mons (UMONS)</organization>
            </author>
            <author fullname="Olivier Bonaventure" initials="O." surname="Bonaventure">
              <organization showOnFrontPage="true">UCLouvain and Tessares</organization>
            </author>
            <author fullname="Christian Huitema" initials="C." surname="Huitema">
              <organization showOnFrontPage="true">Private Octopus Inc.</organization>
            </author>
            <author fullname="Mirja Kuehlewind" initials="M." surname="Kuehlewind">
              <organization showOnFrontPage="true">Ericsson</organization>
            </author>
            <date day="10" month="April" year="2024"/>
            <abstract>
              <t indent="0">   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/mirjak/draft-lmbdhk-quic-multipath.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-quic-multipath-07"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.lhwxz-hybrid-access-network-architecture" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-lhwxz-hybrid-access-network-architecture-02" derivedAnchor="I-D.lhwxz-hybrid-access-network-architecture">
          <front>
            <title>Hybrid Access Network Architecture</title>
            <author fullname="Nicolai Leymann" initials="N." surname="Leymann">
              <organization showOnFrontPage="true">Deutsche Telekom AG</organization>
            </author>
            <author fullname="Cornelius Heidemann" initials="C." surname="Heidemann">
              <organization showOnFrontPage="true">Deutsche Telekom AG</organization>
            </author>
            <author fullname="Margaret Cullen" initials="M." surname="Cullen">
              <organization showOnFrontPage="true">Painless Security</organization>
            </author>
            <author fullname="Li Xue" initials="L." surname="Xue">
              <organization showOnFrontPage="true">Huawei</organization>
            </author>
            <author fullname="Mingui Zhang" initials="M." surname="Zhang">
              <organization showOnFrontPage="true">Huawei</organization>
            </author>
            <date day="13" month="January" year="2015"/>
            <abstract>
              <t indent="0">   Residential and Enterprise customers require continuously increasing
   bandwidth, however it may be difficult for operators to update or
   rebuild existing fixed access networks, especially when they are
   deployed in certain areas.  This document discusses a general way to
   address this problem by bundling together multiple heterogeneous
   access networks according to certain management policies.


              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-lhwxz-hybrid-access-network-architecture-02"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.muley-network-based-bonding-hybrid-access" quoteTitle="true" target="https://datatracker.ietf.org/doc/html/draft-muley-network-based-bonding-hybrid-access-03" derivedAnchor="I-D.muley-network-based-bonding-hybrid-access">
          <front>
            <title>Network based Bonding solution for Hybrid Access</title>
            <author fullname="Praveen Muley" initials="P." surname="Muley">
              <organization showOnFrontPage="true">Nokia</organization>
            </author>
            <author fullname="Wim Henderickx" initials="W." surname="Henderickx">
              <organization showOnFrontPage="true">Nokia</organization>
            </author>
            <author fullname="Liang Geng" initials="L." surname="Geng">
              <organization showOnFrontPage="true">China Mobile</organization>
            </author>
            <author fullname="Hans Liu" initials="H." surname="Liu">
              <organization showOnFrontPage="true">D-Link Corp</organization>
            </author>
            <author fullname="Loris Cardullo" initials="L." surname="Cardullo">
              <organization showOnFrontPage="true">Vodafone</organization>
            </author>
            <author fullname="Jonathan Newton" initials="J." surname="Newton">
              <organization showOnFrontPage="true">Vodafone</organization>
            </author>
            <author fullname="SungHoon Seo" initials="S." surname="Seo">
              <organization showOnFrontPage="true">Korea Telecom</organization>
            </author>
            <author fullname="Sagiv Draznin" initials="S." surname="Draznin">
              <organization showOnFrontPage="true">Verizon Wireless</organization>
            </author>
            <author fullname="Basavaraj Patil" initials="B." surname="Patil">
              <organization showOnFrontPage="true">AT&amp;T</organization>
            </author>
            <date day="22" month="October" year="2018"/>
            <abstract>
              <t indent="0">   In order to address increasing bandwidth demands, operators are
   considering bundling of multiple heterogeneous access networks
   (Hybrid access) for residential and enterprise customers. This
   document describes a solution for Hybrid access and covers the use
   case scenarios.


              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-muley-network-based-bonding-hybrid-access-03"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="IETF115.Slides" target="https://datatracker.ietf.org/meeting/105/materials/slides-105-tsvwg-sessa-62-dccp-extensions-for-multipath-operation-00" quoteTitle="true" derivedAnchor="IETF115.Slides">
          <front>
            <title>MP-DCCP for enabling transfer of UDP/IP traffic over multiple data paths in multi-connectivity networks</title>
            <author initials="M." surname="Amend" fullname="Markus Amend">
              <organization showOnFrontPage="true"/>
            </author>
            <date>n.d.</date>
          </front>
          <seriesInfo name="IETF105" value=""/>
        </reference>
        <reference anchor="MP-DCCP.Paper" quoteTitle="true" target="https://doi.org/10.1109/LCN44214.2019.8990746" derivedAnchor="MP-DCCP.Paper">
          <front>
            <title>A Framework for Multiaccess Support for Unreliable Internet Traffic using Multipath DCCP</title>
            <author initials="M." surname="Amend" fullname="Markus Amend">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="E." surname="Bogenfeld" fullname="Eckard Bogenfeld">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Cvjetkovic" fullname="Milan Cvjetkovic">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="V." surname="Rakocevic" fullname="Veselin Rakocevic">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Pieska" fullname="Marcus Pieska">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Kassler" fullname="Andreas Kassler">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Brunstrom" fullname="Anna Brunstrom">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2019" month="October"/>
          </front>
          <seriesInfo name="DOI" value="10.1109/LCN44214.2019.8990746"/>
        </reference>
        <reference anchor="multipath-dccp.org" target="https://multipath-dccp.org/" quoteTitle="true" derivedAnchor="multipath-dccp.org">
          <front>
            <title>Multipath extension for DCCP</title>
            <author>
              <organization showOnFrontPage="true"/>
            </author>
            <date>n.d.</date>
          </front>
        </reference>
        <reference anchor="OLIA" quoteTitle="true" derivedAnchor="OLIA">
          <front>
            <title>MPTCP is not pareto-optimal: performance issues and a possible solution</title>
            <author initials="R." surname="Khalili">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="N." surname="Gast">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Popovic">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="U." surname="Upadhyay">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Le Boudec">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2012"/>
          </front>
          <seriesInfo name="Proceedings of the 8th international conference on Emerging networking experiments and technologies, ACM" value=""/>
        </reference>
        <reference anchor="RFC2104" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc2104" derivedAnchor="RFC2104">
          <front>
            <title>HMAC: Keyed-Hashing for Message Authentication</title>
            <author fullname="H. Krawczyk" initials="H." surname="Krawczyk"/>
            <author fullname="M. Bellare" initials="M." surname="Bellare"/>
            <author fullname="R. Canetti" initials="R." surname="Canetti"/>
            <date month="February" year="1997"/>
            <abstract>
              <t indent="0">This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key. The cryptographic strength of HMAC depends on the properties of the underlying hash function. This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2104"/>
          <seriesInfo name="DOI" value="10.17487/RFC2104"/>
        </reference>
        <reference anchor="RFC3711" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc3711" derivedAnchor="RFC3711">
          <front>
            <title>The Secure Real-time Transport Protocol (SRTP)</title>
            <author fullname="M. Baugher" initials="M." surname="Baugher"/>
            <author fullname="D. McGrew" initials="D." surname="McGrew"/>
            <author fullname="M. Naslund" initials="M." surname="Naslund"/>
            <author fullname="E. Carrara" initials="E." surname="Carrara"/>
            <author fullname="K. Norrman" initials="K." surname="Norrman"/>
            <date month="March" year="2004"/>
            <abstract>
              <t indent="0">This document describes the Secure Real-time Transport Protocol (SRTP), a profile of the Real-time Transport Protocol (RTP), which can provide confidentiality, message authentication, and replay protection to the RTP traffic and to the control traffic for RTP, the Real-time Transport Control Protocol (RTCP). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3711"/>
          <seriesInfo name="DOI" value="10.17487/RFC3711"/>
        </reference>
        <reference anchor="RFC4043" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc4043" derivedAnchor="RFC4043">
          <front>
            <title>Internet X.509 Public Key Infrastructure Permanent Identifier</title>
            <author fullname="D. Pinkas" initials="D." surname="Pinkas"/>
            <author fullname="T. Gindin" initials="T." surname="Gindin"/>
            <date month="May" year="2005"/>
            <abstract>
              <t indent="0">This document defines a new form of name, called permanent identifier, that may be included in the subjectAltName extension of a public key certificate issued to an entity.</t>
              <t indent="0">The permanent identifier is an optional feature that may be used by a CA to indicate that two or more certificates relate to the same entity, even if they contain different subject name (DNs) or different names in the subjectAltName extension, or if the name or the affiliation of that entity stored in the subject or another name form in the subjectAltName extension has changed.</t>
              <t indent="0">The subject name, carried in the subject field, is only unique for each subject entity certified by the one CA as defined by the issuer name field. However, the new name form can carry a name that is unique for each subject entity certified by a CA. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4043"/>
          <seriesInfo name="DOI" value="10.17487/RFC4043"/>
        </reference>
        <reference anchor="RFC5238" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc5238" derivedAnchor="RFC5238">
          <front>
            <title>Datagram Transport Layer Security (DTLS) over the Datagram Congestion Control Protocol (DCCP)</title>
            <author fullname="T. Phelan" initials="T." surname="Phelan"/>
            <date month="May" year="2008"/>
            <abstract>
              <t indent="0">This document specifies the use of Datagram Transport Layer Security (DTLS) over the Datagram Congestion Control Protocol (DCCP). DTLS provides communications privacy for applications that use datagram transport protocols and allows client/server applications to communicate in a way that is designed to prevent eavesdropping and detect tampering or message forgery. DCCP is a transport protocol that provides a congestion-controlled unreliable datagram service. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5238"/>
          <seriesInfo name="DOI" value="10.17487/RFC5238"/>
        </reference>
        <reference anchor="RFC5596" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc5596" derivedAnchor="RFC5596">
          <front>
            <title>Datagram Congestion Control Protocol (DCCP) Simultaneous-Open Technique to Facilitate NAT/Middlebox Traversal</title>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <date month="September" year="2009"/>
            <abstract>
              <t indent="0">This document specifies an update to the Datagram Congestion Control Protocol (DCCP), a connection-oriented and datagram-based transport protocol. The update adds support for the DCCP-Listen packet. This assists DCCP applications to communicate through middleboxes (e.g., a Network Address Port Translator or a DCCP server behind a firewall), where peering endpoints need to initiate communication in a near- simultaneous manner to establish necessary middlebox state. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5596"/>
          <seriesInfo name="DOI" value="10.17487/RFC5596"/>
        </reference>
        <reference anchor="RFC5597" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc5597" derivedAnchor="RFC5597">
          <front>
            <title>Network Address Translation (NAT) Behavioral Requirements for the Datagram Congestion Control Protocol</title>
            <author fullname="R. Denis-Courmont" initials="R." surname="Denis-Courmont"/>
            <date month="September" year="2009"/>
            <abstract>
              <t indent="0">This document defines a set of requirements for NATs handling the Datagram Congestion Control Protocol (DCCP). These requirements allow DCCP applications, such as streaming applications, to operate consistently, and they are very similar to the TCP requirements for NATs, which have already been published by the IETF. Ensuring that NATs meet this set of requirements will greatly increase the likelihood that applications using DCCP will function properly. 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="150"/>
          <seriesInfo name="RFC" value="5597"/>
          <seriesInfo name="DOI" value="10.17487/RFC5597"/>
        </reference>
        <reference anchor="RFC6356" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc6356" derivedAnchor="RFC6356">
          <front>
            <title>Coupled Congestion Control for Multipath Transport Protocols</title>
            <author fullname="C. Raiciu" initials="C." surname="Raiciu"/>
            <author fullname="M. Handley" initials="M." surname="Handley"/>
            <author fullname="D. Wischik" initials="D." surname="Wischik"/>
            <date month="October" year="2011"/>
            <abstract>
              <t indent="0">Often endpoints are connected by multiple paths, but communications are usually restricted to a single path per connection. Resource usage within the network would be more efficient were it possible for these multiple paths to be used concurrently. Multipath TCP is a proposal to achieve multipath transport in TCP.</t>
              <t indent="0">New congestion control algorithms are needed for multipath transport protocols such as Multipath TCP, as single path algorithms have a series of issues in the multipath context. One of the prominent problems is that running existing algorithms such as standard TCP independently on each path would give the multipath flow more than its fair share at a bottleneck link traversed by more than one of its subflows. Further, it is desirable that a source with multiple paths available will transfer more traffic using the least congested of the paths, achieving a property called "resource pooling" where a bundle of links effectively behaves like one shared link with bigger capacity. This would increase the overall efficiency of the network and also its robustness to failure.</t>
              <t indent="0">This document presents a congestion control algorithm that couples the congestion control algorithms running on different subflows by linking their increase functions, and dynamically controls the overall aggressiveness of the multipath flow. The result is a practical algorithm that is fair to TCP at bottlenecks while moving traffic away from congested links. This document defines an Experimental Protocol for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6356"/>
          <seriesInfo name="DOI" value="10.17487/RFC6356"/>
        </reference>
        <reference anchor="RFC6773" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc6773" derivedAnchor="RFC6773">
          <front>
            <title>DCCP-UDP: A Datagram Congestion Control Protocol UDP Encapsulation for NAT Traversal</title>
            <author fullname="T. Phelan" initials="T." surname="Phelan"/>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="C. Perkins" initials="C." surname="Perkins"/>
            <date month="November" year="2012"/>
            <abstract>
              <t indent="0">This document specifies an alternative encapsulation of the Datagram Congestion Control Protocol (DCCP), referred to as DCCP-UDP. This encapsulation allows DCCP to be carried through the current generation of Network Address Translation (NAT) middleboxes without modification of those middleboxes. This document also updates the Session Description Protocol (SDP) information for DCCP defined in RFC 5762. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6773"/>
          <seriesInfo name="DOI" value="10.17487/RFC6773"/>
        </reference>
        <reference anchor="RFC6904" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc6904" derivedAnchor="RFC6904">
          <front>
            <title>Encryption of Header Extensions in the Secure Real-time Transport Protocol (SRTP)</title>
            <author fullname="J. Lennox" initials="J." surname="Lennox"/>
            <date month="April" year="2013"/>
            <abstract>
              <t indent="0">The Secure Real-time Transport Protocol (SRTP) provides authentication, but not encryption, of the headers of Real-time Transport Protocol (RTP) packets. However, RTP header extensions may carry sensitive information for which participants in multimedia sessions want confidentiality. This document provides a mechanism, extending the mechanisms of SRTP, to selectively encrypt RTP header extensions in SRTP.</t>
              <t indent="0">This document updates RFC 3711, the Secure Real-time Transport Protocol specification, to require that all future SRTP encryption transforms specify how RTP header extensions are to be encrypted.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6904"/>
          <seriesInfo name="DOI" value="10.17487/RFC6904"/>
        </reference>
        <reference anchor="RFC6951" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc6951" derivedAnchor="RFC6951">
          <front>
            <title>UDP Encapsulation of Stream Control Transmission Protocol (SCTP) Packets for End-Host to End-Host Communication</title>
            <author fullname="M. Tuexen" initials="M." surname="Tuexen"/>
            <author fullname="R. Stewart" initials="R." surname="Stewart"/>
            <date month="May" year="2013"/>
            <abstract>
              <t indent="0">This document describes a simple method of encapsulating Stream Control Transmission Protocol (SCTP) packets into UDP packets and its limitations. This allows the usage of SCTP in networks with legacy NATs that do not support SCTP. It can also be used to implement SCTP on hosts without directly accessing the IP layer, for example, implementing it as part of the application without requiring special privileges.</t>
              <t indent="0">Please note that this document only describes the functionality required within an SCTP stack to add on UDP encapsulation, providing only those mechanisms for two end-hosts to communicate with each other over UDP ports. In particular, it does not provide mechanisms to determine whether UDP encapsulation is being used by the peer, nor the mechanisms for determining which remote UDP port number can be used. These functions are out of scope for this document.</t>
              <t indent="0">This document covers only end-hosts and not tunneling (egress or ingress) endpoints.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6951"/>
          <seriesInfo name="DOI" value="10.17487/RFC6951"/>
        </reference>
        <reference anchor="RFC7323" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc7323" derivedAnchor="RFC7323">
          <front>
            <title>TCP Extensions for High Performance</title>
            <author fullname="D. Borman" initials="D." surname="Borman"/>
            <author fullname="B. Braden" initials="B." surname="Braden"/>
            <author fullname="V. Jacobson" initials="V." surname="Jacobson"/>
            <author fullname="R. Scheffenegger" initials="R." role="editor" surname="Scheffenegger"/>
            <date month="September" year="2014"/>
            <abstract>
              <t indent="0">This document specifies a set of TCP extensions to improve performance over paths with a large bandwidth * delay product and to provide reliable operation over very high-speed paths. It defines the TCP Window Scale (WS) option and the TCP Timestamps (TS) option and their semantics. The Window Scale option is used to support larger receive windows, while the Timestamps option can be used for at least two distinct mechanisms, Protection Against Wrapped Sequences (PAWS) and Round-Trip Time Measurement (RTTM), that are also described herein.</t>
              <t indent="0">This document obsoletes RFC 1323 and describes changes from it.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7323"/>
          <seriesInfo name="DOI" value="10.17487/RFC7323"/>
        </reference>
        <reference anchor="RFC8041" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8041" derivedAnchor="RFC8041">
          <front>
            <title>Use Cases and Operational Experience with Multipath TCP</title>
            <author fullname="O. Bonaventure" initials="O." surname="Bonaventure"/>
            <author fullname="C. Paasch" initials="C." surname="Paasch"/>
            <author fullname="G. Detal" initials="G." surname="Detal"/>
            <date month="January" year="2017"/>
            <abstract>
              <t indent="0">This document discusses both use cases and operational experience with Multipath TCP (MPTCP) in real networks. It lists several prominent use cases where Multipath TCP has been considered and is being used. It also gives insight to some heuristics and decisions that have helped to realize these use cases and suggests possible improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8041"/>
          <seriesInfo name="DOI" value="10.17487/RFC8041"/>
        </reference>
        <reference anchor="RFC8684" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8684" derivedAnchor="RFC8684">
          <front>
            <title>TCP Extensions for Multipath Operation with Multiple Addresses</title>
            <author fullname="A. Ford" initials="A." surname="Ford"/>
            <author fullname="C. Raiciu" initials="C." surname="Raiciu"/>
            <author fullname="M. Handley" initials="M." surname="Handley"/>
            <author fullname="O. Bonaventure" initials="O." surname="Bonaventure"/>
            <author fullname="C. Paasch" initials="C." surname="Paasch"/>
            <date month="March" year="2020"/>
            <abstract>
              <t indent="0">TCP/IP communication is currently restricted to a single path per connection, yet multiple paths often exist between peers. The simultaneous use of these multiple paths for a TCP/IP session would improve resource usage within the network and thus improve user experience through higher throughput and improved resilience to network failure.</t>
              <t indent="0">Multipath TCP provides the ability to simultaneously use multiple paths between peers. This document presents a set of extensions to traditional TCP to support multipath operation. The protocol offers the same type of service to applications as TCP (i.e., a reliable bytestream), and it provides the components necessary to establish and use multiple TCP flows across potentially disjoint paths.</t>
              <t indent="0">This document specifies v1 of Multipath TCP, obsoleting v0 as specified in RFC 6824, through clarifications and modifications primarily driven by deployment experience.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8684"/>
          <seriesInfo name="DOI" value="10.17487/RFC8684"/>
        </reference>
        <reference anchor="RFC9293" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc9293" derivedAnchor="RFC9293">
          <front>
            <title>Transmission Control Protocol (TCP)</title>
            <author fullname="W. Eddy" initials="W." role="editor" surname="Eddy"/>
            <date month="August" year="2022"/>
            <abstract>
              <t indent="0">This document specifies the Transmission Control Protocol (TCP). TCP is an important transport-layer protocol in the Internet protocol stack, and it has continuously evolved over decades of use and growth of the Internet. Over this time, a number of changes have been made to TCP as it was specified in RFC 793, though these have only been documented in a piecemeal fashion. This document collects and brings those changes together with the protocol specification from RFC 793. This document obsoletes RFC 793, as well as RFCs 879, 2873, 6093, 6429, 6528, and 6691 that updated parts of RFC 793. It updates RFCs 1011 and 1122, and it should be considered as a replacement for the portions of those documents dealing with TCP requirements. It also updates RFC 5961 by adding a small clarification in reset handling while in the SYN-RECEIVED state. The TCP header control bits from RFC 793 have also been updated based on RFC 3168.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="7"/>
          <seriesInfo name="RFC" value="9293"/>
          <seriesInfo name="DOI" value="10.17487/RFC9293"/>
        </reference>
        <reference anchor="TS23.501" target="https://www.3gpp.org/ftp//Specs/archive/23_series/23.501/23501-g70.zip" quoteTitle="true" derivedAnchor="TS23.501">
          <front>
            <title>System architecture for the 5G System; Stage 2; Release 16</title>
            <author>
              <organization showOnFrontPage="true">3GPP</organization>
            </author>
            <date year="2020" month="December"/>
          </front>
        </reference>
      </references>
    </references>
    <section anchor="diff_mptcp" numbered="true" removeInRFC="false" toc="include" pn="section-appendix.a">
      <name slugifiedName="name-differences-from-multipath-">Differences from Multipath TCP</name>
      <t indent="0" pn="section-appendix.a-1">This appendix is Informative.</t>
      <t indent="0" pn="section-appendix.a-2">Multipath DCCP is similar to Multipath TCP <xref target="RFC8684" format="default" sectionFormat="of" derivedContent="RFC8684"/>, in that it
extends the related basic DCCP transport protocol <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> with
multipath capabilities in the same way as Multipath TCP extends TCP
<xref target="RFC9293" format="default" sectionFormat="of" derivedContent="RFC9293"/>.
However, because of the differences between the underlying TCP and DCCP
protocols, the transport characteristics of MPTCP and MP-DCCP are
different.</t>
      <t indent="0" pn="section-appendix.a-3"><xref target="table_tcp_dccp_comp" format="default" sectionFormat="of" derivedContent="Table 10"/> compares the protocol characteristics of TCP
and DCCP, which are by nature inherited by their respective multipath
extensions.  A major difference lies in the delivery of payload, which
is for TCP an exact copy of the generated byte-stream. DCCP behaves
in a different way and does not guarantee to deliver any payload nor the
order of delivery.
Since this is mainly affecting the receiving endpoint of a TCP or
DCCP communication, many similarities on the sender side can be identified.
Both transport protocols share the 3-way initiation of a
communication and both employ congestion control to adapt the sending
rate to the path characteristics.</t>
      <table anchor="table_tcp_dccp_comp" align="center" pn="table-10">
        <name slugifiedName="name-tcp-and-dccp-protocol-compa">TCP and DCCP protocol comparison</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Feature</th>
            <th align="center" colspan="1" rowspan="1">TCP</th>
            <th align="center" colspan="1" rowspan="1">DCCP</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">Full-Duplex</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Connection-Oriented</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Header option space</td>
            <td align="center" colspan="1" rowspan="1">40 bytes</td>
            <td align="center" colspan="1" rowspan="1">&lt; 1008 bytes or PMTU</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Data transfer</td>
            <td align="center" colspan="1" rowspan="1">reliable</td>
            <td align="center" colspan="1" rowspan="1">unreliable</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Packet-loss handling</td>
            <td align="center" colspan="1" rowspan="1">re-transmission</td>
            <td align="center" colspan="1" rowspan="1">report only</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Ordered data delivery</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">no</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Sequence numbers</td>
            <td align="center" colspan="1" rowspan="1">one per byte</td>
            <td align="center" colspan="1" rowspan="1">one per PDU</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Flow control</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">no</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Congestion control</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">ECN support</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Selective ACK</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">depends on congestion control</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Fix message boundaries</td>
            <td align="center" colspan="1" rowspan="1">no</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Path MTU discovery</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Fragmentation</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">no</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">SYN flood protection</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">no</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Half-open connections</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">no</td>
          </tr>
        </tbody>
      </table>
      <t indent="0" pn="section-appendix.a-5">Consequently, the multipath features, shown in
<xref target="table_mptcp_mpdccp_comp" format="default" sectionFormat="of" derivedContent="Table 11"/>, are the same, supporting volatile paths
having varying capacity and latency, session handover and path
aggregation capabilities. All of them profit by the existence of
congestion control.</t>
      <table anchor="table_mptcp_mpdccp_comp" align="center" pn="table-11">
        <name slugifiedName="name-mptcp-and-mp-dccp-protocol-">MPTCP and MP-DCCP protocol comparison</name>
        <thead>
          <tr>
            <th align="center" colspan="1" rowspan="1">Feature</th>
            <th align="center" colspan="1" rowspan="1">MPTCP</th>
            <th align="center" colspan="1" rowspan="1">MP-DCCP</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="center" colspan="1" rowspan="1">Volatile paths</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Session handover</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Path aggregation</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Data reordering</td>
            <td align="center" colspan="1" rowspan="1">yes</td>
            <td align="center" colspan="1" rowspan="1">optional</td>
          </tr>
          <tr>
            <td align="center" colspan="1" rowspan="1">Expandability</td>
            <td align="center" colspan="1" rowspan="1">limited by TCP header</td>
            <td align="center" colspan="1" rowspan="1">flexible</td>
          </tr>
        </tbody>
      </table>
      <t indent="0" pn="section-appendix.a-7">Therefore, the sender logic is not much different between MP-DCCP and
MPTCP.</t>
      <t indent="0" pn="section-appendix.a-8">The receiver side for MP-DCCP has to deal with the unreliable delivery provided by 
DCCP. The multipath sequence numbers included in MP-DCCP (see <xref target="MP_SEQ" format="default" sectionFormat="of" derivedContent="Section 3.2.5"/>) facilitates
adding optional mechanisms for data stream packet reordering 
at the receiver.  Information from the MP_RTT multipath option (<xref target="MP_RTT" format="default" sectionFormat="of" derivedContent="Section 3.2.7"/>), 
DCCP path sequencing and the DCCP Timestamp Option provide further means 
for advanced reordering approaches, e.g., as proposed in <xref target="I-D.amend-iccrg-multipath-reordering" format="default" sectionFormat="of" derivedContent="I-D.amend-iccrg-multipath-reordering"/>.
Such mechanisms do, however, not affect interoperability
and are not part of the MP-DCCP protocol.  Many 
applications that use unreliable transport protocols can also inherently process 
out-of-sequence data (e.g., through adaptive audio and video buffers), 
and so additional reordering support might not be necessary. The addition of optional 
reordering mechanisms are likely to be needed when the 
different DCCP subflows are routed across paths with different latencies. 
In theory, applications using DCCP are aware that packet reordering could 
occur, because DCCP does not provide mechanisms to restore the original packet order.</t>
      <t indent="0" pn="section-appendix.a-9">In contrast to TCP, the receiver processing for MPTCP adopted a rigid
"just wait" approach, because TCP guarantees reliable in-order delivery.</t>
    </section>
    <section anchor="authors-addresses" numbered="false" removeInRFC="false" toc="include" pn="section-appendix.b">
      <name slugifiedName="name-authors-addresses">Authors' Addresses</name>
      <author initials="M." surname="Amend" fullname="Markus Amend" role="editor">
        <organization abbrev="DT" showOnFrontPage="true">Deutsche Telekom</organization>
        <address>
          <postal>
            <street>Deutsche-Telekom-Allee 9</street>
            <city>Darmstadt</city>
            <code>64295</code>
            <country>Germany</country>
          </postal>
          <email>Markus.Amend@telekom.de</email>
        </address>
      </author>
      <author initials="A." surname="Brunstrom" fullname="Anna Brunstrom">
        <organization showOnFrontPage="true">Karlstad University</organization>
        <address>
          <postal>
            <street>Universitetsgatan 2</street>
            <city>Karlstad</city>
            <code>651 88</code>
            <country>Sweden</country>
          </postal>
          <email>anna.brunstrom@kau.se</email>
        </address>
      </author>
      <author initials="A." surname="Kassler" fullname="Andreas Kassler">
        <organization showOnFrontPage="true">Karlstad University</organization>
        <address>
          <postal>
            <street>Universitetsgatan 2</street>
            <city>Karlstad</city>
            <code>651 88</code>
            <country>Sweden</country>
          </postal>
          <email>andreas.kassler@kau.se</email>
        </address>
      </author>
      <author initials="V." surname="Rakocevic" fullname="Veselin Rakocevic">
        <organization showOnFrontPage="true">City, University of London</organization>
        <address>
          <postal>
            <street>Northampton Square</street>
            <city>London</city>
            <country>United Kingdom</country>
          </postal>
          <email>veselin.rakocevic.1@city.ac.uk</email>
        </address>
      </author>
      <author initials="S." surname="Johnson" fullname="Stephen Johnson">
        <organization showOnFrontPage="true">BT</organization>
        <address>
          <postal>
            <street>Adastral Park</street>
            <city>Martlesham Heath</city>
            <code>IP5 3RE</code>
            <country>United Kingdom</country>
          </postal>
          <email>stephen.h.johnson@bt.com</email>
        </address>
      </author>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+y96XbbSJYu+j+eAsv5I6UySYuS56rM07QsZ6rLg1pSVp1a
3X28IBKUkCYJFgBKZlk+677Gfb37JHePETsAUJKdruphtbK7LJFAjDt27PHb
/X7f1Xk9y54nL/f3j5KDj3W2qPJiUSXTokzerGZ1vkzri+TdMivTGr5IrnL4
k7+YZcloMimzqsoql56dldnlc/MOtugmxXiRzqH9SZlO636e1dN+XV1enffn
+mB/Mh4v+8PHbpLW8ODuzu7D/s6j/s5DN07r50lVT5zLl+XzpC5XVb27s/Ns
Z9e5tMxS/ChdVMuirN3V+fPkVP9KRvBt8uei/JAvzpOfymK1dB+y9VVRTp4n
h4s6KxdZ3X+JQ3LV6myeVzjper2E/g8PTl+5cTGBN58nq6qfVuM8d1WdLibv
01mxyGggmXPL/Hnyr3Ux7iUVdFlm0wp+W8/xl3+H8a3qi6J87pK+S5J8UcHK
DJLRPFtM4G9ekjdp+WFV+Q+LEjp8ma3qanyRJafZLPtQzOFzXdmXp/BHBR1l
dXiuL8/1R7NZliXP4JFxXq/hgbScw6AnNX5STKC7xw93nz2iv1aLuoRHfsrK
ebpYw0fZPM1nOqABDeifam54MMnggbJAGskmeV2UZkqjQfKiXC1gUDRSntZo
sUijj2lif0zLGY4n+WWRX2ZlBYM00/EfZnV1nsJaJ7t+JvpmmMijYfL0qZ3J
yVU2yRZhIikMYXCmQ/inD+lqUGXxuP+YVtUsK82ogZLTynz+HzFsGsPgA4+h
Pe4/DZLj9EMxzi7zsR/5n7Iqm+WL6Bsa+z6Mo2cGnhTT5HWxmBQLM4W3QLsX
6XxZw9k++esKjpWfgX/WDxjaqrNJ8kc4GxPaWhn4JQ9hUOoQBsN/wjYG6Xiw
+mAmcDJI/rm4WFTULA//pM6WF9nCfE6Df2GpfTRJ4dd0lhwBhfrxAbkC66pg
9MnPGTASv9KHR4+SveODu4y84t4HF4Nfuf9/OqsHY3jCLQo4HTWsHZzh5PjV
/u5w+Ex+fbjz9LH+uvdwR359vLv3UH59Otx97H99Qp8iNxzA8GHOwH7wkyQR
1ns4ejuC81qn5/Btsl8szrOKeC38CvQLsy4L4DPwyxa2sp34ZipuJi3PcZUu
6npZPX/w4OrqapCncAJgIR8AKeXnCzjRdfWAGO3Sv9z8e/Dxop7PgNkupnbu
h/2XgxRZQotxT/FNYKof+vMlttX1NPWxmiz7F1k6ycr+uFgQORYLfXp2cfXx
b/2L9VmZT/rpeAz3SR/YM7WbluML2LhxvSr9WKD/bO2fOEurbNI/A1KFrY1b
iYeTj8elHXyZwW2Qlcjm5Tm6nP66ysfhKb/3O7q1e0+GQ08GD/fk10e7e0/1
10fPHodfnyhx7D3STx8/eaKvPX7m23387JG2+2RvVx94uvNQP336+Kk++2z3
GT1werK7N3i0M4yo6WQNND1P7MrRZV7DpfLoJ/n693Ds0vMs2f19cgx8HtYw
gQsYW/H3Fv3QUdz76eiI/uYL+nu4oXf6w93+8Mn3G+lv73y5JPqb1ssHD06W
2bh6QEO6zB7s7r2vYOGz6gEPH/6B/+2fP9kZ/C1fQpOxaDCgQdgpBhkjU4GF
pkgSR9eI2g0+gOfeHPXlVC4bJ3KUvFLSDoIQE1VyslqSiIGf/7Ioge+lZyAJ
qVSBQsh0mo9BdEDZoyEOtVe4L/8mbSlBfjqFha5XD+A2Ls6zxTSbtV4/GH9I
y0nr+47e9y9/zeoPBd8j8RDyGdxwre+bbTQuqaiJrrtqwziOgEA+pB3LMIZl
iL5svhzd7tHb7Ut+w/tWfGm00BBuzKkYPusP4WA85FPBJI68VLf65bvD58lw
ZzAc7jx78Hr/7cOHu8OHA3xv8PTZs50nD/EEovg5HD4anMzySVZFVCn0SpSX
LYDqkMBIAp5mJV7uv7w8enB4hB8RBRbAaOUsAYHCMNMEKbGCWfLHyIwXwCLy
S5QOhKNW35JIzSLwzHYedR5QHBwMe/whK4kN0xGdw90PU3wALz2A6wiaSmfV
g4oWBlb6kdwwoH1Uaf/xLl81niNUfVgnw+8LVWH6OzsOBvHu9eEoWt57b45O
YXXzKlkUNaxUmdUFvFXn8xQEBXibbsXFOINHqlVWobjmYEkLuGGRA1TFbIXt
3zNUcQ92d/deaynuwY0+zjK8sircOOTNT4FH5MREaJQg7MDuwMZm2CPIRQfz
rDzHHZd9wl+zjzCsnC53HE0C/P5iUcyKc+ipl4z239xrbaZuJe3jMZyUi3SW
z/L2d28HyU8gdbW/wLNZLD0DiL77ZZD8skwnF+t03f7ynwf9vwyS1xlwodUk
GzvX7/dBu0HJblw754i4Qfaarxb5mBYBZlUlk2yaL0B2Q7bxaj9BiQtutywB
xbMu8zGKdXWRpAnyW9gGYrawLE6Ju1j0kjUwZn8S+BAUUyAUWMG8qpMzWNIM
/lpmKAbBxXqRuSrHF9JFVgBFr+CChH1KL0FoJHbfaAyPZMo6NJIjXkggegKb
zefLEs4hDrZYlbCTqwrvXdSiYT6477KduH89+GAFG6cvQa+l4z0mKqgvQJM9
v0gu8vOLrNQ/l6uaNl/emmBfsKP8RuG0/SkMHWSBauB+gcmM4cpvKvk0/C3h
Mtu0xvPiLEfegawant/KBueDXnIB3VWg8vRA8L/IxyCDb9MIsGNQaOCqnCUX
xTxLQCfKrtJ1ldjFnK0T2RreuQnsQL4Y154Bwab3Eu4Jztc4m81Ws7SkHkCp
z+HKxXv4dTGGbkjR3/rz69HbbX3f0V40XpvmH6E3ucLlQbjrijmecxoGUQIe
Ks8ykqXI3TD+1fgCaZFYRM9z4mIKBxS+BfEG51wZ0WAGU1+M18CdgBuhKI0M
gFeRTCiTfEqHu4ZVA5mzzPgU46ssU8AWAlOmjV30SVSFbZihLrcGCnXu9AI4
1aQYr/BFHsI0R64EHdVIrIETIhnQeGGaOsYwS88YgfKB8P2sZXYOibQC9p6g
fQQblonQqVsuZ/asUi84ZiRF5NNI4nAS58tiQfODbUd2Xa5pyUE/hlusuqBX
8Iz5Y8UX3ay4gmbHJbBYFxaMj1xMUgPmJvN8Mpllzn2H8lhZTFZ0/pNP3+X4
52fgMV+gZn36JAre5894K6TOW5vCGoHuXIfJnuUT2Mmx8G9iY8BdAiNCroN8
SXrG+xd7ngEFroIoOZExwn50ssQW74O1tdxvkNxOHH4CYzjM57RPMJF0MgmE
4ZRUoAccx++1HTh3s3UvonbUMVOSR3AnoQ86Saula/DJrXTwYZD2knvV6ox2
9952L4FLNaWbDWgFaEC/6iVBRcN1w2XpyTVXznO+JpkeieMCZ3MbmZkjgYlW
QNZU94QORcyeDF0SDQoJNpg+nhZY5THIxGdZAv+/gIuK+EDzYNDaqqDmZij7
JOkcTRN0+/PEztYJiA+z/G+yEtDwMkVDx4NISqNDCdsOj7vmeA4XuIM5X3nY
xLytKFUsOtLphSFNMmgQJKA5iuXIG5mPewbUc1fA4S+Q/uF+ge1OF8Lfiqu+
8LiOyU4KEqKEtbnzVQqzr0Hi8TzMs8OeZ66j1SQvHvwJTlJBlp8UNvkcNtVM
i0YNE0NB6Vws0vB7oVevNgljnRFHRfYMo52uSA/2BFz7GxoOQFEA1Vnhuqjx
el35a3KWf8gcasGoQLPkLDeJynz+ahzx56oEnsCckX57yQlwfVB/8Vdc4hNY
MT4kW6PTk5OTbX9ISdD59El1+8+ft3ECbNhoXGCV+/TpSywonz/z83e2oHz+
DEu5EBLQFRKCh+WZCCWkQI4p6IZjml4FG0c3tEpCKC6QLoITP4P/uconQJLp
+XmZndNWOFaW4bR5tVuJgkd8N/vT588D96YoUV6pQdqBnQeRrqhFIlnFYo/M
Brmp8G9Z+baxAJcBxhFpZvgZzufTp8iMgEMYzWbCykKX0MU0h5MDSiO8hv6U
RXLCEuHrfLH6CEdFZX1Pu0ylfnCrBcoA3eMboDyQwdEGplGB2KOscQGXDN/8
QpBCpqApIlUdAmeEOeta4JUszAEaS89g0/o4EGgsm5jJiIoEfAnlvZIXrkZm
GB2w3/MmgupGxxBXeroq6WzxBumKf9kOj2YVXHkrusaqMUgvOJ66a/bRzKEn
nDXMcZkiLydJ4az4mMUsS2812tJkFNS7eQZK1AT7MgoJiQho0AMRAdYTr4No
Udpz22wPhSbw4oDjml3yDpDURdIinSc8Q/gWbPZJPs9RuIUXZPNIKP2XXw73
eYR4IYtcG3a0odKgIgKr1LyjWZcRecLckzyXDiMpbIrtnPgJHj36wMEqYGs8
XlAGWIxmgrNP04I7384CyCSveWPhCMDRqlGAgfHS97Qq+P1lWuY4nWk6zvg6
BTIo10u+BJlZ+8uEpQdo8eT0+GD0hv58OTod/XQMfwTpDmQiVElhACCmjeWe
n6cfSHxY4lcoA5nbtXFk6X5DoXeWfaRbmeQ8EAV77ZlnH8cz4H6XGcgdBWuE
syylV8bZslYyHiSv0IYrtEwEiyLpDCY2WeuUs0nUAUkAyA4zfClHSRAuO5Tc
YQtypPiMDzLe32tazeJqYdYPaB7Fw7xCURSPXU+3Y5xNUJf0RwGkEU+HfFuA
jAiCE8hyFcgArOYYYU5nEnRdY1/p4fiqCxwLHaEGg2W+i9yExu5VcmZkSB1w
QL77rqnYirr9NlhPTup0/AF0A2Yt7+U+fF/hx6Aq6Ep66d4Lz9MsrWn6XjL+
9An4d39M6mReAdMtpn1yGaflhI88/A48jH9X4btPXVWoXoCyinaQmrgR7N0s
XdNagSzvlU3S03AcNc0k0Cs9TKti7+YURxwegtV1ZyDZqPUAH4ctykp+vSKt
wWh/Oahcho1oq2cNcU+WlVkVn24aLR3QReG8fsGCm3kXCS6bTWGz3P+Fn2BL
7Pq537/55/7Nr1+b30dmCP571+zg/pf1ft1o13YY/6Hbab+/pfekH/3X+ttJ
B77duPcTVqhUrW39/Q3mjj+HOqfOueu3rYd/a+9EO5+eJ9/9hhPIJuAfvt/3
r5NwIa8Hq4ZhCXxI+PXvgVsgxzklvRTtr2tgK3X463PTXLNCMQofUMUbuXRO
opGKUA7v4XDFhIOM1zPJuF4KIW0RrhhQ8nDcyoldFaQEElTQhUj8Ey955M/o
X3BH6OcESYcZ9ZhkAlAGYVXULIqMj4RPtqWV2ThDHa5nxuCIa+kgkEkkD/v1
CqUKXEmWdPH1CZo+RHdPOXroAZtU0rxEFT7o7Pte9uDh0eTQ1oELg/dasBSQ
eiEXz8JZJjOmu1QNKJmfE/D65KKoajF6eeUmyDvAALOPIP4xKxV5iPXMYvwh
qztYGgw/DDo5JFsoqHRlsrV/uI2TmBVkPEHTECx2kocnzmFFF2zIDptuRoNL
6nDA0MfP8A+6ouCqntAk1IZHEk4QASKphK9NJjIQykCd5heQnMYoajTeDn3D
zeCEZ9BGCPsgjaXiIXtzHdPpHHRb0hhYq1OSZtv81pcRhiPC2OZzgiJCxTQw
bVg42Fjo76i2ANtpSagyR8ewZ03yQQs1p8nbHcplmdWqY8iqTqfQB4yr50Cl
JbMzd98P8keVgXADgiOpT5O8Gq+qSpUE5SekyAEjObYm4ddwga5AVkenFdHq
h2ydYChbldx788vJ6b0e/5u8fUe/Hx+ADHR88BJ/P/l59Pq1/4WfwGbg73e/
vJZH8Lfw8v67N28O3r7k9+HTpPHRm9Ff7tGsqZ13R6eH796OXt/zKqDnccik
WHDwq8ZHCXZ6XOZnzDegkRewOsOHzKIwygbkIWZXwyfAruBYZ0K8xQKODv8J
m0GCSAZLjRrGbIYtgf6X1+msMhIkUHuGIsZ3Jobx3SUairIrYNLF8n0hf30W
D5RSMLGzO1pqmQGlsRU2cX8S5SQ0lEhDRrROLtJL5Etw/IMNCK266HrM/5bx
qKz/kSyueqa8TrBeZiyO0bXCNt5pPiMpHSTlbOLoXHQYvg9fGka1f/hyewAs
5iojFk+de01BZOHkbJXP6j505qwV2BtyvUapHFpPF57cJncR04WP5FDFPXJO
9Rv2XCA0Z+lILAodx2kElEgyL+hVoGUp44ilam8xJS+5Y4VRrDVy/VvBFQ0d
M9CgXNB7QkNskOy6p+SGEiHdWVZ5mafGJdQHgq6KZHmxrtjaDl0WaG2dwFds
7KVFGxcl8Mklm+48afn4rWLBahirgnptK22hjwJaBo7VT4EVzZGgmRHP+LHw
zoTXRdhjUeawy/SynQL7qORShFbH+ZJ0Tns/qiq9xgUIvqCzbJyieSkmNm81
7vCA0fS9mW8aFCKJ5U0wOHayIpeEP2o0PadztxqpeQT2a7XUaRi5J0g9uORk
jwedvedUGS1WNRp++DUyS9GwDEdEYmxqpeaGN3pm7Ecyz4i3gHmOa8kyaE1A
fQunRDvGNzAbEA6Nxi+G+QRGvxYXUIc4A7JRY7jqRaEt5i7htchzx0akho8T
xP1UQ8XF8yDSLLkXlxj5wdabDRKIfkYsJlOCBhkKjSoOZMP+atmjQAdkZWM5
0UtgvyVc93+Tv+fFxFsne7Kr8+IyRa5AA+GbWo8rLHjT6wj3ylU2m+G/ZHL8
KIuH7NZwaGeiKhNWrBer+RmH6cSdIDe4xEMwWZXq+nGzfJqhU4ZWZDPNsOza
OAb0IK8T3cMTOIk+pt/h9Uky2wRPLM/fcKg7UzIJzX5c++lSPdbWuI6G4uy8
QFETGATRRAqfXPE8nNhR+LaO3R/z5Xv0fwGxoXXxHa1paKqHfM0al1pMuJKY
x9S6X2l27KqchfE4NCHSdT7LFue4diZGlJluIebEhvDSuGrQ7t8xkNCpGMqM
552faLT55ug9iFU076XxqTk9tBgXlCuDpzuKT8McLnkKYREXsWXO0K/hZys4
IzNth1i3fOSitsnODzoLEHhpDdsYgXGZejJgXRJpt1I3NyuGfjXOMpBx8qIM
F7WY6OT7fTF2fvpOzJ4gi7FJLfuYohbjFXeyWverMTAiONsgHRqueZ4tMgwS
V4GuedWr3Q+4QIZmSnT7zVMUYmKDr2zZaj6HPv5mvRteYmlZrFAlA93o5h96
6IXbZMuInt30kJOUm2Q0xMf8X7vR2/rxi+ihF7su7u3WvuO/XMO20/hrw8fX
0WtblvuhUr9abm9+7RbrD/782PHaH+7w3k2D/Mq5yfddU7z1tTvPLf6ke6Zd
r2H4IEpSkxzOywqOSXwNicjavnu/dmEiu9zNx1jNbwf8lB8Eu6j0qe8/u4R0
4N8laPvosNicZSD5VMrXH/bRHk2xahfpBzjxKi7JuTUWoMNFcjd205N3O6UU
5Jc+dAR5rprPvOQDZxaFDjiV8DRyg0raG/HnsWxJ40IGZuaQNi9dWC65RrF7
Mn/AVvqr0hhIrKYmFkMvRhBn8irlh2zNPJC0EJVxwoSE2eGQmaVZ2cUPtlM4
0VXTp/At708S16W9C81z4maMdQS9E8mzQeGbOH3SqGVpSQODC5SVT9mLgRLS
ny+yYBOCQyFSHrpSIt3K7yHZpGR11PXUsy20pTtQdcagT9bs51TqowCB0F1a
1ymqLCqG+3DELmmYyP/9P787fCsyhN17edBKWsqLUO5b3Nz0IQlMsGcouSTd
1kyz28TddHPZqjjz3VHwYmUISBTIxsn0FBmGeZ6RLZxOct2WNAPRM5HJsWWS
uZPYYB1utDmiXaWLTXvpqd9cuUV0Fsylq1+84PEhq1GSkP3HRc4XK1aH1KzS
5XbvUMvQA4gEL02BTLcs8gUyMiVrL4DrpjWD11QgXMKI1eivTyiPa5J8rewS
42bPxFarJ9uqgI03fQz4hE3wNJ3GkYNGhdnJ1vUkCsvH70grPHoR7DF+64yI
EHV2PJOj4R/6P77Y5f3Ypd+h6dGsvqDIaYxG9bPTAegG59EAyMpDJsQUPSFI
8GI1x7gnlLpHu70GvWhLHPstHc0kpp9c/MHW12gMiaYECc1zJmKeOehfFE0g
YZV81to9klFZQkcmnsNwtHja0gg1lGUxnq0mepIxa2AsBqBYnwzufgoNmeAr
D0hxJJlfRvB73601Ais7B/rL0kqd5hwckLLvAv7WtSCOFXRRnDMpTsbLHy5T
6a8Ru893zpRalCO9cf5VD0Ygds4ooKip7/JQVme/Il8lh4c/xfaSWBZwRNc+
yETvU7+SsUMGeC0p9+pTRMWNFmSWk/WZ/Rvpx3y+mhvrgT0AfLmgDoMMG0hJ
wruM4+9KQkUij8OJ8Ja9wUNskq3tOw+H6Bwk0cBwxGhLRNvEmGc/3EWWTSqx
9KeXBcWqcdj6uJgbClF7TeXjd7OJofZSD6gmW8ybenIIbgEiqAyP7LNl1zsw
ebGYgIyFRvbsuFgtJv3TMl8mp2hi2To+Pd2OjKYhaqrLVqjRH3ANV2RalohY
Y3H0Jpde5M6Tu5o9vmyYTXkh6QwIe8S9V8OVnDnaRHYDs7WNYn9ANhMHrF/G
E2vHCcvcFaWhjqqGBFDFVg7Pu5MtEw7f8xT0dLC3PegQJHgE41kh/rjAa0h0
fr//+t3JgRdeFp5GsJn+Pr52nP01kZxO/gCObYXXeDXYIP6jWZlW5YwC5NFD
26Yq7v7V6OQ0GsMg+WO2Zpupt6ioOBMEFYyCpomEJfVz4fgA2zJf7Bh7y22u
FpyIRTaF6mJVT/B2CS5Gu3xoH/Gf+8SET995exObXuJoBFUEZpjTBPulm/SY
j7nfPnSfuNVykopliFl6IhJjkLW0PRLDXskfwomGO0gozoRpodwlb/RxBOR9
uU7e8vOqJL7J0gV11q1DHmfj7xfJ8QrO3jVIBLwBf0pnq4y+/Ov3E1Atr59b
Zfd5/GdbGTZfN5/Vv59faxTLcMePtCVzRiPFn5M43GbHfPkW//X6r10X1XZb
64xhJGH+z91zuszKDG1i+Sxn3lTi0vjYa/JWqyR8cuSZSCXCeQl3W1+YyZoc
4GZFtQel80ta5lazBySAKC1cUFjZhwVvu3lxgIOH/eFWKRhktpqTZnLvL/eS
fBpcuPB7Ro12hCkk6Mp2FOtM8TfxWODGzOk6u/f2Hl1VC/s92xklYJ81HXEq
srGfX63SKTk75OLGX/flilha07Fv1hH9Z/NlvUaFCO2j+uhAAnvixAK6ntLG
4RReFyc0djPVR4On26ITwFFxzWOpVmm1W/fFbi090Gj1qsGUrYePu44qP2FP
6ik+DMTLVufkNbe66cheM2vGhKr/Fc7kpgPW/Hken0o8fQ8f61HyBvn4GLbP
31/kD3/OzKTax0zWBC4GPGk/Jm/RXi7qFWaWHhC8zfPkiAERmEFy0CjzMKQh
WiSvl/KRYYwN5qUI5tGMP1X+oSwUQ069ewOdguJbYzUuGG+qDbqvtoPJkxnf
8hnGRZDC1JnzI5IiSzUTm67acsRvti9t4V03Ohq9eH2wTXxg2rwSaIUktIw5
UF2uAgSFj5vlYCeNn5cUu3BbJS8y74DSxRBp1J52jh/t8Z0v/vYKGYuypDBv
tUCwfiCMLs9AfQx+J4wU8Ud/8yowA9QjRwFp/bN1ndn42zJbsr1Hh4O+vMqG
GImTiF04YWmi6QKbFPMW75gqpmTFWYAUO868UQ8dw95VKQkFVoMjHiRB5CBM
9iTQfFrPUYSfFqsyOUPB07OH+bIvFNpnwRh2iNdqLdbDOSwPZUZId9Kb6w4/
Y/kIw5REYYdZ7BjXUTt9hPcqDM0+myV/kk55F8lrv/DnMF/4Qe10dfy3rCwa
LjH7FDRSlMFppp7/gXH7wFU/TJLdJNmDPx4myaMkAfb1BL+zIatR+CrFKAPj
0qHD77+EMV/f8m5kT2/tjnK7V/yXWls3UrE5At+LLKlZm95Sq4fdv0Trw9vQ
JV90iipBk9h43T0e7A2G2xIbInqRtyV5WiYF00VuYo4JoUgnL+GcNniG7ila
Acq6aakMor23crhbTNBviziroR9zKLdh7XRqRnAjbazDBuvcPqbvA8nT4EXj
QGssiynHyjiMHbY9IdG2MfcbmcQMY7/oXkQrB3ONrCOiWde7x6vLp2Dps9Mw
94h2vT04kYxeG61OjLphsVDiqpiDnZcZ4VoYV4qeWZNu4JUxXhKaQU9oUDRL
TltxYU7SzFa1vWkSoECug5V6MhEIiRtN4zxf1CKRyelQTXiDlxrzEp0p3DrK
3JiGx/MlW1KOrGzFaA9ZwqvJjcO1gQGO5L5aNAROXVYWRrtvXuiG7z30UGN4
sFwYtOOU0Dld+R2OrxobLplOa2GI9iq3j2vDRqTsuscf8YVzlmECYBJkekoT
JYavDXE8PGrpi3DCG2RRJew926WAz0ZCcJOEduKAksia9zyJ/PdCWV/yw5um
4Dj080Xv8ysKC4RiNFo77vsDbiStHsx6Z7s7u6VTso5/fnQbEmOk12qJ3SqN
xf32YKlbnd/Ftd7R5+/MASjC7fwDdPC7jVebF3hi97CxmKj4Y4lTgLf8TPB+
G7IwIVsdtGTrEyUX4gaa2+mpVzlwEUrQ0IkM4cjtDvQ001wpfkwHE1Pn0A/B
CxnMNej49sTcjB4fDOmVvLzQM/Nxr4QEwcif/r1gk+NEwIWX/X3QYFgPSkjn
kVOjdlK/LEiZjhwjHTKifMcGZGs5J4U/7WYjZiP9udX8wTkonWrmDqNkiQOk
gypk6uY1M1nSxzp425SdGeUmqUYBn8gTVidGQMdTSXeo2iGP9QIzAYu3iBO9
iD2Z60Ti7qewNmeYh0gWCWOSLeRSIBtqy2H/KkqkloilOIROW/4s2UkWzZcT
er+TSLOQ60h82MCJqBmhUEeMptt2xcjFMDJTI4nmVdsKnkc5nkJOor+rxkFA
N63kwGH41UQ97fnfXLIz3N17+Ojxk+TpM/41efyEf03wY/w14SeePgv5Z3f6
xV3v7Ax3hsPhzrWxkNA6wi9kVwPBIxkMBl/aMJkWfnj4uMUOo0XZaNbgr1WY
J8k+pMPUUaqMmqLKrCnrxj2KbUinZxJ+Fq0oRrQgkW2kw37Er4efW6zAm37U
yNQ0KXWYmG4xCW/6QTsUmqHUoAvULgMGgeIH5B3v3r46PH5DH+mtierh0qu4
dPCrShQp9jbg7GXNmz0Md3VJgKx/0KAO+eifC9gUdfvcIp3aVdo0h13qIXgo
YA7EXLqjmVaLMfo1faLAXXrYox7+ePAXv9MH6n/DrCVF8ZMg4fc/vxntb9jp
qIdnvjnQtbGHk4N/8R8FSjxRB2Dkc9hES1EPu3u+h0fUQxjadQK/w25P2DoU
x5jfvQez04+ph+NTPRPXjFw+z+sEPxTb1a0/N+zDE+ph9PIl/N8xfTSaXCKE
QhWFXmjEyl17eOgHnDzlORy8efenA+wEvTMUSn5bm3fu4Rn1cHR8+E4/EvFY
FbcjtTt85SoN5UyTs056aJ4H7esre+AzffC/Q2r0gYdslGOwLPNLtDOjZnnX
Hk5fvJTmfhwOG4/CPpCUxAqpAB+9OfIei87m27dNZEKPWBglmuE986rZdojI
MS6OlKDwgqRMhkzN9SLtrWX4oysM3bVxED0BZ6H7CHTE3NjnWDRp47JwujMG
RYH4811i2DdJPvLH5278gduEjECq8EOgpl8idLQfdsb495W/YKRuEE6EDOET
/gFxRaw/Nsa/Iknlm/St8gv8Jle/3H0/7LQ1PB7CzcbLsF9MX0hzJwgr2YoM
Se6eGrFVZVlL0JHXPn/eBhUOMYu03at8NmOD/uZkCsepExLXICPOq5A7V5Tx
uNBpIO1jQIGG6E0wBol88iJAi4gfSxRdkpyicDjuEp+kyBzRbMQKR8FLpHLp
KCPAvPgMp2WJmJUwIgRSICsaaTKwbhhP2x5BdPg2rK4LZnhWtMQHpSltUlyE
r3fKg4Ff8ARby3DAH6CoGV69tbq/XHtkFKpbVcXYZCEVZ1Uxy2rO90Qo02TL
BgCNcfohxkMYHyM2SSb6FS0TxShe4a2Kk5zlY1HLFxkCq2jjPpAb4bNkC/Ru
ZkEo3KPBMixvN2jE4yXJPXv4EjXmjGCtW6+KmEV3aKOZdRRxm6Olguyinghb
K8nR2TXjtgoGjd+KfMq2kctYO9RXSXVgY3XRHqYEHGOzik7TiOVyIdoGSEID
oPWwvRn9BamK83/UFNsmBI+0YdYBVs2fOg+rhRaLqIPmmaAjjGeCT2qgLifE
68++Unw2vigUj6tacUQ6LyE54PD5Rd2pJPssLTkGElIksXgYZAdXaYVAjHkW
BcYW4/GqZCBd3J76Ag3uSg32cFRsp4F5oOGXHBgce1twzDxDXC1Cgq9YuLM6
5Bt6HxC69TQyoxDr2VSzhdHll57DVg+SP+cYkltTAG1z+TBqboaAm5rYe5GX
k8bQBYvEPmYvjKlwaFRh1JOv0STcnHxI59hx+rFh6hSQR9Gd45pEDkEwCPvm
Z8yutCvMYVS35pVMDh1i5wuF9GyeGfIkk5Fv4hqtDcWTFdzMnTeinxLTTABB
MVyL8tYoEneZUQCO2pIk96+DYUqjSsR+VwRgRdMtxsUyZ3fLGbBNzq5GSIbF
RNGnZl0SB58Z+grHphECxJOYsmai5nYMInL98PdsfmodHcTx1INf6Ai4b2I+
6J2sBPqMkmLbC9FIYuYRSGSjX7+0dgX5lCToCY/eBS0DM8XW5UZErKjUOF1u
9z2flXTBZ6/1ml4Y/KZQtry6i2NynulgPOUFmkbF60MWw0PxguAd1GsEZwQr
EIE+CttB+zSHj8JFg4tDIfChz/t2WPfDNO7rLDlL33tpb6M74fGdRKMOsumM
QrDJ5irhxdy+HC6Se64uCjrHVePU9ILNHLmuE64Ll6C/pmQFcQx4j+D+RDub
euf3hfJtFrga5xNIDs4FB0vI0DxVYZyJnPuA3kSchudCkAJ4T6IhmSoYZaWP
nidOjgAwGQPgKVJ6rsYmI0ogQ6gZtnBh94qGFKx5zfsYvYdfZMwL0z7JJBK+
Ga+1+efvb9UL729U1Jv2EjSYLNYm7eBLfzbbNZqGk79jV00Lyjfoqm0okGO6
yS6tupkAlPgTTZhp1kmNN65Pymo6TaiHkCc4Dd4cKxJ0uhQo/0v1zfOimLBC
IQd4JIwiTVzs8RHD62i3/2LXu+Qb/bGzjC9s5stBzWgIsMjQhgNNl0RHf84O
Qn/4VMpiJLV8gZ5yeH0LEToYDCxgO26rNzL2Sokc3cGOYpkpr+rms4rp0hr3
1nDbtfPxzESl6S1Zm+1By5xyp9x48+iL5G4p8vqz6eG7pcrrz29LmW+PJf6L
l+NOidSdz1x3N2Bpdgu2bgEi93a4gGHzbm7g7rzzxw0j+FZTEBK+n7R/bm6A
AhIMresy9HQRtv02fIMpNA1ZLe6yKZddT6JnYpjODj9upLLcZkbYDBRrcMOz
Vc0mAGRRop2SbhPYoiQLEXhSNokY5VY3p1StGGPDf87Uj80Cqw/89soF6aJy
zmH8coxtJLqyTtGRHg708RAfNlsbqU0WJXTV0ZiTxoZd0q0vNKBRwyprqzUE
HkjXQQTTOjmbk9wZ6QltABWrynagKvIqyAfHkAqab/yMggfdcFtgaFRaznLq
I12ECfgrRK8tWqDR+IPSBTJ0kkqX1pAqzIAXsdnZ7v+w7H80y0aKtvza79HD
7dsauHVtbx2B+fm3bzKF3WgKwy+aQr//b5uIoX/XW6drFndfA/z5rSPo+rnL
IuLB7bry7tDAhntv9z/g3tO74s53nzBzfc0r4AKk/J1HtyBHHf72ZV66O7rj
7ur3ihxr6EuDf3fUsTa8Js6THL68/pL2NkBrRKv/Re29RSvUzbv5Be0FZx5r
/j8Md9WbN4yJQbdqkw+Pvox2+NR80YYvQWC61Gadbwh+MfX96GYW2NsTNI6F
YGePx8PBiFYU0OZ9vOgfD/7CFqvNGM5aVgHN4t696FPhtVgS2oLVF4LlpDz+
ScAz4SAZDZ3SeBObpkI2ST82WizJH2qqfRyMmGydZJkjrxm29fkzackSH7g9
6F52jt4n+9A9oeJ7yZbepIcvt41TJfZ6ylIqMp7unvfH0aOE7uwEssGHAvJ4
e5gDuhB7FgJEsnuNFi/gxTBIai6Q4r5oC9doFN1b2+VUIPjFj9ltyPGZp0uB
4GavRKpA1AGnUm0MrhKTFmFvc7dhfbxTUj5ROMkt2odg5Pn8edupU2DBhT+x
X0yj5eT+sFy+rZaLreo5rA/JfRpQIt+rpru/HZ1WXUOtCifjJXujFMpRgdce
OYYawcI986XUFpXOXCj1xpMUoxnMsMcZ77ittakBl0xWDF0TYCZd0/Bh7JdE
n5JM723e6qXSlYL3HObUCVmHWXpnUDjdQcTXMF26lERrfuCPkUWKaHOJALNv
wSQxxy0f5zWHbBO4S6106TDLDMFn2NJEhFfVjEaFoB3LJZV/bcIK4RyosqwH
OiFnC5IjJzwa/wyFNQhhjhaNjDtHwQuk+SHJGXpDHkVI9B4CtY7XEL0JTZc5
v2bxzQL8PmNURFBn7JCYU0FSwVHmLgV01A98tIiJlOqFKiPkQ+oKxSOOcVEt
ztSYAL5ma47W6IdUwKk5/c4fpoBrqZs2Vyc4kxRfp6g6J3u7/TPgQCWWMZsL
z1Eg/9jnzFntMZOFK6VlPts/ZB2VO+EWEVJbdN+ztMrZa5XOxljPinOO6Iqw
9NwCUauqDojSOH/Nh8rvH+KaYXzIWca+ijxrpDz6QBJJNEtNgLuJsO8xiK/l
H7p/DADSBfAaotMHXuQz2Bkk+IW/FZsddxm3E/PNKFQPFv2YoD4kPh2Z+Vm5
WqIxgSPnUyMowDH5xSZk9CiahIPuG+0RLV1oUEVABYILQeZoa05o91dpiPsZ
JG7ElWN7iDxAp5FaDRH9loAV0s6lUkyASAaOilhpAyqx2r5bEbtbqwUVCmOc
AzovWMFZ3tweMFbBEhPGgamflVn6oX9GAT19rG4VCvUJT9I3CcMYiyf4CAAP
WOYjJRmDx90j4JV7wqP0smJzB+0LzR5VgAYgoK3WLBKSIYfgojNW8EFXcsBv
1QlCXsCXBsXdFH6HnyDADFmyvibi7sb4ut2WRG5RaDbI5V2ri9I5ISKKb+Qq
XTDCd/NMdQaME3ujN18EiqfTimJPq1stvNK9z1GoGF0gMiYGtQ/HwdeOVKE4
q1UipgHxJxS+PdwbCKSKL69BqS2ZXKgNYKBGRyAsY5RV5mvSnSnkNflTL9Tm
OZspC+hoVN26XvpJFcj7rmBBaeeR4SrN2YyjszypKQCAB+vqAOqMITgdGVE5
/E0ug268JOdGZANV+fjWBex5qsIlqrFyB80p3k0VbkJ4QAtldT4HARouRZTd
FeIKk95+WYoLfxmhRajd14yMzaBeS5xR2E3Oxgini9eLtlRuHREdDZH5pOYm
vcBWOz/jJiHS7U6F/kKBUq/dYFkpnFLifjYj4Jiq7mWzVZFbzlNTxkdvWlQ+
6YqFXzaYVrr4aRdjbXBYeHw3AXaaAG9NgNEmz77kM9eu+PXFfxMfpg7w//G/
HbFjqb+fv9f/4An+HnbycsLfJ99qIJ0rervpR3+uv904kKwppgMNtPI38Qjz
N3+/2/ge//57jGMP+2lchje8m0RXoPzoTSg/ciHutS5EJPhNNyF+12Wgij63
JiqvKW4CyCVTEZ7JKOlJpSqum8EYPIyEY8EfTlk2J81DyoSJn0arfpLZ9ZxC
5pYdfF21XFubIm3d0zI/gegNpVgMgDBLoC2Y8Bsuf9V82DJAdlsMqT+ssX7a
32gkrExF8IVSqbSFdBmVq+2CGCRbmGKI7v6fvd2BG43HIKSaQGMkN40RzGZS
UmvD3rPkKSSFma5ZUM+HT2itnuwlL9Z1FlfJ7dM2MzohWwKogowbDh/J06wc
I8f2WpCegyrZ6e9GZahZSPHnhM1aHvmEV4uAvfSG8/nfHwTDUGp5Ssk8/JSr
Q5EdJY6QgS/7+KUFAsOuBQ0sYkb0hSzPFk1s+y65nNduY5xB5xd3iErAmKed
5IejGZZvOMWSg2aUrZ+n8KF5lKbXNUpMwTzYf/nzQX9/99Gj4bP+yc+j3UeP
O5rc28VULnyUCV8exK3fX5WXGb1OTe62m3w03O1o8vHDVpP4YEeTe334vWMC
nWtvIYY2bY/yyYgWTPIXHhJPROSjCavpntN6vlEm18T7XtKTXBVSjhLxv543
Y0HLLiF0nirZwiGA5IX/nG0zrJOkMGfp+MIfdjW7iKe/zBn2GAe5NcF5bOMr
IYZVeSMCcXNP3hbDVikeRE5JQ6AVEI4u9TZKqL2t0fYPPLj7PDaWDl/Ity/k
2zP6Nt0GXRsW9bICGRGWcIfWjMmAKUWoARbvaHU2y8c3rCFWBmOywNl5pt4g
Oxg8UUnCZLJhiaIF8v4LUAJKikEA/abG2xh5B4rFRjYFNsKDEPRZ0IRmpJoQ
Z8vlXkJUcLUXos4BbTXSZUHBuaCaqLlHPiedh7ICKoRmXvTzRR/e6bM4zMD4
HyqNwk2xIAXiOQnYdc9Co/U0wAHLL0lOJZIZm7fGPv1qjKmwU8YAwW2vqpUg
odqvEtHAEFdq827CIf12uykn/hvuZnPgbxRYyxd5IJsUG4UMVHAUDSl3m5ML
pwPmYgP6UZS5pVHTlcd/Qj+Ax7xXDmPgn7oqLkXmTOcOifSWBfA4LnMPMhLV
BQfy5c5IeSIrL37m+RiBiQr/4X6DOZQG55fCfQmsB2OkYU+K6oFtrhpWR1B0
AwLMRnsopcF9J2lw/z3TVNk4tjO8FjPZzl3y+b9RvmrHTdjZcJc7/JmqGg9b
qgbu2iZVA7/rUjWiz72qQZxtMenXRR+tDw+fkh9CM0P6nAqo0VxOUc83F9E7
NdoBQV033k22Dl+evN1WaBpxRLPfA3gEg3ztPH3MSdVm6PI68RnElgbapmwj
b7sjIxQHOPv6Q80wNH7b4DA6sv1xpPNsZkIBUxsYONr/o8LxDMR6ybawrtaJ
F1+kq4qKyHU9R/DDMPOrEnN4QBanWT/Z292zxcbOV/mEwrMJTxatbgJtDi+V
xbJk85Sr2HrXPdGmpqIKUJWdzxnqzvu63CkWcAQJkTE6fT3PYj7nbCvSrpBc
TrGAbcE4/F3zc9z5ecESEfuLDS5ps3NGcAsFkN/wIN2JPPdaB5mb9NNU8hCB
EnE8bedPo/6Ax44bOK7Azmr2qXbaXMCpDEnw2NmSi0l0mC0tVrmUlFcKnsSP
CaHV5HArFCqLMpXqfg+f0hK7MRaHW4RsJ8350gp41Qpr7uYctEq4BINgXCM/
HfFtCsT4asb91dz66/ljkzfTb8qbh4SEsq9a0dbuDi2roB39lj5b7BWmJ/z1
UYu/0vJuYrD0ZReHjb+w1hzvy4olVY3/CGEIPQ1LMMk7vkVO8lZsFfJ/KLdw
HS17g8qvBbv34gin900Dv2sKQib0mBUpzGkFtuaLMQWhBS8EZ2A4TUhDC93U
n4oY0dzUQSdPA63mGE3ZNtwm5mlSz3sHa3jnC9EONDJBlC8hpYu0Qh5/jsL2
xbwp8UEzj4GwEVtOX3TFql6iU6lcLViIEibqIY2Hj3eYWwYyFc/+PZDO78UQ
+jKdOTTp8TA3CNquXawTbeifKTt2loXm7r1hofmeZuGjOazXzOSMqYmMfkZr
pZV/LsU9TDOM27/A6AFrzCLbm1bJkKAMck9H9IetwY4zsIUUrUWG+JKubMqo
XHg0cQkEL0qN85YXKj9RZQcaq6DUb/xIlOetAM7VcxyAnEhQq5MfbDNbsDk/
qMYNq1Wd/3A8un/8Ytu+9GLzSy/0pRf3j0f00mghdQRbdZ1aWWLNSAm77LJp
z5tRVSyehFgZE0FGttWpR8ZAsEKqHxhAI9AcUYxrQRLkOJCdQbMNQjn0ETES
/+HTFYC0qVFyzW+9ffFu+5tuJbb9LXczLN19GOvW4dE2/XsEc9z+0k2+ta1o
B8M5e56cFDNyH0Z7iXfYf42l+/qF2kasx7uwIoyzGIPe8TFn/EslPQ/MTZD2
zoekihLPYNIkgw2SEXstq5sQe9KF0Ql8IKw6mcl8wIgZIlPaez6vkgDREM7g
wL3TE9aLQyhFw1dnb5hM15oUpYuWhPQnxr+hOpw2ZpfLtc/Wio5OHo7AFPz0
nU7sUHPdPyAdKi6M+tJTz83j1Ms0sdII3tOOU/MrvmGtuVNbuK8j1cz8KGOf
vtiNIGSc95jLW3nVws+xF44vd+aTnLjRDe8ZgSpIT8Bs3y3ivUJRuxeuU9kz
49gPolcIN7PnzMgiEh3Bi+u1iXxh0DLMSHVnFf06NeNUo5H/xJkgOh9DQJbE
RgzdWRZARpozIojanjaschpeR1JODHkSRc3ygIMce+WLE2oIX3uIWpstSAG4
HfBiliNpuTeb0Yjs+fEz4UhWEHZI++FEN2R0Aq1lY4KJONqx0IPE3XmQ/mja
gLk4vlB7DjY0kPW0nCRFIzP0z8JvrTH1NSg0te7AKJ7OvI6GCYQk8jk8+SIG
t++O0Dc51ybWOfge8yrmKqEURbAJIkAk6Zbwy39nm6DPsMFPcNKoIl4jPuY3
tv5dJ6Pz25AQ7pw5c6NSG1JoHreUWpzhJp0Wv+tSaaPPrUZbd6CJUgj/eea2
ykyQrlmOnOezWc6suxJos7MMQ6NVo2pDC5HVJYCloa5kDCscZNp4AEaG2Tiq
bzUYCjDoKNKZxq24O+MsgiyPQ54KDEjP5wTkpABwOWPlkYHzgtgjvDrDWHNe
OWycysNSOfRomD7WG/Gezhnei4QMKniBtRrLvJigQY7sfB+pZ+CBw+GzPZjK
qqykj1fks6dNRc9CXJZNfff4tQyfGEDLIhgc+6x00kZj9QJ3nF7R61s/7Gy7
54n+afJhOPaXIngIRihUvWz7st4AHXBrQ2xN/5TWCNBeAlV4ATpaSD9KC7vU
gvz5BS2czAtMc+BG9rCREZZOQp/Zl7V0gH7i/X1QzeKICW9eEKWKt1JxeIQy
87JR0jXeo2qAmyv4KRz7KYvNuEnBNkAupp6tZBIQ7LBNZfpytSsSCI27UTiJ
nehUegVIVmr2IfGik3OO9b+iOBqyxnYcHkz96EeVXVvDSSjnWeU5ZAkrCifF
JwSAaC7IjZZtkMSxKAz8X3gWGyQdolKgInYYsxcCzeN8sfP+wlnbabss40om
acIZShd8MviSN6FOTTeDw9E3zrlG2mCCGZsAeB3e+zIGA3pv2EBJYsmYeqCU
w9PTXQ+gxNIvfkeKgjO818PiZh+BU459zWeVSrPy+wojyc6R0mCE8GtdFjPj
XWXoAdqTy2wdzF0NRspuxq5rgwH3/Ds+QhYn6XQuDW0JGeIZA1LE7Bkn+X6S
zRCVge6EcGYqlbZTRNhc1REpQn+Uy6RlKiwqZsDVa+wfDEwCl9ZzoPYyH+tR
wjDYvoRbgZz8QbQwi2Gn5R2SX/FyKnu+cAPJenpVtHxAgncnyFoLEuZ9/V/J
tOlpKgJIkCsENMMrRnAhwgI9sOAK6pNr/2hOa5IQhFZ3NOixbExUKIwT72GR
sIwxpt7HoZNac4w2uo330kgJ14dFMGpKQWZeP7QfDsPYJQQAlNqGffzzOjxM
R+Yuw7ATjH+aE+wQpd63Ksdk8CeGN3LmzlTPR4jkRCpCMyEyHBG1VSkicVtV
Gi99tXRYX5SvshDrISNuK8WaT1pRerbuOS5dw25bCljSbCI6zL6WYIqFpUP8
i8+KIJVm7ZjhS4bWjUUChPkGtgPHoLqgQBwnBa+9RYTLjMOQH5jcPp0Uf3mG
DsgswIkNQnCJwleFpF+jsqrJSLQiR0ldJtYTjTkerR6zyvwainQlIYjQqq8U
OrFmO+I/msabwlW1TrYOjy4fonoL/z7m2Fw17qWJ2QeqjFz55fYpxajgEaHo
dfqUa1Htsm9hoFU3cHV2xaZrNzuqnchGMtMprP+qynxIXF5KNZpxphsOF1hW
lvbiiKFB1YwymmGS8fmF6KzZxyVnhAS42fRXBhqFF9EcMaaMFoqR0dpmnJWL
w1umeUkphZG3REMIVBmXovP0xtMdxylrlf7dTgNBV1Yh0kq2vAA5AUtk0uM8
SMcVf7YFcTrcnzzYLcypw1bwFYmCmBUpYiPPgOiACLbZnuVYNuAU3bZHKzXY
nlxJyJslYf9ZqHH6hfdgbzaJ8EWgtoa1pk+TeiMh1SoseHe4kqkvgMbLMINT
P1nb8i0h7dBarSwfChmIyB1QWiQ1ztrrvJlHGZa3N3RmXRVlw3XJISTB6Uav
BjE0KqEUjBkuaKiRi04dcxKxgo/2bEE9TusVwWPS8oAaqANvT7UF7q3bjSgB
vXiRx8+rBD2f3i2GWDop7Eizyi3iCbAvoOeh4f+YrfujCJYWP3khFafjZtl7
0HP0ROudEefsY8yiJIlTjB7DjeM5CGGEGCPos70UpVwh/CRi1zuAedd0OtEK
ALeLfSA943zqBe+TzUBYIu1PjCFTwOdb9MVnyBN1gLbqKLfVetn4mXXktOJa
cHK35TijdHtiw1w0Ip21JmsBCqIEOyTxGjVFZK8uX/wqET2t88VJBwtztpOL
/FeM9EujLA6uLU2VdsO9CXc+L4cyd70c+RzxwNgG768vZPds4DVB1dNZfn5R
q3lSaRsa4rrsaH5euJxxYyc5yD28FakFrW2hwppqxMxg8to1HSa6luThlTCx
piXYXke0HXa6qY+oCfj+ASSdHD2TjsoAztvqzYAFfK4rSPRNKO/xuY1uZn++
JLvtH5fc1vzXivNfkNw2lOQ246/+spyyG8cRFkfbZymrDxNnxv6AxC34YPhY
Q4ViMb/ZbvPn1u9lHOjyTbZEGAty1zarJvcb19xdOlZyaWacdSecPWlpIR5r
eYNRt6U+IB4kG6/07BM+fISOYdD9fYHcovRQNk7Rd9QKoC15kdsEKlMCUwwg
M+D+iUmgDFeTHBdg3CUdrYFUgqxgni4o5oS9vWnF6d+oW7AxxMxB0ShbiEGx
P6Qy7iRJJHMMWdMoIuEvK4ITsigkfHPDK0XJFgQF+GiEcHBhX4UDihCMGmBA
MfiRyjVbNn7SIEWY1d7+vYgUyMTzas6y1QxzT2oGd4B1x/VEVSM2/6nYSgLd
LFr8WZaWC0kqYF9eWEQbtOK1RkSf8aBIwc6zEJh6gwhPlHZOQZQUv0/zlb77
hy8xJFnXxiPZcEqcxaOIC46kyf6hQ5ViO+B1gqymUj7Z33mI2mZk+TdCCteo
OJM6VzFuUkgs2j8kBcbWwYpr6YzZzuasdbA5CSz4XXuhvgmxg5VHJnk1TstJ
AKT3sTuqxHLSYT/OVAGtIETpqtrhJ04Z4D0OvGC/sW9tEvRhlzKQxqJg5a0g
N2zUDTHgYITQdB3kLcisHWZ/bLPgGWIbgk5To71404xQ1SimtZPBhkAAOiS4
NuOLouCBQePQxEWzCTbD5wSmgxROXdOyBhOAVkjzs1DLnHGpK/24t6NTNQGw
LTahDBEM28tLNWcqKEkOTQExjLWJhqLJoLpksqRUEsdZJMEOQiLWNB03obxl
wBKjZYLl6WyGyEzUDHGBswbiXZQ/G6LOPfsgQRZoLZ+D9AqKwHhFKn2ZVx8U
+KsRDqi+Z+PjguOBVO2anA/F4OgYd9qaNczAca7yakGiJ8u3JkogoCYwNAeu
hdau9ePWwGpf6w19VWxqwMws9LcZZuYDHPlMjsc0bjKyzPOKbcB0cuYpKv5s
UJKPHa6yD1zx8GZYAgNO8aqqVIDUsaH4SJKzhYELgqyOCScvA1oUgRN4ZyWm
raGAa9CzcOyUi5iPCX/IsC/bsgjZb9+dOrUvysTVchCUgGiMeMJxtji0WTY5
Jx/Vqnasj2G6lICXFMmkgHMsFq+4DBZdG8WZVGciZYTyJTFGKLvCewHhvKBZ
NqMT5BtModFny2OGBQBLOEB8WstEW6Nto16U/C6JPi6y8YcqxKqqSQTn+YA8
eLZwYOzgiFdTTwPyirEf5cTUDGetwW3FOsR2IxQNJBG2O0ZJ9oKQZ5bQszTi
hnwaOgekFQbU8uNzduXWc6ianwmMjt6EqjcFWSjCnfRtSJVFZ9V8ZdZHNrg0
2MNoE6gmlAyIZSc31fhwEzapaj5XIGDmyIcKdcc5Qj1aecPdoDeGlQnAeShH
itCHdRM4Sch5M3dTkGMfHUPPiXNQnsTpdAAzhj2Suihd2jEv/jQn0O3ackdM
kVotnTewdgXvBtPHahFgZ3rmcCtxO636Z4EGlU9ptUxp/wG1beLqE92dCPLs
5+IKcel6wsTUjONN/3DH5+fnZAhHfqHMy7VHQKbciMJaMklrTGTdr33hQBUD
GlqQ5Tpn6whTSG2VVDYsJNmYUFUOhwpbihB3PYuIEaEGdqXG9RrTEkbrQRjF
1YHckUwhavJm0EovBeAlglljaVmx7Vqw3GB5iL5kuw0fz6UaFgE04UoJ3UbD
wVEYU7GyCkP4ArAYJuSCJ7hRlncrWqtt6yFGDucEnEmhhNCOHW6xVVnykdXm
wz3UaW/uSpQxobP/Y3T+H6MzB953mG0V1u03mG4t+f1HW2/noOVoAuQ3Nd/a
el9/DwvuKBgK6KCqAT7tMOR2lHQlQqJiFSC/JvGAB4mqAgJTTTTI0V1dZtwN
wp1ZgX+4fIe4fazGm0qctQC4afYqXbrQJKMHOmtYAuZN+AscNxJPxgcvmhKg
ToB9JE+A4HtVLVN61EWQ3dXrnXjCrKgivL9mOptPxY1ML+yPNQp+SQIFxvyQ
kI7ao/rd5cZTf+VWtZ1swT2pCA260hfZbFnpdddAvkPNHqUFBhDmia4FqIUe
QLJsYF9jQRcU8ODwWINpYQBIV8wPER2bpkJ5WM73rRolqCLAn5tw3GjJFDnX
BxUpQXikbkLLCEI7CdqRqY2hBDuOm7x7o6/iC1wVv9VT8dux3lpeCuuV2DF/
D/nf6yR2U1x/gzF0GfAlFjtEwIsF/6lz/R+j27HhM7AG/vicbozb7pB+yMo/
CqUNBNINFBQgjCmIOPgQ8ao4w8HWeyOkYhdClzg6RWCMOVXfpr+rrAbdqKSH
Wb5zPGCGlfUStrcLiyCGq8I2VS0iMRt/kxiouO5vwIwwafIwNFDd4FJ0KgBI
zE+FIU2rWSahRXNGIZ1k47wi5ZGvL+qhZtsmNuCW6ZoCPUA6mpJJnOAefPKZ
msr5RRNiyRYbjVNyHL5EcetZyPyQytN+RmMDRUA3IhnDnR2wTCMeO460MVBv
U0URXxD02eYve4gxvqaCci0qgQTTxx4fjeEqMzFcqc4+VlxBkf5NdAtNWJSW
P+evcpz8FOtBc9LyOJvNiHrwypnlmDoAFH9ZzFZzYMaPfqLPZX0w2fucbXar
OdHTtugwOgEKraFsN62ZWhUy0SZaE2/fvDjDUbB0Axoy5m8h1tAZymmliF2c
xIuFt+m+1D2nrZ6na7WDLLnUOKzT+KLIxx6zCJauNIZYrkUWMn04IxgzH658
YKd6qJB+0jC96Sw99/TcAQYuHwf9wwOC34yz+mVAq9/AGf1bET05tvTL+Pzw
eotgVrevaUEbsZ6/YRwdrL7F64XVP2s5a4kaNrHxmFQ0/ybkZmiCTWlCIb3C
c4STpCjC5879DrftefJSMaFESeKIZw6LMcGU+PTweXJSg6xytn6OVlp5LZEy
KlIWQpiM4UZimWABRyZPj29xmDpGwhbE6ubwK1W1CR2HMQXIep/EME20vUJt
+K32NHZUDIDG6A0HEGe1C7PS9758Xp4X25mJ6oAFGLMFBkA2p6EzKMagF2tQ
JhXVYFhv3EltEJXDokzLXFLEw7aOU7jAgAmwB4r5V3vW2s6YQ/qx19IvR7TQ
eTeaj9ROQVYezZGBxtEJxby+4DrhOKxKqgpWGrobzRoVTW1qWvpyi3Vr/Ex2
exiy8eg5Uu+c9sivpWWNfNHZ+zy6CHkH/ASUfaotNEqJYs/+ZXyJoDgfss9q
0xjT3rRJcoPkZ76jFApLO2ne7QPfkje+wQWAd5UKL8EEKUTIZmUaSVNQkL5D
k7fuqt1OIX92LdK+4rZqY3Z7W6nU8017braYgpmd05JsIeRX9HhgS8NtOI48
tj/nfRAOVO6S7WcMUhURZOhFOMJx9U0cOTcTUWDURnwikcHIuTb9M9BxOD9Y
GgOaNsfnBAUoXVWTBx9sn9GguSM522TNIYCGKUnC/mQzGnI24ZjphYxKB4Xk
L+7YnlIXm6mwLQR0LyMSbszJE7If2GSFXmB1aI/ZvoN4VHASd79oX3BH+KqI
94PfxeH95v1osC+398WEY75s1GzFAZKnnenL8hkrcd/Ib6i2DQ6yEaw9yaYp
EAc0CKcsL0oxJ0qtIQquCLeOu6ELX+X6h71tk0xB73prTeTkhQUQ8313Fbso
0mRUY0gPVR9XzrdCQyGaKZk9OJVHOOT1nPSXEo8HHHguf0Ol6ahYlKbUi0qr
lS7EUBP5iBhF8/hg/92bNwdvXx6Q5WS1JIth2hoVZbgvikUfQ25VRHI8JBbp
OyHCMee45CAfSdgtGZOTt5zzBtS90ZgpnCUup2WMR929YNkFVS/DFgUAkqB6
VphMhjxS7FhVEve5M/CDYCgLSvPiRQ1WcTEVrpMo+U5LXjoTsyEBbYI4xOKk
1tBkP+SpvQrJHO4reJh7TiXOvf7wUTOBlL5nVYkLSJ+ve2oMbrgyiO2x4ZVt
f5TdRe++13eNl0PdCaxwFeLM35LX9AMqA0ccxFOLPcoU9ECuOIPzyDJWAE6k
V0XUEdRYvHErw3wCk5XEUbrMiBOjsikrVnhBYMjZOn4yLEDolBA4hV1bdv1g
auELXhcucscchbJgJLt96TEcO8gMwY4pek8N5lvBYr7t18C4sW6KfVZqpBSP
LzSfizHHFNjS2lpfhyLxxcgR37Ck0vDvXFJpuNNSEm8up9RRSWnUyZ/kOMDO
jjOuPSMmPuP3FjimUDJIpVSOvEKsnDilimVNtgCq8xY7MxnELUdmMPU7jzZC
mV115DChMTQKKGrFUQk6tXbJ4+yvpO2YjxDuhQx1rQcFs0Jqy3uNOjwkiVVk
QErLch2vtvNIpx+ybMlyGN8tHiDR1iqN+sbqbLWZVF10P9fjlS44bTjwGR5I
a3f5QazHxHVL5Uai8R4jyC+5LxL3BeWeiKf0mZU2iqR1FnxyEbXcXvEpbD4p
BEQdZ42VFmMWZYrPV1Ub7qhJoehB5TH6oeH94y2S6l1q9mBKT7VoKnzAcFEb
Sj3F7xHZeEwtU/6JAzlCsSdXqDTuS1Wq3NdrFHaKtpbEeWj28O1PQnyOvVfB
h2/qkzFV+0HpkKRgx0aC0uuddtRGx5hGgU3NSIohyqCRKDU0MzaFJkIgqi0J
4wt8SfJW8+VQOlOBHUKH6M2r4gpdQvwvbynQ1bU6N29Zon63UH+5nWh6lWEN
1OrW48rRYmE3QQKWo8pVzjhWOCoy1yrqFfgo3eSUYOmjZ9oQUWoWjqZuEKJk
uo0TYjGuN5MLZyx7rgOkLfcTu1dtrLF4HqtGrek2ABWhUkiJINoZU1CNRRpT
rxMFJSAUqY9TEdiGFIC09xPK1YzAot6mg48YEk4R9jMDBa+hQkfvD/73kVp+
LrXGAwkz8AXZZkk64tVAmaqkUIl2U7WWH6LbVtOzcccyOwQT7T0FZUtLHeRz
MgPIXY1NzvO/NZBVeHOQzRfjYibxVcrn1KUj4asSmO49WNniMi+LhZQrAl1l
nC1SkGirGCUoFOjALTV1DSut7DTPUo6qihYMJfSByDqJ04mJaW44jBKefcBZ
5lEUDBxRQmovENLz/76uax5bO8FuGKrHEUM6ffGSvv8WY4B2QKjtXMy7/LSG
8KU/3d7zDelvw2FLWsZjuklWxu9aDhVaQcZbIOxREvfwOJIJtAMbCw93RlHJ
KoCEg4s6n7jMFVY/4CXsPtrlslykE/mD+rORjo68dPTpO4sKHIERYbrNbLZi
XTk6810FUu4OO9w4RgI+e9cfQah1mzb25rfDcz7CZkSH1//VdWzNjz73Yuji
Pr9iBPR3Axvm5pfDc+2Xo4o295N99rwfk01vf3Q0evH6oAdHbju8TINlqWhr
/7A/grcoZHJrCLcb/7a7ze/4Qf+oL/+ha+1DYy+ksRfmXaxrFg07RpG8T5Uj
0VqUvI5GncTD/q0L5lEtv/jlO3MX83Pjgt36802GHX/4m17eQGRNGut+WSgE
5S8ikd7xKKKOxoLFL8vymfdHvWOgLp/8vPViu01h8bCZ0O57KrvbsH/7gtGu
fcXLuiQWRfsGCotfviO93TTs/T/eOuzoXuzg+AGiii+V1hWi9+NZWhH0GStj
4YbpLLzFBusANO5+p9cIheIGRYYJ1cTs9/fTJUcwiFDIJOwSVRR8FGikLupt
i730vRRLTJOw63zEOnq0qZSfR3FeYsqIFFmQMpVdQfdUZWHATdriqHkouxpM
HdBJlPTR5W7xi/KiuSjCb2lKehaM8O8Su052OWAG8XLIGFur8kJWRYKY4u/p
WtA6fLbQp0SJS3GagAQl6flhKWkZXWJqLyk0Y4gz7aaIEdcsE6+EvFtgBR1b
r27j2vnXkZZFKAqkSooWaKfk54scQxMPsfju6OCtD/I9rNUvf0bBEwpkpcV/
xISGuqXUD0QkwpU3L/BJylI0ApIYuaWa4TP82thA4UKvConpVX3PuG7OsnUh
+8zVTma6RKzzpaXJ4UZUWoojT3xSmB2DdxTywpL/yQeIyZ5cpXldmaONw/EL
TLsqtcnF1AQLVkoJqrXzDkgC6+TAdZ2T8gdTRlf8TjFHaZeLqRJG2uKSfT6J
TTmSKZL3j+E9BiuC22B6/P/+n/+3ohOGHmWfudpRHtlkqoyiHA9QPlBM57Jn
XGQFmjoeNYCOW0D49lBwLZks1IeIbMvHZjadrMcl3czHJHh0c6DmojjGRzV8
2E4rOX7RKDBAjj4eu8fBV07kSy747CjSu+QWu+jKsfL8x9T5wW2Zal4PlRAa
SxTumfWh8gC9jcyWl8ZbXuaMfJ5MtX4+ach/0HWxVXw23Cv4GnxNpXbefHGV
mRt4qV9VU2LIQOlFu/4fs9DR+o38osXrrwSpOwBr8+0W+u41gG67dcKlxal2
DBGOXlxKWWKCMcIXGwBUZQ1Z63rPsUlyJFmubJVFQxvHUob81W2nkejElreY
GraBjS+k2qkHszDxhD4dPjRKWVly5WmxiDZE11ZcZAH3wnnbAhtCpNRR09QA
N4HitqAwddrZ/DKtDGB1KLvoISRib51PxWRejwmxQSTbyifJ7rand5ynSZD2
gQkcHFCRVVzRgqF/cwsJVovfmorYLbZp2hMmG7ZotPv+8IjoZsRYMBhWyLhx
YvHVY2DztNuhdnlluuF183EpOzsJ5wSZiEb1TMTJ3yTvwloBEWqJxBuBNVNv
gYFZNMOOm7VPrPvOY6taR5NWsNJ160yJ1bODhzLUdbvh+ox9iTfV6g21QDh/
VschURH2KmffZgzKDKLbX0E+G3pqMplujbpzGl2h8tQLmwwo8fjLLjCuGI0h
MBfjlmnE94TcaYPHXpEoPsv1EHGZHlYqUvbFW+mIsxi1xXZfpsKqWQQNDGps
NEW3iIeDc3gVOBx5Iy9R88ZvsYC7kciLryKRVgXn/xzmzq+1d35Lg+e3sngG
ls3o4LK5xIt7CfHEHrAttA01Xu6wp9wXEjSkdyfzyl2Hzf90mPGs4SppoYB3
zPwPfuxylvyQbV2vxvA3WGjMRbnJQqNHxpO2Qocf+6zVICgYyIVbRAUfs87o
Cib4Vt3uPgpug7TQzgjvQD25u8zAObodYkO7n7+j5GBueQKCIYe93O8C542y
xFWz2HBA0uhg9IPffKmaooL/ae7Vr7lW9/b+DtdqR2L+f/abFdfha2/WXvfV
2jom/3O5/ne6XMP2CsdqXVV3v1yR+v6LXa57e714FewMNlyu8Y2y6X415ya6
YlFl3xcci+4UgE/faRJ7rJf7O5YibqN0DFW5EOULM0jwqF1dFGE4zsZe5rVi
oXC8bBR/20pI6IzHbSELncjjjwaPG7Zp6G+QDfiyt2YPChl7YCLSFIOS5yIB
R5IbLajtAsTaCIWNaiUyrkpedsUTk7FC2u85TloS5qQrGFmfw1KteMFtmD8t
VEkjJ/NU8+o+HL0dwTrgY4MjvQHgvptKLGiC5nOpy5VEifKNNHMNmDR9PUq2
3jEvPyjLotxu5q1onJbH3lTkLzLhI+hhaOtZsnVaFMmLVbXeNhknEnci9wus
nEIqcwID5rw4yg6X+i4BZzZAuqRxP2SZ9xm33jBvYOTyOVxboYCEp++UYFoU
lEVKdmVow08lwb6ytfXQd6EYYCL8WI8AlpkPFkRP1DFFu9qE4mFylqLsacOb
MnhCyzcdpYhUKn94HiFaqA1uR/9SyjVTiT791azFvDS+NnqqFaFr4Kg1wpEr
hCdfcKvyfSpv3eX6Mg9uhA1o/PxBmnwnGOiNeOj7d21Hf/wC/Ovoe7Ld/nvy
pU38a6MEzL9LAybw9X7ox/z0f5Qn//WF9r2prVt/dF0Cv/zt03Atz1EHOQsD
liwPDoKN0sXuvcLsOlqHe26jzN+Ir+1p/pwNSZbEICm540IkNNF2JMnG8bs+
tphn+o8kaDP8+41RydP/yYngCxtA8eWVFCoGScXXLPaiirIgKgpNGZ10zVk1
VakMMeIot1wzW3tS98l53s64eUBTAURIu5RLU+hTcnnwS+yChudI1TZiTcRY
y6Q0lo6ygGsN3eFjK4BkdOtpTjMn2NoJ4suaiY4mjjdHGsaAuYImsh8fJpd6
EdAafWy1w/qsJJnBISI9qhnuXWEL8Nn6AeathkgJXUlV/AkYaeLLRDlKeGQs
H7z56RqrNeGhDEjQbUTROPRBgeUsnpy+pd5dxFfUcbBLbRUQ6Rr1EWEpKXfM
98y+YLrXTRhMZyBqnQhIaQim8C5pTbPxnmiPti04BXEaFseG6Qx6m7ISKL9c
Cm67Zn50vFAiyyiNJk0K3MoF5U7y0Z0Cy3lJ0/PabRY6zDhua1yy3uFMLQvC
rUKqI//dOYIl4dF3SnOJ0JwCVBkdPRBfM6BBSdfjrTazckF0mS/fy26qra3V
pWkGMWdRwlsxnK+v9hqecE33ko28iYV1ChGQK40jilpRIEhh7TWwA5KNMSEi
HeaLjWNwm8hn06YpqJP/PlB6c3uVPCifUCv/5t5chdFsxlON0VwY/m6KxQec
2IETWHh11RmM5l8LRhm9sRIjKpodzCccKp+VocAxmiEsWDLMztTW2nHQe3y8
dYTx2dAy3cBgSJAmOByK/sCc6DwujmdOuid6xcZQAFh4PayO8mN17Q6odmmA
7STwAHgG+CwdD4Xa2zJmzG2a6EIVL6wzoHWUNdAlLpMgVNZWQnnqvlSEv384
k1/Xg4E1Vfxv4mRupJ1UorMwFtQqDUhMdN9elYiKTOGPDxiCl4yWEtfCW27i
KOlCnjHOPSaNM4gToYdeYiYP748U8rBXE72pILNn68TgWg6Y/KnGoGMwfVBM
65CCSsEblAXZtEpsipcbgHjoW6Lz6YhXymmKA91M5TJM6LhK1/A6vEJPBZg+
vVDZTH1OW0cVKrDlTIpSa5/F4iotJ5U5nAZ3sC5XFZbeqC/WMvdQIRsBFyUt
0jdGolazsKPeArz1k7JYcvBGqDcgqSkEwkoiC6PA86cVvbIk6y3XUA6hiYpt
TGbEl/KY+mrwb84o3Oslbp/f2uabXfNoN7Y85UOzSSBporNSWQJ7CFA6PaFU
zpc5A/h++o6iMfsT/vtzlKiKgaHaFGeAhuTYSlJp05IiampG91Y0Vtd+nPdo
Euw7cZp6j89ThTVnrYwGNC3rYKWPabEq+wjKHYefTlHVYvNfMFvwLcsDkmly
TpsL+T3suyJ7PUI6oQGiOQGpvKItIHvV1+GsD9yrqPyPB3BMy3GVbNGVif64
bT4RFWL2x/mHDCpMQvnp4ZuDP48OT3vk1ABiEq3PUzD7YTSHNK6/4idrU5mB
JhhnhwV6fyolGRb6DJG59kJvr7MUgPXRLgqLzsikeO+xjhIcml6Eo2IEHGHp
WueMoSql4eODf/nlAAvMcJIuCwDtrXWCtiAYyMwZRdMhDsDAxr66F+Iay4H2
cFL4jYyqqkQnSCXxl61Hm/uXhOj6wmRkm345ABQ7dVyghhOmdXcZP4k2IAZb
NkliN+b5kWH/lkxAXyF848+l/5/NP9c3t2LGcKuzwbbSqPWdKDm2v7iplWty
TCOmTsdY2DKatIbf0Qpq4osNQ/df3d7Kpp8Kdlv1sFtauWU3uh8zrdzfuHjx
T8e+mVbgf18fnpwCW7iZgq79cfWPtcZy/25jub9pLNpTOb70i2h/+HNxFd+6
R7wV8nT0g99IutJ/lT06Pjg5evf25W17dDQ6PiUe/w/Zo2bKl3z2AEWijiS+
DXt0a+LYF53GjSt+SysRM/oRv6F1TBpJZrdwqfjnPq4j/3fTiset6AXGLI3v
omv5L4k/vmUsuLjeZ0Bf8n9o9IOdsl/ddUamFdvBzTO6pZXNz9x6jjpaaZ2k
6Bx5NA27q/epDdvFj9ceDkZfvcM5as2ndZI2nKNoDW0rwvCy+C7ZzOuyuqsV
++CNrXQ8f60Uh/4NGWe7FXNC/IqEiRmaM61ctlqB/yffqKX/8MJ1c5o3rm5o
KO72uiF1wE57Sa21042f0Hvr6+6x3Ca1dXXSXt2v+okOzFe1svvm5DXB/KHC
swTJtuoOBGHN0uIpcSjIm5vUrDihU7RPjr3EhClEjMWm9iVhYD8qLuncCWGC
SYgf1y1GNdYDbOn72O9KqslKodbCaSQBYydSKAC6bBhzj7Ex0TBmmtEasxSQ
kGpRA8LkVPwJCRQ4Yk/0Sf63rDFo0MHnywrBJ0QvjisEh1LNNu5AYUyxua03
RyfeQOajJngheRUzUm3EJh2DVng/O0UfMKAPTaJTR9cwluHDQfJnULSo/OOC
MDYJbpN9MWrBTyfFUvOhgjVU500VskyJTJze0ZvTXxDUBr0ic1uUhvc1ecGe
sFXJShm1aFXJUKxNq7H5+jD2MUQHyquxB+xVfEhYSFmkCG5Lvw6OJTJ7VLL+
aoHXIsuZFkaKsDHHZeELebL6jthVzMsa5N4gnRBjciLfO8cxPUXJful8QYCV
mXnUFiclG5AphpFvwHDtCZaWL4GTMSGqnuwdAxLHIjZrTuzxBEABR8sSp0Yl
fRTbqJdcaK1C7kNxieFdLsZDtSnkUFhINKoXpsjWFlb7LFtk01xA9tp5sBUn
Gbexb7kIBiUTtRcsb9aBrjTVrMyw/FirAGwA2bLxr3wf2Ep9HkvsXl0Uydmq
Wt9rRUVZF6z6wni0ObkXCbuayeOoBQaLddI+fdcF9OqC40XIAeNaz1eS0Ay0
MUNKRmhWXAqxTplmFdacO+xRUXLGJ8yl9qYlYF/vjlxls/hLU7C+wxs0VdR7
a5TRADAee5pM1ot0jpVguOB3omU14eRj2p2FLUSErMpnizP0Zt8YjSfeP0MV
W9JKK9/4TDVFTusjOiuXjMMpG/94PDuPtBZCHG2GQox1aAP86C5CBwSD8GZ4
oOywkOP30QXeLwnnbf/PoPZBa8enpxrJ5qfdcVWOtDThAG5J3blG0B50elEw
RBNzTl0sQyRx4ZlkVcOSCziaIRg6pnM0zAbmlte+egawc6wyj4jVjfvOM+VD
5OWLjI5/7q/aGRUFNPBpuj4/r8/KHHVGogh459FPyej05OREsHGPImRjOSYe
2NgUPfLP6OkJYYI4LKkzFpeokYNfAeunqn9oLqWJaNEnyVSFNV9xPKl1gGpQ
oa3ACdPUWIBJliE0NRaXNSuIQmyOVUmzGRYfW8OuFnNvgoxJcgNIRjKnSoVc
/hTWWG4jsbcbQ2ox5qFxWcRxVqJAkmQYW2mLAksJIiYYkA9BOuippDLj2w/L
wxazSY+I1vzJLooHHDs8Ye/g5NdVVfMme4O1ToIK/nisRL6woLszqi3O/KPQ
iswTubwMxnao+Cpz3tJoV5q6hKNUNI4JCESMR43wrXEUhPci+Wp8a9+xFwlg
moj0zgWgqTR2HZNNOFFyEVKv6F0W/Amt7spw4MxxeVLUOeyJjHibaqggO2b0
TivyVT6UVIzNIeDEVMXy1wLXSCNEajyA07g+QLLM0VmvTpMJkuB5mEHfDp9S
c/0O+pqiROMbHocz+yOFzD5PjlczvX+gS71NqVfLuTb1Sz6Y5o3usV+Z54oL
PsZE1Iqzk2K8whcHLuYgeWXkwTw6wMlrOOYfbbJz3PunTx5JnDSlQVGeewzv
/U648k/ftdDK3UtPNuSK62ZeFkoY+w7QvBwJHcQeFONYVaID65dIq9hxPfv4
ascyYKaUgtCZhp7xZXIlZcLwOvECQYDbRTe9q3L8Jl1kXBNZa3Ol5+dldq4h
+DRBFRY5do4QQKRkiy1pLUduuUIsHK1EoZJoc0kYI76h0vXsWoQpOq76rbic
ZdYvSgRGQK2RpzvJOI6ZcElb2PPhsnT+egkeKU1ECzoRCkFcdPsiRZEauoJh
jgcc+dRBKDIKigZI4zIXWJlOFBPakirLKN7GkVKJVztXOyAC6pk17MFFscAn
sB2ErFiMsUZSPWbc2I5RtC9xFCmozAWeBfXtghLJUZEuBFW148Vxr6+KRKoa
cmx9L7B90FPOV7A40FOW+ErtvmoORdNQNB2ofBi8Uw8S7hYb3ZJWtwNFVhdU
5ck7OM+Kup6BojH+0POu/QprsaTlpINwaM3nmayxMxsLc1lMkSdhUFeZn60s
oKyvUOMj2EO1ATduhs/HRW3EKjFfZpztYgQTiwSU2GU+1ZARFkZWSxSsOmYD
rOwDfHPIdbTQQe3lyGTr9eFoO9ZfKMDOIuwq7pVyPlBvHu89egzqDd6TxexS
64JxhOlAKiy5aBVJKj7LGtaKmGbEP88+aYrgIRbhpBjE5hlyT7b8lsdvKhS/
obFwKnO+I/6/WtCZbC9VWKlPn97BWvkyx/GioMYVzumUZSo9VIEKmE0wYgwu
s+uYiy8/XsnjTfZUSfVt72oXwCvnDyoSP0hSaKBiPjkuFKPM3obJ4bQnmbmZ
hJ8cHpy+crpFyH2EFzVm5Es9+suAD6qYUZxCcOmIpH4AZghdFeWHJr2ZQTVK
aeLui+iOhw+HF5XsMsOT25BCZNDItSJpqGWnq+QbUBdOgB9KYSYOffBqZZFV
EtHHXY/L9bIuzst0eYHR09KE8zwLpdCLjAV/vDnRLImhZ8FexTWrNjW0hUav
85J4NpYZwKtpLEVfSZ6b8GXFD7B65C85jEqGUeT9MlvO0rXGjMHL21bbOTyC
7kCyP319wrw9xIs/2t17yvHiXLbPaHY6RCmTqQv/e0crjCaRdNYnFL9Tf88d
qY1p6+T49Gib+9h7MhyiQaQi0RaukgnVJgiRqhQYFc0da3fbdN2DBS2fnLef
CbHNHWDcEtd+whw96JBMYFaZZo71bOchmj+JD/nlZsnGUfodvwD00wqk98pj
WFqPZ8fl6VWsIDtPJXK9ShiS8oU8ApU02Ev4tF9M+6r/pXUNbVQUe+MUk5x7
XBSetLp6Ryi0BRt7uREM91oUxVIUDFRepF5WhTGe52npKxP4rTWR7jG+Hggq
H6oA8IcV78tishoTEw61d+Ng31McLTSpWFMpF9B2ITkC0ad85xEkOgd8wlU/
zclKcObj5ylb/Eg5QUD+i2GlMCMBJS9OB8SbKeTGoWRgwKU4tIsP1pgLc9UI
26hM1es4Frs/q1fLgRkIR8iqRVoTABDdyEAhtFAK3hy5xDYLZ4KjwOgIcE4F
LSuFoPoCh2mtYIIsQOS1HUrr8GtSqkU6TD1OH0FeqbKepDAgA0z6/RSV+u8p
FA2eG1/kGd3xKJGdFylGYoYEF5oZXhUIadZnCMIQauZvM8/ho2TaysRz9yxG
gmAmxMjbSFvOku2GbIZGyS1hgEB2IiHAzjsSEREskc5fO741Rmv1OiaaVTmF
i46g81Iy3HJ4tSHPSlB0gEHo5fgRd4uD4/BSKaGNlBSR+DaYY6U44Ay9TmxH
hQ+R+PxZwPqkyGtTJ5z9KjTbUATNzvMsA8rmEhYYgAdfoT5AQgnOU6G+qAW6
+NHvgI//HHb4DWeduFHEsck2XiVbuIfVtlYrDAGoeH7IZ0QiDRIhnaC1M8kz
enwbUfPdyQ7KXXwcY+P0utbpxUp6bKFVFtt9iOkUwjXlOo4hSSzmlCNnpdMn
jFz0Za4ZD3zTh0+SmZCKr9HipiWLOb93pAnh2W6kJfG+i08Pf1V0SCmbtkUo
gLDUKYO2OqL7fp+H2EpNohh+zvUhQj4zi1ewNhW6HrifVnBHk8VwoVgXlKUd
jyEyaVIWudAOjID8rs47RXaePsZj/JL9nAuk2FlwJ/biZJDAyuIafSK4C2Jr
V7S8QZWt9Kp0IQZ7W3J6QJfmC0zFPL8WM1idGdXS67hyZY8LnNckhxdXksNr
qLIS4x2tSTMZZlSR63KlUDwxWKAvRY9pfwGWEMUKKRDihOwylhiEMbMhmK2J
5BxVy9IFVSLOTewxtPl95TzHUrggStkIJy5O3mgsWYyfm1fOy8zkMluazBuJ
+0aXW4khtFyByv2snsTcGzPovLCXE/RsBIOQ4jtmVHIMRcn0OThGhgmVW5Ia
fbxcXKUtdYGOOytgWXuOpEsgxXxMMERsvAGNbcHr1r5h8GhBN2V6rnl8MLF8
mYshT7pltTVa/mjN5cS7pquyWen4IluxyajSY87x+exPZyWRd5XFBpTQeMm9
4IlbNGDKi5OWMWyBSK4ryIGjEijhhQMYMpVRutC6D8MWwNIWbL0iqxM0Cy2p
/9wXFO05jDuQdEspjMoOExq3etppltStvjhAsQQE7fycy5/ygeRkKjGIwfN4
4SXsADvxAotj6kAL35jEZ8kLa6wcDpe8QGSXiabRU3cEmv8KA7Og5io0ArPm
mwqxMDJrSPfBcBH9C/TQw6paKURsHt7j11S8N9lC3nbxdnSKabMgPl/B2sCv
wK4+wu3ZI0l9VbEspAysWlcwVeCghy9Pqm2eBpFoxSYTybYKSTqy5i4LKhYa
fNRupppbhffTWEp2XiGvWi3QfkSw3wieoUFBzs4BudtFTnuLrA1EtlmxZrME
u3kFIMNf0+wFrgvnN36TlmW68fqeKCx5xX48tAAhXoQAUew83ItCYx5vi1mT
DhufYLysEYq35mzunMCaYQdA1nC6BVhBl3R0DxUvgTDREmtymm4jzoP18EfP
0KrmrSORTb1PAeywmRcMWc/opFwBGFvYAs4YsA6g3fWc/c/bRgjqx3l3BhhE
E0CANWnRUt1pKnlIHRdYKjWr9AIim5TZU7nJUbBk4qRF86q4igEwzSdkR2PF
/MmTPTPpKvnl5RGq+umyQmxlDSjAlT4tU8xbTGc+GEDCooDiq2DMYb6LzWS2
mXBusL2T/dMjtQw8GqJU8mqFN4mLDHuVOuPJ8iTXlFQi426sTU78iaZPNRZ6
K4onUmWV6RWukV3FvCUeeJsVgSslh9F9wT2QHw2j1wJ/T89QtfM5fv6W4VaJ
msRXKYw5iAw1kAk0UQkkOVWjC+bNoNOFktrMIi6poCBVhMcEQjh5DtQgWMZa
DXDkxp7B0Eos6LlmodyYbLOPMFfVRIwld+UT0uvNvjdYm5EHvCOLgtDY08dP
HwKNaY5hbAkmd5CnUSw+D3RfAwtdrjzEfwizG9t95ZKgFdaKraVWrEHcS1Bc
olco/mqJiVULkoaswZPY/su8/JBcAqn/vDoveslbGBuII1lyXMyL5A1ICQv4
9N0c6PstIjhO4T4rLlIMKXhRrMbpJM1BkDrJ53iFvspK2CZ4fAbCKQbcAUdA
3CjKOP6pQHSAV/D8xaoUhPsX2cUYr3xgjx/SdcoLSdhOzdDMqHaf58znqiaI
pOft0KNKBMa3oiqMuIQqlqXG9rdRNBaLFPyWK5kglUgJbW8t1+TBxN9GUZyE
NyOissGwiDQkukOZBoa7pHywc8Ivv9IErhzSuRZJF9xrsZdkWlYcfaDj1PiL
aZ1oCK9EFNXJyozWIi8gPgHXAKSPxbfR1aTAbsnb52WBaqssvh+3D1ijAaA5
hxZbTmsEW+HBGYmYPRLA4pwdZILm4a35XBJ8qfDnnrEpr/X+Z7oXWzBpnz7p
Xig6QrD8wcDLdQAwRQxXGWQfa6TgNeCNjfBl2PeNa7t5yZrgmF0hsM8GDwcg
rUzEhnOPmlHz9T1SIRGEHhb/OvkTEUYUy+1HhTpj/HOdnEQOIgz3vn7eDBJ/
3v7opi+fX1PZweEObNr5OZOljylvY1rwOP4V6ealkM2/4zg+Pf+ua/U1tlsh
k9QvsnHxMaT7R0FFKxJY3+QA3izK58nRjExgZJOEQ9gYgoTMhNgKrRhI9lZo
B2PAxyAIxlAbRkRQK+uwj2UChaz4vjMGyYf9s5wNwqFyJ9/min4gHITsVN6i
Gd2ug+SWYyfqKh+777WRP3EH1feBKH1ASje1cmatBORoMzJOPkYGmaMWGMCa
45z1LERlXYBoJdlBBoO/N4m4RaacIPH8RiJ83qJKT4U70mqCJeANlbbIUN75
ZZHKHUHvY934pJ8M4acjTSOiXFmaiHKbq48Oj783pbLU2NyxKhnis8NHAnor
96BEUNlNC9HF8U4ca7GiZTHLx3BhKtN6aOAn+U7bHtz1cuDL7eHjiG3eE5xF
hFKp7oWRwWv3AlPhh6p7bQQKMhO9OzolEYw6bN6bjTPSbPPOh6TrOhFjcbhQ
6PYBZaluXSlJdKXcNhbuzF40N/SBgjAGhywRb4EiGDFOkUqZPvK2H9gbUMdk
E6iQKt8szUEA5TdvlOvkpanoe6efayAhJdtwgjovnDsc8tt/ul6hC0tK0O7E
gzOwz/KJ1lLy9ccfSCwa+TIFxovqIRe6TIz2yM3ALvAMtcNhq0MycIZP/rnI
F9ZKeQMckL5iTKJhSbXD3VaHEVTetWTMbWq9cw9bsIK2w71Wh4hTYz45UDAz
dLmqf0miJRjQp7tDxldqz/Bhq0ME6LafeFJuwpjfPEOCLe/o8FGrw2jU19Yl
5UHRQckYMCCrzVqKOxQvY6vDx60OMcrZfHIq8BcU/SxKCgr4WguKo1Y9Grrv
EB7vnOGTVoeaZCCfjLwLwHjmxQCzlVXbD1B636q2m0vqHQqNDp+2ZxhwnJlt
sE/YdJE0++jaQ1u9wHb4rNUhRSSHT6QGq55EH8m88Uc6xGa69nC4Ez3bxC1t
nkPt94Yf5TRyBFsdDqNnpYC2+eQgCqfTwtqtou+tDqGZLqL5sdFhkKL0E8xG
KS/FhjsVEaV510VtdEzailvxjecFrlaTRjdIvGzUhHr0pcpkLv8gGelwEbDz
OuWUtgptMr742h7uGanWSirhySB29kxVhwvUsSfmEr83IqBZNGkY1OR7gyT5
pcqMcO/RpfMAwGRwv1oXxBdM1Nu2GvqQB49So0pLclPoPSO6RcUb0NhhUiKU
4qtgx7GQalhUheuKrO23f/T1ZnNGlibz4VPS6pTztnLvQh27ZkH6lrQIyiXc
i30YnRXlCFdqwJoSPVwSd9rroyi3hSH183S2zXomQdYImtIqHEINaqTw5jA+
XeUdX8DCr6+El/gWMDdvA60bokZbV3CAyDH3GsiGzRygyEmwiR1ypnKwLKWN
vIEhGuHSS5UbpMY7CJPxI2zm2KF+jma4uKfZxzrqnj+u8WOUbbpGaGhB7CbM
i/df/nzQ34fdHD6Teob+Yz6v8iFhO62Ai9KjXQ3udjb4aLjbbhA/vK1BJrE2
O7+Bp0e3RqNB4d4dVN5m3x5KM9LEmoeRNETqngpIYmJUgMtdNLIKK1S6YTMJ
qBgtyprrMlZfZ2yG//Qdvv9+vqzHy8+i0CIM7mKSf0QGdqgRTojU1kw2QLN0
cAA1Gg4egB4fTUyGqdmtOakkLELKeFINb85+8/Gs/pjamFAq3tphMDXBSxRK
gshradPloF3D7+ygeLb7bA9Ztw+KOMsYDlMO8cSsnZpfyXKFtssZQVqqK4O8
3N43y/FEm3JQGIn5SF/1Pqkyc34zyU9HAT7vYWfeo8PlPTpTYQ0kCLSKmVlH
FzhPHVtPjOvI787WyYJtixTkmoek37w0eGomUyn4ouGiHIFO8yvGdvjVSWZm
/TWtMgkY0dI5lnVAMuaJI+bfGC/ZpQ8qDJV9sPBPnxEBxDNNUN5ZRY4GQ/O0
0Zi5qIEwIaMFw3F4LIS0oKCgC4mW52A4Cpn1eaDkUVcQBrxf0LVE2JAqCnXg
YJJzDedUlE5UzPl8tfCh5HPsXc4JU6pESEqQBSUMSIa2L/Q1GbgXFHLSOg+a
Z4Mt7BHEoJRbEVEidVH/tDrkUM/m6OzvSuSgsNR0WftRoZeCsNXlEufDFlMY
3WhqpG5dA6f7R82PrD7YcXN0G0m6L7Lb7jaygLxazWb9l5i98jEeyDqrGn23
P2qODe0k6s1/V+bs0P361jiMXiWxapmOBWrvoRa9Cq392x+S4c7OUy2GVTLW
h23tpU/7n1qd/1rS0mbGFAW8q/VhY2xHIV+eIsBmLJNga32LLcAfsRcLD0p3
a+9KDmuhe8vzhu51WxQ3LBu1dhLbNyr/KkUxoRUQPRPxR0cvf9nQ2isp+U6H
wA7kq8a23z5YG1u7nUIO9t96J+FtY7u9NcEtAKaOgMw3t2biuDt4Ba0byAZq
9xGzK7K1jkW6y9goOxhJWpFl1r9lpq/K9DwkDN880zvQ21/eInJ2MbExqV/d
2s/pbMoBRTao8etaQ8yoDvlAhUwrlxghwYdjoZiIcQYc2T2TbOcgWYmLEiQZ
rYbp5RGSFeF/jUzSiyLCe0q4yDguCzTP+cpOiEKEn6aMCO4zMSmNRxNkxecd
wCAoWAQFEc1rJoo0wh8DZ7MYMcf5IriNBBGRgVkgGDpS/266x3QzWFjr+rzf
vNU232M3X12dn9M99qdoBVtj6D4SnZ8zJ2is7W9qjc6u3ZTf1BrdY2XmMy/v
2FqhJZ3i1g4+LjGSTgIqWm9R0hhLvqc+cB0+n2LqSHw92tPWov7gBm0K9BuO
3WmcdSBSIMb4jbVIxBxD5oKQ24AeoNxD6k4ConwgMomS1vyOHjKSg2F1vG5p
RAB/IdvMPedTygxDqJo3r82u0u5CMTByLWwbXCEKXwy1ZGE8Jr3AYxcJCJig
BxhScJJLoVMFPeQwJN9YmBNyHcwbxk8t9YvugO1eIul+Zl4M6TMJlsXTfI5R
m7C/76KSdx4yiSNjCcAunVxi2NPEDlhDA5GFMkQK50dyajRZww77LwcpZnb2
8/G4PO+H+LrQDqqnJ0gNZrUmhUEEI3ARUlE4ipmiQZnmncXo+P/bupIchkEY
eOcVKP/prR+IlB5Qq+YAOeT3xTPGNmkeAArGC3Y840hB8VecyvkhSUqaoLNs
da2TvtylI+Q8qg6Z/JzGm5L2o7H7X7UHt6ycMUbvIrmHvE3WYys7rkEkLUxf
YgHSNY2j1Bkm6bIe7ySCMWwoiY56oibH+S2mgilsEgSMpuPyfpF2HHthRqTx
DXmefoWg9JX9UM156+i0YXu+iJEOcWsipIviZ/l9VAa0Y1XBllfrUMoEsA15
FeMeVR3Oie772naN3Qa+HMP/ZHsWthErVyIYn1JNiLaYwx9jOh94QuUw7B69
b7ulRUiJer5e2mLG4d8qKwKw2xSufAnED1l6CgWuH2fph8iqkwEA

-->

</rfc>
