<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.29 (Ruby 3.4.4) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-zaeschke-scion-quic-multipath-00" category="info" submissionType="IRTF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.29.0 -->
  <front>
    <title abbrev="SCION-QUIC-MP">Guidelines for QUIC Multipath over SCION</title>
    <seriesInfo name="Internet-Draft" value="draft-zaeschke-scion-quic-multipath-00"/>
    <author initials="J." surname="van Bommel" fullname="Jelte van Bommel">
      <organization>ETH Zurich</organization>
      <address>
        <email>jelte.vanbommel@inf.ethz.ch</email>
      </address>
    </author>
    <author initials="F." surname="Wirz" fullname="Francois Wirz">
      <organization>ETH Zurich</organization>
      <address>
        <email>wirzf@inf.ethz.ch</email>
      </address>
    </author>
    <author initials="T." surname="Zaeschke" fullname="Tilmann Zaeschke" role="editor">
      <organization>ETH Zurich</organization>
      <address>
        <email>tilmann.zaeschke@inf.ethz.ch</email>
      </address>
    </author>
    <date year="2025" month="July" day="01"/>
    <area>IRTF</area>
    <workgroup>PANRG</workgroup>
    <keyword>SCION</keyword>
    <keyword>QUIC</keyword>
    <keyword>multipath</keyword>
    <abstract>
      <?line 96?>
<t>This document provides informational guidance for using the
Multipath Extension for QUIC with the SCION networking technology.</t>
      <t>SCION is an inter-domain routing protocol that supports path-aware
multi-path networking.
The multiple paths and their associated path information offered
by SCION provide opportunities as well as challenges for
combining QUIC-MP with SCION.</t>
      <t>This document explores various aspects of this combination, such as
algorithms for congestion control, RTT estimation, and general
application scenarios.
In addition, it provides techniques and guidance to maintain the security
of QUIC-MP and SCION,
and to leverage path-aware multi-path networking with QUIC-MP.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://netsec-ethz.github.io/scion-quic-multipath_I-D/draft-zaeschke-scion-quic-multipath.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-zaeschke-scion-quic-multipath/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        WG Working Group mailing list (<eref target="mailto:panrg@irtf.org"/>),
        which is archived at <eref target="https://datatracker.ietf.org/rg/panrg"/>.
        Subscribe at <eref target="https://www.ietf.org/mailman/listinfo/panrg/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/netsec-ethz/scion-quic-multipath_I-D"/>.</t>
    </note>
  </front>
  <middle>
    <?line 113?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The Multipath Extension for QUIC <xref target="QUIC-MP"/>, is an extension for
the QUIC protocol that enables simultaneous usage of multiple
paths for a single QUIC connection.</t>
      <t>SCION (<xref target="SCION-CP"/>, <xref target="SCION-DP"/>) is an inter-domain routing protocol
that offers explicit path selection between two endpoints,
typically from a large selection of paths, where paths have detailed
information on traversed autonomous systems (ASes), links, router
interfaces, and other information.</t>
      <t>Despite their complementary goals, QUIC-MP and PANs have evolved
largely in isolation. QUIC-MP has been designed with traditional
IP-based routing in mind, where path changes are typically inferred
from endpoint address changes (i.e., 4-tuples), and where routing is
opaque to the transport layer.
In contrast, Path-Aware Networks (PANs), such as SCION, enable
informed path selection based on performance, disjointness,
policy, or security requirements.
This combination of QUIC-MP and SCION allows for optimizations, for
example, for congestion control, RTT estimation, failure recovery,
performance, and security.
However, the slightly different assumptions on endpoint addresses
(4-tuple + path ID vs 4-tuple + AS code + path) and path
lifecycles (path abandon vs expiry, etc.) can cause some pitfalls.</t>
      <t>The purpose of this document is to explore how QUIC-MP and SCION
can interoperate, how we can leverage the path awareness offered
by SCION, and suggestions on how to overcome challenges.</t>
      <t>This document
lists notable points when using QUIC-MP over SCION (<xref target="overview"/>),
looks at different usage scenarios (<xref target="categories"/>),
gives implementations considerations (<xref target="teccon"/>) for library
developers of SCION and QUIC-MP,
and discusses general security considerations
(<xref target="security-considerations"/>).</t>
      <t>While we provide guidelines for these areas, we do not
discuss concrete algorithms, APIs, QUIC-MP or SCION implementations,
or QUIC-MP user applications; these are considered out of scope.</t>
      <t>Some considerations are independent of multipathing and may be
directly applicable for using <xref target="QUIC-TRANSPORT"/> over SCION.</t>
    </section>
    <section anchor="terminology-and-conventions">
      <name>Terminology and Conventions</name>
      <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

<section anchor="terms">
        <name>Terminology</name>
        <t>We assume that the reader is familiar with the terminology used in
<xref target="QUIC-TRANSPORT"/> and <xref target="QUIC-MP"/>. We also draw on the terminology
of <xref target="PATH-VOCABULARY"/> and of SCION (<xref target="SCION-CP"/> and <xref target="SCION-DP"/>).
For ease of reference, we have included some definitions here, but
refer the reader to the references above for complete specifications
of the relevant terminology.</t>
        <t><strong>Autonomous System (AS)</strong>: An autonomous system is a network under
common administrative control.  For example, the network of an
Internet service provider or organization can constitute an AS.</t>
        <t><strong>Endpoint</strong>: An endpoint is the start or end of a path,
as defined in <xref target="PATH-VOCABULARY"/>.</t>
        <t><strong>Inter-AS Link</strong>: A direct link between two external interfaces of two
ASes.</t>
        <t><strong>Intra-AS Link</strong>: A direct link between two internal interfaces of
a single AS. A direct link may contain several internal hops.</t>
        <t><strong>Link</strong>: General term that refers to "inter-AS links" and "intra-AS
links".</t>
        <t><strong>Network Address</strong>:
In traditional IP networks, this refers to the tuple of address and
port of an endpoint.
In SCION, the network address consists of an <em>ISD-AS identifier</em> and
a <em>host address</em>, typically expressed as <tt>[ISD-AS, Host]</tt>.</t>
        <t><strong>Network Path</strong>: The network path is the sequence of network elements
between the two endpoints (e.g., ASes, interfaces, internal links).
In traditional IP networks, the network path is typically opaque to
the endpoints.</t>
        <t><strong>QUIC-MP Path</strong>: Consists of the network address at each
endpoint and a Path ID (see <xref target="QUIC-MP"/>). The Path ID allows having
multiple logical paths for the same set of network addresses.</t>
        <t><strong>Path Metadata</strong>: Path metadata is additional data that is available
to endpoints when they request a selection of paths to a destination.
Path metadata is authenticated by the owner of each link, but is
otherwise not verified. This data describes properties of
traversed ASes and links, such as their identity or MTU.</t>
        <t><strong>Metadata Extension</strong>:
SCION offers additional path metadata via extensions. The metadata
includes properties such as bandwidth and latency. The extension
is widely supported but not further discussed here as it is not specified
in <xref target="SCION-CP"/> or <xref target="SCION-DP"/>.</t>
      </section>
    </section>
    <section anchor="overview">
      <name>Overview of QUIC Multipath in Path-Aware Networks</name>
      <t>The Multipath Extension for QUIC (QUIC-MP) is primarily designed for
traditional IP networks, where each path is identified by a 4-tuple of
local and remote IP addresses and ports.
Routing is considered opaque to endpoints, and path changes are inferred
indirectly through changes in the 4-tuple. However, the
path between two endpoints may change unpredictably due to routing
dynamics, which is not captured by the 4-tuple.</t>
      <t>In SCION, endpoints can discover and select explicit network paths,
which are described at the level of ASes and inter-AS links, and have
associated metadata, such as the MTU.</t>
      <t>The different underlying assumptions of QUIC-MP and SCION result in
some mismatches, for instance:</t>
      <ul spacing="normal">
        <li>
          <t><strong>Endpoint Ambiguity</strong>: PANs such as SCION use composite addresses
(e.g., ISD-AS + Host), where the host can be an IP address from a
private IP range. This breaks the assumption that IP addresses
are unique in the current network.</t>
        </li>
        <li>
          <t><strong>Path Identity Mismatch</strong>: In QUIC-MP, paths are distinguished by
4-tuples and Path IDs. In SCION, two distinct physical paths may share
the same 4-tuple, rendering transport-layer path tracking incomplete.</t>
        </li>
        <li>
          <t><strong>Routing and Path Lifecycle</strong>: Paths in SCION can expire, be revoked,
or be reissued, even when 4-tuple information is unchanged.
This can interfere with RTT estimation, congestion control, and path
validation logic if not properly accounted for.</t>
        </li>
      </ul>
      <t>However, SCION also opens up opportunities for enhancing
multipath transport:</t>
      <ul spacing="normal">
        <li>
          <t><strong>Explicit path selection</strong> enables endpoints to choose disjoint
paths, i.e., paths that do not share links or segments, to improve
fault tolerance against link failures, or to increase aggregate
throughput.</t>
        </li>
        <li>
          <t><strong>Path metadata</strong> allows endpoints to prioritize paths with more
suitable properties. For instance, low-latency and low-hop-count
paths can be prioritized for RTT measurements, avoiding wasting
resources on probing paths with poorer characteristics. Or, path
overlap or disjointness can easily be determined and used for
congestion control.</t>
        </li>
        <li>
          <t><strong>Path-awareness</strong> allows congestion control and RTT
estimators to reset only when the underlying network path has actually
changed, something not reliably detectable in traditional IP networks,
where network path changes may occur due to routing, despite a
constant 4-tuple.</t>
        </li>
        <li>
          <t>The availability of <strong>stable network paths</strong> in PANs allows the
transport layer to distinguish between actual path changes and
transient network conditions, enabling more accurate RTT estimation
and congestion control.</t>
        </li>
      </ul>
    </section>
    <section anchor="categories">
      <name>Multipath Use Cases and Categorization</name>
      <t>This section categorizes common use cases for multipath transport and
highlights how PANs enhance each scenario. Many of these use cases can
be combined to meet complex application requirements.</t>
      <section anchor="fault-tolerance-and-availability">
        <name>Fault Tolerance and Availability</name>
        <t>Multipath transport can improve robustness against network failures in
several ways:</t>
        <ul spacing="normal">
          <li>
            <t>An endpoint can immediately send data over a predetermined backup
path if it suspects or obtains a network notification that a primary
path is faulty.</t>
          </li>
          <li>
            <t>In SCION, the network may send error messages that explicitly specify
the faulty link. This allows selecting a backup path that circumvents
the faulty link.</t>
          </li>
          <li>
            <t>By sending redundant traffic over multiple paths, an application can
maintain continuity even if one path becomes unavailable.</t>
          </li>
        </ul>
        <t>The use of backup paths or paths for redundant sending can be further
improved by analyzing paths for overlap and selecting disjoint paths.
This reduces the likelihood of multiple paths failing simultaneously.</t>
      </section>
      <section anchor="high-throughput">
        <name>High Throughput</name>
        <t>An application may aim to maximize the available bandwidth by spreading
traffic across multiple paths.
To optimize this, an application may:</t>
        <ul spacing="normal">
          <li>
            <t>Select multiple paths with maximum disjointness.</t>
          </li>
          <li>
            <t>Select multiple paths such that disjointness is limited to
sub-paths that are expected to have high bandwidth available.</t>
          </li>
          <li>
            <t>When congestion is detected, switch over entirely, or shift
parts of traffic to an underutilized disjoint path to preserve the
throughput.</t>
          </li>
        </ul>
      </section>
      <section anchor="low-latency">
        <name>Low Latency</name>
        <t>Latency-sensitive applications benefit from selecting the fastest
available path at any moment. In PANs, endpoints may estimate latency
from explicit metadata or infer it from probing. Because in PANs paths
are stable and explicitly selectable, the transport layer can maintain
multiple low-latency options in parallel, and either transmit in
parallel, or switch traffic to a different path once the latency
starts to fluctuate.</t>
        <t>Latency may be determined by RTT estimation, see <xref target="rtt"/>.</t>
        <t>For deadline sensitive applications, an algorithm as described in
<xref target="DMTP"/> may be useful.</t>
        <t>Instead of probing many paths at once, an implementation
should probe only the most promising paths (based on the metadata).
Probing many paths should also be avoided to avoid overloading
individual links, and it may effectively be limited (except traceroute)
by the available path IDs and connection IDs, see
<xref section="7.2" sectionFormat="of" target="QUIC-MP"/>.</t>
      </section>
      <section anchor="policy-driven-routing-and-routing-constraints">
        <name>Policy-Driven Routing and Routing Constraints</name>
        <t>Some applications or deployments may wish to avoid routing traffic
through certain ASes, e.g. to ensure path diversity or to enforce
routing policies. SCION enables this by
making path selection explicit and verifiable.</t>
      </section>
      <section anchor="anonymity-and-traffic-obfuscation">
        <name>Anonymity and Traffic Obfuscation</name>
        <t>Multipath transport can be used to reduce the observability of traffic
by distributing it across multiple network paths. In PANs, endpoints
can explicitly select disjoint paths to minimize the risk that a single
AS observes the full traffic flow.</t>
        <t>Randomizing path selection and packet scheduling can help obscure
traffic patterns. However, traffic characteristics such as packet
timing, flow duration, or volume may still be linkable across paths.
Mechanisms such as probing should therefore be designed and used such
that it avoids creating identifiable patterns.</t>
      </section>
      <section anchor="sig">
        <name>Gateways and Proxies</name>
        <t>There are gateways and proxies (including VPN) that translate
SCION traffic to IP traffic and back.
These are a special case because they are not used together with a
QUIC(-MP) implementation, instead they are, and should be, oblivious
to QUIC traffic.</t>
        <t><strong>TODO</strong>
These, along with NATs, will be discussed in a future version of this
document.</t>
      </section>
    </section>
    <section anchor="teccon">
      <name>Technical Considerations</name>
      <t>Using QUIC or QUIC-MP over a PAN, such as SCION, changes some of the
underlying assumptions. This provides certain benefits, such as
additional information and control over paths, but also some challenges.</t>
      <section anchor="endpoint-identity">
        <name>Addressing</name>
        <t>SCION uses composite addresses (AS + IP + port), where the IP
address can be from a private IP range. This breaks the assumption
that IP addresses are globally unique.</t>
        <section anchor="key-implications">
          <name>Key Implications</name>
          <t>QUIC-MP relies on the 4-tuple changes to trigger path validation.
However, with SCION, the 4-tuple does not uniquely identify an endpoint.
Two endpoints with identical IP/port could be in different ASes.
An attacker could use endpoints with identical 4-tuple to reroute traffic
to a different machine without triggering path validation, see
<xref target="attack-path-injection"/> and <xref target="token"/>.</t>
        </section>
        <section anchor="recommendations">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>To prevent attackers circumventing path validation, a QUIC-MP
implementation <bcp14>MUST</bcp14> ensure to trigger path validation when the
network address of the destination changes; this includes
IP, port and AS number. This protects against several attacks,
see <xref target="attack-path-injection"/> and especially
<xref target="attack-amplification"/>.</t>
            </li>
          </ul>
          <t>There are several ways to achieve this, for example:</t>
          <ul spacing="normal">
            <li>
              <t>Adapt the QUIC-MP library to be aware of the AS number in SCION
network addresses.</t>
            </li>
            <li>
              <t>If the network address is available as a single "object",
the SCION layer can extend this with the AS code and the
QUIC-MP implementation must only ensure to compare the whole
object instead of port and IP separately.</t>
            </li>
            <li>
              <t>The SCION implementation could detect cases where only the AS
changes and then mangle the port or IP to trigger a path validation
in the QUIC-MP layer. This may be a pragmatic solution but is
discouraged because:
              </t>
              <ul spacing="normal">
                <li>
                  <t>Managing paths in the SCION layer is not trivial because it requires
synchronizing the lifecycle of SCION paths and QUIC-MP paths, e.g.,
knowing when is a path valid or when is it closed in QUIC-MP.</t>
                </li>
                <li>
                  <t>It creates opportunities for memory exhaustion attacks
(for storing the mapping of mangled IP/port).</t>
                </li>
                <li>
                  <t>It reports a wrong IP/port to the application.</t>
                </li>
              </ul>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="pathid">
        <name>Interoperability of QUIC-MP Path ID and Network Paths</name>
        <t>The identification of "paths" varies between QUIC, QUIC-MP and SCION.</t>
        <ul spacing="normal">
          <li>
            <t><xref target="QUIC-TRANSPORT"/> uses a 4-tuple of local/remote IP/port to
distinguish paths.</t>
          </li>
          <li>
            <t><xref target="QUIC-MP"/> extends the 4-tuple with a path ID to distinguish
logical paths (connections).</t>
          </li>
          <li>
            <t>SCION can distinguish paths based on the physical inter-domain
network path and additional properties, such as an expiration
time (the latter may or may not be used to distinguish path
instances).</t>
          </li>
        </ul>
        <t>A path change occurs when at least one of the router interfaces
changes. The network address may stay the same.</t>
        <t>With NAT rebinding, as described in <xref section="5.2" sectionFormat="of" target="QUIC-MP"/>,
the path can change, but not without changing the SCION network
address (IP, port, AS), so this case is not a concern.</t>
        <t>Path change detection is required to trigger certain actions,
such as resetting congestion control or RTT estimation algorithms.
See also <xref target="concon"/> and <xref target="rtt"/>.
When using a PAN such as SCION, it is important to trigger these
actions even if the full network address (4-tuple + AS) stays the same.</t>
        <t>Alternatively, the system can be implemented in a way so that
uncontrolled path changes cannot occur.
This is possible because path changes can only be initiated by
endpoints. However, this has some limitation if one of the
endpoints is not aware of transporting QUIC, for example a SCION
gateway or proxy, see <xref target="sig"/>.</t>
        <t>Implementations should try to maintain a 1:1 mapping between QUIC-MP
path IDs and SCION network paths.
However, this is not always possible or useful:</t>
        <ul spacing="normal">
          <li>
            <t>A SCION network path may expire. Replacing a path with an
identical new path (except for the expiration date), should be allowed
without triggering algorithm reset. Alternatively, refresh
can be handled by the path selector, see <xref target="patsel"/>.</t>
          </li>
          <li>
            <t>A SCION implementation, when used with QUIC-MP should be configured
such that every SCION network path is used for exactly one QUIC-MP
path ID.
However, it may not always be possible or feasible to configure SCION
implementations in this way, for example. when they are part of a SCION
gateway or proxy, and are unaware of transporting QUIC, see <xref target="sig"/>.</t>
          </li>
          <li>
            <t>A SCION path should be allowed to be reused, e.g., they may be assigned
to one QUIC path ID, and when that path ID is closed, the path
must be allowed to be assigned to another path ID.
This should not cause any problems except for the
marginal complexity of managing the associated state with a path ID.</t>
          </li>
        </ul>
        <section anchor="key-implications-1">
          <name>Key Implications</name>
          <t>If a path change occurs undetected, the QUIC-MP layer cannot
reset congestion control (<xref target="concon"/>) or RTT estimation (<xref target="rtt"/>).
This is undesirable but not worse than traditional IP based non-PAN
transport where routes can change without the endpoints learning about
it.</t>
        </section>
        <section anchor="recommendations-1">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>Congestion control and RTT estimation algorithms should be
designed to gracefully handle path changes that don't trigger a
reset, unless it can be guaranteed that both SCION endpoints are
configured to prevent automatic path changes.</t>
            </li>
            <li>
              <t>Within a QUIC-MP session, every SCION network path should be used only
with one path ID. However, it may be reused if the path was abandoned
or closed.</t>
            </li>
            <li>
              <t>Changes of the network path (while the network address stays the
same), except for expired paths being renewed, should trigger
algorithm reset (CC, RTT estimate), see <xref section="5.1" sectionFormat="of" target="QUIC-MP"/>.</t>
            </li>
          </ul>
          <t>Analogous to <xref target="endpoint-identity"/>, except for replacing "AS" with
"network path". We list them here again because the implications
of not following the recommendation are much weaker and may be
considered acceptable. Recommendations:</t>
          <ul spacing="normal">
            <li>
              <t>Adapt the QUIC-MP library to be aware of the full network path,
including router interfaces.</t>
            </li>
            <li>
              <t>If the network address is available as a single "object",
the SCION layer can extend this with the network path (possibly
excluding the expiration date), and the
QUIC-MP implementation must only ensure to compare the whole
object instead of port and IP separately.</t>
            </li>
            <li>
              <t>The SCION implementation could detect cases where only the router
interfaces
change and then mangle the port or IP to trigger a path validation
in the QUIC-MP layer. This may be a pragmatic solution but is
discouraged, because:
              </t>
              <ul spacing="normal">
                <li>
                  <t>Managing paths in the SCION layer is not trivial because it requires
synchronizing the lifecycle of SCION paths and QUIC-MP paths, e.g.,
knowing when is a path valid or when is it closed in QUIC-MP.</t>
                </li>
                <li>
                  <t>It creates opportunities for memory exhaustion attacks
(for storing the mapping of mangled IP/port).</t>
                </li>
                <li>
                  <t>It reports a wrong IP/port to the application.</t>
                </li>
              </ul>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="handshake">
        <name>Initial Handshake</name>
        <t><xref target="QUIC-TRANSPORT"/> requires that there is no connection migration
during the initial handshake, and that there are no other packets
sent (including probing packets) during the initial handshake, see
<xref section="9" sectionFormat="of" target="QUIC-TRANSPORT"/>, paragraphs 2 and 3.</t>
        <section anchor="key-implications-2">
          <name>Key Implications</name>
          <t>Changing the path during handshake would violate
<xref section="9" sectionFormat="of" target="QUIC-TRANSPORT"/>:</t>
          <ul empty="true">
            <li>
              <t>The design of QUIC relies on endpoints retaining a stable address
for the duration of the handshake. An endpoint <bcp14>MUST NOT</bcp14> initiate connection
migration before the handshake is confirmed, as defined in
<xref section="4.1.2" sectionFormat="of" target="QUIC-TLS"/>.</t>
            </li>
          </ul>
        </section>
        <section anchor="recommendations-2">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>A SCION implementation should not automatically change network
paths switch without explicit request by the QUIC(-MP) layer.
The only exception allowed is replacing an expiring path with
an new path that is identical except for the expiration time.
We also need to ensure this for gateways  etc, see <xref target="sig"/>.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="concon">
        <name>Congestion Control</name>
        <t>Following <xref section="5.1" sectionFormat="of" target="QUIC-MP"/>, the CC algorithm should be reset
when the 4-tuple of a QUIC path changes. With SCION, 4-tuples are not
sufficient to identify paths, see <xref target="pathid"/>.</t>
        <t>To avoid missing a path change, the SCION implementation should never
change a network path unless explicitly instructed by the QUIC-MP
implementation, see <xref target="recommendations"/>.</t>
        <section anchor="coupled-congestion-control">
          <name>Coupled Congestion Control</name>
          <t><xref section="5.3" sectionFormat="of" target="QUIC-MP"/> mentions coupled congestion control
algorithms, such as <xref target="CC-MULTIPATH-TCP"/>. <xref target="CC-MULTIPATH-TCP"/> states:</t>
          <ul empty="true">
            <li>
              <t>"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.".</t>
            </li>
          </ul>
          <t>This can be avoided in PANs, such as SCION, through link-level analysis
of paths and selecting paths that do not share a bottleneck link.
Instead, this bottleneck knowledge can be used to effectively use
separate congestion control for each path.
Alternatively, a CC algorithm could be employed that focuses
on known shared links (which may be bottlenecks).</t>
          <t>There are several congestion control algorithms proposed in literature,
e.g., LIA, OLIA, BALIA and RSF.  These combine congestion control with
path selection algorithms.
For simplicity, we suggest separating concerns in terms of
congestion control and path selection. This allows us to better
tailor the solutions to the different usage scenarios.</t>
          <t>The proposition is to use non-coupled congestion control per path,
tailored for each use case in <xref target="categories"/>, and use separate
independent path selection algorithms.</t>
          <t>CC algorithms can also benefit from the SCION metadata extension that
provides bandwidth and latency data for each link on a
network path.</t>
        </section>
        <section anchor="key-implications-3">
          <name>Key Implications</name>
          <t>A network path change goes unnoticed in case
a SCION implementation changes a path that happens to have the same
IP/port for both endpoints.</t>
          <t>Congestion control (CC) algorithms can also benefit from exact knowledge
of a path:</t>
          <ul spacing="normal">
            <li>
              <t>When using multiple paths, a CC algorithm can access path metadata
as to if and where the paths overlap and some of the properties of the
overlapping sections.</t>
            </li>
            <li>
              <t>CC algorithms should be notified of every path change, allowing them
to reset only when necessary. A reset may not be necessary if the
network path remains the same and only the IP or port of an endpoint
changes. This can make sense if any congestion is assumed to be on the
network path rather than behind the remote IP/port (e.g., behind a proxy).</t>
            </li>
          </ul>
          <t>See also <xref section="5.3" sectionFormat="of" target="QUIC-MP"/>.</t>
        </section>
        <section anchor="recommendations-3">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>Congestion control algorithms should be reset when the network path
changes (beyond 4-tuple). This is best achieved by ensuring that
the network path changes only in conjunction with QUIC path migration
events.</t>
            </li>
          </ul>
          <t>Congestion control algorithms can also benefit from exact
knowledge of a network path:</t>
          <ul spacing="normal">
            <li>
              <t>Congestion control algorithms should use the path metadata to
detect and, if necessary and possible, avoid overlap with
other paths. Congestion control can then be simplified to work
independently for each path.</t>
            </li>
            <li>
              <t>Path selection algorithms should try to avoid multiple path
that share bottleneck links.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="rtt">
        <name>RTT Estimation</name>
        <t>Similarly to congestion control, and following
<xref section="5.1" sectionFormat="of" target="QUIC-MP"/>, the RTT estimation algorithm should be
reset when the 4-tuple of a QUIC path changes.
As described in <xref target="concon"/> this can be avoided
by forbidding SCION implementations to change a network path unless
instructed otherwise by the QUIC-MP implementation.</t>
        <section anchor="key-implications-4">
          <name>Key Implications</name>
          <t>If a path change occurs undetected, the QUIC-MP layer may fail to
reset RTT estimation.
This is undesirable but not worse than traditional IP based non-PAN
transport where routes can change without the endpoints ever
learning about it.</t>
        </section>
        <section anchor="recommendations-4">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>RTT-algorithms should be reset when the network path
changes (beyond 4-tuple). This is best achieved by ensuring that
the network path changes only when requested by QUIC.</t>
            </li>
          </ul>
          <t>Round-trip time estimation algorithms can also benefit from exact
knowledge of a path:</t>
          <ul spacing="normal">
            <li>
              <t>An implementation may use SCION's SCMP traceroute
(<xref section="6" sectionFormat="of" target="SCION-CP"/>) to measure the latency of individual
links and then use this information to select new network paths
that favor low latency links and avoid high latency links. See also
<xref target="bottleneck"/>.</t>
            </li>
            <li>
              <t>An implementation could use the SCION metadata extension to
get propagation latency information of links in a path without
having to measure it.
This latency does not include queing latency but may in
many cases be sufficient for practical use.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="mtu">
        <name>MTU Discovery</name>
        <t>The MTU may be used to calculate the available payload size.
SCION inserts an additional header (<xref section="2" sectionFormat="of" target="SCION-DP"/>) into
each packet. The header size depends on the IP family (e.g., IPv4 vs
IPv6 addresses) and on the "length" of the path, i.e., the number of
ASes that are traversed. This must be taken into account when
calculating the available payload size.</t>
        <t>The difference between typical MTU (1500 bytes) and QUIC's required packet
size (1200 bytes) is sufficient for typical real-world SCION headers.</t>
        <t>PMTU discovery <xref section="14.3" sectionFormat="of" target="QUIC-TRANSPORT"/> can be used to
discover or verify MTU sizes. However, path metadata MTU can (at
least on the client side) be used to preselect paths with desirable
MTU values.</t>
        <t>In SCION, when an endpoint requests a network path, it will be
provided with MTU information for every hop on a path, see also <xref target="mtu"/>
and <xref section="4.4" sectionFormat="of" target="SCION-CP"/>. However, in SCION, paths are
typically only requested by client endpoints, not by server endpoints.</t>
        <t>There are several ways for a server to determine the MTU.
If a server wants to know the MTU, it may:</t>
        <ul spacing="normal">
          <li>
            <t>Try to determine the MTU from the size of incoming packets.</t>
          </li>
          <li>
            <t>Use an algorithm to determine the MTU, see Path MTU Discovery in
<xref section="14.3" sectionFormat="of" target="QUIC-TRANSPORT"/> and <xref section="5.8" sectionFormat="of" target="QUIC-MP"/>.</t>
          </li>
          <li>
            <t>Try to look up the path to the client endpoint that is identical to
the incoming path. However, this requires time
and effort on the server side, and there is no guarantee that
the incoming path is available in the local AS.</t>
          </li>
        </ul>
        <t>Also, note that the MTU information is authenticated but not verified,
it may be incorrect due to misconfiguration or malicious ASes.</t>
        <section anchor="key-implications-and-recommendations">
          <name>Key Implications and Recommendations</name>
          <t>PMTU discovery for multi-path may be improved by using path metadata.
PMTU will be explored more in detail in a future version of this
document (<strong>TODO</strong>)).</t>
        </section>
      </section>
      <section anchor="retransmission">
        <name>Retransmission &amp; PTO</name>
        <t>See <xref section="5.6" sectionFormat="of" target="QUIC-MP"/> and <xref section="5.7" sectionFormat="of" target="QUIC-MP"/>.
For retransmission, a SCION client or server may compare available
paths and choose one or more paths that have minimum overlap
with the current (unreliable) path.</t>
      </section>
      <section anchor="paths-having-different-pmtu-sizes">
        <name>Paths Having Different PMTU Sizes</name>
        <t><xref section="5.8" sectionFormat="of" target="QUIC-MP"/> suggests determining a single MTU size
in order to simplify retransmission.</t>
        <section anchor="key-implications-5">
          <name>Key Implications</name>
          <t><xref section="5.8" sectionFormat="of" target="QUIC-MP"/> explains that the benefit of using a
single MTU size is
to simplify retransmission processing, as the content of lost packets
initially sent on one path can be sent on another path without
further frame scheduling adaptations.</t>
        </section>
        <section anchor="recommendations-5">
          <name>Recommendations</name>
          <ul spacing="normal">
            <li>
              <t>On the client, this can be facilitated by computing a viable minimum
MTU size from all available network paths. However, it must be
considered that these values are not verified.</t>
            </li>
            <li>
              <t>On the server, MTU values from path metadata are not available.
The server may request these from the local AS, but the exact
path may not be available (in SCION, different ASes may offer
different sets of paths to their customers).
Also, except for initially proposing a preferred address
(<xref section="9.6" sectionFormat="of" target="QUIC-TRANSPORT"/>), new paths must be opened by
the client, not the server, see <xref section="9" sectionFormat="of" target="QUIC-TRANSPORT"/>.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="patsel">
        <name>Path Selection</name>
        <t>The path selection component is responsible for requesting paths
to a destination, ordering the path based on policy and preferences,
using them when new QUIC-paths are opened, and retiring them or listing
them for reuse when they are closed.</t>
        <section anchor="dynamic-approach">
          <name>Dynamic Approach</name>
          <t>A dynamic approach could start with using low latency paths. If the
connection appears to be long lasting, it could start (and keep)
adding additional paths as long as the traffic increases.</t>
          <t>As an example, if the algorithm detects traffic that lasts for
at least one second and transfers at least 100MB of traffic,
the algorithm could trigger creation of additional QUIC paths.</t>
        </section>
        <section anchor="bottleneck">
          <name>Bottleneck Detection</name>
          <t>If live traffic information is not available, bottleneck detection
can help to identify links that should be avoided. In PANs,
this can be achieved using approaches such as <xref target="UMCC"/>.</t>
          <t>An alternative is to use SCION's SCMP <tt>traceroute</tt> command
(<xref section="6" sectionFormat="of" target="SCION-CP"/>)
to measure the latency between two consecutive AS border routers.
The measured latency can be compared to earlier measurements or to
the latency given in the path metadata. Discrepancies can be an
indication of high traffic volume and queueing on the measured link.</t>
          <t>While traceroute may be useful, it should be used with care:</t>
          <ul spacing="normal">
            <li>
              <t>traceroute traffic is not congestion controlled.</t>
            </li>
            <li>
              <t>It is clearly distinguishable from QUIC traffic, so it
may affect anonymity.</t>
            </li>
          </ul>
        </section>
        <section anchor="key-implications-6">
          <name>Key Implications</name>
          <t>Path selection is a key feature of SCION and PANs in general.
For more details, see <xref target="SCION-CP"/> and <xref target="SCION-DP"/>.</t>
        </section>
        <section anchor="recommendations-6">
          <name>Recommendations</name>
          <t>In order to manage paths effectively, the path selection algorithm
probably requires access to the following fields and events:</t>
          <ul spacing="normal">
            <li>
              <t><tt>initial_max_path_id</tt> (<xref section="2.1" sectionFormat="of" target="QUIC-MP"/>)</t>
            </li>
            <li>
              <t>MAX_PATH_ID frames (<xref section="4.6" sectionFormat="of" target="QUIC-MP"/></t>
            </li>
            <li>
              <t>PATH_AVAILABLE and PATH_BACKUP, see <xref section="3.3" sectionFormat="of" target="QUIC-MP"/>,</t>
            </li>
            <li>
              <t>PATH_ABANDON <xref section="3.4" sectionFormat="of" target="QUIC-MP"/>.</t>
            </li>
          </ul>
          <t>Moreover, path selection must exclude paths whose MTU is too
small to guarantee 1200 bytes MTU payload for QUIC packets.
The effective MTU also depends on the length of the paths.</t>
        </section>
      </section>
      <section anchor="scheduling">
        <name>Packet Scheduling</name>
        <t>Packet scheduling helps to distribute the transfer load efficiently
over multiple paths, see also <xref section="5.5" sectionFormat="of" target="QUIC-MP"/>.</t>
        <section anchor="key-implications-7">
          <name>Key Implications</name>
          <t>SCION paths are stable, at least on the inter-AS level,
i.e., they cannot change without initiative from the endpoints.</t>
        </section>
        <section anchor="recommendations-7">
          <name>Recommendations</name>
          <t>Path stability may simplify packet scheduling algorithms because the
performance of individual QUIC-paths is more reliable if they
cannot unexpectedly be rerouted.</t>
        </section>
      </section>
      <section anchor="token">
        <name>Address Validation Token</name>
        <t><xref section="9.3" sectionFormat="of" target="QUIC-TRANSPORT"/> specifies that a server is
expected to send a new address validation token to a client
following the successful validation of a new client address.</t>
        <t>Potential challenges:</t>
        <ul spacing="normal">
          <li>
            <t>If we adapt an implementation to use the full network
address + path for identity, and if we use this to
generate tokens, then we may end up generating many more or
longer tokens.</t>
          </li>
          <li>
            <t>Clients may not know their IP address (e.g., NAT) and their IP
address may change.</t>
          </li>
        </ul>
        <t>See discussion in https://github.com/quicwg/multipath/issues/550</t>
        <t>See also <xref section="21.3" sectionFormat="of" target="QUIC-TRANSPORT"/>.</t>
        <t><strong>TODO</strong> This section will be completed in a future
version of this document.</t>
      </section>
    </section>
    <section anchor="all-recommendations">
      <name>Summary of Recommendations</name>
      <t>This memo is informational. However, we use <xref target="RFC2119"/>
imperative language here for recommendations that are
relevant to security or performance.</t>
      <section anchor="recommendations-for-quic-mp-implementations">
        <name>Recommendations for QUIC-MP Implementations</name>
        <ul spacing="normal">
          <li>
            <t>To prevent attackers circumventing path validation, a QUIC-MP
implementation <bcp14>MUST</bcp14> ensure to trigger path validation when the
network address of the destination changes; this includes
IP, port and AS number. This protects against several attacks,
see <xref target="attack-path-injection"/> and especially
<xref target="attack-amplification"/>.  </t>
            <t>
There are several ways to achieve this, for example:  </t>
            <ul spacing="normal">
              <li>
                <t>Adapt the QUIC-MP library to be aware of the AS number in SCION
network addresses.</t>
              </li>
              <li>
                <t>If the network address is available as a single "object",
the SCION layer can extend this with the AS code, and the
QUIC-MP implementation must only ensure to compare the whole
object instead of port and IP separately.</t>
              </li>
              <li>
                <t>The SCION implementation could detect cases where only the AS
changes and then mangle the port or IP to trigger a path validation
in the QUIC-MP layer. This may be a pragmatic solution but is
discouraged, because:
                </t>
                <ul spacing="normal">
                  <li>
                    <t>Managing paths in the SCION layer is not trivial because it requires
synchronizing the lifecycle of SCION paths and QUIC-MP paths, e.g.,
knowing when is a path valid or when is it closed in QUIC-MP.</t>
                  </li>
                  <li>
                    <t>It creates opportunities for memory exhaustion attacks
(for storing the mapping of mangled IP/port).</t>
                  </li>
                  <li>
                    <t>It reports a wrong IP/port to the application.</t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li>
            <t>A QUIC-MP implementations <bcp14>SHOULD</bcp14> be able to recognize network
path changes beyond 4-tuple or AS changes. This enables resetting
congestion control and RTT algorithms.</t>
          </li>
        </ul>
      </section>
      <section anchor="recommendations-for-scion-implementations">
        <name>Recommendations for SCION Implementations</name>
        <ul spacing="normal">
          <li>
            <t>A SCION implementation <bcp14>SHOULD NOT</bcp14> store or cache paths,
especially not on the server side. This prevents memory
exhaustion attacks, see {attack-memory-exhaustion}.
This also avoids the problem of path lifecycle maintenance, i.e.,
determining which paths are still alive and which have been closed
or abandoned.
Sometimes, storing paths is inevitable, see <xref target="sig"/>.
For security concerns, see also <xref target="attack-path-injection"/>.</t>
          </li>
          <li>
            <t>When used with QUIC-MP, a SCION implementation <bcp14>MUST</bcp14> not change the
network paths, possibly with the exception of refreshing expired
paths.
When a path stops working, the implementation should instead report
an error to the QUIC(-MP) layer or time out silently.</t>
          </li>
        </ul>
      </section>
      <section anchor="recommendations-for-both-quic-mp-and-scion-implementations">
        <name>Recommendations for both QUIC-MP and SCION Implementations</name>
        <ul spacing="normal">
          <li>
            <t>A server should return packets on the same path on which they were
received.
            </t>
            <ul spacing="normal">
              <li>
                <t>Generally, a server <bcp14>SHOULD</bcp14> respond on the same path on which the data
was originally requested, unless the new path has been validated.
This ensures that the path does not violate the path policy of the
client.</t>
              </li>
              <li>
                <t>A server <bcp14>SHOULD NOT</bcp14> create new paths. This is also stated in
<xref section="9" sectionFormat="of" target="QUIC-TRANSPORT"/>. Servers may communicate a preferred
address after the initial handshake. However, it is recommended to
avoid that because any new path may violate a client's path policy.</t>
              </li>
              <li>
                <t>Returning probing packets on the same network path on which they
were received: This greatly simplifies RTT estimation, see <xref target="rtt"/>.</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Clients may replace expired or soon-to-expire paths with identical
paths without performing path migration / validation.</t>
          </li>
          <li>
            <t>Within a QUIC-MP session, every SCION network path should be used only
with one path ID. However, it may be reused if the path was abandoned
or closed by QUIC. This is the responsibility of the path selection
algorithm, regardless of whether it is considered part of SCION or
part of QUIC-MP.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The aim is that QUIC-MP over SCION retains all security
properties of QUIC-MP and SCION. However, this requires some
implementation changes and additional consideration regarding:</t>
      <ul spacing="normal">
        <li>
          <t>endpoint identity: a 4-tuple is not sufficient to identify an endhost;</t>
        </li>
        <li>
          <t>network path authenticity: paths may be forged by malicious clients;</t>
        </li>
        <li>
          <t>path probing patterns may expose user intentions or identity.</t>
        </li>
      </ul>
      <section anchor="attack-path-injection">
        <name>Path Injection</name>
        <t>There are several potential attacks that build on injecting
valid or invalid paths into the server-side software stack.</t>
        <t>In summary, these attacks can be prevented by the recommendations
listed in <xref target="all-recommendations"/>, specifically we
recommend the following where possible:</t>
        <ol spacing="normal" type="1"><li>
            <t>SCION layers should avoid storing/caching paths and network addresses
(beyond IP/port) internally.
Instead, they should be given to the QUIC(-MP) layer or the
application layer. That means that path information would only be
accepted and retained if the QUIC(-MP) or application layer decides
to do so.</t>
          </li>
          <li>
            <t>SCION layers and QUIC(-MP) layers should interface by using
network addresses that include all information that identifies an
endpoint, including, for example, AS code. Any change in a
network address (including the AS code) should trigger path
validation.</t>
          </li>
        </ol>
        <t>Alternatives:</t>
        <ol spacing="normal" type="1"><li>
            <t>If paths and network addresses must be stored in the SCION layer, an
alternative solution is to implement a form of signalling
which would indicate that a packet is (or would be) rejected/dropped
by the QUIC(-MP) layer. These addresses and path from such packets
should not be stored. However, to avoid connection drop, they should
not be removed if they were previously used with a valid connection.</t>
          </li>
        </ol>
        <t>Examples of attacks include memory exhaustion attacks, traffic
redirection attacks, and traffic amplification attacks.</t>
        <section anchor="attack-memory-exhaustion">
          <name>Memory Exhaustion</name>
          <t>An attacker may flood a server with packets that each have a
different source network address. If these are stored in the
SCION layer, they may cause memory exhaustion.</t>
          <t>Mitigation: do not store state in the SCION layer, or implement
a way to clean up state without affecting a valid connection.</t>
        </section>
        <section anchor="traffic-redirection-to-different-as">
          <name>Traffic Redirection to Different AS</name>
          <t>An attacker may craft a packet that appears to originate from the same
IP/port, but is located in a different AS than an existing connection.
If the server's SCION layer stores paths internally, and uses IP/port
as key to look them up, then the new paths may replace the existing one,
and outgoing traffic is redirected to the new paths and destination.</t>
          <t>Mitigation:</t>
          <ul spacing="normal">
            <li>
              <t>The QUIC(-MP) layer <bcp14>MUST</bcp14> trigger path validation if the
network address changes, and must consider every attribute of the
address, not just IP and port.</t>
            </li>
            <li>
              <t>If a packet is rejected by the QUIC(-MP) layer, the SCION layer <bcp14>MUST
NOT</bcp14> add it to any local state (including not replacing existing
state).
This can be achieved trivially by not having state in the SCION layer.</t>
            </li>
          </ul>
        </section>
        <section anchor="traffic-redirection-over-different-path">
          <name>Traffic Redirection over Different Path</name>
          <t>An attacker may craft a path with a network address that is identical
to an existing valid endpoint, but with a different path.</t>
          <t>The new route may be invalid (e.g., contain nonexistent links)
or faulty (contain links that are broken or have high latency
or drop rate).</t>
          <t>The new route may also work fine, but violate the client's path policy
or be used for traffic analysis.</t>
          <figure anchor="fig-example-non-unique-ip">
            <name>Example of non-unique IPs</name>
            <artwork><![CDATA[
     AS #100               AS #200                   AS #300
  +-----------------+        +--------------+        +--------------+
  | Server          |        | Attacker     |        | Victim       |
  | IP=198.51.100.1 | ------ | IP=192.0.2.1 | ------ | IP=192.0.2.1 |
  | port = 42       |        | port= 12345  |        | port= 12345  |
  +-----------------+        +--------------+        +--------------+

]]></artwork>
          </figure>
          <t>This attack requires either spoofing of the client's IP address
(when the attacker is in the same AS as the client) or injection
of a path (which requires control over an AS that is en-route
between the client and server).</t>
          <t>Mitigation:</t>
          <t>This is mitigated by the recommendation that path validation
should always be triggered when the network address or path
changes, even if the 4-tuple stays the same.</t>
        </section>
        <section anchor="attack-amplification">
          <name>Traffic Amplification</name>
          <t>An attacker may establish a connection with a server,
request a large amount of data, and then inject a path that
redirects to a victim that has the same IP/port, but in a different AS.</t>
          <t>If the server-side QUIC-MP does not trigger path validation
(because IP/port are the same), then it may implicitly accept
the new path and send the requested data to a victim.</t>
          <t>This attack requires the attacker to have control over an AS that
is en-route between client (victim) and server.</t>
          <t>Mitigation:</t>
          <ul spacing="normal">
            <li>
              <t>A QUIC(-MP) library must consider all attributes
(not just the 4-tuple) when checking for a change in the network
address. This would then trigger path validation, and the attack
can be averted.</t>
            </li>
            <li>
              <t>If a QUIC(-MP) library cannot compare additional attributes
(e.g., legacy library), the SCION layer (server side) should have an
option to perform port mangling or IP mangling: when the SCION layer
detects a new network address that differs only in the AS number
from a previously seen address (IP/port are the same), then it
should perform IP/port mangling, i.e., reporting a modified IP or
port to the QUIC(-MP) layer. This new IP/port would trigger a path
validation or algorithm reset where required.</t>
            </li>
          </ul>
          <t>Caveats:</t>
          <ul spacing="normal">
            <li>
              <t>Offering a mangled IP/port to the application may have implications
for application correctness, such as displaying an unexpected IP/port.</t>
            </li>
          </ul>
          <figure anchor="fig-example-new-path">
            <name>Example of traffic amplification attack</name>
            <artwork><![CDATA[
   Attacker                                                Server
   (Establish connection)
   Path=[#200, #100] -->
                                                <-- Path=[#100, #200]

   (Change Path)
   Path=[#300, #200, #100] -->
                                          <-- Path=[#100, #200, #300]

   Client: receives unwanted traffic
]]></artwork>
          </figure>
        </section>
      </section>
      <section anchor="security-many-paths">
        <name>Number of Open Paths</name>
        <t>The number of open paths should be limited, see
<xref section="7.2" sectionFormat="of" target="QUIC-MP"/>.
This is important in the context of applications that may open many
paths in parallel.</t>
        <t>Mitigation:</t>
        <ul spacing="normal">
          <li>
            <t>Same as <xref section="7.2" sectionFormat="of" target="QUIC-MP"/>: endpoints
 need to limit the maximum number of paths and might consider
 additional measures to limit the number of concurrent path validation
 processes, e.g., by pacing them out or limiting the number of path
 initiation attempts over a certain time period.</t>
          </li>
        </ul>
      </section>
      <section anchor="probe-fingerprinting">
        <name>Probe Fingerprinting</name>
        <t>An endpoint may probe multiple paths to determine the best
path(s) for a given use case. One example of probing packets is
packets that measure round-trip time (RTT).</t>
        <t>Probing packets may be detected if they are sent in bulk, to the
same destination, in regular intervals, and all with slightly
different paths attached.</t>
        <t>This can be used to fingerprint an endpoint or their intentions
(applications may have unique intervals defined).</t>
        <t>This can be mitigated by varying and generally reducing the
number of probing packets, and by sending probing packets
not en-block but time-shifted.</t>
      </section>
      <section anchor="additional-points">
        <name>Additional Points</name>
        <t>TODO: Complete this section in a future version of this document.</t>
        <ul spacing="normal">
          <li>
            <t>Use multipathing for anonymity, see <xref target="categories"/>.</t>
          </li>
          <li>
            <t>See other attacks in <xref section="7.2.4" sectionFormat="of" target="SCION-CP"/>?</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="DCCP-UDPENCAP">
          <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>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="MPTCP-ARCHITECTURE">
          <front>
            <title>Architectural Guidelines for Multipath TCP Development</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="S. Barre" initials="S." surname="Barre"/>
            <author fullname="J. Iyengar" initials="J." surname="Iyengar"/>
            <date month="March" year="2011"/>
            <abstract>
              <t>Hosts are often connected by multiple paths, but TCP restricts communications to a single path per transport connection. Resource usage within the network would be more efficient were these multiple paths able to be used concurrently. This should enhance user experience through improved resilience to network failure and higher throughput.</t>
              <t>This document outlines architectural guidelines for the development of a Multipath Transport Protocol, with references to how these architectural components come together in the development of a Multipath TCP (MPTCP). This document lists certain high-level design decisions that provide foundations for the design of the MPTCP protocol, based upon these architectural requirements. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6182"/>
          <seriesInfo name="DOI" value="10.17487/RFC6182"/>
        </reference>
        <reference anchor="QUIC-TRANSPORT">
          <front>
            <title>QUIC: A UDP-Based Multiplexed and Secure Transport</title>
            <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar"/>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document defines the core of the QUIC transport protocol. QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances. Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9000"/>
          <seriesInfo name="DOI" value="10.17487/RFC9000"/>
        </reference>
        <reference anchor="QUIC-TLS">
          <front>
            <title>Using TLS to Secure QUIC</title>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <author fullname="S. Turner" initials="S." role="editor" surname="Turner"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document describes how Transport Layer Security (TLS) is used to secure QUIC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9001"/>
          <seriesInfo name="DOI" value="10.17487/RFC9001"/>
        </reference>
        <reference anchor="QUIC-RECOVERY">
          <front>
            <title>QUIC Loss Detection and Congestion Control</title>
            <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar"/>
            <author fullname="I. Swett" initials="I." role="editor" surname="Swett"/>
            <date month="May" year="2021"/>
            <abstract>
              <t>This document describes loss detection and congestion control mechanisms for QUIC.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9002"/>
          <seriesInfo name="DOI" value="10.17487/RFC9002"/>
        </reference>
        <reference anchor="CC-PRINCIPLES">
          <front>
            <title>Congestion Control Principles</title>
            <author fullname="S. Floyd" initials="S." surname="Floyd"/>
            <date month="September" year="2000"/>
            <abstract>
              <t>The goal of this document is to explain the need for congestion control in the Internet, and to discuss what constitutes correct congestion control. 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="41"/>
          <seriesInfo name="RFC" value="2914"/>
          <seriesInfo name="DOI" value="10.17487/RFC2914"/>
        </reference>
        <reference anchor="UDP-GUIDELINES">
          <front>
            <title>UDP Usage Guidelines</title>
            <author fullname="L. Eggert" initials="L." surname="Eggert"/>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="G. Shepherd" initials="G." surname="Shepherd"/>
            <date month="March" year="2017"/>
            <abstract>
              <t>The User Datagram Protocol (UDP) provides a minimal message-passing transport that has no inherent congestion control mechanisms. This document provides guidelines on the use of UDP for the designers of applications, tunnels, and other protocols that use UDP. Congestion control guidelines are a primary focus, but the document also provides guidance on other topics, including message sizes, reliability, checksums, middlebox traversal, the use of Explicit Congestion Notification (ECN), Differentiated Services Code Points (DSCPs), and ports.</t>
              <t>Because congestion control is critical to the stable operation of the Internet, applications and other protocols that choose to use UDP as an Internet transport must employ mechanisms to prevent congestion collapse and to establish some degree of fairness with concurrent traffic. They may also need to implement additional mechanisms, depending on how they use UDP.</t>
              <t>Some guidance is also applicable to the design of other protocols (e.g., protocols layered directly on IP or via IP-based tunnels), especially when these protocols do not themselves provide congestion control.</t>
              <t>This document obsoletes RFC 5405 and adds guidelines for multicast UDP usage.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="145"/>
          <seriesInfo name="RFC" value="8085"/>
          <seriesInfo name="DOI" value="10.17487/RFC8085"/>
        </reference>
        <reference anchor="MTU-DISCOVERY">
          <front>
            <title>Packetization Layer Path MTU Discovery for Datagram Transports</title>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="T. Jones" initials="T." surname="Jones"/>
            <author fullname="M. Tüxen" initials="M." surname="Tüxen"/>
            <author fullname="I. Rüngeler" initials="I." surname="Rüngeler"/>
            <author fullname="T. Völker" initials="T." surname="Völker"/>
            <date month="September" year="2020"/>
            <abstract>
              <t>This document specifies Datagram Packetization Layer Path MTU Discovery (DPLPMTUD). This is a robust method for Path MTU Discovery (PMTUD) for datagram Packetization Layers (PLs). It allows a PL, or a datagram application that uses a PL, to discover whether a network path can support the current size of datagram. This can be used to detect and reduce the message size when a sender encounters a packet black hole. It can also probe a network path to discover whether the maximum packet size can be increased. This provides functionality for datagram transports that is equivalent to the PLPMTUD specification for TCP, specified in RFC 4821, which it updates. It also updates the UDP Usage Guidelines to refer to this method for use with UDP datagrams and updates SCTP.</t>
              <t>The document provides implementation notes for incorporating Datagram PMTUD into IETF datagram transports or applications that use datagram transports.</t>
              <t>This specification updates RFC 4960, RFC 4821, RFC 6951, RFC 8085, and RFC 8261.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8899"/>
          <seriesInfo name="DOI" value="10.17487/RFC8899"/>
        </reference>
        <reference anchor="CC-ALGORITHMS">
          <front>
            <title>Specifying New Congestion Control Algorithms</title>
            <author fullname="M. Duke" initials="M." role="editor" surname="Duke"/>
            <author fullname="G. Fairhurst" initials="G." role="editor" surname="Fairhurst"/>
            <date month="March" year="2025"/>
            <abstract>
              <t>RFC 5033 discusses the principles and guidelines for standardizing new congestion control algorithms. This document obsoletes RFC 5033 to reflect changes in the congestion control landscape by providing a framework for the development and assessment of congestion control mechanisms, promoting stability across diverse network paths. This document seeks to ensure that proposed congestion control algorithms operate efficiently and without harm when used in the global Internet. It emphasizes the need for comprehensive testing and validation to prevent adverse interactions with existing flows.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="133"/>
          <seriesInfo name="RFC" value="9743"/>
          <seriesInfo name="DOI" value="10.17487/RFC9743"/>
        </reference>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="DMTP">
          <front>
            <title>Deadline Aware Streams in QUIC Multipath</title>
            <author fullname="Tony John" initials="T." surname="John">
              <organization>Otto-von-Guericke University Magdeburg</organization>
            </author>
            <author fullname="Till-Frederik Riechard" initials="T." surname="Riechard">
              <organization>Otto-von-Guericke University Magdeburg</organization>
            </author>
            <date day="5" month="June" year="2025"/>
            <abstract>
              <t>   This document proposes the Deadline-aware Multipath Transport
   Protocol (DMTP) concept as an extension to the Multipath Extension
   for QUIC (QUIC-MULTIPATH) as well as QUIC itself.  This extension
   aims to support data streams with strict latency requirements by
   enabling the signaling of a stream's deadline and ideally by
   combining multipath scheduling, congestion control adaptations, and
   optional forward error correction (FEC).  Moreover, DMTP leverages
   the path identifiers introduced by the Multipath Extension for QUIC
   to distinguish different end-to-end paths as they may be offered in a
   Path Aware Network (PAN) such as SCION.  This allows an application
   to select its preferred paths while maintaining interoperability with
   standard endpoints using the Multipath Extension for QUIC.  In
   combination, DMTP enables endpoints to exchange and schedule
   deadline-aware streams across multiple network paths.  Additionally,
   this proposal also maintains compatibility with QUIC itself, in order
   to deliver its benefits - albeit with limited effectiveness - even in
   scenarios where only a single path can or should be used.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-tjohn-quic-multipath-dmtp-01"/>
        </reference>
        <reference anchor="QUIC-ACKFREQUENCY">
          <front>
            <title>QUIC Acknowledgment Frequency</title>
            <author fullname="Jana Iyengar" initials="J." surname="Iyengar">
              <organization>Fastly</organization>
            </author>
            <author fullname="Ian Swett" initials="I." surname="Swett">
              <organization>Google</organization>
            </author>
            <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind">
              <organization>Ericsson</organization>
            </author>
            <date day="28" month="February" year="2025"/>
            <abstract>
              <t>   This document specifies an extension to QUIC that enables an endpoint
   to request its peer change its behavior when sending or delaying
   acknowledgments.

Note to Readers

   Discussion of this draft takes place on the QUIC working group
   mailing list (quic@ietf.org), which is archived at
   https://mailarchive.ietf.org/arch/search/?email_list=quic.  Source
   code and issues list for this draft can be found at
   https://github.com/quicwg/ack-frequency.

   Working Group information can be found at https://github.com/quicwg.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-quic-ack-frequency-11"/>
        </reference>
        <reference anchor="QUIC-MP">
          <front>
            <title>Multipath Extension for QUIC</title>
            <author fullname="Yanmei Liu" initials="Y." surname="Liu">
              <organization>Alibaba Inc.</organization>
            </author>
            <author fullname="Yunfei Ma" initials="Y." surname="Ma">
              <organization>Uber Technologies Inc.</organization>
            </author>
            <author fullname="Quentin De Coninck" initials="Q." surname="De Coninck">
              <organization>University of Mons (UMONS)</organization>
            </author>
            <author fullname="Olivier Bonaventure" initials="O." surname="Bonaventure">
              <organization>UCLouvain and Tessares</organization>
            </author>
            <author fullname="Christian Huitema" initials="C." surname="Huitema">
              <organization>Private Octopus Inc.</organization>
            </author>
            <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind">
              <organization>Ericsson</organization>
            </author>
            <date day="23" month="April" year="2025"/>
            <abstract>
              <t>   This document specifies a multipath extension for the QUIC protocol
   to enable the simultaneous usage of multiple paths for a single
   connection.

Discussion Venues

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

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

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

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-quic-multipath-14"/>
        </reference>
        <reference anchor="CC-MULTIPATH-TCP">
          <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>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>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>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="PATH-VOCABULARY">
          <front>
            <title>A Vocabulary of Path Properties</title>
            <author fullname="R. Enghardt" initials="R." surname="Enghardt"/>
            <author fullname="C. Krähenbühl" initials="C." surname="Krähenbühl"/>
            <date month="September" year="2023"/>
            <abstract>
              <t>Path properties express information about paths across a network and the services provided via such paths. In a path-aware network, path properties may be fully or partially available to entities such as endpoints. This document defines and categorizes path properties. Furthermore, the document identifies several path properties that might be useful to endpoints or other entities, e.g., for selecting between paths or for invoking some of the provided services. This document is a product of the Path Aware Networking Research Group (PANRG).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9473"/>
          <seriesInfo name="DOI" value="10.17487/RFC9473"/>
        </reference>
        <reference anchor="SCION-CP">
          <front>
            <title>SCION Control Plane</title>
            <author fullname="Corine de Kater" initials="C." surname="de Kater">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Nicola Rustignoli" initials="N." surname="Rustignoli">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Samuel Hitz" initials="S." surname="Hitz">
              <organization>Anapaya Systems</organization>
            </author>
            <date day="3" month="March" year="2025"/>
            <abstract>
              <t>   This document describes the Control Plane of the path-aware, inter-
   domain network architecture SCION (Scalability, Control, and
   Isolation On Next-generation networks).  A fundamental characteristic
   of SCION is that it gives path control to SCION-capable endpoints
   that can choose between multiple path options, thereby enabling the
   optimization of network paths.  The Control Plane is responsible for
   discovering these paths and making them available to the endpoints.

   The SCION Control Plane creates and securely disseminates path
   segments between SCION Autonomous Systems (AS) which can then be
   combined into forwarding paths to transmit packets in the data plane.
   This document describes mechanisms of path exploration through
   beaconing and path registration.  In addition, it describes how
   Endpoints construct end-to-end paths from a set of possible path
   segments through a path lookup process.

   This document contains new approaches to secure path aware
   networking.  It is not an Internet Standard, has not received any
   formal review of the IETF, nor was the work developed through the
   rough consensus process.  The approaches offered in this work are
   offered to the community for its consideration in the further
   evolution of the Internet.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-controlplane-08"/>
        </reference>
        <reference anchor="SCION-DP">
          <front>
            <title>SCION Data Plane</title>
            <author fullname="Corine de Kater" initials="C." surname="de Kater">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Nicola Rustignoli" initials="N." surname="Rustignoli">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Jean-Christophe Hugly" initials="J." surname="Hugly">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Samuel Hitz" initials="S." surname="Hitz">
              <organization>Anapaya Systems</organization>
            </author>
            <date day="3" month="March" year="2025"/>
            <abstract>
              <t>   This document describes the data plane of the path-aware, inter-
   domain network architecture SCION (Scalability, Control, and
   Isolation On Next-generation networks).  One of the basic
   characteristics of SCION is that it gives path control to endpoints.
   The SCION Control Plane is responsible for discovering these paths
   and making them available as path segments to the endpoints.  The
   role of the SCION Data Plane is to combine the path segments into
   end-to-end paths, and forward data between endpoints according to the
   specified path.

   The SCION Data Plane fundamentally differs from today's IP-based data
   plane in that it is _path-aware_: In SCION, interdomain forwarding
   directives are embedded in the packet header.  This document provides
   a detailed specification of the SCION data packet format as well as
   the structure of the SCION header.  SCION also supports extension
   headers, which are additionally described.  The document continues
   with the life cycle of a SCION packet while traversing the SCION
   Internet, followed by a specification of the SCION path authorization
   mechanisms and the packet processing at routers.

   This document contains new approaches to secure path aware
   networking.  It is not an Internet Standard, has not received any
   formal review of the IETF, nor was the work developed through the
   rough consensus process.  The approaches offered in this work are
   offered to the community for its consideration in the further
   evolution of the Internet.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-dataplane-05"/>
        </reference>
        <reference anchor="OLIA">
          <front>
            <title>MPTCP is not pareto-optimal: performance issues and a possible solution</title>
            <author initials="R." surname="Khalili">
              <organization/>
            </author>
            <author initials="N." surname="Gast">
              <organization/>
            </author>
            <author initials="M." surname="Popovic">
              <organization/>
            </author>
            <author initials="U." surname="Upadhyay">
              <organization/>
            </author>
            <author initials="J." surname="Le Boudec">
              <organization/>
            </author>
            <date year="2012"/>
          </front>
          <seriesInfo name="Proceedings of the 8th international conference on Emerging networking experiments and technologies, ACM" value=""/>
        </reference>
        <reference anchor="UMCC">
          <front>
            <title>UMCC: Uncoupling Multipath Congestion Control through Shared Bottleneck Detection in Path-Aware Networks</title>
            <author initials="M." surname="Gartner">
              <organization/>
            </author>
            <author initials="D." surname="Hausheer">
              <organization/>
            </author>
            <date year="2024"/>
          </front>
          <seriesInfo name="Proceedings of the IEEE 49th Conference on Local Computer Networks (LCN)" value=""/>
        </reference>
      </references>
    </references>
    <?line 1146?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>Thanks to the Path Aware Networking Research Group for discussion
and feedback. Specifically, we would like to thank Kevin Meynell and
Nicola Rustignoli from the Scion Association for their valuable input
on several iterations of this document.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+19+5Lb1pnn/3iKs62qTbdNUmpZju2eSWbolmz3RJcedSve
TCrlgCBIwgIBBgC7TWs0z7LPsk+23++7nHMAkrKdpHZmqyY1NW6BwLl857vf
zng8TrqiK/MLd/L1tpjnZVHlrVvUjfvXN1eX7sW27IpN2q1cfZc37uby6tXL
kyRJZ7Mmv6Nv+MEYr45fXNMPWdrly7rZXbiiWtRJMq+zKl3T6PMmXXTjH9O8
zVZv83GbFXU1/su2yMZrm2L86FGStNvZumhb+rXbbei7q9e3Xzn3wKVlW9N8
RTXPNzn9v6o7GbmTfF50dVOkJf5xNf2S/0Nf0ErmtJIL9/jR40/Hjz4bPzpP
kmLTXLiu2bbd40ePvnj0mLbR5KlMkST3dfN22dTbzYW7nr58/XWSvM139HB+
kbixbBx/YKv4r191ktzl1Tant5x+/u3X9Les/lsatKiW7mv8Qk/XaVFeuE1a
Nct/LppuMambJT1Om2x14VZdt2kvHj6kladdk2Zv82ZS5PLSQ/o//gzTFN1q
OyNgVHnX5tk471Y/PjwE0O+uxk9P6IOSQNF29IHNEH04kdEmRX10iIc/4+wm
q25dEtTbLq3m36VlXdHud3mbJJviwv2xq7ORa+uma/JFS3/t1vjjTwS7C/cJ
ncO2W9UNA5rwpr1w/zJxd2nlvqzX67ykHTgnWPQvednlw58IPBfu2e037t+2
TZGt+FkukD75Hh9M6IMZv//PhJUT3na2OgnTfTVx3xbNj9FEXzVpldVFG55/
aJZ7emlxZOzbifs3hVw0/m1RrtOq6v/U1KBDwemfmrOTASZ2KvHsSVLVzTrt
ijtGy6eXl9fjN0+vn728nF5fuGaR/fqzzz6hH15c39Iv09eX31zdPru8ffP6
mfx6/vlj+pWJ+vb19OXN9avXt/zLF4+IRO2X5zf27NyevX52+er3z17/wX7A
MJeX4+vXVy8vr66fP6MvXn91+fiL8yf0A61o/PWbq6fPnl+91F8+f/T5p1jX
7Zvx06sbGws/fP7FFzLW9PnXr15f3X7zQr744rMnhD8JmE284xe3tFFC3Ymg
bvd9vdrjNvN1t7GFTy9/99XrZ//6hkD0h/hDkJ98R+Q4XjT5X7Z5le3ssxfX
h18OzIHX/OLN89ur6+ntN2OCNy/71598+mv6jZ/9/tXl9Ms3z6e61S+e8NkI
Y73sTTDP3xIlN0qAGbFIwphNmVa5/+DpBz4AX7G3Xz2/ml4wPhn3Z2RwhPFV
3RGHavKuHtebrlin4Fh5wwCuspxeabckIojOk9RtauLVszIn4i63Hc1ywoMK
8z15/Oj8sTxo86bIWxwTPb5u6iwnNK+WrasXrlvl7nOSMEVFa61SjJKWjra3
yJscM9ZV8mydN0twUmJd98pU8x9oWcWaRAGvxnV5tqrqsl7STCM3vXwhU3vm
Qv8bC02+nrjfrdKyKIv46cuJ+zptu/jRi4m7rjf1XZHFT99M3JtNOl/t0l38
+F8m4z9M3POceNN2nuOLNy8uL/tQ5ifuDfGW7abEJoKAvayrJbFp2j3+xNES
ZEhuLFfJzYrOY07jdjRKlWdv3dOcdsvvFpW7BjpP7+kd91LA0w6O4fGTn3cM
V8+ePXNPvpDVBPC753WWlsllvd5s6Yz8LO70+eXLs6NgfgGANl2VN/HTpxP3
TbptVzk9TsbjsUtnLcRdl9yuCP1IY9jiTN2mIbjPCdM8cTNeLElLYTyEjrJt
AUNaeRLg+OyHLq+gQAQt5p5kHO+PiSTGIY8zu0mSyK8FsEmQcTyvidtWxJgJ
t+ltWhJJMj6YtHPtdrMhkdY6Zicp4J8w5Y95HWGWCe0sV42BSAW/Ksau8qJx
advWWUFHNeef4v3SueAU5slsp2tXqLia595WRVeAGFt3n5cl/psRYhOSLEWL
S7J6PSsqLF45lgCDB6Mt90FOFFXWDX15lzZFvcW4G0IzRQ96U0bjpZEU32Yr
eiNJS9L4aNC16I1ZwGNlUSP3+vbW4dlaP8Xml4TJDWFVuiFKyGS7bZZXmLqd
JFeVS+ckCvn9IkIHPrLiL8qDAj50NdSrqsOB4axJwyGp2e0SWrztHR/w1kcJ
w792ZU56bbrMo0N0Bw9R4KYDTQRz18V8XuZJ8sBdYaPzLZNkwsf9QYR8904H
ev9+pAiXx28l2AC/2Uc5gg4x29a1BdZIrByHtG2xftqlYVgiGIbZUgcKKXUw
Oo9K2IbH9tN370zUYC32r6f0r7OfQwoJr4vRtGX8KTIcFvbd5qXyqBlBMc/p
WO5r2sJ8U9OQ7SghHZkOvix3btHUa1prmTbLPPqO9sRbGbn7FZGBUs4qvcvd
PKeDLokyetRCUzT0a9MSLRFDqqt6DQi1u7bLCT1Ppzd5ezZyxHnf0qDYCzEh
3t8izSA1gBU1Ab+JqZCA9TRvNwWpnkKxRAYEZpBM2uzcsibjZNTDMbIgdJ35
XV3e0TJ5a7RTAmFBslLG9d+siHBngBAheLGsaPXCsppUKIDI5Op6PEuxLzsB
GmlN5lAMGxA/Uz6wOEC3ACsHF2Ew2wGAvIjWW//RaTHJJyP3ZNyRbGI4YSsy
up+0TepNSsQH2gGS0hKrFqyIDm9HBgvolsmeJOnokGRypwDOmWcfSo+K2nqc
xgojFOK90x+RKjJy86L9Hnshm5XwaVMT9u1GpDZ74ndQ2YqGz6qdCLuLmJg7
xBvI1izre6Ef1oCKH/llOmOQZv5DitMf/WxmtyBE3QKGeQYjekcLjfeAeW25
k+Sb+h4caSQsrCyWq45OcF6wHMChkfa13vByAI3hYZLFdaoH6D4WGF49dXet
Cw+nN7TUuf18xvOzrloWizzbZeAvp/xlOqPfaJI7puyCVu7yLpucuYy4QkYy
HGrfmlCv6BYEs3YinG+zbUgtzL3Q8OKF/iasUSHjVvX9PuyTzBhOTUAimTji
9+5zntMzawBHlgjcwunvSUoF7Hap58Pgwli0BBxDhpUHYTmUhQSNtmNlGGjp
hGWBGCpVOmzpwS8CXop/3RX5PXHPUVLWNeE7scdwfMKrvZjDJ+oyITHOHy3J
hiGdxzMYWTshV0vSr9F/0mckBukhuDTwsCxmDfGiZE4QKgE6ltmKzgQHXa2I
PaKabAtcMRkcyKU/T0Lz2E/j/k80MYHs2xXxYJyOqSXLvg+JzokQAW4W8HDi
2jUgmugCMFtGhga94VUIUtyvryJuWhtwBxAZJSpL8RJhIom6oEe0/xBm9lsC
+9hCVBH4CUKQgIwCfcjii8jJFMQqYRuOHfBbpzvi1rQLomhQp84MPAlKqYp4
b0C/fx+hygQ6w23eEANn5ZOHJZX7jqZkwDMhvc13Dh6olqyzNze3cG7hv+7l
K/4bBuvV62dP8ffNN9Pnz/0fib5x882rN8+fhr/Cl5evXrx49vKpfExPXe9R
cvJi+ocToaCTV9e3tOLp8xPHilVM0CxmaoKFkOwGZzmHSkhiLGuKGf2Dvvny
8vr//O/zJwSR/wHr//z8C4KF/OPz88+e0D9AVip7K4Kn/JNOcAflME8hjMGU
iQcQq2FhS3KjJWImiqaDJWh+9EdA5k8X7h9n2eb8yW/1ATbce2gw6z1kmO0/
2ftYgHjg0YFpPDR7zweQ7q93+ofevw3u0cN//CeQlhuff/5Pv00Ihfo49O4B
ncG6fU9kmYucyEVrBLckEpxDqyG6TNdk+BJQvVXURYNsWz605AD64nwixXXi
ME3Z1vDt3rPu1R8Live7dwMfh47jmVNP/9QpIhV0knxFFEXsg8VJk6tNysyE
9auiykqytuciieb5oqgKoWRgxsjNtl3Cn8VQUN3FD0dkPyPiVIkORkM8CaZP
sTCOkqiF3JBGcpcS7kcbBf59NA3q5g2rm9A2zz766MJNq31dlFVrsy7clngN
m2rrGlYPjVvAJIY7y9SKiXMMCVM+sBb7nJaWVqR4wX2SdzDy74rM8+QGPLRu
lmmleoyIb9pTV3RbMN+KdALewzPVJnTVXrmA4IY6Qupuh9FyOcGUZTDJlFYA
L+R+4Mh5cF7fmLSP56R98wxOOCir430b4Qf2BJUuqOasTdzXCTR4G65Jf95w
6lgaDJd424h2P/gaHB6Ah8XTstJRhlFW9UaWYDN/rVIUKCEUx5jF2s5JYdtm
o+NEeGqhi0/kIY+mCrKbiiZHA0OXjkwAd3VtR96OhBOHeZj2WMPDwahmDx8d
6+aMIf48WUlXJSnGI28QQCS2YvbTZ99d3TzFBgoIRKKIvPlOvX/frerWq57f
jSKTg5Q8VkchDdyf/ygjjNw39P6f/tzbLkwEAPE2Woi4QRTpxOfK+7Lfc9EE
2sSfMnYfG5fuNJ8syZgBuoxcbOH5Y2TQn01+AsgHFuU36S0hNtf93Lw9U01s
e5cRTA/BHMZ9mq2SoNATnqT8OTT40zbPY+Z7NmGA2c9qsRBHJIxOvKcJvlBa
qgv+AIZougZYuxii3nzgxfOwL8jChssYq+cHa33AvGvuAcaPGOvx/I6MHTbk
uvg0WG+GQGd7LAfSHDDzgccpTOBOzbNJsj/xloYhNMzYX0bKPnZEigDY3IJB
yAfLjJ+tVRjz9wXJD/i1iZKBwHNAD4oMBjVdpQXDJM2ZHWrEHoInAUjE56F+
A7NcxRkgZEG6M4H3xe0bBqDBLvh+QM4i8dRXEkFw09vkXZEGZ1Ar52w/Jiru
emu15cBauy/msIqwVgJQle3kez9eQru+h4q+M/cloEigAnQW24ZdH2YfzFmG
Yuiis8iASkV2vLie7Kbtx6J7AgXFvVJ7yAztyC122HFNWoy3oX6GI+1UKYJ9
VZuGbO6mgL1sbhT2pR2jbnFtMM4YcXsex7iVerOZ8KGED5xB2+TrmuQmjeXJ
RqxoeIMnyWvvK+nZHt5tEjxg3vbuOW68u4bsEDMxNBLg31Mfpy5v4mK3Abv/
DvvcRLDxGKR0EIueFxkMXIKYrE39PMl8V5GamDGQimxlp08KeLdtAuHZ/Ekk
UcJk0DOAS2z3iJsDJB/chDFrJYtOpgIIgv2g6iss/xJI5GmxL1cFlNAIk8id
bmTTI1klUqBWZJdDAyt3bOHFHpZD7iE6cUJJKMmsc66Ldp122SoX/xCCHB08
OxdJMnZBp3LT9awg87jbMUOFg7DnAYPmzcpn3cLRGPw5zmSZiuGPWYqeGfpi
RyyGAe0Za3MBMdWxSmMQbdylgrQNjl854Iw04rcClrBv4eYxenOOAlAGfndD
vmzbMOz0FCe8XZFIxhJfKGywZcIQ80JYCAQnXYDbE1zaFaMVzWQOSPGkioQj
PhjpLITS8h0h02a1ayMhBwRvES5DDoYJOx1xREeHc+bAj/ktx+y3FCrkrAvx
rZoZILsykvYrem6+MpOOTJJykBl78zcFmx+wGO7qt/l8lCCeLw84hDonUiF7
X2Sj8ZnYm03Hs62EWOcT+lqcl+YfA+KKCTf0Nx7ySXonn3N3aVnMZQbWD1yx
kJgvSxS4M7Ks3ladcE+iFM9bzDtKJh+9SuSx3QziUAs2DmjJWdBDFLACbSOK
w4GCjz7yEY7ARYgrZasaDkXz9gKdJSwgHmtVHoC04mASDBDOIN7gJeuLIwxW
rGEYAT8WKei4q8u84QhSukxBvGICqNe2ZXcyPoOrCnZoulw2+ZJoiTGM2fJm
20XYv/aKk+llvc0QJcLXVfxo8Qw+xHXNKNsSgxCHo5fvEzb8jKuM6NDuxyrc
RdDTv8kkGfOhGWiMG4TJ+DQZV9a0ja26xAkz7upizvGtlCmRRqBd19uGraQK
C5lxwCesdVPTYhvIEYRtiZ7ow4zW+aoZGZKB5ZfpBrCLffRCG2kLGT3jIA5b
0eDztBP2PSw492UfhwOAx97pGyC8/z6PSNulwZQ4arGUaHfQfc3RxFwiYv89
dR9xGdriFuo+ViXEOGJng/gDgW1NXhYiRDkqz+dXHLcqaCBh3b2pTLKDgdUZ
8daBSB5BKHIMKhX4AB+6IIHHrOip/l2UrJAuCGKtrKcnaglu0L4ggxR+UBvc
MJiD2SP+7FUKgchAcSGDUAcoIqGAhQoQWg3xAGhAdrCZLTz8A/4FUUMndwgB
oFBG6uAbIsbL1JSvS3Wjq4/j3YPIry6u/VbNDfvhx5xjQfC5sOzloUAkB/gW
729VLFcckWk5kMDwE26nWqT59SfuRVrt1NSjocPwhP9ktGoIKucI9DondBRx
80PsxB6EruDt+4oZ1m1gWLTvaXTiURZEWDlLDOF5hEuzbSuUaMzODsr4Hes1
6vK4T3ctc+zYGSTjrUl1JDjCjoA3iC0X0fMc1MpA2DMSqZz7KCr2ArZEu7W8
ArLaZvCyxN4wIinvdxOunqpqv/PDtMK8d8D7w84MVgSwNNKlcaa05xSIKnF0
lT9YPhs0O1UXZFSWAKohKYGojIIOoFtSlQHDZUWTbdd37JLYH4eW+KWsBZ8T
cIjbsAexSRe0TwFbPzsEAruHC8AbF/IbQBJFBWVSdAgCa11pSGyWI7QF3cEb
46rubsWLGi2fTyB4B8LabLUqRtQyTBSPxDgivrb7MYgGDpcq2w/KPn43CSAv
ahQWc2W5qJ5l8ZZYKAn5eZzGYOPSJjBKnPNQ7ibi//6GyJHOyaRwkkz7cAMW
pMVakkN+QChXNGYPmshqngEZ4CGGFLTDSbOmJmrpr4m2UFtoOGdP3N6B0cRM
OTdi8gz2JCIfC9quewJycvQTNhZEx4kFKkGypGV0zEtYgZiNI30IahDy5DJ5
QXzm4GOxtyCgydh9C5EYMV94SViqsdijdWeaCg4NnwSfhttXxUJ0j0ZdXAo+
eHQqEa8kxUrWQ3roIBpRDp91blIoUqpwxs+J1z4XhSdJ9I9xC08AO8jjuB/h
apUviMOw3RMwUEiyRRp0Eo5eIsjg7TsSSeCzbGWAr48GNrPKp9zcKppKYWqs
d96wpoZog61B1aeJ+zKXiLkJXj4kZKA7ldCgmZgv8eLxy+hQogVTpvGD2OMX
lMNajViakc4FgW41BPKC3Tw84rpgSza8gNOUY47PMDKVpRqAM65WAR4cG2D9
alFuoR/AdLLT0ohprO8RsQ3tFnFxNl3HziMovXMiRo54HT5tIToLHTsOQ4S4
Y/LuHfKA37+32Qn6i23JvgrChJR5jWm3a+CAWqUd744H7wedk3ZVb8s5f5SL
BgkQrGF907N10QZueOoTVrrIf3c2Sa73Z9Rh2bCCBQ+NXMiV/xSuWgtfgk/o
rphvzYEtJwoUBJbSGWUAk6jXxhhO8x+yfMMCJ8s56eksUQfOgBjI0DbtSxPF
8IiPhsB5o48+mzyOPCPq6nvgrjn9Zvy0KSCSYpPZ/oYTnBYBqtLoe494+cQ3
Zb2TnF7s6B56pweEZSEpZibeK0aWEsSiePvhLRE/G8wc2RgBLW9a9dLybySu
sjzx6WxYOxtbYuSaGcpRltkuWadv7Wwjx7Wnf2xSfMsqbgkc06qudmtMiV9v
lZhezRbbVjacHFXXBFnnYq1ATIqXewYuGSn3BobZjtV0Qnx1PHZ7Yqun/h/i
col6LfrsZyC6WYwWVRCjZPq9NRVNgmnJ9EYXqrKdSK70rGRB/Img8xp5RTTI
AZCKoyJ7izhmtqLNl6aGrPJyg6HJasi9eKavEc5pYw+o/jQwT723TUZPILxh
VWFJZGo1yoQIPe7qEqFzViBJZpVCStVb4dICWFUDXuSwf4p2HQ2v9K1EDU6b
L2DvMP9Tt7S3dvGVpFDi0IDkZCOQDiLnqM5oo0/ZqRDb18RZoZ6LS6qpf4D7
5d0DGl/c5o0kvyzj1zb62qlEETDF769fnmmSADAQ3FzDFBH3J+PVq0OVaPSc
0qwJNqno0MjZh39kpoKOwz34HSayovMyZ8nD6k+agIGcivO+x2dH7O0Ah7Yx
NJlLQDqjf9ZkSN4hRRlxJo4E6Ao5/HL76umrjz6SJdKnZW3puy+nt3Bp66GG
OAfySwhT4dt2zCgkKgXqTyzbRezPW84+hr/xsp84hOwLzshKkjc+QcxFSUpq
HRHd7eU+mhHN/mSxGpPDHmk1SnwytHE+1XvaKCs7xJdip6Jyd/aQ8IrU3kAM
iAVQu5cXx8xMPMGc2PTAmMbYQl/vLZt424pNPXRiIxfCfQxE+pijJD3v9dV1
4iPPam5IOvAv8Vknez5rwf+ynnGsVlzXzJkfuN8RVl2tg+RJEjskuHLE7xWF
N/z5IM7eFMul+YuDKzVK3Az59aPeIPM6lyCKLAV5uULfu35s/rYXsOHR5MWM
/UgPRUooJQBzg2omyREwgbqO6wf1PZDj0SFtfSxsWDsI8rWv+a3TbAVtDAMg
lU5h4bl4AIdpDLIONkjGRfW98Hif59PVb/OK1QccymvYrURoczuTsbtl2+CO
U810R21kbB+cODWCI0uiz1YcZ4SpVnD8KL1XkAYYRuk1eB+FqA03/kFUBYvP
0rdXiHOo6whJt9V2PcubQMAde0DMDWMuF9knOwlFH/4QCHNlvOyc9K8iQ8g7
UBi8QR7Enh3Wq+hE8zuzYRchw0jcPvN0I/E3ow/NM9WsPymXUKD4LfpIyD4A
czZwrw6nQMTpA2COPj/npJ5h3ycjda4IrwlmEEe353IAPqnN0py1ziaU7A2x
Yr1t1R0cUAMsLFX2dL+qS3wui/CiCcaDnS6xnTaHCQWHmLliD6WtKj2KRa0u
QWGE3pqY3nhHsy8SgqXHkOC851qSsCCVAxKnQzQG+lf9s+MEfcE/NYnAY9Ml
REPmK/gsc8JJ7HaLhOu5SXXUd43h3UyXwdbReeJj0Xgxre4OioHpBEVnXs1W
6tF2VUY6fCWqoLiCNLAWUgRDvZTtRGUWh0V5nLdVfc8xDMCKU+sCNAAre07z
Z2WtEt/X8mBLV53oXWD+eyGtdb6uGyQ1rWgXIkaFTHnyU7zSog5d97AmqwZ/
w5fF5zY3vn3mJ2tyqR1L3X0D9cQYu6ZyRXaRSuArnxQfDIA4yYjTgAhGcV4V
tBJOXJ5rLoVplJmvfjhhWJ5wxVfeehc/Rh7tx75R93Qos5nlfpwt4Thb4qHP
lLDNCVb5iIKq0eM4tUnJue0JT9EYfUFDPzCBEvdeptNpsF+R4TWOArN7s7ue
oe6jyXHRU8THxGWE1KwofceH6oJiZyFgI0WyNnJ3qg4TlFBymEf+A0KJLL7h
CpmQJfiHzSTTOPAioSJNsCIFqMxT5maeK0uNU5QBlyhvmfQy7owHi9GT7nzs
HEn+qjkTzs4KdguPhr4WF5wDnw6cA6PEF2tw3inPPvI5R6ZL8HMjoF6ZplcO
T02iIq0PBUS1FiXC6lCGk3JNAdlJtO7rCEzzUC/bGguax/zTFOk00/ICO0kO
F7KqcSDGqBHV4MWKKhkmyU2uCdLv3mFVkeajTq5vQzkJGwZDu0DSrkiE0KY5
YhDWy4GlRFfrgwDe4B6e62lc/3PGR9zGZzwttfb6jl26/IskKqtK7uWYWUv3
wJSabUeyVRQgZT7IZ6KvcSyMper4h/ZjVeMmF4bfiDhk9ZaoTFP9kpBhGec7
FS2HadluYY+XZk8sIjIIn3pE8aqLeV7MZuupQbRRUWXUkOZ4CZnRO3NXwuCG
inU1KNgx8190JR+4Sd35xbkXEDG3hcba88H1iMA4ZX/ftpeS1TkPVa5Bga9T
lLgDI4m3kHNUJqR4b8o0EyTkH4XZsgbhrYQqv5cfzZlo2aSBzXG5OejSzHSJ
neUIDB8wGYLjlkls4gY42OQL+gHsT1GQ0GNehtyzyHFUN3Yc9JAe4UTCxofO
BS3isiJLE3Jh2Wg9UCyR58YBFYu7APC7Q8BEoo6mLgBvOGEPuBcMET1YSH9/
guqzjQ4Q+RrRGS6QKDErVSHVJXnNelghZsU5NFIPgydR8m3K7lDNB/cj7aM2
CzjO9/oQmfQIIIBbzmWIA2oxNDkgpaqbLMpU0VZ8YxCWtQefQc7XompE2BQB
sH9W6EYeJxAnhUq/N7fNIEEpqfKNDkZyBGTdkusIzsRe+qamY1ijCjJGfQ7I
oisFd6vg+L3qZWvTj9VHYfmIxHa7oS5z1CVxZQUWA1EPx5AF5PbUe2W4iSS5
HJBYp0EWnR0QX6cqm84Cs8Z8LZE482uT2nXDHr50L8tFtKmqrsYkz5Lg1g5l
xMrhdVOeMcQZ9FBjGm5akM7ox6TojvsILo9m/hwWywE1oYvmASWWiI5AeO6U
0/SlkqaXVb/qgs0luVI5KSTbqmQT1vvvl1syB0laYmx8OavNKxRtU9IUA7vR
YKg4PLZdLYZZvAwO0RZIPQqODiJEbpg1Os6hAjluRdlljwEjos8buHo62WNO
nmJNuRD5AAVXaoOZXlE1xUSI1V0qvAZ1DiI77rle9JDx7zUSsFzSSUiORNQm
ompuGnsuiRQkkzgqbaKWTwX5Q33J4k4vL3tV2SykmHkFpfV8GNGaEkLXS1Rs
dVDg9n2e73srbLwQPZnenDBok5N48ydcL4eqYuxyran1S3Heeo85s/W45ozz
8mvwMeMnTY8GnDSsIBl1n6dvNc9aC1Sj7PM0w0o5ODUkol/u6elpmFIC5lyI
KeyZHP/PfD59ZFNZCkyng9LFHVZZ/n9zEmnnChfbdeY1+q/jNBr9t9foP99r
BPupdN8QINoVMQj37sHK/n6fHCrzNVA7qx1u1LqOswLWxVJ9G/Ot30Ghk/kJ
jLD8OBIOdKZ7IRDbJi3EXRSTDBnH/PuZ+/AU/dyELzwfj/Y04gQYWvGGUOIx
L+qTo3rXZeyJkOQBmd/PSeoPCPSuqDle+hOTE3/9LdO6KBu+EiqEmoJC0KCr
jSg+Pi1IOCWNYRaXBauNHft1TXp5mlb/7m3o6PxoNH+CRGYcn+4NpcVLiwK9
WNTdYxW+9HHY8pPJeeTwuX1+86F4zmGLLFa6vdbDQTtlaOYIstx2zU8y1dFn
YVhtoRqIIbysrWkcH4NwcZbcohmKjcB+IW8Iq/vOR5hYniMzORjCVvIYbOTj
ljHcf5jfKuarXJQ9EybgrvjMh+vRaGXoYiCYHugR9+6B6vNImTI94bhmIzbD
5WWkJAXlkNWlxGfFR+7cNLLGvAPx2yjSGYp2JOKftFuEEDkXHNUTFupUJuyt
dfimOURlOT7c/TX4Isxf2B0TloY80FsTk4B9TUCV8yi7BfK52WZRCanZ6kNn
gSal9XHZUp5wINj1/MDBJEl8CJ/0DsGttc+Hy/T7fUstiXuimF/w3bthO0n0
YTj0VGzNlpnPyavgD+Y8tSrnSpFg2BbK7ZttVUlrRXFC9+wmXQO3eE2buaN5
MEjULYX9HlFBpfBJdLQRCefTnTjpZi1chx1NJGM507fR0h3OKJqFfodckhMq
cme78LW5+QpOvkYCLEZvJyfW0scK4zStrrDcp4Gz1ZLJMNVY6g05xbktWBEP
+kRIKz1WeLS39InlHKrjLvoZSghhwDIfZn7FyXz0LDHl8ZBVzzaSgX0y9Oam
fXr3uQP5Gsl2ZqEu6gxhnISGxZoq2YsWPbPplq1MBQzr55DEfnz5UD1OQCVE
TEyfKosOOTTEBkeJeIWeX01H3KB05L6c0n/Enr/5asL8u/XVE4cmYT49TCmL
XPLIKm3FxiIbjtuIaIsoU87V048Yguio6KmC+t8jJUb9yfpFA2I8znJEfBL0
q7MKfNWafeeGow2irKUWA6ywAAZ9teWKdnSBPcZA0ClNrTOZ2jyUwBOrSJHY
TdyCamTJad5aSeJ+SB+AbRJjmZCdprRGOdmBj/uc6dD5kIMJPrfpYD27VJr4
fTBfwDqSmOMbd95X7qaHiq7csuZ6CRSeZIKVgE2SHjHPLDgf6QErNCqS8+QU
ewutJKahY8XsA4rbRBzwXZ1eXp79NBTZyxxYR+KbsbAxH4WV9spKBqwAo2dZ
rhmNoc+A42LpGm6f0ATQFOK2X+cRktb6HRTUotZ32bbREqyW48h9dAlaiNT/
5Gw9i0erpwmkkTNkLd7iYUkfMSaU+zQ79HWRH6NAq/9VnVrD8G6DFttVCI+F
xlSSrcaO8v2uKiFtQ5mAZOi/lez1XEC5G9RWSJsm81DXw7wjWU8q6forlg+r
Qsx7N4ita5G4vpCKKx/MOYpCHtNHfpl39dCZCZC95hivP0pnOZ3lu5pWp8ri
mQIKApF7gkgyEot31ozllNNOfUAH6yX5YKQk6vttJfvzcR3Fam+sOo6UHqO9
n0d2SZDYTHbxqi5+NszM39cjO02QEMdPit6eqM326Co9JiRANIprA4gS1UAJ
UQ3CwgMLwb7YN0RnJnKQKY3QTy2svjY30CvGkmlyiP0PAp6qy8fchw8xNRVp
oCBZnim8tM+C2/7dA0QjCIeLdVGmKE6XWNjB+nbvJk1+yvw5FhyIYgMDhP4J
UyiZ7uVD+Ih/t6+DImOfQDsr5uzwONjgUOrej5szSWTDhCY3fWtmMObfOdQE
loriPGCtgKsP1//cEBLbg/04kvtQHInWPv6vyNp4YvVsyPc4BRRR1ATWcdcU
G8kuOhzt+gWMzDOw6bDwiY8aHIsx9VcwmV5cR+VE6FESaO7X3gnLjYHOpMg5
VU+HLxljm81XMyGHiw0N770WDln0+r9jKK1MgR+mlxxh/GVBRNagEM5PFAYW
tsT1j70fJ86kJCfSBubEsvEQRLIeFz+u0WLAZS7dNdKltt3QqfuN3nWZHNnz
PidEP5329YrhCEzWkLVXjC2/XHOQHaEMvrLfQXg4x0IqiaGKcGgBkiD4ahac
BYC8Ini0aH/ieHpx+8Y91VY+6DS57rbWnol+CQV2LEroy2yLacUpHZWY7VDG
RoLnRxpWuR6pRuzRruKUupX0aYyQ6nFAKu1NXhFsVTbBTyz5bPohZnAiyHwy
P3EWbn258/10ru+euLuWVPS7X4cE5TNV9/ibExRBdKsTr9/CnNKuI0y2kvBM
1iH3JfIlt95TYZETTUjoSB3k/i21dVlh+k4MYj5n4AjMel2Lsjw0eZKedHwY
p+efPnpEfKKzvYBf/CrKetMCKIbR6fnj8DLyH/qYYOM2eVqOidRKS0sSOENq
X2POeUANf2LnTyItMw4w9P0cie8QhdIr1NDteBtYXpzo1VeU8AbGOSUOajmP
DLms5MUj7nkW4yTXGDPjiCqwvVRKMN5dWm654CU0FJC0ysiproy4HchkDphr
WZEZsJpehJFjQmeVikG1qjdsuuoIbdDTQV3vE22G6h3tT/p8NY7W+wWrlwoV
cqFNIcRIT4IokKJGZGwa7bh1KNd2Bxv1SO2AXi4g7yNr1Up7+RS4xRZrFfrG
fardbyBz7BVLM2ChcyuK4944wW3ACMtCI4MP0weIoJe+4VSdSJM7NJTAmFXY
Pj9jlvgzMLd/Ip9OPh9YUX4X6PyN7khew1c/zwDwB2IILDAk0uV3Sar3IOEx
xOhI8mvHlHyxYKPUbr9guIMOfHjbB/J8ckqsgvQm7AfmNVQrHfC4V+yUEJWx
JmoxPMT0/W6NqvpZF8ZREtJMMHvDDVi17c0apyOJMSohoXHCb4ecDG0De0id
FXfhUMEbsCnf5mXs0yElydW3t9j6Ym7PdSYyipUPaiP7ubiiUYjFd1L8rGJC
d2pVimdnZvrkWpDPyTzuf7rr21cwgHqP34s9HyPhr/uhhSGOfjbA0a84WSUe
c2S5gIae3DGL0Uf64EqaQ2jtGVzh2piLPfCNwCHyibMnjOuFt2szVBOfrGHt
4063lTZQIo4dvHdawPCNqD5PvYOUj+AGwqEfYenTonl1W88FNKgq2SUmYNDE
sm60JbTaw7sBeI5aTR+YHaihPiQlDlO/6TVN+E4Ga0H6xPFVQIHMpAJzZI0M
Yf1qj/qSexBoQF2D5NKbhzmCT/JS2WvPe2mQpm9aG9BFw41iQxV2iiSh1Bx4
R+yoV7EcHvWs30WaoXTFOrdmfJ2UnMudFDkrsiQuQEVqQXG3kWdHg2L2XtKa
KFraIUuTn+wQ2lxlvC9L9v1gw8IF80cuaATayKOnf9gAUe8UiS5HhGPhaJnZ
izHjolIDIYFiWGMuZGarozLs+DRI+H61p9SR4Amn3thPZLG2vba6ndxbQ9Cp
18SSOKNEeHgUtA54o/EGCcNyk2lOItNUhJ6190XEgCJZeTbykfKg/qJroHV5
jJGEk34i2PeT8w5mVURMQhvmiL9IE8A1bNL3VnFhcqU3kdBONkARu7VBT8uH
9ZJhM+KRcIpeZki4lYZ7X2iVvW8rP0r8BWVr80zrpSdeUVOgjLSzbFc0/gu+
10Oa8vG/ZZmwOfsp3ZZ8yST5VDq3uumGDhEdpZOp026uyA/iZ2q9Sj93Zsiy
zthoVuKSvL0kSv2RKxk0suW4tr6U1oFMgfHQp9jT2zzfnHE5OrOQXtdjvrmM
h1CWZn0GrNsiGM1Uy6m0871mogZVT3xUbehYAHLHkuQGtF5VVJujIZ0oROCu
0orZ3jh/9OjFl1FnDaldGkZOfckQ92kQ4R7ty3sHjUkevLbv3YPIycAeuJLD
5H7/PT2qx2pGsfPUFzYlvkdGnG4hPgX1u/qUfPFChjYgSc9Haa4qlVOKM1Gj
6XfvcI2hZskSeHywOYpN9jxFfw6uoj9zyz100/uAxyg54jGKexqDv+fZlqed
3hBIWIxLYmSrN+7JECF2qDtUjUai7GlDTKjpNcWUHjFJPPOSe9qoHtxXCtmO
aPINmp7mAYoVt+oJhZbsdLLj1RYjQEPiOuKn8a2CbNGcN6BX7AQA9rsZMckN
sruZoDPaINtV0ZceubSZ854fvRRJeNVJXUXOHveoHlGuuIEgi1tucCVe0bFX
iRgSpy1As5DuN8djsYNYAidg4sqbRc7pAP0LjLhnFsFfbywSPZYVTtG6fU7R
B24TOaa0XEVKIJdumBYbpWCE+pJD4Q/Y/DNuAeotMw2rquEXUrhJ3Sjnoj1L
LIpP6c8qe79bpz98h1m+K+Z/7vm/BoGMM/roxfR/fYeMn++unoqy1sZfPBlY
Boje4OXp76dXz6dfPn+mcKVHX04vf/fmeih3PxlECUd+hC+nL5/SucSvPhkG
FF/Q2dTBcxOAxsqAJGT7dngrWBFsPwJiddKuofF1saUaHFX8ovnFfCd47wwA
5fuD43flkpq+N1Ace7Ffr/UqBXcfugl677sHQQl+D7wdticC222tdpfbMOUm
zVjEOF5qbq61cpcc7PnYHorUfnqg1dYhauplPfuucqO4KFjNfOubjhQnMsHN
mbmzYs1BWEXTRwFMr8PGDqKDJCW03VmtOpcVm2Gz394pildEtRDxNXn9YEGs
QsG7WvPtemJDqn6wS3Q328r6H5Zaz8LMcD6J+9q434f2H7foSoJ2PtydJDbz
vjjiFrI7EcwBbEYAGXRx70XuRpqyCmjlD1HXEZ5Oeu2JWpz0yz5I+IKhEM+P
v9II9L2Z7jow/LI1bEPuyuSb+TCrIVXjPhdbbr/FnYnvblDmAR+TrlmvFWSD
QWthtAkdD+zDNhr6qPgaP9me3KhS4TUuQEWi0cbe8U3x+Di5CzQ0Q2bL+JaL
i3iXrTeSzJtYNHHTe/Xvv5zenpnri1+INhHuQdAMCe0FxYKI9Kiu27QXDx8u
CSm3swkh90Nc7H2/fOhzGB/KPdgPP/300cEci8fnh7ElalDlem2Jza1kned7
XamSgSPJ9btS3WzXaI+LXwekSIhMpz8eJrBqaiRKFFw/xEayNVjUep7xzW3I
kM31bqqSALiFuGTfopgn/dktIpKEe7PqcNsgYk2Bxr0frD+EcXgEngdV1v/d
I+jv1yOI3Rd/RZcgVKb87X2CDnYK4qKXv6Fu7Jd3C4orwf7mWrBfUg2Grd7+
9fVg3DTo79U26G+vATteBfZ3rQP7+1WC/e21YH9jNdgvrwf7ayrCUIFzGKnJ
UJebLHG2M+sGl9XLCj7YfgGOR7N+ygugBDLq5UBaH1XfRSU5dLeDr9jupRMf
EwZyqgdEwZHyonBHJ8OXF5rBo6F4gKxAzyQZ8fZjaJ4li82mp8mVpcPzVDNK
Ga28OA6vvfeJG6wwaM9PTZ5FNYb5bSNU5vYhBEpuS8wKu6YJWmBDkvNj5R/K
RMouJcnfxe8cj+FrxgWFpXTbV3JjYWjKi5gidqG46NXsosrvCrUqepVJcjVl
fIcwZ8/3DJojImoS5SsPGnKEsNQhER0ZKvsps+3I8iR3gcWHki+5SRTNRaTW
hWvLrbqMy7Q47K+Ga1eTbYeh2cPZrfIjFUjG5YUipVhM7h5QWhzUo7GXCYlb
MLLaomTD8ANoz9nj+7dRHaQDw1xZWZOTClmZheyxG9Ed3iLrMwW3OcGNwzl3
JSDqzwl95iKb9IpLqSbR0ZWuxJE+//CwTrPKHTcPIMTithlxXoLvoSDiXovs
0NmHMVYllKzHGXNpt3GhqlZrWh6U1meGX9RJ7zPTnVpNssXpYF/gF8LOQyQj
ZPVJr1SJZRUiNX8qYuFuePzWoqrrbcWB8TjGwgP5OyEXnd5bu1f22o96cThD
McYuAnCa7CbdJ/LQzcTDFsswGJnR+as2BpUA5jWjz4HK3N6R9zIYexglx865
m4pTFwLGJaBb7kIicvsTPeH7BqCUa+a+OQR4UF1X464ey6M41cdnWPgqUvNv
qAUSov2+MPZhr8Hrf+nOGz4v1COolAhojCu0DN9zYsb9MtB0aZk281LtGFJ6
OBIsKBZFVK2JkN5o2STOP/I6EdulJhP6zZIlOod7OazwsNck2a7Z04thynA/
fdIvMNnvT3gsTwZFKsmxOp5+O7/ehfAKEEIO9p2EG5HV83ERdT20GzIPF75K
Fhlu6vsHjNRvKGhpMjyixkwFCQg1l1rw6JNfhFRbHkeoNdzRxT3Crb1XLXcP
SS8OrTiN3DZxDPXKZDIcBgdl9aFUsI13Mqnyo+xmW5QsEPRrUvu8Il1U8qcp
/yochfeOAXk6rEV3rz5MtBqHg74VD8dIo+k2nb/mjPWyUM478EMkiKNaZv4h
f8j7UbjvG2LpHh4LfWXgwBfTy+owCC3OJ7HxEq5zYParWtTDjHsnmzYFlNsz
eMEnLY3cNH1/XbEYiS4qI813EXOR+NQHFA0RePENNd6qS3F/SWrOGsn+isKP
UsSrDfl4EO4lo13shUoDmwpzQ7UcTkdKa1aI64Pd5Wg3Pkk+GQDQTLVoD23Q
srThic/RSg45DzSzTjOhwUJ6WeT8o1312kqvO0/co9DLpufsGJmXAH0WfHMC
yIMDS4gbWkQOhrNBtyIrI+hLmqh+txUEu1p8CHN8ggXbN/MDJvVI9xgHa73d
LlFbzx0d11eyHYKGFQQ8hbKI9Hs9h7koL3ZBlzj1aahTWMuKl2eEH9+zA/zh
nDj3RhScI/0Z4ABp46bxvrxWbvPZ+lxvKfQOXSP8zmP+b0VIUeoC1tAjHT44
GQDldHcej0UNZr5S8H1TkX2SqlcgDExH9kxwRO5MV+Zk6HfU9PeXVSS4ibex
qKL9qFkKcvFC7LCzVywa9EImeBYm8Ex83/5Meg3iuYinxM1bIVeX73hUFU86
H6ZmPaZJlGTEl0QOsdFSRvRyiB5GJj2M7Kz7n+ime1BCEJGEshRNXPgKezbh
pZPeITyHiDFMTqRNKfxzZY57qDZRCz7ofhKs1hS0/UNl4NrNLa+jI6IRn0Z5
WPsgzeijiCyESELijBpAXRRSi6uF7fZyzhXzkYA488tx4RR7M7VTQ7xwdZrK
ef6q7fnWGH5tEL8qXXzZd2uyJyFdE+F4S2fmFKTtRkM4sZXWV8fF1tZVkZ46
4kR2gvayLsLdPWKzCES1E29vRHzTuwk+xoVEu2cNBR17Bo657PeKff2lE6IH
CgSYk5oKqGo9nawGdb3pqN9K6tr3+Obq2tkd4NrvLGaKxgaP8L7REI95KzQP
jFCaCxo4d63cafqgoHEkY+QeUutfY/BHhABvnvXuD46TfNTHCuEuvi+tNTpG
YB+iClbeo0xdiLYPUIbvNLt3Intp8YncI+fRSmg1CGyQi47Vv6hMS2aAV73s
GdNCNVQIPyQ68VWEr5gDn3Pq1FmCRqxymeOpvRUlVXEpa8OhW3ox3K5n16Lh
SisSOqjhzs8OLoYdCXIDJ+lRspXYc3HILk/kImnfdDbcziP9SnBI/0H/E9cy
cYsH548euf7/8PTx3lP75ZNHj+jjj8fD/31sL338M5/TKP+ujo8ww7+HP6aG
G4Pnvy8Ip9b2Tx7l6vo35198Pvn0fEK7mZzTE5nDfno8eTR5/KHnPAp7x3/j
njzeXwt++o07f/zJk08/8PzvBBc5oHcX7sGiWI5VxRyj6lXuhxlzXWdX5r85
Ud3CcTtI+5321p5YHFcoLJi7esMfWf/1QmMIPVwKwfLk1Fe2ejItfFCGPTuE
D5Zwzt+fiRmndmHoPWE9YvwqevcMpZWKLabsvBpL5ahP6QvVMdJjBxhzNmT7
5txYy8Nj9l5kyUSRLX/NnjVbVkmRz/ere30wVzV0LyPiTutm+O91U+9xyGlP
c/OKWT8Cu88nc07gwSUAaazCKpfTTOnEcsxT4jgNSsXXXFRIZwKH6yhEAuW8
4p4lXueUEC8xHaY4rdyI2l/0lZKhJjJJ+uqGmPDmmfHO2CNSOTk116QFriyK
qk1gZfFaubr2DbzEBk16vmLBG98dw+rdtLGC3+HkCM30SMD6uBxB4SRCYZ+V
quh7KtOcRXi8r71MYw1AY+V91YNLHkzx4Jx7r2pEuHcmqJut8owvKJSyvGCa
RjgdtBZ1Et7bBXXVsdPx+KOASVxoZJA3nWaLWkuE/m4smcyqh4KDrb8rEcBl
vky5GJs/PtvXh06jYJw3osUkgWErd51yoae4c4XPc+CUGSAHvu2fF4Hgozl8
641Wc6oOqiWC+6HvSC+lgYbwd5d5y7HlO9PDJRYfwvPE27W2D3vf1m7lxxJm
EtNlXc+ljwc3p4EzNgoBHzCz4amk/dnQ9z2PRGo+iTjNrNlrqqzdGLSoGA1V
6DBSTWd9BRjp2vqx6wOBaaZtPspe82MnyBxfgi0VghUr3paMPi9a0np32rUx
ZPvZhLEu1FM2fsH/RH9h/9wzz5YDUz7DL9B2f/NHqFQjVrf+RFrIb5NfOtM/
jsc20jmPROP9KeGZpbE2/xpP+Im99tdNe2jCEet/Mq0EXC4sdINeHqjlzb1n
4ogek99LZeW+CnPQo5EIg4FCA5f0S6urd682RBdSCvjugYUBxsgTlPxPrfTx
hfhcTqM2ZHCP6k24P32RrSkY4c4VJXGutftBej7Fd9YyT+AirI3k2+wSn9Zi
lyrvs/8bbivVuuNLuYiuZnXONwzljWh6iNweHnYeDOc1mSBBlLDfL7BfLTBo
+8OFYRC+19LMA7lBWoZo9+yOoIBtxOhkBwG8Kly3BBVNfZ/9JWIUyykWV1a+
3nSt3Y9pF/FwaJyYYFHPLU7B1y5/VSAndEPchQ3cJG55i3OQy5kHl6fvVYOj
KQsf1Gl7pkJTXOjWGG/i0DQzD2g7jH0WbdLzkVm9SjNoy3L6+vYWeuz14Pvo
SmxmV+Z3lPCKIN5sW74dKcdMWBfr1aMVHJ7akuYnjhw6KfViQHlgTbEtgQrl
Lumbxar9rJhxx34Ba5ewCFDu9T+QUEIRR5SS0x5BeGauZopfmXUQPhtM2dPl
70j6CyufW6kHJwnMt4ZiSYRNfZDK1rmLQXWokXQCfYS0tllZk97HxZd0QGO+
uz43JJsGQrkW6kuQrHvhLjUtVwKLlrT7gVrvOEVXGhT43GGvqVmRjAW640aM
fG8ZPZUK3eBT7jONYVeIf+K469X05fRAzDVaFKv4VS1vpr4rXwK7GRf8YpRp
Zh2CuCyKmLzAPp//5mRBJ5qL/ZmyN0TEOscSpxy804vosNfXpDGkDcnrr4k6
Nrz1kG/N7sEF8Te+V9jdRGE4TkAW7aQs3kpCLqZzvyPlqnIv8l2Vl5w9lrws
srpM3Wu4jpdVXRZRu8kMsJrqNSyF9uAQNEaFr7Y42Gw79D610Ka0JZWQ6d6B
/l+x8RwtN68AAA==

-->

</rfc>
