<?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-20" category="std" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" prepTime="2025-01-17T16:02:46" indexInclude="true" scripts="Common,Latin" tocDepth="3">
  <!-- xml2rfc v2v3 conversion 3.25.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-20" 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="01" year="2025" day="17"/>
    <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 21 July 2025.
        </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) 2025 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 Considerations</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. Other fundamentals of the DCCP protocol
are summarized in section 1 of <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>, such as the reliable
handshake process in section 4.7 and the reliable negotiation of features
in section 4.5. These are an important basis for this document. This also
applies to the DCCP sequencing scheme, which is packet-based (section 4.2),
and the principles for loss and retransmission of features as described in
more detail in section 6.6.3.
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 that either combine a 3GPP and a non-3GPP access or a fixed and cellular access between user user-equipment/residential gateway and operator network. MP-DCCP can be used in these scenarios for load balancing, seamless session handover and bandwidth aggregation when non-DCCP traffic like IP, UDP or TCP is encapsulated into MP-DCCP.
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.
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">MP-DCCP is based exclusively on the lean concept of DCCP. For traffic that is already encrypted or does not need encryption, MP-DCCP is an efficient choice as it does not apply its own encryption mechanisms. Also, the procedures defined by MP-DCCP, which allow subsequent reordering of traffic and efficient traffic scheduling, improve performance, as shown in <xref target="MP-DCCP.Paper" format="default" sectionFormat="of" derivedContent="MP-DCCP.Paper"/>, and take into account the interaction of the protocol with the further elements required for multi-path transport.</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 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 and the source and destination ports. This is illustrated in the following two examples for IPv6 and IPv4, which each show a pair of sender IP-address:port and a pair of receiver IP-address:port, which together form the 4-tuple:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-1.2-3">
          <li pn="section-1.2-3.1">
            <t indent="0" pn="section-1.2-3.1.1">IPv6: [2001:db8:3333:4444:5555:6666:7777:8888]:1234, [2001:db8:3333:4444:CCCC:DDDD:EEEE:FFFF]:4321</t>
          </li>
          <li pn="section-1.2-3.2">
            <t indent="0" pn="section-1.2-3.2.1">IPv4: 203.0.113.1:1234, 203.0.113.2:4321</t>
          </li>
        </ul>
        <t indent="0" pn="section-1.2-4">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-5">(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-6">Connection Identifier (CI): A unique identifier that is assigned to a multipath connection by the host to distinguish several multipath connections locally. The CIs must therefore be locally unique per host and do not have to be the same across the peers.</t>
        <t indent="0" pn="section-1.2-7">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-8">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.
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. 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-2">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 paths, for example using paths via different links.
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-3">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 4-tuples 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-4">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-5">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. 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
continue 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 the procedures that enable a host to initiate new subflows or to signal available IP addresses between peers. However, the definition of a path management method, in which sequence and when subflows are created, is outside the scope of this document. This method is subject to a 
corresponding policy and the specifics of the implementation. If a MP-DCCP peer host wishes to limit the maximum number of paths that can be maintained (e.g. similar to that discussed in section 3.4 of <xref target="RFC8041" format="default" sectionFormat="of" derivedContent="RFC8041"/>), the creation of new subflows from that peer host is omitted when the threshold of maximum paths is exceeded and incoming subflow requests MUST be rejected.</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
extended in this document 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. This can be for example required 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 (<xref section="6" sectionFormat="comma" target="RFC4340" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4340#section-6" derivedContent="RFC4340"/>) 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 (<xref section="6" sectionFormat="comma" target="RFC4340" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4340#section-6" derivedContent="RFC4340"/>) 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.  Therefore, successful
negotiation of MP-DCCP as defined in this document, the client
and the server MUST both support MP-DCCP version 0.</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 MUST either 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">8</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 the confirmation
of options is considered irrelevant because the data contained in the options has already been
replaced by newer information. This can happen, for example, with an MP_PRIO option if the path prioritization
is changed while the previous prioritization has not yet been confirmed. 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; see <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. Similar to the setup of the first subflow, MP_JOIN also exchanges the Multipath Capable feature MP_CAPABLE as described in <xref target="mp_capable" format="default" sectionFormat="of" derivedContent="Section 3.1"/>. This procedure includes the DCCP Confirm principle and thus ensures a reliable exchange of the MP_JOIN in accordance with section 6.6.4 of <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>.</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 the need to know the source address at the receiver,
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 derived key from the both hosts Connection Identifier described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/>, 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"/> to avoid replay attacks.</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 MUST 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 MUST 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 (host A, host B) for a given connection.
The CI is a unique number in the host for each multipath connection and is generated for inclusion in the first exchange of a connection with MP_KEY.  With the CI it is possible 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 (Host A, Host B), and the respective key
parts (KeyA, KeyB) are used by each host to generate the derived
key (d-key) by concatenating the two parts with the local key
in front. That is,
</t>
              <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.4-4.2.2">
                <li pn="section-3.2.4-4.2.2.1">
                  <t indent="0" pn="section-3.2.4-4.2.2.1.1">Host A: d-keyA=(KeyA+KeyB)</t>
                </li>
                <li pn="section-3.2.4-4.2.2.2">
                  <t indent="0" pn="section-3.2.4-4.2.2.2.1">Host B: d-keyB=(KeyB+KeyA)</t>
                </li>
              </ul>
            </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 certification authority (CA) as described in <xref target="RFC5280" format="default" sectionFormat="of" derivedContent="RFC5280"/>.</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 support all key types and this specification does not
recommend or enforce the use of any particular Key Type as this could have security
implications. 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"/>. As with the standard DCCP
sequence number, the data sequence number should not start at zero, but at
a random value to make blind session hijacking more difficult, see also
section 7.2 in <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/>.</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 considering the current
globally routable maximum packet size of 1500 bytes, which corresponds to
roughly 375 PiB of data within the sequence number space.</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-keyA for Host A or d-KeyB for Host B)
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 must be calculated in both hosts in order to protect on the one hand and validate on the other, and 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:  </t>
              <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.6-4.1.2">
                <li pn="section-3.2.6-4.1.2.1">
                  <t indent="0" pn="section-3.2.6-4.1.2.1.1">MP_HMAC(A) = HMAC-SHA256(Key=d-keyA, Msg=RA+RB)</t>
                </li>
                <li pn="section-3.2.6-4.1.2.2">
                  <t indent="0" pn="section-3.2.6-4.1.2.2.1">MP_HMAC(B) = HMAC-SHA256(Key=d-keyB, Msg=RB+RA)</t>
                </li>
              </ul>
            </li>
          </ul>
          <t indent="0" pn="section-3.2.6-5">An usage example is shown in <xref target="ref-mp-dccp-handshaking" format="default" sectionFormat="of" derivedContent="Figure 21"/>.</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.6-6">
            <li pn="section-3.2.6-6.1">
              <t indent="0" pn="section-3.2.6-6.1.1">for MP_ADDADDR: The Address ID and Nonce with associated IP address and if defined port,
   otherwise two bytes 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:  </t>
              <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.6-6.1.2">
                <li pn="section-3.2.6-6.1.2.1">
                  <t indent="0" pn="section-3.2.6-6.1.2.1.1">MP_HMAC(A) = HMAC-SHA256(Key=d-keyA, Msg=Address ID+Nonce+NBO(IP)+NBO(Port))</t>
                </li>
                <li pn="section-3.2.6-6.1.2.2">
                  <t indent="0" pn="section-3.2.6-6.1.2.2.1">MP_HMAC(B) = HMAC-SHA256(Key=d-keyB, Msg=Address ID+Nonce+NBO(IP)+NBO(Port))</t>
                </li>
              </ul>
            </li>
            <li pn="section-3.2.6-6.2">
              <t indent="0" pn="section-3.2.6-6.2.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:  </t>
              <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.6-6.2.2">
                <li pn="section-3.2.6-6.2.2.1">
                  <t indent="0" pn="section-3.2.6-6.2.2.1.1">MP_HMAC(A) = HMAC-SHA256(Key=d-keyA, Msg=Address ID+Nonce)</t>
                </li>
                <li pn="section-3.2.6-6.2.2.2">
                  <t indent="0" pn="section-3.2.6-6.2.2.2.1">MP_HMAC(B) = HMAC-SHA256(Key=d-keyB, Msg=Address ID+Nonce)</t>
                </li>
              </ul>
            </li>
          </ul>
          <t indent="0" pn="section-3.2.6-7">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-8">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"/>).</t>
          <t indent="0" pn="section-3.2.6-9">In the event that an MP_HMAC cannot be associated with a suboption this MP_HMAC MUST be ignored, unless
it is a single MP_HMAC that was sent in a DCCP-Ack corresponding to a DCCP response packet with MP_JOIN (penultimate arrow in <xref target="ref-mp-dccp-handshaking" format="default" sectionFormat="of" derivedContent="Figure 21"/>).</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-link and up-link 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 12 and 26 bytes.</t>
          <t indent="0" pn="section-3.2.8-3">The Nonce is a 32-bit random value that is generated locally for
each MP_ADDADDR option and is used in the HMAC calculation process
to prevent replay attacks.</t>
          <t indent="0" pn="section-3.2.8-4">The final 2 bytes, 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-5">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 d-KeyA, and in the case of Host B,
d-KeyB.  These are the keys that were exchanged and
selected in the original MP_KEY handshake. The message for the HMAC is
the Address ID, Nonce, 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 bytes 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 MUST silently ignore the option.</t>
          <t indent="0" pn="section-3.2.8-6">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-7.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   |
  +---------------+---------------+-------+-------+---------------+
  |                             Nonce                             |
  +-------------------------------+-------------------------------+
  |          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-8">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-9">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. Reasons for this are for example:</t>
          <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-3.2.8-10">
            <li pn="section-3.2.8-10.1">
              <t indent="0" pn="section-3.2.8-10.1.1">to avoid the required mapping state, or</t>
            </li>
            <li pn="section-3.2.8-10.2">
              <t indent="0" pn="section-3.2.8-10.2.1">because advertised addresses are of no use to it.</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.2.8-11">Possible scenarios in which this applies are the lack of resources to store
a mapping or when IPv6 addresses are advertised even though the host only
supports IPv4. Therefore, a host MUST treat address announcements as soft state.
However, a sender MAY choose to update the announcements periodically to
overcome temporary limitations.</t>
          <t indent="0" pn="section-3.2.8-12">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. The advertisement
of broadcast or multicast IP addresses MUST be ignored by the recipient of
this option, as it is not permitted according to the unicast principle of the
basic DCCP.</t>
          <t indent="0" pn="section-3.2.8-13">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-14">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-15">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-16">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. If a sender, however, 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>
          <t indent="0" pn="section-3.2.8-17">A host MAY send an MP_ADDADDR message with an already assigned Address
ID using the IP Address previously assigned to this Address ID. The new
MP_ADDADDR could have the same port number or a different port number. The
receiver MUST silently ignore the MP_ADDADDR if the IP Address is not the
same as that previously assigned to this Address ID. 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>
        </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">MP_REMOVEADDR is only used to close already established subflows that
have an invalid address. Functional flows with a valid address MUST be
closed with a DCCP Close exchange (as with regular DCCP) instead of
using MP_REMOVEADDR. For more information see <xref target="closing" format="default" sectionFormat="of" derivedContent="Section 3.5"/>.</t>
          <t indent="0" pn="section-3.2.9-3">The Nonce is a 32-bit random value that is generated locally for
each MP_REMOVEADDR option and is used in the HMAC calculation process
to prevent replay attacks.</t>
          <t indent="0" pn="section-3.2.9-4">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 d-KeyA, and in the case of Host B,
d-KeyB.  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-5">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 MUST silently ignore the option.</t>
          <t indent="0" pn="section-3.2.9-6">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-7">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-8">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 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-9">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-10.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  |
+---------------+---------------+---------------+---------------+
|                             Nonce                             |
+-------------------------------+-------------------------------+
     Type=46        Length=8         MP_OPT=8

-> followed by MP_HMAC option
]]></artwork>
          </figure>
        </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 signaled with the MP_PRIO option provides hints 
for the packet scheduler when making decisions about 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 value
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>
          <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-3.2.10-7"><li pn="section-3.2.10-7.1" derivedCounter="1.">
              <t indent="0" pn="section-3.2.10-7.1.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.</t>
            </li>
            <li pn="section-3.2.10-7.2" derivedCounter="2.">
              <t indent="0" pn="section-3.2.10-7.2.1">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.</t>
            </li>
            <li pn="section-3.2.10-7.3" derivedCounter="3.">
              <t indent="0" pn="section-3.2.10-7.3.1">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>
            </li>
          </ol>
          <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.
To ensure reliable transmission, the MP_PRIO suboption MUST be acknowledged via an MP_CONFIRM 
(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 depend 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 the MP_PRIO suboption 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 + KeyA(1), KeyA(2),...) ---------->|
     |<------------------- MP_KEY(CI-B + KeyB) ------------|
     |       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 KeyA 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 KeyB.
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-keyB, 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-keyA, 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">a Nonce value to prevent replay attacks</t>
            </li>
            <li pn="section-3.4.1-2.3">
              <t indent="0" pn="section-3.4.1-2.3.1">the IP address of the new path (A2_IP)</t>
            </li>
            <li pn="section-3.4.1-2.4">
              <t indent="0" pn="section-3.4.1-2.4.1">A pair of bytes 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">According to <xref target="MP_ADDADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.8"/>, the following options are required 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, Nonce, 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>
            <li pn="section-3.4.2-2.2">
              <t indent="0" pn="section-3.4.2-2.2.1">a Nonce value to prevent replay attacks</t>
            </li>
          </ul>
          <t indent="0" pn="section-3.4.2-3">According to <xref target="MP_REMOVEADDR" format="default" sectionFormat="of" derivedContent="Section 3.2.9"/>, the following options are required 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, Nonce) +         |
     |------- 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 the connection MUST be closed.</t>
        <t indent="0" pn="section-3.6-3">If the endpoints fail to agree on the protocol version to use during the Multipath
Capable feature negotiation, the connection MUST either be closed or fallback
to regular DCCP. 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 KeyA/KeyB 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-considerations" numbered="true" removeInRFC="false" toc="include" pn="section-3.10">
        <name slugifiedName="name-maximum-number-of-subflows-">Maximum number of Subflows Considerations</name>
        <t indent="0" pn="section-3.10-1">MP-DCCP does not support any explicit procedure to negotiate
the maximum number of subflows between endpoints. 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" according to <xref target="RFC4340" format="default" sectionFormat="of" derivedContent="RFC4340"/> if the resource limit is exceeded or it is known that the multipath connection will not benefit from further subflows. Likewise, the host that wants to create the subflows is RECOMMENDED to consider the aspect of available resources and the possible gains.</t>
        <t indent="0" pn="section-3.10-3">To avoid further inefficiencies with subflows due to short-lived connections, it MAY be useful to delay the start of additional subflows. The decision on the initial number of subflows can be based on the occupancy of the socket buffer and/or the timing.</t>
        <t indent="0" pn="section-3.10-4">While in the socket buffer based approach the number of initial subflows can be derived by opening new subflows until their initial windows cover the amount of buffered application data, the timing based approach delays the start of additional subflows based on a certain time period, load or knowledge of traffic and path properties. The delay based approach also provides resilience for low-bandwidth but long-lived applications. All this could also be supported by advanced APIs that signal application traffic requests to the MP-DCCP.</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 the MP_PRIO suboption 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.<br/>
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-2">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-3">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">The selection of the Key Type described in <xref target="MP_KEY" format="default" sectionFormat="of" derivedContent="Section 3.2.4"/> for the exchange of the initial
key pair determines whether authentication between hosts is possible. The use of
ECDHE-based key types can provide this functionality if, for example, it is combined
with a separate certificate validation by a certification authority. The plaintext
Key Type does not offer this mechanism.</t>
      <t indent="0" pn="section-4-6">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-7">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 anchor="sec-combined-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="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="RFC5280" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc5280" derivedAnchor="RFC5280">
          <front>
            <title>Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile</title>
            <author fullname="D. Cooper" initials="D." surname="Cooper"/>
            <author fullname="S. Santesson" initials="S." surname="Santesson"/>
            <author fullname="S. Farrell" initials="S." surname="Farrell"/>
            <author fullname="S. Boeyen" initials="S." surname="Boeyen"/>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <author fullname="W. Polk" initials="W." surname="Polk"/>
            <date month="May" year="2008"/>
            <abstract>
              <t indent="0">This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5280"/>
          <seriesInfo name="DOI" value="10.17487/RFC5280"/>
        </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+y96XYbyZUw+D+eIo/qRxEWABFctNBdNQ1SlIttLWySZbeP
P0+dJJAkswQg4cyEKFrUnH6NOWfm5fpJ5q4RNzITJFUlu5f5WHYVCWTGcuPG
3ZfBYODqvJ5le8nLg4Pj5PBjnS2qvFhUyUVRJm9WszpfpvVV8m6ZlWkNXyTX
OfzJX8yyZDydlllVZZVLz8/L7MOeeQdHdNNiskjnMP60TC/qQZ7VF4O6+nB9
OZjrg4PpZLIcbG26aVrDg1ubW7uDzdFg9MxN0novqeqpc/my3EvqclXVW5ub
Lza3nEvLLMWP0kW1LMraXV/uJWf6VzKGb5M/FuX7fHGZ/K4sVkv3Pru5Lsrp
XnK0qLNykdWDl7gkV63O53mFm65vljD/0eHZKzcppvDmXrKqBmk1yXNX1eli
+lM6KxYZLSRzbpnvJX+ui0k/qWDKMruo4LebOf7yF1jfqr4qyj2XDFyS5IsK
IDNMxvNsMYW/GSRv0vL9qvIfFiVM+DJb1dXkKkvOsln2vpjD5wrZl2fwRwUT
ZXV4biDPDcazWZYlL+CRSV7fwANpOYdFT2v8pJjCdE93tl7s0l+rRV3CI7/L
ynm6uIGPsnmaz3RBQ1rQP9c88HCawQNlgTiSTfO6KM2WxsNkv1wtYFG0Ut7W
eLFIo49pY79PyxmuJ/lxkX/IygoWabbjP8zq6jIFWCdbfif6ZtjI7ih5/tzu
5PQ6m2aLsJEUljA81yX88/t0NayyeN2/T6tqlpVm1YDJaWU+/89YNq1h+J7X
0F73H4bJSfq+mGQf8olf+R+yKpvli+gbWvsBrKNvFp4UF8nrYjEtFmYLbwF3
r9L5soa7ffrXFVwrvwP/rF8wjFVn0+T3cDemdLSy8A+8hGGpSxiO/hnHGKaT
4eq92cDpMPmX4mpR0bC8/NM6W15lC/M5LX7fYvt4msKv6Sw5Bgz16wN0BdJV
weqTHzIgJB7SR8e7yfbJ4UNWXvHsw6vhzzz/P5/Xwwk84RYF3I4aYAd3ODl5
dbA1Gr2QX3c2nz/VX7d3NuXXp1vbO/Lr89HWU//rM/oUqeEQlg97BvKDnySJ
kN6j8dsx3Nc6vYRvk4NicZlVRGvhV8Bf2HVZAJ2BXzZwlF7ih6l4mLS8RChd
1fWy2nvy5Pr6epincAMAkE8AlfLLBdzounpChHbpX27+Pfx4Vc9nQGwXF3bv
R4OXwxRJghBuems1XQ6usnSalYNJsSAEKxbx0/lkUloyX2ZAfrMS6apCdFMB
tv1sNPLA3dmWX3e3tp/7X58rnHd3XzwNvz5T6G/v6qdPnz3TEZ6+8FM8fbGr
Uzzb3tIHnm/u6KfPnz7XZ19svaAHzk63toe7m6PouE5vAGnmSVpOrgCnJvWq
zIhb1kC1d38nX/8W8Dq9zJKt3yYnQEjTKktGT2kUzxjoh3B9+3fHx/Q3c8Bv
gQVuDkZbwAK/XXvA25fLJR3wRb188uR0mU2qJ7SkD9mTre2fKgB0Vj3h5cN/
4N+Dy2ebw7/lSxgy5r1DWoTdYmDimUoEtEVi6V0rag/4BJ57czwQtF82UH6c
vEKsA4b8Pkga6WQCskRyuloSD8fPf1yUQFjScxA1lG0jl7+4yCfAm5G5N+SN
NoQH8t+kzYblp5Mbd716COyuuMwWF9ms9frh5H1aTlvfd8x+8OHnrH5fMKGO
l5DPgIW0vm+O0eAC0RBdzGDNOo4BQd6nHWCYABiiL5svR+wzervNRde8b+WD
xggN6cHcitGLwQguxg7fCkZxJFZ61C/fHe0lo83haLT54snrg7c7O1ujnSG+
N3z+4sXmsx28gSjfjUa7w9NZPs2qCCsFXwnzsgVgHSIYiZgXWYnc88eXx0+O
jvEjwsAC6J7cJUBQWGaaICZWsEv+GGnjAkhE/gHZLyAvInz1NZHUAIF3trnb
eUFxcbDsyfusHKIQTld0DswVtvgEXnoC9B6GSmfVk4oAA5DeFYIP4n2VDp5u
MeX3FKEaAJwMfS9URxhsbjpYxLvXR+MIvI/eHJ8BdPMqWRQ1QKrM6gLeqvN5
CpwY3ia2s5hk8Ei1yiqUhxyAtAAWhhSgKmYrHP+RwYpHcLpbj1qgeAQsc5Jl
KMRXeHBIm58DjciJiNAqQZqA04GDzXBGEDwO51l5iScu54S/Zh9hWTlxT1xN
AvT+alHMikuYqZ+MD948ah2mHiWd4wnclKt0ls/y9ndvh8nvQKxpf4F3s1h6
AhB99+Mw+XGZTq9u0pv2l/8yHPxpmLzOgAqtptnEucFgAOoDik6T2jlHyA3C
zXy1yCcEBNhVlUyzi3wBwhGSjVcHCYo0wN2yBDS7uswnKDfVRZImSG/hGIjY
AlicInex6Cc3QJj9TeBLUFwAogAE86pOzgGkGfy1zFDOAMZ6lbkqxxfSRVYA
Rq+AQcI5pR9AKiNy3xgMr2TKSiqiIzIkkO2AzObzZQn3EBdbrEo4yVWFfBfV
VNgPnrscJ55fHz5YwcHpSzBr6fiMCQvqK1AVL6+Sq/zyKiv1z+WqpsOXt6Y4
F5wov1E4Hf8Clg6yQDV0P8JmJsDym1o0LX9DqEyPYDwvznOkHUiq4fmNbHg5
7CdXMF0FOkUfJOurfAJCbo9WgBODxgCscpZcFfMsAaUju05vqsQCc3aTyNHw
yU3hBPLFpPYECA69n/BMcL8m2Wy2mqUlzQBacw4sF/nw62IC05AmvfHH1+O3
PX3f0Vk0XrvIP8JswsLlQeB1xRzvOS2DMAEvlScZyVIEW1j/anKFuEgkou8p
cXEBFxS+BfEG91wZ0WAGW19MboA6ATVCWRUJAEORbBTT/IIudw1Q++sKNsW3
GF9lmQKOEIgyHexiQKIpHMMMlaUbwFDnzq6AUk2LyQpf5CVc5EiVYKIakTVQ
QkQDWi9sU9cYdukJI2A+IL7ftezOIZJWQN4TNEDgwLIRunXL5czeVZoF14yo
iHQaURxu4nxZLGh/cOxIrssbAjkooMDFqit6Be+Yv1bM6GbFNQw7KYHEugAw
vnIxSg2Zmszz6XSWOfcNymNlMV3R/U8+fZPjn5+BxnyBHvPpk2hQnz8jV0id
N+cEGIFyWofNnudTOMmJ0G8iY0BdAiFCqoN0SWZG/oszzwADV0GUnMoa4Tw6
SSLowDHtA9ha6jdM3tVIHy5WiynqOjWwTeUyNKCuHq1UgBDzeVrmf2MKW/FC
kxG+YADQ91cAR9GlOqIEV+l7whq6W2aMneEz5krmDUCAywIIBD0AU1yAZoxU
yUXv7RImAj7gAkHmBNIGUE/h7M/TKq9EnzH4j8/jEc2qwhFOIuYVYccV3DG4
jni90Sw1z/rJNVCuKzzXJYod9QBGBhBshEVs9fpOl78EvXCCiMlzzwAhheIR
ToiFzm6IOVc1KfNzgqybFyUS0hrIsAXS0+HT4fbw/tvsMW4CML+kiwWYl06n
4SY7vduwc9z1b3UcIJSzm35EnlDrTkmAxG3AHET6VkvXYGwb6fD9MO0nj6rV
OV3HR71+AlJQSqJITYekX/WToEMjoiMe90UuKef5wh+6sEhgRW4t93Ek4RIE
5BLoJSIqFvMTQ0iIaAjNaHBpQZIJINR5lsD/FyBZEOFuUjKCrUrWbobCapLO
0VhDF4k3dn6TgLw3y/8mkICBAZWAaD+JxGqiooAC8LhrrudogSeYs4yCQ8zb
mm3Fsj6RW1jSNIMBQWSdox6VeTT0HKPvPGKHW8M4ez0QptSx2WlBUq/wIne5
SmH3NYionul4/hVIwXg1zYsnfwDSV5AtLIVDvoRDNdvSW4iS7aXY6OH3Qq+l
DglrnRELRH5aIO0iw4VH4NqLVHABigKwzmpDBdG7lZdrZvn7zKHZAi0erOoI
61ch3csyY/5ctfZT2DPibz85BTY9uaJfEcSnADG+JBvjs9PT056/pEQ3P31S
Y8znzz3cwNXNeZk3JQ4BdpbTeoGun8MZAs7SUllQWQBb4D/5TRJmRHqBB4JY
w1+r5IqiIv1rgCe4REg+seKYSGI0BjN8GNjLQQpLuRqrijcl13sCCFjmhZK+
FHA5naVETQEX4NRJHlO5F1kCaZ441Tn86zqfAj6nl5dldilOGjSo4kZZKBHQ
46ElRyBdgRqL2xZlDBA2XVYrRN0po47abdybQFIBUCC+F7VsdxWLuLI95CbC
q+XQ2oYhZHWfPsVaOH6Gu/n0KTIZff48dOPZTMAUpoQpLnK4dGUxR+b1bgm7
PWXp/3W+WH2EW6Z6nUd7BoxfHHBugGD3+oYo+2UGLkJVWwAVDBdwHgFRhT0r
LFD8EroCg6XncGQDXAgMlk3NZkQdBpKGyFQqYuRVfDcREhVIIitiVtUEcAxf
rbsWGi0SRsMFwnKWKVJsEuDOi49ZTJiUdxH0k3HQuucZ6LZTnMvoiSS4oJ0V
JDfYOhL9aP1wwA+2GsMQyB6AFGQfGFgkDJMQT4iPyI5vITcT4MKELE5kHyez
VQX0E5hUwfreLEuRksHpL2uFxjB5hRKNgIT2TdIMkNTpDQKwvFki+sND0yLj
E1kgcZaviH+YyWGGDIfKUZgAeonSOtDrvA6vIwu4gU9g/dcLMw4AFCWMvELx
E8+0LwIQiHdTEmwUzsDQZEoVpkDMAN4L4gCLW3UsD/j94VUKy9NPUS6brmZE
VFQBNkaXPm6gusLF0gE2bqLIGSiJEo0A8ojs2vMeNDEI+tVWx6FjxE8uViUR
5WwmmpiwwilREOYhxJi9EgDn/c03TfVZlPq3wUZzWoN8CRrIfIk49pPQ3J8q
/PhzQBmvQ3iJz0uSXpz79Akox2BCSmtewXUvLgbk+U3LKWMw/D6YL/l33eOA
pqpQiQHegdaWmi4X4MksvaHTGSYGdR2sAqRDVi2UG5w3hAbZJ18F5Cui+xE8
F4XzUiqzf/Mu4lw2uwDouf8LfoIJsevn8eDun8d3v35rfh+bJfjvXXOCx182
+21jXDth/IfC135/z+zJIPqn9beTCfy48eynLJarNtv6+yvsHX+OdE+de9dv
Ww//2tkJdz7tJd/8iivBlt/vvj3wrxPzkteDMcPcUaYa/Pq3cH2RBJyRdoNm
1xu453X463PTSrNCjooPqPoGAokIg8pNnSc3MbUhQZDEHc/lSOcogLh9JHqh
xBgtlzmKiHD3iBGi55AoJEpDSKLRreCOYXj0dIlqTJYdoL7vg0yJlIjkEJZM
y2ySoSbQN2twREZ0EUgkkp1BvUIVByHJQg++PkWLh2iAKUfleNvAmsdw16qz
4f888fKb592Q+nWNBrx07jX0o+MPT2lE+GVH+VMGXJx4SIKekLxkXZS2eHQ8
kGXtEbR5y/qQbr35mA5cF5cZm1yAW9HSBAp7ziW/ocXsJX/e2twc7U3Pn+9t
w8/eDvzs7cLP3lP42XsGP3vP4ecve6OtbVhy1+MH8LP3En72DuFn7xX8/GVv
Z3trJLPsYHzS9hBdTNvDkQwUPtniZ51QAjp9IQokklZsSPe2t0SMG3VNIiFZ
CzyisqF948HH/YTioBCiVY+xH4FVkfFKuHJAe7b8ec6j1q1gBAD2EWwFB/5j
Rmi6DjQuXKWitBYK0kxEWlk4y5YmJJappS3ztwBR66qoarGOelUp2COAZWYf
QSBFFa3SpbJ+W6BpqYMJwvLDopMj0tJAlSyTjYOjHm4CVgHXMsnDN14qrAJ3
Tg3IzIIAZDgfrjoY2C9XaB+pQIjFSJWu90AeKMhUxDs9OEIDSkUyFKAHwhGk
AXlEFwjCF89Dp86y+lX6IRPZwcsIYpAh2YucLM79AK+hQxWEzymPIZZoMkoF
cTZSkVjOY5rp8kVOpkQUL1kjXjbfNhiTdBkmqswRPe5bl8yFd/4bshpEyWWZ
1arM9FWahUkA5foOlFzSzxkNBkEyrDKQY+t8QsQMjmSyqirVRpSxkHIHHOXE
ugRegyS1Si8zdFrSwbzPbhKMFaySR29+PD171Of/Jm/f0e8nh//649HJ4Uv8
/fSH8evX/hd+AoeBv9/9+Foewd/Cywfv3rw5fPuS34dPk8ZHb8Z/ekS7pnHe
HZ8dvXs7fv3Iq4We2SG3YizwUOMbEplFYZB9gM5oh3kVhjGBpMp8a/QM+BZZ
CxjMxQIQj/+EwyCJNANQw8yAkjgSKJo5WruNsoC4i7LmNyZI9N0HtDtl18Ct
i+VPhfz1WTyQSvSIrz3QUs90JfJBDt0f0GqyssMkMoxRsvi2nCOlCQYltOmj
4zn/W8Zrst5nMt8qEfY6480yY6mcpAs2GF/kM9LX4FJmU0eEtMPtcfTSUJ+D
o5e9IVzN64w4PU3udUbRUZLzVT6rB3B41qLsjcLeyKlUV68WUuTWpURXa4ji
UetA5JgcNEzDeYxCYgFy7Zs0BiQkZyko3aCCK5vx3jtFCL7beJiOzZhiuxEJ
0OouaPaY5bULym8YhjXPLr4jHIfNa85y1Q95mjQ8W30O8GBpRtguG+Pjh0lY
G5ItaFKUwGKXxQIjCjyS+UC5YsGquTpvRJgRLENf1ewGCNcAWEs2R7xmFj7j
p8IrUw4iESpZlDmcNzEDuyN2VTJ1hUEn+ZLUfMv8WKabg9p4nhmP4Hk2SdHw
FCOdN0V3+EFp894AyKcbOWSCUSFcOaJdunFrojBPwNmtlsq3jRQcZGCEN9n4
s9kN+4nwpWJVo5mJXyMjGK3KeqoALZtGA8O6jRkgdiaaZ8QDQYTHtcQUtDmh
8o07ouNiDGIz05GxAKmtP13ciFOpQ1ABqaexWPXL4PHyhPBW5LtlZG14uUVO
rMSNIWHxJA+Q/43Obw3j1s+IxGSKxSB+VDVoO1k9WC37FOSChGwiV3oJxLcE
Vv83+XteTL21si+HOS8+pEgWXHAU6o0FODc9zsBTrrPZTJ2gAmc6YkOfnYlY
TRLC0MVqfs4RWvEcSA8+IOZPV6U6kdwsv8jQvUPwWI8pLKM1cJ8eZCgRC57C
9fP5Eo7M7ig1TsmSSNs3NOrB+EtisF/XQbrUYAVra0e7sbh6gSgQMqTwyTXv
w4lxixl17EiZL39CTxogGRDx5B2yPBeG6iMpszbGFhlW93BqPe+0O3Z6zsJ6
HECfOfksW1wi7Ew4MHscCrGuNuSWBqtBN0DHQsKkYi81QRf8RGPMN8c/gURF
+14a75yTu0ohYbnSdGJSfBfmwOFJsJbIKEuQRRsQKraCKzLTcdikzB+5aGwy
+4OwD/hdWuM5Bt98SD0aBA28Uh2CjQMeGucZCDh5UQZGLXZT+f5ALOGfvhGb
OIhhbOcUDuiNNxQ5NVBvFAiGhlZeZgtSa1SWa7J6NcYCESDXPzoQ5yksCQ2V
aBsGDlCRcN4OiWBnh1c7W1ZL1GNAY7v7hx7ad+vsWdGz6x5yks6UjEf4mP9r
K3pbP96PHtrfcvFs984d/+Ua9r3GX2s+vo1e27DUD9X01bK3/rV7LID4833H
a//0gPfuWuQv3Jt837XFe1978N7iT7p32vUaRo6i+DTN4b6s4JrEbEiE1jbn
/aWAiWyzd19jNcEeiriri+AwSX3q288uIfX3NwkaDDpsMOcZCDyV0vWdAfok
fHBS3xtz5N4am87RInkYuenLu50yCjmqNQgFaa6aUDUBEe8syhxwK+FppAaV
jDfmz2klZLUJq06bbBYAJIwTJyTzGByeZ47GqmM1M7ETe8GBaJHXIN9nN0z1
MHjKCzVhC0LecJFMxKy04hfbKY4onPQp0mTUkdhS4z59Ms8hC9TXmxJrcl5Q
iK8YLEmBFmCS1gUsk5VNgf5QUeePV1kwAME1ELEOwyoiBcqfGtksBToa+tu3
I7TlOdBoJqBCkugQ8I0iBMJ0aV2nqJmowO1jT7ukX0L4n/7l3dFbkRrs2cuD
VrZS6oOS3uLuoY9IRIIzQ1kl6bZImtMmeqaHy8a3mZ+OIlUrg0CiJjbuosfI
sEyxnXtX7FqkZyRTzTh/6M2N/J50OKJFpYt1Z+mx3zDZIroLhs3qF/u8PiQu
ihJy/gjkfLEiBUuNKB1G7S79C3CF8F1GAiFuWeQLpFyK1V7i1jNrxr2pBLiE
BaunR59QotbE+FrpI8ZIn4spXy+2VfYab/p4/ylb0Wk7jRsHgwqtk5PrSwCX
j9+RUXj1Islj6Nc54SCq5nglx6N/Gny/v8XHsUW/w9DjWX1FUfKooPrd6QL0
fPNoAWTXIXNhiu4vxHexLaP/H8Xs8Va/gS46Esf5y0Qzyd+ggI9g2WsMhjhT
gkjmCRPRzhwULgq0k4hMvmrtGcmALPEoU09gODMgbamAGh+zmMxWU73ImCEy
EStPrECGMA9KaZjiK09IUyQhX1YwlGlj76ZS86o5FAe9cbRR6t0SChSiXEHv
Ljm+E5Umk29xdGx4aSNdw1sryYqH6kfub/gaePQRAdgo5/2fCA5SkSONWIh5
H4H+AO1YTFs+KAnG+hnpMzlrPDWwzGZZwF2/Cc5Q4cv+SGL/B9BsMguoRzpT
/8s1Ch7ED2c5KH7sT0s/5vPV3Ngf7I1iZoVaEDIAjH3GeLHEeI85AMu6KjRq
eXu44wPEMUf18+ceg9+S1+hcRVnFaHm/ZgSpKKlsm7iiHJcMriJcdqRSsgFJ
WyPukmVTiYUEnC7mBi3VJlQl5A45R0X4Z0ozMRetVNqgOT3zpk4eIqkA4ypD
ngdsRfYIw2Bljm6MQXLKJ8VqMR2clfkyOUNzzsbJ2VkvssmGELwua6SG/4AA
UJEZW+J4jUnTm3f6kSdQpASOMGC7b8pQp1snlBkdHGojk+t+TcdDYQds0pOQ
enX4ezCe2huiwd2B5duoIPWHNWSPKraoeLaRbERJB6eCb8+H271hhwgjd3RW
iKc4kDkS0386eP3u9NCLTf5q02oGB/jaSfbXRFKH+QO4vBUKENVwjaqBdmuC
CiEY8qO6jVU8/avx6Vm0hmHy++yGzbLeeqOCVBCRMNqBNhJA6vfC8Sh2ZJYp
MNWbx1wtON+P7BfV1aqeImMLnkwLPrTF+M99/sunb7xti808cfSLqiAzTJ2D
89JDespEwR9fjz3jNRqegiXFswv0R035rIhUBLFPJyCJ8JX8IURstImY40wk
IIqA8sYAl0Sun9vkLT+vGuqbLF3gXGsU2JNs8u0iOVnBZbwF6YRP5A/pbJXR
l3/9dgp67e2e1bT34j/bmrj5uvms/r13q2FUo02/0pb421K1T+N4r03z5Vv8
r1e+LVxU1W7BGeOYwv733B7JI2WGBrl8Jrk65WomoYAqwHuh/PTYU5VK9IQS
+PFAqMsNZQQYiOoMivgfCMytYQ9JGFJcuEqRir1f8LGbF4e4eDgfHpWikWar
OSlJj/70KMkvgusYfs9o0I7AAuIZjuKuKQAsXgsw3Zz41aO3j4jRLez3bOSU
vANWusShyY4GfrVKL0gBEN6Pvx4Iz1hau7Uf1hH+Z/NlfYO6GRpn9dGhRJbF
+RHEr9LGbRXiFyfSdlPZ3eHznugncFVc81qqSVyN5gMxmssMtFrlPZgquPO0
66ryE/amnuHDgLxs8k5e86jrruwt02pM5Ps/wp1cd8GaP3vxrcTbt/NUr5L3
BsTXsH3//iR/+HtmNtW+ZgIT4BR4075P3qKxXlQ9zGg+pLpFe8kxF+JYLaeq
OQkNQxwiIHkVma+MDwUCUopVWpoRyUo/lIRiELL3raAfUhx6rFIGO1K1Rg3X
cTCmKGO2n6HkRspbZ+qSCJks5kxtmnQUytXhUTKmrg1kfuPj8f7rwx7RgYsm
SyAISWwjU6C6XIXSJz6S+hIUs4VPEJDUzsC+kv3My/eNPEV72zmAuc9CgLj7
Na6KDibsW40hbBkQQpdnIN0GpxdGqPirvx4KTAD1ylF82+D8pma9ReYrsyWb
nnQ56EisbGiTeKjYfxRAY7cbp8nZWAQfEk+mpQUIuJPMWxrRK+0dppI7YfVK
okaS6AByZl+SIS7qOaoCF8WqTM5RJvWEYr4cCK4OWGaGs2Ko3YhJcw6AoiQQ
mU5mc92hYyw6iWZQcVjepo0hbSe1JOzj0qXZZ7PkDzIpnyeFDCz8jYRd6KI2
uyb+W1YWDc+cfQoGKcrgu9Owg6HxPgHTHyXJVpJswx87SbKbJEDInuF3Nno6
iqSmcHkgYbp0+P3HsObbe96NzPqt01G694r/UhPwWnw2l+FbETM1DdWbj/Xa
+5cIPnwMXZJGp9ASlIy1jA9TcEc9n0RMZMRbuDwuUzCbi7zVHI9C0VZe1jlr
UA89U7RFlHXTfNrIoEaDibvHLv62iHNsBjGtcmtgp1szIhwpah2GYecOsICE
atKijKCJmAWWEwNHA0VKfWTaYqzG7Z2Kno5lCZB6zDAwjVgnBhEzOck6ou71
IPoMdr4eS59MB6s+JXRor1qEp9f3LlsVWAtelNYqrnZwWWZUi8X4gPSWm1wZ
r9kxEGlrfcFaUVM57cqFzcowG1Vv3e5AG70JxvbpVMnwXRZ+BgSqpEgWdakm
LsNLnHmJPiEeHeV1TCfk/ZKuRjn3K65QkiUMZh4cWA4GZZLfbdEQVl8LWFmQ
7ebaMA3zTHStYzCw8BpCBcpxvVj5o4/uVW5DPNOLWkioFQPs4zqwEUe7ZIBd
ZlHnQIooWkL1AcpLIxYRIvNEUFotAk1ooEWVsNtvi4JUGznRTRTajCNhIm15
L4kCDwSzvuSHD00LOtHPF73Pr2gpKxTB0XTy2JMEI6X1Ydebve7UrE6pPP75
3q3J6pJZqyVOqzgWz9sHULcmf0hMQMecvzEXoAj8/DuY4DdrmaFiR8Ovbcwv
KjBZ5JRicX4nyBFHEobPRx00bOvaJU/oGpzb7Ks7PFARyi7SjYzgym0N9TbT
XinuTRcTY+fIL8GLJUw16PqyokvUHK2JmlcaZmYCH9ItvSjlb/92MPBx5vDC
6w0+yDHAg3LyeeU0qN3UjwtSxCMHT4dUKd+hIBBbpshYECJmXUMXaN1brhjF
ORJ9Q7bWvRjr4tHcYkWnPfrqI5Wht3TiigLtlRDpJg2xg2JesKunXCddaekz
8hPWiVEZ8K4Ty1ZT6YmyRRO9eY9Y04+IXpNJSRrcBYD9HBNmyVBiTMeF7J9s
va2QhleSvavurDTUjlAhSkf+LFl7tno0LePTNxJ9F5JyicSb6jpq3fAOqg8S
4t8VNxhXVbowYnFeta31eZTdLJgqZgVVf6juUytpdhR+NZFg2/43l2xiItju
02fJ8xf8a/L0Gf+a4Mf4a8JPPH8R8jIf9Iu73dwcbY5Go81bY7ghOMIvZO4D
mSYZDodfOjBZPL7bedqitBFQ1lpb+GvVLEjNCAlldZRsphayMmsK3vGMYrLS
7ZmUuUUrshMNW2Sy6TBr8evh5x7j9LoftX01LV0dlq97LNXrftA8htYxtTMD
tsuCQVb5DgnIu7evjk7e0EfKkFFXXXp9W8pCiVbHXhHcvcC8OcNoS0ECaP2d
hr3IR/9SwKGoe+oewddCad0etmiG4EmBPRBx6Y7wWi0m6LHVfIkHzbBNM/z+
8E/+pA/VT4hJXFrUUgKnf/rhzfhgzUlHM7zww4HijzOcHv6r/yhg4qk6KiNX
yDpcimbY2vYz7NIMYWm3CfwOpz1l21Acdv/wGcxJP6UZTs70TtxypXz0YuOH
YlK79+eOc3hGM4xfvoT/ndBH4ykwyDqvougUjel56AzP/YLhV9rD4Zt3fzjE
SdBpROH194159ww7YYYXNMPxydE7/Ugkb9UJj9UI8guhNJI7TU5FmaF5H3Su
XzgD3+nDfwslAw59BVO5Bssy/4Dmb1RaHzrD2f5LGe770ajxKJwDiU+s60pZ
qTfH3pHSOXyb20SW/YiEUeYd8plXzbFD0JKR9lKqDBmEcDKvavobKYbt0jrI
wtCtHCcWUFky9GqB+pkbYyGLJu16OFwGAOPGQPz5JjHkmyQf+eNzd12O+4SM
gKrwQzV+v0ToaD/sjCXyF/6C0ctBOBE0hE/4B8QVsTjZvIeKJJWvMrfKL/Cb
sH7hfd9ttpVHXsLdltRwXoxfiHOnWGW1FcGSPDxdZKPKspagI699/twbulOs
9abjXuezGfsZ7kswkfALWXBehRTCEJDsl+bQnSFTNGo1lZpw4rMDa0nV1MjV
ECOhQ5CnRGonYfidQxtVOuGVLrLrrLRhOMbdcYUJxYso/7LvTVtKfFVeNxlX
caqZw9EkBvb6KpcKW6BUfSBVIX6YFotKF1YoplhBn5ojeoNoNkGQcq1qCR52
C+MtQMFIo6xwArFrUjQa6aJ6OlEVxph0pWWJlWuLVY11VcguSVqclANoryCi
OWuQygVXCCuZ4hHUnEbp4UNSzW8Txk/+C6mXNdGHmiQU2cTxrzfqkXTt5VEg
d1UVE5OVVpxXxSyrGamwqnGyYYO0JgiDJo4lXCVM6lhcE6wohPUaJQrc6Syf
iLWDEU4H92H+WF1NzkHlEhYCgwwRTPTyNgUGaZTvVEqMFT5I+eglpjZlVOG+
9aqImITCjWFuonjsnIoJUvATnDu6oqctSHLsfs0lnNM68lFRxEVA99arpDax
c6BoLzNc6lTLXDfi7VyIiAKU0PB4pTRvxn9C1OJ8MLVwtxHBV98xcEgrv2F0
JXAYJBqCogmaF4NcsXgx+LoG7HIil3vCp2ifTa4KKTm9qFacryDxmnhd8flF
3WkgiEhDXmnYlwRXYjgkEM4KS3zmWRQ3XUwmq5JrajPhQj9GTNDEZsLmL9gH
2tPJk8Sh2QVnVNCCvN8LtiCOg6xuUUOq8LypwTKFGCUvNGMcfa/pJRz1MPlj
jhHbNcVXN8GHkY1UbVezu6/yctqkxVysxz5mmeWFcCdU3zS4Qi1rPJx8SPfY
BS4jDI2CJilmd1KTuCXFLMK5+R2zT/Mac1rVv3wtm0PP5OVCi8U27wyxLLKd
Tl1jtJG4FIPnv1Ma8FtinAllbgzVojxGCtReZhQTZTlxNu24J6F8MyOxPxUp
oaPJOJNimbMX6xzI5pxPBJnplC9W8O9F0hbfGfoK16ZBG0STGLNmouJ3LCLy
qPH3bHprXR2sEKsXv9AV8NxEfNBNXElFRApEbgOikc3OK5DoUw+/tHYFueok
Dg2vHssUTBRbHI6QWAvU43Z53J/4rqQLvnut15Rh8JuC2fLqltQHF6KDMa9X
aCoWqzQJPEdidEYe1G/EywQLGNUEFbKDZn8O8QVGg8ChDIkw52O7rMdhG491
l1yqwbvL78M7ofGdSKN+x4sZBdaT0VkCwXl8uVwcFn9V0D2uGremH1wRSHWd
UF1ggp5NCQRxDchH8Hyik019FMKV0m2Wuhr3E1AO7gVHrcjSPFZh6I/c+1DR
jSgN74VdAAUXtqSKlhlALK0omolF0BseBXBFmybkamgzogQSBBykkq/0rGhJ
wZLZ5MfolP0iQ2bY9mkm+Q3NELr1P39/i2Z4f62RomkrQmPR4sakonzpz3qb
TtNo9Hecqmk9+gpTtY0kck3X2eRVL5UaNf5GUx1F6/tHjutT9ppeI5ohZJFe
BHdWpJ51uVMoO1B17cuimLJCkWleHxOKNHGxy0uMzuOtwf7WOnWQfZDMsJku
BzWjIcAiQRsNNZkWddOc/a7+8qmUxdUV8wUGIMDrG1iphWu2hTrdPXXyxm45
kaM7yFEsM+VV3XxW6/q01r0x6rl2tqbZqAy9IbDpDVumpAfVSjCP7icPK5mg
P+sefljpBP35dSUU2muJ/2JwPCixvvOZ2+4BLM5uwNEtQOTuBQYMh3f3AA+n
nd+vWcHX2oKg8OOk/XP3ABTnYXBdwdBXIPT8MXyFLTSNeC3qsq62gd5ET8Sw
vAH8uLHKcusJYTNir0ENz1c1mwCQRIl2SrpNIIuS0EUVtLJpRCg3uimlasUY
rv9Dpo58Flh9LL5XLkgXlXsO65drbJMDlHSKjrQz9PTXh93NbozUJkAJU3UM
5mSwUZd061tYaCC3ytpqDYEH0psggmnLrPUlELjeF9oAKlaV7UJV5NWiLxzM
KyW342e0ltQd3AIjztJyJiVAF2EDnoUo2yIAjSfvFS+QoJNUurRGZCEGDMTm
ZFv/m2T/o0k2YrSl1/6Mdnr3DXAvbO9dgfn5X19lC1vRFkZftIXB4H+tQ4bB
Q7lO1y4eDgP8+bUr6Pp5CBDx4naxvAcMsIbvbf0n8D3lFQ/mfULM9TWvgEtx
9W987RNyUuJvX+ahfKAr8qE+v8ipiH5E+O+mOhVHt0R5kqOXt18y3prCKxH0
v2i8t2iFuvs0v2C84Mhkzf+70ZZ6MkcxMuhRrfNf0pfRCZ+ZL9rFbbBQYWrL
CKwJ/DGtPokzSwXkUzSOhRhyX5+JYzytKKDD+zDc3x/+iS1W66t0a3sbNIt7
16qvbaBtuNAWrL4QbFTmq+OEajccIKRhYxprY/OFyCbp10bAkpSuptrH0Zjk
NXPkNcOxPn8mLVliI4fJqa3w0KjqE8Gj76eLakOtSw/0STohsrRdNTGu7qhu
DC0JxSkblY879VFlvgGfmKRXlXhP2Aso9ZhtSU6LcwipyaQop6RHi+QT+u+F
WhacDjDsRkxdHGDgI7nnj5INlTWOXvaM2yn2ictytJak4rf3WNKjVD3faXME
DRTlE+1j4rJ3Oh8diwOS0CvUW+LKwrk0YvCtlDg8WawTOi5nrcEvfs1uTTra
PF1KtXf226Ra6D/UZFErjKvE6IdXQKYN8PFuW/lE669uEKYGM9jnzz2nbhMW
xxlcmPxtQBX6SMTOlL4j9Eg1wLw5nVZreDs+q7rWiC0keaFkipW+VaoLWGrE
Nyeta0x7kcpePJIL/RV5d2JP5DopBZEEsjf7xovJdMVFn0JFVte0CRnTLt9K
ViS8O0AdeAIQfM9hBqjgc9il95MFwhe0Hw3hpvsnBoUnnsLYQidtAhq6kti6
q5iHmU/ympMEuD2AIqTDTEgs28RWdMK4quYyblidZrmkJtnNely4B+q/HYoC
oR8K8ZDTc43riqJdBCPHi0ZWqKOYFqJvEZ4x+aZuB75YcB3DEB0tzWgCaTRi
SgGG3hNcYiWqCsi+mjm1bZaa4zyl1Of1Cx8vYiSlrsrKI/h2ukLLdcclhG2B
tglVxpvdcBDPIKSrXphr77xbMpSA1UOba3wAoxRLGmhVSLa3BudAekps/zcX
YqPNImJ3PNdgiKkrcNuWZREL4SBgMFTWc1g6Zq47vaZeXauiLrBXzvHQ9fLi
sIq9WBi4qyz6BtPZhFoNEjUjRmyvRquQYdXq89pM1ySK+aHIp2TpxdIxNTUP
CpkaB0d4LBiic56xp8hEZTRieSStMjX5FSbBo584ppeBRCmKcImcrnLLIS9i
6AVuU12GxO7wtzZJQERCjMHsSgoShXM9oWI4khmB2z4vV0s05XDORmrENLiJ
P9osoz5xcU73aIxH6HqlIS2h6hYwG9mj7emi01+nIeRsmLgxt/DuYykOuvA0
asglsXdEy026VLp6EFbCbRQbeVSqrDujZWO1oNaAXPiDrmRa1brgnrT7XWIF
BcDj8zJL3w/OKaZqMMcz9T00hezpm1RRHLuY+PgLX03Qx+hylSr3iEoTPQri
UnBX8rnQ7lHoahTrDNvQhB2LDsFBanwQw660lF+rkYWMlC8Nx7wr8BM/wRJM
ZEf8JbGed0Z2brX0IVunaY1W1AVd1I2oWqlY367TBRfab96pzlQFoqBsjAsY
T7dVRapoWm1s1H3OUbSeNe4WCy3FztfBaYcoVUmyWqRXXhB/QokDo+2h1Bjy
fW4oqSoTnt0ondWYCARxjHELdQbPtQA9ebO9xXk2UxLQMag61b2AlWpZ/YeW
00o7r4xjEXrGsXEe1bQOhq9911FENy6PS2GkEnwozKC7ophzY7JAq+x9LwD7
eoJ0tDW20KE9xaep8lMIzmjVPJ7PsynKPqgXaBE4ZGw/LiWAYhmVT1Gru1kZ
q2JeR59R0FPOpiCnwOtHRypcp41kPlO/iS9w1E7vUQsRietTT9bQPdhrTtjo
D7ck7+8LxCiirRtsttt5y3VtOlEpp0XVn1gsCin3tMQcdXzWZQ1nCguPbyVA
ThOgrQkQ2uTFl3zm2j0Yv/hvosM0Af4f/9kUK6JGW/D3+g88wd/DSX6Y8vfJ
11pIJ0TvN7zpz+3XWweiNUXUoHlc/iYaYf7m77ca3+Pff491bOM8DWZ4x7tJ
xALlRzmh/AhD3G4xRET4dZwQv+syD0afWwOhV0bXFa8mQx3eySjdTqUqViM2
iB6P+0yX93tSpYprRdmiKGcsrJO2I+3v1Ee3CHFgpOFgo8nO1nxSJTtWiMiy
VOWh/giTSmvNSlv8XayUCYXPqiLBAqdvjm0KhLMU2yr8f4cAoQoaGzDI8v65
hzXDscfh32hVrPNFRUIr0dublWerHOGRLjIMCu8q5EnWTK0NvPV/bm8N3Zhs
diZUHFFWozx9o+Y1+MPSq6Al5mmbwsGjZ3QQz7YTrKAltY61ZR+hCtcAZYMF
dYJyo9GuPM06PFJ9r0npXaqSzcFW1GeeBR1/19js5osIMbSoWp5ySV8Y4b1U
Ch0mWhwJn8FPudkbmXviGCf4coBf2up6OLWU2IsIGn0h4NmgjfUekol869ZG
inR+8YC4Eoxa20y+O55hQ5YzbCRrVtn6eQ4fmkdpe12rxATiw4OXPxwODrZ2
d0cvBqc/jLd2n3YMub2FiYj4KCO+PIhHf7AqP2T0Og251R5yd7TVMeTTndaQ
+GDHkNsD+L1jA52wt9W61h2P0toIF0zqIl4Sj0TkZQvQdHsEzzdKKJv1/Jf0
JPf6laskNPQHoaEsJ/X6xvymfdJwVpdQESx4AeaBx+HfQHCpdpqk5hPpVDKg
ZNKag2AIXP7GFHfYw1dCfLKKv1iCn+fxxiQ2q/ESckqG42rd1FQVe3s4LPjC
29hLaPDxd7TKx7TI8PW+fL1PX+/j1+Megv1DBZIoAHmToMqIwrgk+ALgPV6d
z/LJHVDGHn+MOLhLzwIaiAmrITxKGJHWgCoClLeggapRUpwJaFE18nykLih8
GwkYCA0vQqpAg741IwWIaB9zmQk1BlDDJ2o2MFYjHRzUqCvqhZ1zbXLVrCjz
o8Jq7ItBvhjAOwMWur15zGflwaBYPE3q3Xcl51UZtlyTnGHEOzaiTXzdlQmm
el9w+Rw8/qpaZdJYOHxF3Jk1PdAkNw7GvQ7T3smrg92t5+QiWn/gcNO/3oEL
2fiKB95c+BstdOc7wZBxjK1Tpqp3FBQrDFJzETvKvaypLRYl8KnQVPnqaujz
8J0xlEyZ4mpdjdgie6tzRw0ZCK84WleRY/NkrEdKDR382DBVIlutyrreJohp
PKD2LiiPNcM8wQmfgK/7fUOUJ5+QLdPz/VTCvzQp5ANFi60Q1xy7RzQjRqzC
fu/BNkwA8sfhvrjEDlp6Ey2ug2OuGiZY0PpDjae1xmFMvSGVFTMy/2dmi7Ol
cHN0KzbDzYeU1fhKaeMdLL1z4K7IjBeqd+209C48tXV6F37XpXdFn3u9iwjw
YjqoiwHeg53n5PfRJKUBZ6VqYKHTJgnru3ueGZ8jJXY33k02jl6evu0l0qha
YiLYzwR0iv32m8+fYjzB2HB8KtuXlhw46hqRjqHlbysGEmRqvKN4QWCIktyp
6KTsU3RtWrs0dnLBZSKjPdB5atzCnWev8p/h3nDPQUyryrFNM+BQnzKaycus
IQjPhluNeoTD6Ah0XUizsaQ+TEMJfN4gS5ZFzhnwLd5au6K3TY1ZRwZdTh6Y
zUx0bWpjbccHv9cSX0MxSbOBs2t04mtX6aqihildz1GRdTjB6xLT4kA5ok0/
297atv0cL1c5R2pQ1Ww0pUpHB3ipLJYl2xxdxSbZ7o02VUfVSKvscs5FOb2P
1J1ha1wQ2bn+sO+SzIQep0B1F9H+DNuDqz+vY3+OJ78sWBDlOANTfbk5Odea
DO3l3/Ai3ak891oXmZuM7lRSe+FGnXExuYZHT4tZbjf6MQzdAZZMlgLOZzpp
E4AXsiRpQ8HmecxLxSoEYmpNyZpA8cj4MdWhNiUhtMwzS46VKuM7zwnEboL9
NxchgVDTKLXqQ7XCy5JzHDiVOfHfqoQPrBMTMd3lrDgnFzPAuqYYoNAzhpaq
porR7uYm6++avBra8KD44eiwYKDtZ7vJcb6vXZbj4+tAtWEw5pK/mFgjhV39
Yt74ixniL2dBTfZHvyn7G1HNpwPVoDe2BJK9X1ctpYuDwfaEhe22WBiBdx0P
oy+7mFj8hbUeet9prLNoLFOIrOlrpI1J1fMjckkHrSJF/jYlZK5jZG98+7lg
d3Icz/hT06HkmvJuHRINRFgFFgcU14fwBbkQea4ztYxNlE6rqLS/sLHgG6pW
9smzRdCcoOsksmJG5JZo+tZocwdb7y1ET9RgG2HOgkpXaYXs5xKVrqt5h7b1
FBAbgzf0RQfXfIlOzHK1YDlV6LuvJD96usmEPKCpsNNHII0/inuYyHbmMKQv
KtytT43pHXV9lsl0gMp/+HC/59ZGnoQqMDTfozesPD3SohxoW+03E7tjdJsD
U6U4Dg1QoUlMMEweBwWQli3xYxihepUKvqh/zX+JlLyvdunUGlPo+Pek55NZ
KndvWWAojbW+krFYmydJsBPFZESXAEcDtOM6QtI2HRnGSxJpKIl74XtKBHCL
/01eqDwwlSYpXPQKGucplZbQ4v3VXij0+xslDxug639nh0PDznd87HAu1eV3
J+PHJ/u9jjf31765L2/uPz4Z05v4//FCOtu2Gg+28lTj+xmfguDJXit4EU6R
Q5xYrgvBaSZWk476wpfqQSWYetuGAjZoPmNTN5wuC7mbw+YQXIBWI9AkSMpn
TsHbNCah5Mbb/Xe9r3rEOPbXP+UAyccExcew7o2j4x799xj22/tFKPDAYaMT
Dld/LzktZuRij86aWjD+t4PoV4FfDwv0PoRoYojSBLTUjzlXLlZE9a0dqD2K
87H0YnbirgMkPoJGOcOI4dDytKvMWrowmpeP4Nf4DDJ4abC6LwGhT+VVEmrL
hAs7dO/0Ovaj6Ga1B3k67jfTBZOidBFIhrZQdeoXQdd4mssqpL8GOfYCBfHb
d7qxIy3S8R7RUwtaaRhK6nlCnDOeJlawQpHDcU2RioUFa8vXER7rSrWkSFRq
hL7YimpfOR9sIm/lVavwl2VbodK2ZmfyoGveM7JhEASBRr9bxGeFKks/MH45
MxMTE6TIEKlpr58RqySwiIHrNRHfxpQC+8JK9WS1G0Jq1qkmRv+JM/GnPvyG
zOON8FNbg6+5Iyou3teBVeRELia9KpFUUUy79F31Ivm1b7qr0a/tJYoJ2MgS
eBzwItcNd2/Wl1Gz98fvhOPMQSwjHZMzdJH+bfh6cz5in5CjnaIwTNyDF+mv
Zm1iTePQXJ05WFx71DePXuFkAS5atvBnayzDDRRN7ZqQ/DSziqS/UD/hQFXH
lN9TQK9sUXm7tGqU6pMkY9vFlvJCiHCWcS5SI5YAkADpyJyKcJWlKiNrBZ9e
sDtjLWBSruGX/8l2Z59QiJ/gplFHvsVSyF/ZwnybjC/vK/zy4ETBO7X6kDH4
tKXV4w7XKfX4XZdOH31uVfq6o3A0aT6XmdsoM+lswLLqPJ/Ncib4lVRyPM8w
3UFVynYlNbKIhdqQqCwaoxdHdTcegJVh8qEqnA0yBGQ9SjmgdWuZsUkWNb6I
YwwLTDLhe+TrXeZcaJ3MVldEVOHVGeaPMORwcGqWfpk1l+nzN7C83SVXMyTR
hPopYfvgMi+wJ7MjG+xHmhko52j0Yhu2siormeMVBbjQoaL3Km4MqoEu+LUs
nxS2lrU2RMGwUk0HjT1w3El6Ta9vfLfZc3uJ/mmS2zjYnkLmqGpaaMTc9tm+
ATzg0UY4mv4po1FbFAkEYwB0jJB+lBG2aAT58wtGOJ0XqMbzINs4yBib96Fv
+MtGOsTQiYMD0APj8CJvXxHFjY9Sy44JZuZlg6LHZ1QN8XClXBQHWwuwuUxc
sH2QH7Vv+2GFgp04pkZniUCgdghad6NhH0eckIkVUFa6xiLyor9/jh0oo6Az
spR3XB5M5xpEnclby0moxINKgUgSVhS/jU9IvbW5sEBLNkhOWRSm2ml4Fgck
zaPSumwcO8GeLnRdsDjA5wt3bbPtmo/7YaUJZx1e8c1gycDECDZdQA5X37jn
GpaG2aLMdhkOP/lmOEN6b9QoCsfyNM1AGdZnZ1shf5hkZvyO1AtnaK+vgJ59
BEpJIA1hCZRw9i3lcV0ipsEK4de6LGYmioArrdCZfMhugr2vQUjZld3FNoYh
QDIKScdNOt1LQ8dCgqjxkxF5xk3+NM1m6BfociLwhaiK2aqOUBHmI1udNjuy
RYBDGdHG+cHCJMrvZg7YXuYTvUoYdz4Asfq9xCfy76zA2bqd2tMn+Rk5VNn3
3XpIKFN+0XLSSY1PqSa4ID3A96WXvLe+JgCB7LnCIo7IZ6QWToDSE1tQRp2/
7R/N408SKhvYHYN9IqcTdankYiMAqQ08z14zgFkbXtJpt2tcNcpg6MMiHTVF
IbOv79oPh2VsUdUTFN1GA/zzNjxM9+Yhy7AbjH+aG+yQp35qNSHL4M8Uu2lT
vtyFXpIQP41ohIZJpDoib6s+RTK3akNeBGupv74jbGVbaoRU140U2wfys+ix
6zvugsbxARTIpzl8dKN9S1vgar7isXyoWc7p4sYx1Ze8yDubwggFDrQHrkF1
RYFpjjuNBWMKHjVdoycmaVc3xV+eo4c4CyUUhyGSSkv2hTR+o+2qtUn0I0ep
lCY6Gu1AvjsJ5nJ6GIqIJUG7MKpvWD21hkAiQpqYnwK/ukk2jo4/7KBmDP99
yhHxai5ME3MOGF7AGX1nUZEAWHBJiOIjqDmYdespG4oflg5cc7Sl8RtpgjDw
KEeRn1aPD4UKVcIX8ifarzdeKk1yJrO+lW17RlwMj29L/cABGaPGwmz/M0AB
/FhVmY9pzUtpkTbJFCGBy2ZlablbXK5ZLUTjGZY1uLwSU2v2ccl5YqEEePoz
ByDCi2hpmVCeGwWsaRtPLgeAy1umeUkJyJFPS2Np1M6wwXSc3ni+6TiRtdK/
28lh6HAsRKTKllcgzGAnaY6Vo0U6bk/Xk1YAgcnzYjcw0xZHwVckHGhWpFiv
fgaXApC0x6Y6xwIM1wZo+x1TU2+ZZs+9xRXwkyUvp1/4EIj11h5mVGpFudG6
DaSDSZKESjQ+nkKvke/1KSGD3FzCtBMLycjWIGfpZMhLRuqFIi3pmtYU2cJ8
b4jpzMWEOxP71jiWKrhG6dUgK0d9/YJRyAU1OnKkqvtUQrfw0b7tHcv1BNQd
2fJTm/Iz3lRMqHuN17KKfJ+ECZTmb/2yXm/p+7oSYmOmm8KeRquBYwUTDUTX
ViXkpx2LgzMeRTJkHbtyuRQIRhBL7QkKh2ULGGJ5iNjFcFyf4al9IbRoqkTY
eyc8n4kuNtof0NrYp9NnAto3rrZ+8LUpMcIVLRHBp8YQy8twLSTii+IxN9QU
7Gj02HrZuPx1AwRW7ay81fQSUi0PorTcqCidtbZsq59EqbWIxjWqrEhCXb74
WcK+WneIU4UW5v5KsF2UJDV0b4uab3vf8G6QOxgaSsCVQfNd4YWxC8GzUCTp
bJ82qRAXs/zyqhb7qeIL7g+rhyzIer5wOdfrnuYge/FJpLZYeKsad+hdKEQk
r13T36OwJDd3pxnbMhw6DLvZ1AddbYS2Kr3QnIL8VNOOtizOuxrMgqXoZ1dU
9pvQUupzu6qk/fmSvNZ/XFpr879WpfiCtNaRpLUaL/2XZZPeuY5ugMrPF5aB
W/Nz7/fxOnSfLHEO4ACYRjwh0RM+GD3V4LG/zzrQoZ5stGQ8mu42OAy1NfkD
Jla0bea8dqe8PmtpZL7W/hord0uVwnrAbM1TGkT9QaISQKa7i+87X5S+UJfT
2mJqFtGRvPphsgMo/TGukjXk+YlYobxYk8wY2nhI/mujHBOSpHm6SKVGXEXB
qlSAAvUstg6ZPWg14lY9tLg2UGW8cpKG6rguV6OJkOeZVCzNllpiKQFeKUo2
qWgVo7M4gIbIoC92FtVna5Q6i0u7qQy1YaNFTa0aA+3eb0V8QWaSV3OW42ao
CdVcXgbgjvBEtSu2h6qITMLjLAL+LEvLhWQTSStlD0QbMuQ1aCyx5Uu+BcPX
QtqUmI4ghGmXFPFLiTu0X5l7cPQS8wAUNr5cFyfU2oo4ccOpNDk4cqi+9EK9
ZpALVaNgXyQtUceMXCFGZOIeRefS4zGuDBeyEA+OSFmyPSDjzrQTNjw6ay5t
bmKYeJGCQj7iOmLYeWqaVxPMOPANSXzAlCr0lLI8TE4oKlqRKWecNJlte879
Jo40V83Hw4NKU/QxwuM33i/vp5nGNcZwh4uCNUi4Zqh9HGt+VDXJFtjFurKx
BLm2I6q8ODxDCQvGgVEJyCTJ0Rm51C9KjSVE6+MlmLXR9RRFGIcmKoNJZ06S
siocYKcRrBI0uRpN+SYYje1OnA2O+lVxUTN4hu6H4hrLjfWpTw5dWDynyVVR
MCyk9RNd8Ggc9pLkE+lWRcXVyN6DQmdRojFtloPaId4RuJG0QEKDYL7RbqYe
FGpVNZEUiu/u7fhMzTdsTE8olQ3jSvNS7dFaximHoQB5JzpEQwnnIvAhPtRR
ypmxYZFoepFOmq0nZMESyCdNzSz2YsrfeQn6/CTlqCqymdEfQW3JqmaogSlo
li9zrsDK/S3UIZRqvSxSTXz2Ycs3COSZZgslQYUGYxW3CQmtjQKeISIadX1E
nqxRVzaqcRASUTyRJmSHGw0n/jfMnOHMvaTMq/daQ7IRAatdNYwtDIgQ0g7X
5C90yyyx7HRxaEyM4xIUqwUpGv1wgVgXaFbHwWIzr6SHpF+3ZlP4brLoImXj
EebG4tEYluFjepnyTSa0broY87xir0OfMCFFUw6bMOVjh1D2UVa+UiZlRFWT
VVWpuqBrQ2WB9CRbSjQoLrom3LwsaFEEeut95Jg4jOqMKcSIa7e5mYZJ2JEl
zeztuzOnFEE2rragoPJFa6ROnrBbXNosm16Sa3RVO1a+kdpKkaoimQLlLMTG
GjebJOZcnEsPRFI9yUaKAW3ZNXJfrAwJw7LjhqqHwhYac7YctdhiuIRrzzSm
THQ0OjaaRdHvA+HHVTZ5X4XwbDVy4T6fEGOwrYljv1oMTb0NSOEmfpXTUM1Y
dES3EWuMvUbcZGeJXy22aru5KiFOpLNVl57NmXwXObVNqO3Nw8zC1dJ5c2xX
zHOwoawWoXRV3yCOAs5p81ZbAEbvgPZ6lvGf0NgmV8LLBlHZRH81kKddKXPz
fgxgjfnlJVn1ERX1Xrj2Asjua0tTt2WH1pLIVVH79q/wH3isZb20CH1+E5Ul
U8Mm9X30J4Usk+lWJ+poxyW1uvoKGCIFOpDbg/sXTkylQ7s5fUehbgKpOZsh
u7Ykz6RpB9ZoDp8kw4Z5mr9iJccL1GsNNBZgF82Vh5a9Lkr5e+iOBLCIFhI8
Ki2QIw9ZU+9hHz+Xo5XgAnmyWGSuo0qzSX0zUdccoxeew0KnfVvvLipP25UT
3G9gppBhX+1XXG9IO8kspi4Oro7sJRtkMZhmmpYV+yqkoicAjcAjF9ZQ+Vw6
UlKZPkR2AUa0HFyFcQ0oehpoSiXfsCEX8POER/RmkghWPRu2gPSPqxOHgnLo
twg8jnMgZzce/QOXGro48BtRiso6qK4t9SPlTnUVLGZhheXGhQe1jp+8ApiJ
LMmPS+Rp9JhPNpYgV9OrTOq8enq+kcoQWgcWH+qRKxWWiCKJ5xk2nh3z1ijD
2pIdNhfgnJo989W8k7an4td1ULb9QV3phiZq/387hf7/4BRSGStyqGip1V/h
VLHI9Z/tV5mDpq3561/VsdK+rV/TtzJOYj6vfrG008XS0emeEInad7nmepHA
svAofTsIBTn+s8u/skYOtymk/2hRHEvpsgHLtCYXy4xmirBNBobkgr7OWlqB
kxLL4qCyeDM+vNn0RHdSJ0/yj6hov2rQio4KBOH9Ki4TBWB2EWIPmwm9vpBC
ZIvkYAiTQVQiPmgYjggcGh6wgZIIiClanUhAe5XNlpUKG43qs2grQnGb+wTw
zm6knJkYubxNXVtcYEs7zPqFy2JdBoUpAi71irAJBq2dsj+dn1u1fVATgdo2
W26gLV/MET7EUDHAd+OgQlFBTCf/dmRs5jJMHRdM3r3Ta/gFTsNf6zP89fVW
W/5C6x/cNH+P+L+3SewwvP0aa7jTE/gQX+HX8NC13WiSIvK86Ud77tzg+6jH
e8NzZ91sMXFYm07SIU/ZPmPUkZHUF/xNYh0pKndZ5hyWxayykUJoGwF72yFo
XsDwnDJ3LUeCwYyrWSZ28jlX/Z5mk7xiUxyZb5hB0cw1m+1xGLdMbyiQCqSb
C3IDUT0en7Wl7iF+0cRZs/1M4xQdhy9S8koWcsaugO2SPCg7nZhaMcT1yAHk
7LJlM/EOcKWNhXrrPapU0hqH/VzCQDDQX+fV5BtQwSSjJvZyagxnmYkZUZXw
CdVBQAGYOZpRz2nDoiT+MX+V4+YvyiyTygyTbDYjlQO5Cln1gX67D8VsNQfy
u/s7+lzgg8rBJVtQV3M68p7ojLoBCl2jRFntE18VstFm9UI+vnlxjqtg+WUF
IESrIVrZURIrRbDisgHwKbNEPXM66nlKDV1E/pJIxMlVkU98gT4AXakcUjHW
lMrlGgSY/nTtA7tVU0T8ScP2uGuP94K2e3DIx0GB8H047i5v/mX1zb9CJMiv
LaTNweVfRtpHtxtU3bx3SxBtBHv/inV0UFYlrT7nUSjri1aEAqHDOqoZ44pm
4YUMLU2zK00stNdpjnGTFEZMLk04tr3kpVYfFD2I8x7Y5GWiqfHp0V5yimXc
zm/20GguryXSGU0aPgmVMeRITEEs08jm6fENTlZB711BtG4Ov1IrvzBxWFPo
FONTmS4SHa9Ql0prPA0eLzNasLGtwA3EXW3BrvS9L9+XJ8Z2Z6IeYNfpbIGO
1eY2dAfFBDRdjXqW4uOYNY8nqQOqizOXqhPhWLF13wSoALsxmYC1d63jTDix
J6NimQqOCNB5d7016YqGtDzaI4mkZJFiYo91eDBYAZZVSSvlSmP3o11TkrMM
dVH6HtN1a/2MdtsYp7S7h9g7pzPysLS0kTmdZesRJ+QT8BtQ+ulLxtvESA5n
+RBzEZTgQw5qbQZj3Ltootww+YGZlBZd1EmazH3oR/LWTql6qJ7BYLYXJGTj
MK2kKSnI3GHIe0/VHqegP9sZ6VzxWHUwe7ytMgzzdWdujpiyGZzTPrQhpl6U
daxrMhrCfeTF/TEfgHigkpecP9ftViFB1l6EOxz3HMel8zARCkZjxFcSKYxc
bDM/ST7mAmH5WRja3J9TFKEUrKaIRrA2R4vmieRyk8WGir5csP1UrzZR4iyb
clbCQlali0L8FxG3r+jFpigcCxuplBEON/bkMdkvbEoVNDUsYsI2HAqOwZpH
W190MngmzC3iE+F3cYG/+kQaPMol21+MO+bLRrN6XCGFbDCKWVpjxe47aQ61
laPapXFGxDS7SAE/YEC4aXlRitVQOglS8FDgPO6OKchlgTLBd9s9k1FF73qr
TOR3BwCIz6S7fW8UYjWuMZaN4oGU+q3QHojWSCYRTmUSNttfkhJDLjm49Nx5
jnryUitILckhWqQ2mRLzTOxaJev/yeHBuzdvDt++PHxp4oPS1qqo4MWiWAww
5l3FJMdLYrm+s7MGVh8oObpNUvdLWp0cOSfnqE+psVO4Ttws09iMumfBjkeq
aYYjCgWMghZaYVop0kmp018l8Zyb2JhRTH/B8ifmdap02++WE71bIrI1Yngi
Gya1EbiT2E6pAMIvaztx9jGeWQZJdnDfTstwP5VDtwejXcmHs9FUokDBfgHu
lzdaBDRvOCi4WC9ZXNnoRzmf9O5P+q7xXajXgNWwQgIuNuQ1/YC6vhJN8ehj
7zYFppBD1JTnZcEr1LulV0X+kcLpyIYrQ44aOppwOKLOqIIKwAovHYw4hc9v
hqUK3RJWYmIHo4UfbC18wXDhnrZMYij3TApfLH3p3Q68w5YAFMd6ZzaCcU6t
zUboxj5JTPhSK7oYgkzrS+16+cvKzXxxiZmv2Oxw9HdudjjabOmRdzc67Ohx
OO4kX3I54JwnGXeFE/exCSeRam+hmZ8Kshwrh6W44rRGFkfZtawOde+a5VID
Xe0exOLvfDgjZVfWkd+E1tDoniwcdEOCsSUkj3zeJ9lfOYAkfITVpMiY13pQ
PMu8/qB0h4ckuZGMTGlZ3sTQdj6I+H2WLVlSY9bjS8naDuXR3Ng3tTabqovu
5/oM6YJLCwSqwwtpnS4/iJ0SuVu5MCxa7wlWnCenRuK+oBEjUZhBo9eWepg6
WjG6CFvu78UYDp90Bq692oC0EB4qKaHVWqNqak0MRT8qr9EvDbmRt1qqk6k5
g2kK2cKp8AFXo1vThDF+j9DGl+wzjRk5lCO0YXSFyuu+T7WKhf1Gy8XoaEng
h2GP3v5OkM+xTyv46U3nUMZqvyhdkrTBWotQyuzpRG3QmRkUyNSMhBzCDFqJ
YkMza1pwIoQOm6ZrofWm5FY2Xw59s7UCTJgQfXxV3DtTkP/lPa0zu6Bz95El
6o3zeNdvJ3tfZ9gAvbr3unJYWDhNEJDlqnL/UY5JjzpzttptBjpKfJ2iZ3xE
E1UZ0OpxhGNqOY62znHVvHnebuOG2EYF69GFqxp4qgOoLfyJna42Olz8kVUg
+RTO3Ihwh2mpfA0KpLT6N1GrUxZwTCdtFJsAUaTrXEVVeaQ1s+VPPhVjquF2
hx8xOYEyT2amL4nK3cc/Hf7bsRqHPmhfJBJm4Asy35J0xNBACaukgIn2ULU2
9SNuqyUS8MQyuwSTVXABupj2/snnZCgQXo1DzvO/NUow8eEgmS8mxUxi3pTO
qdtHAo4lAcJ7ubLFh7wsFtIEsDSJLFHKQGhqhUdqOg5XGrk1z1KOnIoAhvL6
UGSdxOnGxHo3GkVFB3wQYOYrrZi6ZQlpxYBIe/9zHdq8tnYC7Cj0dSWCdLb/
kr7/Sg5tEGo7gfmQn3v92ff9dPuz16SFjkYtaRmv6TpZGb9r+VwIglyThUob
k7iH15GspB1F9PByZ5TpqAJIuLioAUo4prbMCDVLtna3fGEXUon4ov5gpKNj
Lx19+saW7IyqlmG22Wy2Ys05uvNdHcMeXgy9cY2k5PVDf6Qutlt3sHe/HZ7z
cTdjurz+r65ra370uf2Ri+f8BSugvxv1o+5+OTzXfjlq8fY4OWDv/AmZ/A7G
x+P914d9uHK98DKvlsWijYOjwRhew9jKjVGvz79s9fiVsOjv9eV/6oJ9GGuf
x9q372K30GjZKm2w1PCYejqj6Sh5Ha06iZf9awHmq+B+8csPIy3xz50Au/fn
qyw7/vBXvbwGyZo41v2yYAjKX4Qi/ZNxjB4xwOKXBXzm/XH/BNDLFwXY2O+1
MSxeNiPaY49lD1v2rwcYndoveFlB4rfYBa97APYFGNZa9sHv7112xBc7KH4o
Y8dMpcVClD9yAqgqY4HDdHai5NLupr2Bdn/lgNygyDCimnivwUG65CAHEQoZ
hV2iioIPBo3UReW2OMvAS7FEM6nIJZFL8XlTtoGvEU850dKNRtpUdsXVU7eZ
IY+YmybleeiHHiwdMEmUh9PljPEw2W/CRMgt7UivgpH9XWLBZKEBO4ihIWts
AWVfgCJxTvH3FJrv2Httm2dLpLj0Fwu12KRoRYAkQdElpn2eVnANsafd+DDm
9pnioJB3C2yCZtu3rgWdfx0xWUSigKikZoFuSk7AyGs09ZVY3x0fvvWBv0e1
Ou7PKbpCS8lp/zYxoKFmKR13sWDpyhsX+B5lKZoASYjcUL3wBX5tLKDAzqtC
4nxV2zPp0efZTSHHzPkzMwWRdNYtTQmD2nuUfKKlXYP3IjJgyTnlI8jkTK7T
vK7MxcbleADTqQr0xdBEnRwleNp57+Sc89DtnpQ6mNb04oKK6Um7rVaVcK07
7mDrE0OVHpl+rf8YymMqqPAYDJH/+Pf/u6ILhu5mn2lsTKAt+jlEidXkeYDq
gUK6JE9RHygY6mTcqIfe6rJhLwX33MpCT5rIsnxidtNJeVzSTXtMkkc3AWoC
xXEZZUOF7baSk/1G9xJy+vHafZMNpUS+n0vo0YVal/Cwq64sKk9/TD80PJYL
ze2hVmsTidM9vzGhHbxAbyGzbRaQx8uekcyTodbvJw1JEAoX2+1sDVvB1+Br
6gL05gt7X91BST1MTSM2U8oyOvP/HDBH0Bt7kMXQV3RU+O/3viKYH9qc7D6O
ExgWJ9JxFwH05lLSEiOLEbtY9VdlNVQYUB7HxsixpI2zPRZNbBxoGfKbe07j
1Mk0v8G40AMSvpDG375cigk29KULwqCUlSXsTrvQtIvnbcTdW/AknLcqsAlE
Wq81jQzABbSSEcpRZ53DL9PKJHqGrrm+3Efsp/OJlkznMZE2SGMb+TTZ6nls
x32aggM+QIGDBCqyh2tBcZjfcCCpXuSPpiJSm0pWh29T3J16SqWGrqJaB0KL
w2mOt346OiYUG3MhJQxPp6slVmG9LjZJvh2xl1dmFoawD23Z3Ew4m8gERqr3
Ii67QEIxQBXQVRPj7yyAm3orDWzCuXHcq9IiS9PLqvXHIunFFm+2Xiptyqfw
7MyZ1euHtzokGt/BfWNHZINsRGax0KeIE2x1HRJgYSUBdozGVd9B8vsriHcj
j5AmWy5tgYwCNVQc27dBPhLvv+yqcBeXdLC9hLxPR32qEh4UkuFN14eKJPlZ
rveQW4ixSpKyI98KV3HAUXsu02PbAEFDjBoHTYEy2lmJ0oC1PQGSVwZRU2Bo
UZGHocj+L0KRBlb8V7GV/lJj6de0ln4tc2mg+tx+QA6XyLmv4Usksw9kDe1L
Deuf5e2PBQUN6j3INvPQZfN/OmyA1uqVtNoMdOz8n/za5S75Jdueg43lrzHv
GF67zryjV8ajtvYmOPGJsEHWMDU07pE2fEw8l8swkb3qs/cBdWsEjnZSeUdt
lIeLHZz22yF5tOf5OwofhvsDkCQVWfi+9AtAceS62W4+lEbpIPRfJoa0GbOF
6K/izaad6n8Z9vxLuPP29t+BO3fUCPivzqARDr+UQfe7OXTrtv1vHv0/iUeH
47Vs2jK+h/NoxL7/Zjx6e7sfQ8HuYA2PjhnTOjZt7k3EqdF4cCAlNbqzFD59
oxWaYguBZ9VSo8pkjKhKh/X7pEIaMKYiLMfZ+E8t4qIxu/S4LS8V5Ux0xgS3
KhidyuO7w6cNCznMN8yGLDNYAwyFrT0xUXFab5X3IkFPksMtjR2kSHIjHDfq
BsslXvKyK6aZzCYyft9xapUQJ4VgZAMPoFoxwG3igVk5mcmaEsDR+O0Y4EB1
V4+VAwC/u5B41ASN+FImN4kS+hvp8Bq0WYa5dpONd0zLD8uyKHvN1BqNFfNV
F7RMGTkSsFRmGOtFsnFWFMn+qrrpmaQYiX3Rwn4Xvtw5p1RgWo6jJHbpQxVq
QIfqMmk8D/kHfGKwdw+YApH5HNhWaCTj8TvFCpy+mYz0F8zQk5BKIYDKNgJF
D4rWhhPhx/ol6mxpLJkeqWOM5iK8lWZBhfqZOvC6JKMw8l1XKUKVyl+eXSzo
ZgPs0cuVcltowk/PmrXzoMb4Rk+1ooRNqXiNshxq5/oHc1Xmp/LWQ9iXeXBt
dYPGzz/JkO+kP0EjJvvxQ8fRHw+AP4+/JRvyX5IvHeLPjVZQf5EBTPDt4zCP
+Rl8L0/+eV/nXjfWvT8Kl0B1fv02XMt/1YHOQoAl04QDcWfWE/DoFSYAEhwe
ubUyfyPGt68pfpaMSnKStN5yIRqbcDuSZOMYYh/fzDv9RyK0Wf7jxqrk6f/i
SPCFA6D48kp6sYOk4tuye1FFSRD1vaekU2JzVkVVLMNqdZQCr8m3fal07jxt
Z70YcCoUydQphWkKfko+EX6JU9DyHGnsRqyJCGuZlMZgUhbA1tApP7ECSEZc
TzOvOQfYbhBf1oR5tJS8OdZgCsxeNNkF+DA59otQFdLHdztsJk2SGVwi0qOa
IecVjgCf3TzB1NoQr6GQVKWfin5Ofbs4RymYXHMIOT+xsVqTLspQP7xdaTYO
wNAad7a0nb6lPmas9OiND+TaW4XieI1mrgBKyl/zM7NHmvi6icXpDIatEyle
G0I6vGNcU328P9zXaJdyCnEqGMen6Q40Y7dFAikHHt8GPHPNFO4YUCLLKI4m
DQyUYvW5L2XstOKdeND9nJpEwXRX8tdJyl1MlwXV0EKcIj/hJZZs0pxewalE
cEoLZRkd3COXa4ZNKGp6DGguSG5Z4AdF6ffavG2hjkmDFcyXP8l5q1GvtWiz
EDdlGXDFtbx98+rwRMvBZSOEYnEecVSDWjjyqRWtQkd014L06EIoi+swcKxf
wzoEW48zUllIvw93oUnffG45Zj1qI/PcG7Qw5s741DHoDIP0Eyn3eZ6ZirVD
J+0G1Flo6rP/XHBF1Dt7yqIq2kGewrXzuSNaAUezmqUoDhM8Nep2kII+EwBd
YePGOMU+SuDPuV/JlaSm53EbTUML/LXRGh9arBZeD9BRiq1u6CF1YQ41RqkC
AjwDlJgumJbo2zCGzh5t1FeQxv4VWitZA3Li9huCZW01lbfuG6d4DsU1HhQe
XAVUFYRmUc+1uJNKFBlGrFq1ApGJOPJ1ifWZMUjzCcYfJmTUlOgbPnAT60kM
e8bdEzDNnWtRUaHTD5htxKdTSQUlw7roTS2He36TmIqcQ0Z+6kXquEUDKK51
SJOlIBPK1GxaLdZF9WGpeD8S3U5H1FbuUhyOZ7ofYtLJdXoDr8Mr9FQoN6gM
l83Yl3RwVEocR86Ykfg5i8V1Wk4rczW1AhE+Wa4qbENTX93I3jkdTThiLqmb
fjASxZoNYJWP8MFPy2LJYSahi4Wkz1C9WBJpuP8Df1rRK0uy7nJD+BBAqVWY
ycz4Uh5TlxD+zVmP2/3EHfBbPeb8muu7duQLvjLrBJZmWVlqoWCvAEqvp5Ru
+jLnUsOfvqGY0cGU//4cJdNi+KoOxVmqIYG3knTftKTYn5qrjGsdWdd+nM9o
Guw/cSp9n29Thb2UrAwHOC1wsNLJRbEqB1gcPA6SvUBVjM2DwazBPJYXJNvk
vDsXcpDYRUb2fKxMhQaK5gakn4+OgMRVX4e7PnSvrM2q9oUo03JSJRvEMNHt
1+MbUWGDjjhHkusfk9B+dvTm8I/jo7M+OT0AmUQr9BjMfhrNc427+vjN2nRr
wAkuFcQCv7+VkrALc4b4YSsrteEsjaJ9tI2WZ8dFMNfTbk3qNw0iXuHjQF3r
nnHJTRn45PBffzzEMtucSMzsv320TipCSLlmpowioxEF4BrMvjMflWDmC+2L
YuE3tm6NI8CyRsvWpfXzS9J2fWWyxs28HKaKkzpue8RJ3Xq6XAKKDqCvdXYA
k2Y3JpHtzlxEMvzfk63IxSjv0mg/+H+t/7m9exSzhnudEXaUeO2YpMXo2P7i
rlFuyf+NRYA61sKW06S1/I5RUFNfrFm6/+r+Udb9VHDaqqfdM8o9p9H9mBnl
8VrgxT8d52ZGgX+/Pjo9A7JwNwbd+uvqH2ut5fHD1vJ43Vp0pnLywQPR/vDn
4kq+94z4KOTp6Ae/kZSq/y5ndHJ4evzu7cv7zuh4fHJGNP4fckbNtDT57AmK
RB2JhmvO6N7kti+6jWshfs8oETH6Hr8hOCaNRLh7qFT88xjhyP/cBfF4FGVg
TNKYF93KP0n88T1rQeB6nwJ9yf+gURBOyn710B2ZUewEd+/onlHWP3PvPeoY
pXWTonvkK37YU31MY9gpvr/1JWv01Qfco9Z+WjdpzT2KYGhHEYKXxbxkPa3L
6q5R7IN3jtLx/K1iHPo/ZJ3tUcwN8RAJGzM4Z0b50BoF/k++U4v/4YXb5jbv
hG4YKJ72tiF1wEl7Sa110o2fMHvr6+613Ce1dU3Shu4v+okuzC8aZevN6Wsq
TIgKzxIk26o7UIQ1S1vziUNF3tylZsVZp6J9cognpnVh3Vsc6kBSGw6ilqXO
nVLdMmkwxj3HUY31RcD0fZx3JZ2gpZty4TTSgKs9UqgAunS4LiCX90SzmBlG
+0NTwEKqzRmorKjWyJBAgmP2VJ/mf8saiwYdfL6ssECG6MVxd+/QZt3GJWgl
Vhxu483xqTeP+agKBiRDMSPVRizScWEN74en6AQuOkSb6NTRNcxltDNM/phj
r+aajD6AA1QxlH01auFPp8VS87aCLVT3TZ26TONV3N7xm7MfsfAOek3mtn8O
n2uyz56yFfdT5DVaVTI0+dMufr6zjX0MKxjl1cSXHdaKlgBIAVJUEky/Do4n
MntUAn+1v2uD9ExbOEXVPCdl4dvDsvqO9bWYljXQvYE6IQblVEM8mmivA0yL
TK3z4objqkzYgLeOLefemuu6411C+qq4HLznhSKOliWuHVvQ+gJLpvMo2z+0
eLL2BretsW1dNkety7QCty3/fZ4tsotcKv2103ErznVu1+flbh2UrNTeUN5s
0l5p1luZYSe0Vt/gUOnLBsAywbctHH1Bs//49/+nLorkfFXd/Me//7/NSNzg
hBV7agwfMtp/nHCtba5W7NuceT9iKJ7a7agzYNNus8HD8zp/n13nVWa6RHNM
rI+w42bYJhyt6gCyLwpP14vsF1FHGdMTXq+xtwVR2jka5bUOpa4yh5VfALZm
iwk2qGOjoK5BLIHVFaD2YEYmdpOQzeFqbPIEdMIkaypVhtHksc+3A5HYuCdl
CxU51ZvVgURyt31uN/lKJpPVMl1MfIlzqSl3vkJPCwLhiZAKLHpGqZR/tGav
+HEemkLuUiloG9bRSGbz69Fk0vMbslkgzpmSddibuEav6VWWl36M63wxpSE8
PUznxYpjCXktvI7IYNc3+2gulUBe3Qtzmxg/ycqazIpYeAJrURVTDAdI6QaE
JFOEq3QeoMbL3IQJeQq2M9RDxANvLIncOj4cEBAzRxvdhIk3LGZwDuNd51MY
D22YaLoUBDMbr9ixUYdgRRr23BbjOKeWySn2pU3Gx0dCzqS5UcSDZB+etsQm
bmYBx60S1XgpPn3TVX46cAHBBYptv1xJaQW40jPkVlgwGhFZLNBmWO3AwBP2
qSo310nNudlvYpmU761JlGgWf8kXN190FhChiYhZWsOrBoHy2tNkerNI59i1
inukegIB3B2TgG35VKzUV/m6FVwCeGAcQ1PvgaXuUmmliOPzZrWC4wDrRXMD
S9yyiZGJd9fRc9YmO8U1V22QL8mbhItUGjxDqckuCwnAAMNgBiXVmzz449uX
ONrJ2Zmir992hzg81jaoQ5CE9eQagbsw6VXBpeJYOlJgGSSJm2QlKyAaWqTR
IAyh9hydL0GAyWvf6AcEhkFdDLDiekOm9YTmCOW1RUY2+tyL0zNqUWrKOCp8
frg5L3O0CxFGwDu7v0vGZ6enp1Kj+ziqty7XxJdbN43b/DN6ewJtwGVJF8S4
nZbw/grEO+pBii4R2siFtDwWnggwX7XiWXxgse3OnE19PNA0A/BMqXW8gSAq
qvmESBq2RryBUy3m3s0Qo+Saaj3JnPqmcmtsgLFInMJJjbMEmVdZapNWpccZ
xlfjcFNRz6RdGiMMEGvQAPqqjcxYwsXu78UM6DcirfmT3ZBPOH9gyv7/6c+r
quZD9k4p3QQ1J/M1W1lfgenOgTeJU1z7Nnjxwhb+D93AZc8bGvFOW5eQtIrW
MQWlh6vkYxnpOBLKe4p9c9AbP7EX+2Gb2JCCG9IjTlOAm0GbcKNE1qNZMX5E
KuFo52/uUcAUV2SmnHmxrJhbhSI55irCVq2rfDi5OJRC0Jnp4OfZQihW3aiT
j9fxIu5qkixzDM5RN+kUEfIy7GdgN0O1APx5+n7HhPFrHocb/D0F0e8lJ6uZ
ciOYUsVrmtXSsXXzkte1KeIH0Y4osITcxJVatdf1tJis8MWhi+lJXhk+n0fX
GUTqxeqjLcQQz/7pkxfYyTYyLMpL31ngoLOlwqdvWh0VnHvpsYi87920zFY4
x8lDxXBOjrAifSrWEbq/Hkba8zwl/Tzm9Bg4ZxrACNppNCrzlmsRjpC7ePkg
VAFHkclVOX6TLoCCVKYBfXp5WWaXqn3QBoMageG0VJpImk2ZtB69gctVPUwS
pw10VDltwoQ7WTTMOH0LjLBHqt0e6gWX2QC0uYysLbLfaca5DVQvudUhIzBP
59lN8EJrcmqwg6BQRMr75CpFLRumgmVOhm68pvuGrIIigNK4Ow8KnmKMoDOp
sgwj7Bzp+8jpuXkLIVDfwLAPfGOBT+AwWE0HtJp+ktUTLmfdsYg2T0cJg5rz
4GUIIrQESrsQ5NtOIcGzvi44nreUdJt+4AKLIrlcAWxgpkzCcmrT74vC5yjA
dppXGK2HKMF8BAbdkFF7ASOrK+pP52Mazou6noEOPXnf99E8FbaQSstpB94Q
yOeZgNiZc4W9LC6QKGEUZ5mDapGHOte+tZZPaglavZs0M2riblxiiJwvM06A
M3KKLVGWWDCfaZQYyyar5Szr3A3QsvfwzRF3AMSYFC9WJhuvj8a9OHuHonJt
4W+tx6ek7+TVwdPt3aefPxPbLGYftKMhB50PpTeci6DoNavIQBnjjITkcBgK
hewRiXDSsWb9Dnkm2zjQF5YrtGRMA3Aqgr4jBrBa0JVsgypA6tOndwAr34Q9
BgoqYOGaXrCIpZcqYAFTCS5mhWB2HXtJdcZKHm9SJ2alKNLKYUklPucvKiI/
CFZozGEyOSm0eKJlh8nRRV9y/jOJODs6PHvl9IiQ+AgpauzId6n1zIAvqlhO
ndYG1BVJUj8mDV4X5fsmvplFNboA4+mLJI+XD5cXNRs0ywt6tvsG7dorEo5a
pvlKvgHmewr0UPrJcbRTy+qqU0/Km2VdXJbp8goTKmQI52kWCqVXGesByDnR
E4GxpsbUQM321g20gXbuy5JoNnY/Qc40kbh1Eu+mzKv4AdaWPI+jIHD4eiCF
FiRMFF7uWeXn6BimA0H/7PUp0/aQQrK7tf2cU0i44ahR9HSJ0uBXAf9bRxBG
I2k6G5CR58yzuWONNt84PTk77vEc289GI7SQViTpAiuZUssU50PTKRYy2jtA
MsrgP1wQ+OS+/UClJN0hhipyxzpM24UJKSzW6tZMsV5s7qDHg+iQBzdLNo4y
cvkFwJ9Wbo3XJQNofaHNq/znlIRakirI4FuJmK8ChmSBIo1AnQ3OEj4dFBcD
VQelNAaF2zltlcAzLgqPWl2zY43GBft3eBC0Cy+KYin6Buoy0uWvwqDuy7T0
DVP80Zrkl7jwJ8gp76tQedTliHHT1YSIcGgb3sySgNXCkGq5pOzVK2wlrflS
WBjPTx51auAIb2D1FzkZDc59Sg0VkDhWShBKksY17zBJKSXTIYahI2cK6bIo
GZjKdxzNyRdrwu0Ea6wnq0TVKzm2pUhWr5ZDsxAOiVcDoNry0UBriqw0Ggqh
Uu8SOyzcCQ78pCvAaVYEVoo6DwbSWqucsgCR13Yprcuveeq2BGvqC4hSPT7V
3ZMUFmTqJX97gTr+txR9Cs9NrvKMeDxKZJdFisHXIeeNdoasAqstDthMG6JL
PTfzFD7Kr69MAkfflk2RMipxQwDELWfR1qr1BqCscnuXlBBAQDuREODkHYmI
aKym+9cOaY+LSHslE62snNVJV9B5KRm4HLI2pFkJig6wCGWOH/G0OB4WmQqW
xUlJD4m5wRz7WwJl6HcWndXCRGLkn4UixJRqkS8uCinCy1Zz2q1/JNrneQaY
zZ11MOYWvkJ9gIQS3KfWIaQRiPGj9wgf/yGc8BtORHPjiGKTt6xKNvAMq542
WQ0x53h/yE1MIg0iId2gG2fy6fT6si/L39bu7CalLj50uXF7Xev2Yv/P2HnQ
fYnpFgKbch3XkCQWc8uRstoaR6Ivg1xH/tKQFEdWQ+oQScBNSxZzfutIE8K7
3chU5HMXNz7+qmVrpbfjBhUoBVCnXE3aEd4PBrzEVrYiJe2wV5EQ+dwAr2Bt
Kkw9dL9bAY8mA+JCy99Q4YZ4DZGFkwpLCO7ACijUwvmog83nT/Eav+TQhgVi
7CxEEPTj7K9AypypQL2hgruUku5KkDHlritllS6kXfQkiQ9UaWZgKuZ5WMwA
OjNq+NnBcuWMC9zXNIcXV5LWb7CyElsewSTij6I9WMMFTuuT19ZVjNWgBJuy
auiBQ6ZK5jJjuwB0I+kpFqu8/eiKmquj4ib4yZSDyaU7PHj5w6Hc9lCR3jSG
ZhxTY3nKJrWLRrEPdnaDtHCeU9KC2tyxhlSdkVmaL5/vokcrvBEXYriY0hSw
vpEUyxmG0WQfaxcgp1J7Qe5WqZ0liIPJWRUFiay0tlqzJqiUpcEE7FCqFqU5
aRfl5LZnLKgJP2RzPNt0KQxFDXoCXZPlAWN+WznPKLT+G6XGBUIXJ8k1MDWu
p55XLgSIYOzC0mQ4ivsRYx9KTFbgfoTuBw3pyL0JiciUhAisFhg0IK3YzKqE
+olu73MdjegY+nglNUbTcKuttrCL0SsFgLXPyAAUIJ9QXTk2mYGivGC4tRk7
UjSYpkwvNaMaNpYvc7GfyrRsLYjAH8FcCK1rxoyInOujIK6yFRvqKqWuNKV0
0mTdnE+VpTUUjBnkXt7HIxLMa+YMV4xyXeFkHP9FqYUcKpapaNjVvOEoHAGA
tmCbIRn7YFgYSSOVfPfpvsMgIqEi0kWb3Va0bo1pol3StPoi9YgG/Sa/5F7Z
TAfZH85mSHwe5YyE3ZCnXk50jB1ImyaktUj+bQNyuFzyxZE5LNpGX51CaHQt
TMEbtRKi8Z0NDqkgC9fqDomVGJinf4H6f1RVKy0anof3+DXVqkxepjcZvR2f
YQED0FquATbwKxDEjyC09ElBWlUsgirfqG4q2CowrqOXp1WPt0EoWrGlSrJa
QzqkwNxlQbNFO5uaK1VhrlAsmEg7Z4z+gbuLZjtqA4FljDT80tk9IHW7yuls
kbSBpDwrbtgaxM52KVXkpSP2xaOFWQ9+nXJrpvFqtuiJecXeVDS8YeUeKQm0
ubMdBSE+7Yk1mS4b32CUkbA4e811NXIq3g8nACKe0yPAdutkGvGdQyTkMAKx
JgHrMeI+2Pyx+wKNmd4oFbkyBpQqBId5xR1MuA41t4vHETaAMoaqMzDuzZyj
AHpG9hzE+c2mRJOm2gFp0hbWetLUAJcmLrCNdlYpAyJToDlTEaBQnmfkJKB5
C4hKX7DNZ2S+ZHvIs2fbZtNV8uPLY7SwpMsKq+1rWAdC+qxMMT88nfmQDAlA
BYyvgg2N6S4Ok9lhwr3B8U4Pzo7VILM7QmHw1Qo5iYvsqZV6MsngJ2xK+lLy
NNYUKl5dM6eXstR45ZFUSWV6jTCyUMxb4oE3FX5mo+JRxDB4ChMjpQQ+PUeV
2qdTezbDwxI6ictYKHOQGWrAExiikh4VFOkVzMpBl/aDC434QP1l4WVM3R/j
1XOgfgIcazV8UjTBDJZWYn/nG1aGjKk8+wibVQ3QWNBXvjZIvd7pCbAZ+9qj
ZMkRJHv+9PkOIJmmc8cWePLCeSSdo+kQWD/Q0OXK93wJEc0Te7AsDFbYOryW
1uGm+ClFZ9Er1FN+iTmsCxKHrKGZ6P7LvHyffABc/2F1WfSTt7A2kEey5KSY
F8kbEBMW8Om7OSD4W6zJC9Ltm+IqxciO/WI1SacgcAP9yufIQ19lJRwTPD4D
pQBjm4EkYAk/Ku3wuwILtbyC569WpbQ82c+uJsjzgT6+T29SQTIss9cMB45a
uXrSfKnqmYh63v4/rkRifCsq2liFZ+BCMH4PVRKxBMJvuaIJYgmV762Cl0KD
2BLPjqJwFW++RSWP42JpScREGQdGW6T0sVPIg19xAiGHeM5lg30zBLFT8Qqo
jIMyARHpCE60hFcii+pmZUc3IjBgMRluCUsfi0+pa0gazb99WRZoLhDg+3X7
8D5aAJrRCNhyW6MKQr5OLiGzL7myuGTHpER0ey8K+fqwkAx7/z1lU2Ib622t
ipWfPulZaBmaYHGFhZc3oSQ1VuWWRQ6waRbyAW/khS/Dua+F7XqQrY2ONoz+
xXBnCOKKxho/omHUbfCIVHcMpwXg3yZ/IMSI0mb8qlBXj39uk9PIMYeZNbd7
zXycvfZHd325d0tdaEebcGiXl4yWPn0nEDUtP8Tr+DPizUtBm7/gOj7tfdMF
fU2j0ep16o9aC3zMnvleClQWCcA3OYQ3i3IvOZ6R6ZFswXAJG0sQ5TsEtWgD
WbJzwziYbjMBSTCuaWRkBLVujwZYIlnQivmdMQTvDM5zNsSHRs7MzrXMjFAQ
sg96S3LEXYfJPddO9FW+dt/qIH/gCapvA1L6SKBubOUiBhIJpcPIOvkamRJI
tVRkrTmlRO9C1OcLkFbyymQx+HsTiVtoyrloe3ci4V4LKz0WbsqoySb8GCxt
oaG88+MiFR5B78NLo2SQjOCnIyMuwlwBTYS5Teijo+nvjaksNjZPrEpG+Oxo
V+qPCx+U0DV7aCHPIz6JE60xvyxm+QQYphKtHVMJmHlab/hQ5sDMbedpRDYf
SclbNF5Vj8LK4LVHgajwQ9WjdrEfshO9Oz4jEYwmbPLNxh1pjvngS9LFTsRI
HxgKcR/QluoWS0kilnLfWngyy2jumAMFYQzKWWJpGwokxXBR6my9640/cDag
j8khUF9t5izNRQDmNznKbfLSNHh/0M8toJCibbhBnQznAZf8/p+uV4hhSUfy
zXhxpgK/fKLN9Uot+fVEYgDJhywVFXEorXl0K4V3eRg4Bd6hTjhqTUgWzvDJ
vxT5wpop76i7pq8Ym2gAqU641Zowqlp6K8nJ60bvPMNWhVc74XZrQiwJZj45
VCM9Gs7VrydRKlw5rXtCNvW3d7jTmhB7JdhPPCo3O0rcvUPqINEx4W5rwmjV
t9YV6PtTgJIx5NrYNkE0nlC8u60Jn7YmxGBz88mZVBqiIHRRUlDA1/aAHC7s
G1P4CeHxzh0+a02ouR7yydj7AExEhFhgNrKq9wSl942q1wSp9yg0Jnze3mEo
qc9kg33xZoqkOUfXGdruKXbCF60JKSg8fCItufUm+oDytT8yIQ7TdYajzejZ
Zgnp5j3Uee/4UUojV7A14Sh6Fj49/Ldj+8lhFMboo+EpFJ2dOuTtak0Iw3Qh
zfeNCYMUpZ9gUlD5QYy4FyKiNHldNEbHpq24FXM8L3C1hjS6QeJlo2bVXd+9
UvbyD5KRjhb+CiWdckpLhR6Y3Ftm26NtI9XaxkjhySB29k2DHUwtFbmJD//R
mGp+o0nDFLB/NEySH6vs/yvt2lYbOYLo+3yF2LzEIBlfElhDXhJ7TUzI2rBK
IBAws5K8TCJphEYKFkn+PV2nLl3d05Ic+yWEXqump6cv1VXnnHLOvQn9N1Hr
zkks9g6I//GiFtvK7kOm06dBlZ7npslO57oldXQo2OGYKTrjHRnRq1dSmSyu
FLXz//qTZXsbFvlH+PA9bnW682bFIXxpU3/9R8Y69xbD5TKci6PQO+/KQcLv
lG9K+OM1dqfLEblyXxOVYVHPT/ieCXUwEa7bxkWoYFLAymP/dJTPrJaQja/A
eswCUST3zHU3qSnWFTMgssztBrLnY56Sy4lEdcHP1B1sVuNDHtgQnXNpXuUe
r/EFzmT6JxzmOMNzHijBPhjPnjfJ47mZEu/wbUo9dHNB4ia8FwNPcB2+5vmV
lLi1Zl6v0ggZvW3YRfGnJYMXRYPfnl/0DVLjMYM8xfrb+YE9PTk1MoOyexdm
eX/7NvBCchPLFyNuiHg8agoTPy3CQJYZubOjS3f4mNCMp4iycowmmuxMw/B/
f0W/f1ysNpPVv3KhJUXy5bR5pg3sTpFlJIqZkzwoLB0zQJnhmAEY8tIkEtKG
85rTTnARUtm57sINjUmIhiO2ZeqxuKjmXQiYOtAYIDwkclnnKQd9dPh/TlBc
XVxd0tZtqIjPM9YdlkU8dWOn4VdErih2OYd2sKYykOa25KzQ6fdQf1gU/0F/
akmp9ayyj4lEHYBVj+HLPFLC5ZGyqWEMBHzbpZtZ4RH0ntq3oQTXab/7vBss
ObYIcHETudfN2klXOoZYTEaHg/L7cKf5g8AdNjqDuRt/ZbcOoly/PJwq7NA0
5hcnlNCEDtmVgTljkTUKMI5YfEVS06iqMOuQaHBzHh+aCKSKhIlMIlaLaFgl
dGf6y0thKTAIEVBlo+Mipa56N3S+UGoJMrzqChUkh5Fco3dq15VcMReL7dIg
/At6uqwTnqmCTBWUBYgaQpS30o3T0+oHYE5660H5TWThEmquUvlKXIm6Sp6P
0UFGfbagbH+JQAM4cL3aWK8oSwGElhzivNjSGYYTTYPUvWNgfP2QN/n7YOHk
KAdJygfZsbMNEZDb7Xw+uiHW0HPakd2sy57db8r7RnESTeffrxtO6L7eGtMX
1BPrVvVEVE2/0fqD0drv3w3Oz87ea13CNcsqeWs3pr7w5O/8/wgdcO5CUWHv
6jVmfXuIsgWAgM3ZJyFrIy/xwE2cxaKFUrZ2v2ZcC84t2xvK47ZsDwwbrH1K
4xud/RQwJooCUmYibXq4+WWPtVuIx8si8B15Vd+u+wtrr7XjM+TD9UdLEh7r
23FrIh8RNnVSvj9szeHnC3sFxi34Bhr3kbArbWuFQXpJ30DLpimtIl67t7zp
7br+Epnah9/0BfPtt49UoqCdeizwq639WM+fGFHkUY2vs0byfAX/QJ1M75c4
J8HwWOQmEs6AEfVzYZlHz0pSlMGT0frG5o/AVwz/dT7JMEHiD3Xi0sbxV0vh
OSuyR4Jv1Fpz6QVjwII+pcRkyXlHTQ5VB6qUT44Z6Zw/lvJhN2JB70t6WYIi
QoBZlDAKlMtD55h+DHbWSu2j/FTbf44dPrqK7TjHfk1GsNeH8pIotvNOkI3t
m6xh7fqP8iZrOMfWM2O8vtBaq9X1UmsfnlcEpRNARe9XIOux5zs2wkBofyLK
Tno8+tXWm/0xDZo79HuW3Thle4gXSCC/iVbjWRBmLjq5meQDOJ94nACiDIkM
V9KH3ylDBj8YwmByt3QugB3InjFZGZXPbQhdfvJ6Vps+LtZlRGrhxMk7Ab8Y
S3qH/jhah0lIid6iiDa4qVAJh0VfNdxD7iLpyavNIHWwyIKfWryd0gEnw4HQ
LN17sbLSNOZAx82CYJvh+94n1UdNuYqhsdAKNYkw12GFBtIWyko1zEtlSjqi
YXejm9OaGLWjZjJZfxlFfF20Q9fTTzQb3GhNW6fNCFUXXFEYxgw4KM/5youj
eOmPXnBqMPiZLilVQllmrGuXzJfSdYSlp7pIVZ3vTL6marcbhv/L7MFXFuke
U9mhuwf5JvV22rT4DDTSrcjVEWwar9Kl9NQ41uonMRvDqj9J1T2eyb5Qlk3B
yhlxAwzUcfPnjCs8wBbkG032Kd7Tc+oP1alvGUrJ8E7etLH24o/4pMO5xdom
oRvE7fbDz+F3jQwIZFVIrvnqEKkKiD7FKEaZze7eE/D7btPK2W2kV63DSuY5
sI2zsmbm6JiiCX4tDlzGmDcf7IQiFxt29GB2Wr0jbahwX28272xxxL7SLxyh
3iZcs2QBBHdLr1yA6z+jAPNSPaYBAA==

-->

</rfc>
