<?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.18 (Ruby 3.3.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-meynell-panrg-scion-research-questions-01" category="info" submissionType="IRTF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.22.0 -->
  <front>
    <title abbrev="scion-research_I-D">SCION Research Questions</title>
    <seriesInfo name="Internet-Draft" value="draft-meynell-panrg-scion-research-questions-01"/>
    <author initials="K." surname="Meynell" fullname="Kevin Meynell">
      <organization>SCION Association</organization>
      <address>
        <email>kme@scion.org</email>
      </address>
    </author>
    <author initials="J." surname="García Pardo" fullname="Juan A. García Pardo Giménez de los Galanes">
      <organization>ETH Zürich</organization>
      <address>
        <email>juan.garcia@inf.ethz.ch</email>
      </address>
    </author>
    <author initials="T." surname="Zäschke" fullname="Tilmann Zäschke">
      <organization>ETH Zürich</organization>
      <address>
        <email>tilmann.zaeschke@inf.ethz.ch</email>
      </address>
    </author>
    <author initials="N." surname="Rustignoli" fullname="Nicola Rustignoli">
      <organization>SCION Association</organization>
      <address>
        <email>nic@scion.org</email>
      </address>
    </author>
    <date year="2024" month="July" day="24"/>
    <area>IRTF</area>
    <workgroup>PANRG</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 151?>

<t>This draft intends to summarize all SCION related questions which are deemed important to be answered
for SCION to properly work at Internet scale.
The set of questions is at the moment not comprehensive, but we intend them to initiate a discussion
to determine which questions should remain here, and which ones are missing.</t>
      <t>When appropriate, some example solutions can be provided for the community to determine whether said
solutions are adequate or not.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://scionassociation.github.io/scion-research_I-D/draft-meynell-panrg-scion-research-questions.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-meynell-panrg-scion-research-questions/"/>.
      </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/scionassociation/scion-research_I-D"/>.</t>
    </note>
  </front>
  <middle>
    <?line 163?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>SCION is an inter-domain network architecture. Its core components, as deployed by some of its early adopters, are specified in <xref target="I-D.dekater-scion-dataplane"/>, <xref target="I-D.dekater-scion-pki"/>, <xref target="I-D.dekater-scion-controlplane"/> which are currently under ISE review.</t>
      <t>The goal of this draft is to explore how SCION and its early deployment experiences can help address open research questions in <xref target="RFC9217"/>. Specifically, there are still many open areas of research around path-aware networking, where SCION with its early deployment experiences and research efforts can provide a contribution. This can also be a starting point for discussions around long-term protocol evolution.</t>
      <t>This draft assumes the reader is familiar with some of the fundamental concepts defined in the components specification.</t>
      <t><strong>Note:</strong> This is a very early version of the SCION research questions draft, and it merely contains a selection of potential topics to be further discussed in this draft. Any feedback is welcome and much appreciated. Thanks!</t>
    </section>
    <section anchor="conventions-and-definitions">
      <name>Conventions and Definitions</name>
      <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
      <?line -18?>

</section>
    <section anchor="discovery-distribution-and-trustworthiness-of-path-properties">
      <name>Discovery, Distribution, and Trustworthiness of Path Properties</name>
      <section anchor="isd-as-identity">
        <name>ISD, AS Identity</name>
        <t>In the SCION specification, identifiers for ISDs and ASes are 16 bits and 48 bits long respectively.
Whilst 48 bits for the AS will accommodate up to 2.81475e14 assignments which is likely to be more than sufficient for the future, using 16 bits for the ISD only offers 65,536 possible assignments. Further investigation on whether this is sufficient is required.</t>
        <t>The following questions arise: (not comprehensive)</t>
        <ul spacing="normal">
          <li>
            <t>How many ASes do we expect in the SCION network model?</t>
          </li>
          <li>
            <t>Can one AS belong to many ISDs?</t>
          </li>
          <li>
            <t>Are AS numbers globally unique, or only unique within each ISD?</t>
          </li>
          <li>
            <t>How many ISDs do we expect?</t>
          </li>
          <li>
            <t>What is the ontology of an ISD?
            </t>
            <ul spacing="normal">
              <li>
                <t>Per geographic area?</t>
              </li>
              <li>
                <t>Per legal jurisdiction?</t>
              </li>
              <li>
                <t>Per capacity tier?</t>
              </li>
              <li>
                <t>Per "type"? (meaning: any grouping that makes sense to their members)</t>
              </li>
              <li>
                <t>Possible combinations of any previous "types"?</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Note that, to achieve global connectivity, ISDs require core links to other ISDs.
This reduces the number of ISDs to those that have core ASes that can directly
connect to core ASes in other ISDs.
The number of ISDs is still super-exponential asymptotically.</t>
          </li>
        </ul>
      </section>
      <section anchor="beacon-selection-policies">
        <name>Beacon Selection Policies</name>
        <t>Path discovery between SCION ASes relies on Path Construction Beacons (PCBs). In core beaconing PCBs are propagated omnidirectionally, unless this would cause a loop or exceed the maximum <em>path length</em>.
A core AS selects a small number of paths to/from other core ASes, based on its beacon selection policy. It then propagates valid and policy compliant paths to neighbor ASes. The number of propagated beacons is limited to the <em>best PCBs set size</em>, in order to avoid that the number of paths (and beacons) grows exponentially with core network size.</t>
        <t>Some potential questions are:</t>
        <ul spacing="normal">
          <li>
            <t>Limiting the number of beacons to a <em>best PCBs set size</em> per AS results in a partial view of the network being available to endpoints. To what point this affects endpoint's path-selection possibilities?</t>
          </li>
          <li>
            <t>what is a good, practical, general purpose policy, that can fulfill conflicting requirements of both operators and endpoints, as highlighted in section 2.7 of <xref target="RFC9217"/>?</t>
          </li>
          <li>
            <t>What are the desirable path properties (e.g. diversity, PCB Expiration Time, how recently the same PCBs was forwarded before).</t>
          </li>
        </ul>
        <!--
Since a path may expire after an hour or so and because expiration is not the only factor, an AS will typically start
resending the same beacons in less than an hour (i.e. the typical expiration time).

This means the total number of different PCBs that an AS will receive from a given neighbor is e.g.
5 per minute * 30 minute = 150 paths.

Most likely, an AS will receive PCBs originating from a given source from several neighbors, although these are likely to be
very similar. They are likely to have the same tail and only differ in the few last added hops, i.e. the immediate neighbors.

As a result, an AS will probably have only little more than 150 paths to a given remote AS.


This is likely sufficient for most applications, but is far from a complete view of the network.

This can be problematic:

* Massive multipathing: endpoints may not be able to use the theoretically best paths.
* Unusual path policies, such as geofencing, may not be fulfillable by the limited number of paths on offer.
-->

</section>
      <section anchor="name-resolution-and-dns-service-binding-svcb">
        <name>Name Resolution and DNS Service Binding (SVCB)</name>
        <t>In current deployments, SCION addresses are added to TXT records.</t>
        <t>Example of current entry:</t>
        <artwork><![CDATA[
$ dig +short ethz.ch TXT  | grep scion
"x-sciondiscovery=8041"
"scion=64-2:0:9,129.132.230.98"
]]></artwork>
        <t>The DNS Service Binding <xref section="14.3" sectionFormat="comma" target="RFC9460"/> allows a dedicated SCION Service Parameter to be specified.</t>
        <t>Service Parameters allow the specification of alternative IP addresses or other parameters (such as ISD/AS numbers) for a given URL.
This would be more elegant than using DNS TXT records.</t>
        <t>With SVCB this may look like this for https:</t>
        <artwork><![CDATA[
dig +short https ethz.ch
1 . alpn="h2" scion=64-2:0:9,129.132.230.98
]]></artwork>
        <t>SVCB is also planned to be supported by Happy Eyeballs v3 <xref target="I-D.draft-pauly-v6ops-happy-eyeballs-v3-01"/>.</t>
      </section>
      <section anchor="segment-dissemination">
        <name>Segment Dissemination</name>
        <t>A path look-up in SCION works similarly to a recursive DNS query (section 4 of <xref target="I-D.dekater-scion-controlplane"/>):</t>
        <ul spacing="normal">
          <li>
            <t>The source endpoint queries the control service in its own AS.</t>
          </li>
          <li>
            <t>The local AS has already at least one segment to one core AS of its local ISD.
It uses it to query the core AS' control service for segments to core ASes of the remote ISD.</t>
          </li>
          <li>
            <t>The local AS has now segments also from its local ISD core ASes to core ASes in the remote ISD.
The local AS queries the remote ISD's core ASes for segments to the destination AS.</t>
          </li>
          <li>
            <t>The local AS returns all these segments to the endpoint, to be combined.</t>
          </li>
        </ul>
        <t>Control services may return a large number of path segments for some queries.
This can cost considerable bandwidth while at the same time
overload clients with an unnecessarily large numbers of segments.</t>
        <ul spacing="normal">
          <li>
            <t>This problem may be more acute in ASes with many endpoints (e.g. IoT),
or for resource-constrained endpoints.</t>
          </li>
          <li>
            <t>Getting a full path to a remote endpoint may require three queries to control services.</t>
          </li>
        </ul>
        <t>There are multiple possible and independent solution steps here:</t>
        <ul spacing="normal">
          <li>
            <t>Predefine some policies that can be resolved by the control plane, e.g. ANY, BEST_LATENCY, BEST_BANDWIDTH, BEST_PRICE,
BEST_CO2. For these, the control plane could simply calculate 5-10 compliant paths and return these.
Moreover these could be cached for commonly requested remote ASes.
If a user requires a custom policy they can still resort to requesting actual segments.</t>
          </li>
          <li>
            <t>Caching of paths. An open question concerns when a control service should return a chached path, versus performing a recursive path lookup.</t>
          </li>
        </ul>
        <t>An example including the number of core segments between different ISDs as of 2024-07-12 in the SCION production network is shown in <xref target="segment-count-example"/>.</t>
        <table anchor="segment-count-example">
          <name>core segment count examples</name>
          <thead>
            <tr>
              <th align="right">src ISD</th>
              <th align="right">dst ISD</th>
              <th align="center">segments returned</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="right">64</td>
              <td align="right">64</td>
              <td align="center">337</td>
            </tr>
            <tr>
              <td align="right">64</td>
              <td align="right">65</td>
              <td align="center">240</td>
            </tr>
            <tr>
              <td align="right">64</td>
              <td align="right">67</td>
              <td align="center">60</td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="periodic-beacon-propagation">
        <name>Periodic Beacon Propagation</name>
        <t>The SCION control plane protocol specifies that beacons should be propagated periodically.
Is this really necessary?</t>
        <ul spacing="normal">
          <li>
            <t>For path freshness, only the initial AS emitting the PCB needs to originate beacons periodically,
  and others can disseminate immediately.</t>
          </li>
          <li>
            <t>As response to link failures or availability of new paths, beacon services can respond instantly.</t>
          </li>
        </ul>
        <t>If no periodic propagation is necessary for path freshness or to respond to link failures,
the periodic propagation would only be used for the discovery of new paths at each interval,
enhancing the scalability and path diversity.</t>
      </section>
      <section anchor="beacon-optimization-and-extensibility">
        <name>Beacon Optimization and Extensibility</name>
        <t>Communication requirements vary according to source, destination, and application.
Satisfying all these requirements either requires discovering all paths in the network,
or optimizing the creation of paths during the beaconing process.
Selecting the 5 shortest paths per destination for each beaconing period may not satisfy all requirements
that different applications, on different endpoints, and on different ASes, will have.
The beacon selection process, the criteria and metrics that they carry, and the adaptability
of them all have a strong impact in the traffic engineering of the individual ASes,
and of the inter-domain communication as a whole. See question 2.7 of <xref target="RFC9217"/>.</t>
        <ul spacing="normal">
          <li>
            <t>What optimization functions should be applied to beacons and what metrics should be considered when propagating them?
Is the set of properties composed of path length, peering ASes, path disjointness, PCB last reception,
and path lifetime enough?</t>
          </li>
          <li>
            <t>How do we extend the metrics with new dimensions, such as bandwidth, latency, geo-position, etc?</t>
          </li>
          <li>
            <t>Who should select these functions?</t>
          </li>
          <li>
            <t>How should the outcome of these functions be verified?</t>
          </li>
          <li>
            <t>How can multiple functions be applied concurrently, for different source and destination applications?</t>
          </li>
          <li>
            <t>How should end-ASes express their desired requirements to the inter-domain control plane?</t>
          </li>
          <li>
            <t>How do these requirements translate into concrete optimization functions?</t>
          </li>
          <li>
            <t>How would standardization of the functions look like?</t>
          </li>
          <li>
            <t>The functions changing over time:
            </t>
            <ul spacing="normal">
              <li>
                <t>How can optimization functions adapt to incorporate these changes?</t>
              </li>
              <li>
                <t>How to achieve fast adaptation of optimization functions?</t>
              </li>
            </ul>
          </li>
          <li>
            <t>See also: IREC <xref target="TABAEIAGHDAEI2023"/></t>
          </li>
        </ul>
        <!--
## Routing Policies and Traffic Engineering

Reduced adoption due to limited routing policy possibilities, such as a (core-)AS does not want to accept transit traffic unless it starts/ends in ASes with special properties. For example a GEANT AS does not want to allow transit traffic unless it originates or ends in another research and education AS.

One solution could be to add a “confirm full path”-flag to certain segments. If this flag is set, the full path (all segments) needs to authorized by all ASes that insist on authorizing it. This is obviously less scalable but may be viable for ASes that insist on such policies. This also allows for “secret” policies.

Collateral: this probably needs a data plane change. Conceptually, we have only a single resulting segment, and that segment needs to be used in full, e.g. no on-path trickery.
-->

</section>
      <section anchor="drkey">
        <name>DRKey</name>
        <t>DRKey is a key distribution system that scales well with the number of endpoints in the network.
It relies on two things:</t>
        <ul spacing="normal">
          <li>
            <t>Two sides of a key: a fast side, and a slow side. Sometimes called fast and slow side of the derivation.
The ability of deriving a key very quickly on the fast side is necessary for most of its use cases.</t>
          </li>
          <li>
            <t>A grouping of endpoints (such as ASes): The pieces necessary to derive a key, namely the L1 keys,
are communicated to each keystore at each grouping (e.g., a keystore per AS).</t>
          </li>
        </ul>
        <t>The questions related to DRKey are the following ones (not comprehensive):</t>
        <ul spacing="normal">
          <li>
            <t>Do we want to have any possible authorization that is at the moment carried out at the data-plane to be moved to the control-plane? This could include e.g. authorization to deliver traffic depending on the source, but also information like port numbers/ranges per source, etc.
            </t>
            <ul spacing="normal">
              <li>
                <t>Could this obsolete firewalls? What else would be necessary?</t>
              </li>
              <li>
                <t>What do we mean when we say "authorize transit"?</t>
              </li>
            </ul>
          </li>
          <li>
            <t>Could perfect forward secrecy DRKey be useful, and should we research it?
            </t>
            <ul spacing="normal">
              <li>
                <t>What would be the trust model? Do end-users trust their ASes to ephemerally create personal keys?</t>
              </li>
              <li>
                <t>What would be the attacker model?</t>
              </li>
              <li>
                <t>Which use cases are relevant?</t>
              </li>
            </ul>
          </li>
        </ul>
        <t>For more info: <xref target="I-D.garciapardo-panrg-drkey"/>.</t>
      </section>
      <section anchor="scmp-authentication">
        <name>SCMP Authentication</name>
        <t>In SCION, endpoints are responsible to select alternate paths in case of failure.
One approach to detect failures is to rely on signals from the network, such as SCMP (SCION Control Message Protocol) messages.
These signals must be authenticated in order to be trusted by endpoints. This reflects a question raised in section 2.7 of <xref target="RFC9217"/>.</t>
        <t>One option is to use DRKey as the mechanism to use to derive the authentication key,
where the fast path would be on the infrastructure side (e.g. the border router in the case of an
interface down type of message), and the slow side being on the intended endpoint destination
for that SCMP message (e.g. the endpoint receiving the SCMP interface down message).
Another option is to leverage the control-plane PKI.</t>
        <t>However, we have identified a number of possible issues (not comprehensive):</t>
        <ul spacing="normal">
          <li>
            <t>Denial of Service/Capability Attacks: If an endpoint receives (too) many SCMP messages,
it will need (too) many resources just to authenticate their origin.
Most of these messages could just be sent to the endpoint to exhaust its processing capacity.</t>
          </li>
          <li>
            <t>Sending an SCMP message in certain cases might be an amplification factor:
If a border router sends an SCMP message (e.g. interface down) on all cases, even with small packets,
there is the risk of having that border router sending a lot of traffic to
a possibly unintended recipient, e.g. when the packet is not source validated.
In addition, validation may trigger additional requests for keys.</t>
          </li>
        </ul>
      </section>
      <section anchor="proof-of-transit">
        <name>Proof of Transit</name>
        <t>FABRID <xref target="KRAHENBUHL2023"/> and EPIC <xref target="LEGNER2020"/>.</t>
      </section>
      <section anchor="nat">
        <name>NAT</name>
        <t>Currently, the SCION implementation is not compatible out-of-the-box with NAT'ed devices, regardless of whether these devices are end-hosts, or even running SCION services. This is due to the (UDP-IP) underlay being modified by the NAT mechanism, but not the internal destination SCION address. Although this does not concern the SCION protocols themselves, we want to check that this will not be a problem.
Critically, the SCION header needs to contain the SRC address as seen by the border router so that the border router can forward incoming response packets to the correct NAT device and port.</t>
        <t>Possible solutions:</t>
        <ul spacing="normal">
          <li>
            <t>With IPv6 as an intra-domain protocol, this problem disappears.</t>
          </li>
          <li>
            <t>Introduce a mechanism so that the SCION border router can report the NATed address to an endpoint (similar to a STUN server).</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="data-plane-stability">
      <name>Data Plane Stability</name>
      <section anchor="link-load-balancing">
        <name>Link Load Balancing</name>
        <t>Links may get overloaded because the SCION distributed path selection process fails to distribute load properly over different links, resulting in uneven utilization.</t>
        <t>There are several potential approaches to relieve an overloaded link:</t>
        <ul spacing="normal">
          <li>
            <t>introduce explicit congestion notifications from routers to endpoints.</t>
          </li>
          <li>
            <t>optimize the path lookup process so that the control plane hands out paths that optimize load balancing.</t>
          </li>
        </ul>
        <!--
If a link has good properties, many ASes will disseminate segments and therefore paths through this link to the extent link may become overloaded. See Simon Scherrer's work on Braess Paradox.

Either there needs to be some constant control by all clients to not choose the best theoretical path, but the one that works best, or there needs to be a mechanism whereby control plane do not disseminate “good” links to all end-hosts.

The current consensus is that end-hosts can use multi-pathing and “automatically” converge on the best path, i.e. creating an equilibrium. Again, see Simon Scherrer's work on Braess Paradox.
-->

</section>
      <section anchor="reverse-path-refreshment">
        <name>Reverse Path Refreshment</name>
        <t>When a client and server communicate, return traffic should usually follow the same reverse path.
If the server uses that path for a long period of time, the path will eventually expire.
How should the server determine the path for return traffic and at which layer? How to avoid this being a vector pf path hijackings?</t>
        <t>There are some relevant points for the discussion:</t>
        <ul spacing="normal">
          <li>
            <t>In order to send data back to the client, the server needs to store the path locally
(analogous to storing the client's 4-tuple in an TCP/IP scenario).</t>
          </li>
          <li>
            <t>More generally, if multiple paths are used to contact the server,
which one of those would be used to reply? Should this be responsibility of the transport protocol,
as in the case of QUIC-MP <xref target="I-D.ietf-quic-multipath"/>?</t>
          </li>
          <li>
            <t>How long before path expiration should the client and server still use a path?
The client can choose from paths that will not expire in a short period of time,
but it does not control for how long the server will attempt to use it (i.e.
how long it will take the server to send the complete response).</t>
          </li>
        </ul>
        <section anchor="proposed-solutions-not-comprehensive">
          <name>Proposed Solutions (not comprehensive)</name>
          <ul spacing="normal">
            <li>
              <t>The server <bcp14>MUST</bcp14> ask the control plane for a path, regardless of the client's policy.</t>
            </li>
            <li>
              <t>The client <bcp14>SHOULD</bcp14> (somehow) send a new packet with a new path,
prompting the server to use this path from now on.</t>
            </li>
            <li>
              <t>The client and server agree, via a path policy specification,
on which kinds of paths are okay for the server to use.
This solution implies a standard specification of this path policy.</t>
            </li>
            <li>
              <t>Leave the solution to the application and transport layers.
Transport protocols may require keep alive messages, or already support multiple paths.
Applications should know for how long they are willing to read a response from a server.
With this knowledge these two layers can easily determine when to send a new path
(analogous to connection migration in QUIC <xref target="RFC9000"/>), so that the server is instructed
to use it for the next replies.</t>
            </li>
            <li>
              <t>The server must ask the control plane for a path, regardless of the client's policy.</t>
            </li>
            <li>
              <t>The client (somehow) sends a new packet with a new path, prompting the server to use this path from now on.</t>
            </li>
          </ul>
          <t>There are some nuances: Usually the server's API will store the initial address of the client to be used through all the session.</t>
          <t>A related question: how long before expiration should a path be used?</t>
          <t>Is reverse path refresh a relevant problem?</t>
          <ul spacing="normal">
            <li>
              <t>Contra: It is probably rare that a server needs to send data for a long time without the application layer protocol requiring the client to ever answer back.</t>
            </li>
            <li>
              <t>Pro: The client may happen to have an old-ish path. If we can't refresh, the client always needs to consider whether a path is valid "long enough", which might only be possible to guess.</t>
            </li>
            <li>
              <t>Contra: Sending keep-alives sounds like a connection based protocol. It also means we need to figure out when to stop sending keep-alives.</t>
            </li>
            <li>
              <t>Contra: It may be better to solve this in the application layer or in the overlay protocol, where we we know more about
potential length of the session, whether this is a singular request/answer type of exchange, or whether more frequent keep-alives
are required anyway.</t>
            </li>
          </ul>
          <!--
# Hummingbird / QoS

* How many QoS flows to support at core routers?
* How does QoS interact with Net Neutrality?
* What proof of transit (or forwarding failure detection) is needed or wanted?
* What time synchronization precision should we expect at the border router level of every AS? How far can we go realistically?
-->

</section>
      </section>
    </section>
    <section anchor="interfacing-scion-with-existing-technologies">
      <name>Interfacing SCION with Existing Technologies</name>
      <t>The questions posed here are:</t>
      <ul spacing="normal">
        <li>
          <t>What existing protocols/solutions should be compatible with SCION simultanously?
How can ISPs offer traditional IP side by side with SCION.</t>
        </li>
        <li>
          <t>Could a future evolution of the SCION specification better reuse existing technologies?
Referring to the possibility of slightly changing an existing technology (e.g. IPv6) to be used
as part of SCION, replacing part of the ad-hoc specification that we have for SCION.</t>
        </li>
        <li>
          <t>What would be required effort to make them work?
Referring to the ranking according to different types of parties involved: ISPs, vendors,
application developers, etc.</t>
        </li>
      </ul>
      <t>There are several possibilities of existing protocols/technologies/solutions that
may work for this purpose:</t>
      <ul spacing="normal">
        <li>
          <t>IPv6 in the Data Plane. Use an IPv6 routing header as specified in 4.4. of <xref target="RFC8200"/>.</t>
        </li>
        <li>
          <t>SCION IP Gateway. See section 3 of <xref target="I-D.rustignoli-panrg-scion-components"/></t>
        </li>
        <li>
          <t>SCION-IP translation <xref target="SCIONIPTRLN"/></t>
        </li>
        <li>
          <t>How can we interface with QUIC Multipath <xref target="I-D.ietf-quic-multipath"/>?</t>
        </li>
        <li>
          <t>How can we interface with, and what is the relationship to TAPS <xref target="TAPS"/>?</t>
        </li>
      </ul>
    </section>
    <section anchor="implications-of-path-awareness-for-the-transport-and-application-layers">
      <name>Implications of Path Awareness for the Transport and Application Layers</name>
      <t>This question relates to 2.5 in <xref target="RFC9217"/>.</t>
      <ul spacing="normal">
        <li>
          <t>How to express transport preferences and map them to SCION path properties?</t>
        </li>
      </ul>
    </section>
    <section anchor="naming">
      <name>Naming</name>
      <t>To be discussed</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>TODO Security</t>
    </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="RFC8200">
          <front>
            <title>Internet Protocol, Version 6 (IPv6) Specification</title>
            <author fullname="S. Deering" initials="S." surname="Deering"/>
            <author fullname="R. Hinden" initials="R." surname="Hinden"/>
            <date month="July" year="2017"/>
            <abstract>
              <t>This document specifies version 6 of the Internet Protocol (IPv6). It obsoletes RFC 2460.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="86"/>
          <seriesInfo name="RFC" value="8200"/>
          <seriesInfo name="DOI" value="10.17487/RFC8200"/>
        </reference>
        <reference anchor="TAPS" target="https://datatracker.ietf.org/wg/taps">
          <front>
            <title>Transport Services Working Group</title>
            <author initials="" surname="IETF" fullname="IETF">
              <organization/>
            </author>
            <date year="2024"/>
          </front>
        </reference>
        <reference anchor="RFC9217">
          <front>
            <title>Current Open Questions in Path-Aware Networking</title>
            <author fullname="B. Trammell" initials="B." surname="Trammell"/>
            <date month="March" year="2022"/>
            <abstract>
              <t>In contrast to the present Internet architecture, a path-aware internetworking architecture has two important properties: it exposes the properties of available Internet paths to endpoints, and it provides for endpoints and applications to use these properties to select paths through the Internet for their traffic. While this property of "path awareness" already exists in many Internet-connected networks within single domains and via administrative interfaces to the network layer, a fully path-aware internetwork expands these concepts across layers and across the Internet.</t>
              <t>This document poses questions in path-aware networking, open as of 2021, that must be answered in the design, development, and deployment of path-aware internetworks. It was originally written to frame discussions in the Path Aware Networking Research Group (PANRG), and has been published to snapshot current thinking in this space.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9217"/>
          <seriesInfo name="DOI" value="10.17487/RFC9217"/>
        </reference>
        <reference anchor="RFC9000">
          <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="I-D.ietf-quic-multipath">
          <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="8" month="July" year="2024"/>
            <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-10"/>
        </reference>
        <reference anchor="I-D.dekater-scion-controlplane">
          <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="21" month="July" year="2024"/>
            <abstract>
              <t>   This document describes the control plane of the path-aware, inter-
   domain network architecture SCION (Scalability, Control, and
   Isolation On Next-generation networks).  One of the basic
   characteristics of SCION is that it gives path control to SCION-
   capable endpoints.  In fact, endpoints can choose between multiple
   path options, enabling the optimization of network paths.  The SCION
   control plane is responsible for discovering these paths and making
   them available to the endpoints.

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

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-controlplane-05"/>
        </reference>
        <reference anchor="I-D.dekater-scion-pki">
          <front>
            <title>SCION Control-Plane PKI</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="8" month="July" year="2024"/>
            <abstract>
              <t>   This document presents the trust concept and design of the SCION
   _control-plane Public Key Infrastructure (PKI)_, SCION's public key
   infrastructure model.  SCION (Scalability, Control, and Isolation On
   Next-generation networks) is a path-aware, inter-domain network
   architecture.  The control-plane PKI, or short CP-PKI, handles
   cryptographic material and lays the foundation for the authentication
   procedures in SCION.  It is used by SCION's control plane to
   authenticate and verify path information, and builds the basis for
   SCION's special trust model based on so-called Isolation Domains.

   This document first introduces the trust model behind the SCION's
   control-plane PKI, as well as clarifications to the concepts used in
   it.  This is followed by specifications of the different types of
   certificates and the Trust Root Configuration.  The document then
   specifies how to deploy the whole infrastructure.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-pki-06"/>
        </reference>
        <reference anchor="I-D.dekater-scion-dataplane">
          <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="Samuel Hitz" initials="S." surname="Hitz">
              <organization>Anapaya Systems</organization>
            </author>
            <date day="8" month="July" year="2024"/>
            <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 first
   provides a detailed specification of the SCION data packet format as
   well as the structure of the SCION header.  SCION also supports
   extension headers - these are described, too.  The document then
   shows the life cycle of a SCION packet while traversing the SCION
   Internet.  This is followed by a specification of the SCION path
   authorization mechanisms and the packet processing at routers.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-dekater-scion-dataplane-02"/>
        </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="I-D.rustignoli-panrg-scion-components">
          <front>
            <title>SCION Components Analysis</title>
            <author fullname="Nicola Rustignoli" initials="N." surname="Rustignoli">
              <organization>SCION Association</organization>
            </author>
            <author fullname="Corine de Kater" initials="C." surname="de Kater">
              <organization>SCION Association</organization>
            </author>
            <date day="10" month="September" year="2023"/>
            <abstract>
              <t>   SCION is an inter-domain Internet architecture that focuses on
   security and availability.  Its fundamental functions are carried out
   by a number of components.

   This document analyzes its core components from a functionality
   perspective, describing their dependencies, outputs, and properties
   provided.  The goal is to answer the following questions:

   *  What are the main components of SCION and their dependencies?  Can
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-rustignoli-panrg-scion-components-03"/>
        </reference>
        <reference anchor="SCIONIPTRLN">
          <front>
            <title>Unlocking Path Awareness for Legacy Applications through SCION-IP Translation in eBPF</title>
            <author fullname="Lars-Christian Schulz" initials="L." surname="Schulz">
              <organization>OVGU Magdeburg, Germany</organization>
            </author>
            <author fullname="Florian Gallrein" initials="F." surname="Gallrein">
              <organization>OVGU Magdeburg, Germany</organization>
            </author>
            <author fullname="David Hausheer" initials="D." surname="Hausheer">
              <organization>OVGU Magdeburg, Germany</organization>
            </author>
            <date month="August" year="2024"/>
          </front>
          <seriesInfo name="Proceedings of the SIGCOMM Workshop on eBPF and Kernel" value="Extensions"/>
          <seriesInfo name="DOI" value="10.1145/3672197.3673437"/>
          <refcontent>ACM</refcontent>
        </reference>
        <reference anchor="RFC9460">
          <front>
            <title>Service Binding and Parameter Specification via the DNS (SVCB and HTTPS Resource Records)</title>
            <author fullname="B. Schwartz" initials="B." surname="Schwartz"/>
            <author fullname="M. Bishop" initials="M." surname="Bishop"/>
            <author fullname="E. Nygren" initials="E." surname="Nygren"/>
            <date month="November" year="2023"/>
            <abstract>
              <t>This document specifies the "SVCB" ("Service Binding") and "HTTPS" DNS resource record (RR) types to facilitate the lookup of information needed to make connections to network services, such as for HTTP origins. SVCB records allow a service to be provided from multiple alternative endpoints, each with associated parameters (such as transport protocol configuration), and are extensible to support future uses (such as keys for encrypting the TLS ClientHello). They also enable aliasing of apex domains, which is not possible with CNAME. The HTTPS RR is a variation of SVCB for use with HTTP (see RFC 9110, "HTTP Semantics"). By providing more information to the client before it attempts to establish a connection, these records offer potential benefits to both performance and privacy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9460"/>
          <seriesInfo name="DOI" value="10.17487/RFC9460"/>
        </reference>
        <reference anchor="I-D.garciapardo-panrg-drkey">
          <front>
            <title>Dynamically Recreatable Keys</title>
            <author fullname="Juan A. García Pardo Giménez de los Galanes" initials="J. A." surname="de los Galanes">
              <organization>ETH Zürich</organization>
            </author>
            <author fullname="Cyrill Krähenbühl" initials="C." surname="Krähenbühl">
              <organization>ETH Zürich</organization>
            </author>
            <author fullname="Benjamin Rothenberger" initials="B." surname="Rothenberger">
              <organization>ETH Zürich</organization>
            </author>
            <author fullname="Adrian Perrig" initials="A." surname="Perrig">
              <organization>ETH Zürich</organization>
            </author>
            <date day="24" month="July" year="2022"/>
            <abstract>
              <t>   DRKey is a pragmatic Internet-scale key-establishment system that
   allows any host to locally obtain a symmetric key to enable a remote
   service to perform source-address authentication, and enables first-
   packet authentication.  The remote service can itself locally derive
   the same key with efficient cryptographic operations.

   DRKey was developed with path aware networks in mind, but it is also
   applicable to today's Internet.  It can be incrementally deployed and
   it offers incentives to the parties using it independently of its
   dissemination in the network.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-garciapardo-panrg-drkey-03"/>
        </reference>
        <reference anchor="TABAEIAGHDAEI2023" target="https://netsec.ethz.ch/publications/papers/IREC_arXiv.pdf">
          <front>
            <title>Inter-domain Routing with Extensible Criteria</title>
            <author initials="S." surname="Tabaeiaghdaei" fullname="Seyedali Tabaeiaghdaei">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="M." surname="Wyss" fullname="Marc Wyss">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="G." surname="Giuliari" fullname="Giacomo Giuliari">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="J." surname="van Bommel" fullname="Jelte van Bommel">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="A. N." surname="Zehmakan" fullname="Ahad N. Zehmakan">
              <organization>Australian National University</organization>
            </author>
            <author initials="A." surname="Perrig" fullname="Adrian Perrig">
              <organization>ETH Zürich</organization>
            </author>
            <date year="2023"/>
          </front>
        </reference>
        <reference anchor="LEGNER2020" target="https://netsec.ethz.ch/publications/papers/Legner_Usenix2020_EPIC.pdf">
          <front>
            <title>EPIC: Every Packet Is Checked in the Data Plane of a Path-Aware Internet</title>
            <author initials="M." surname="Legner" fullname="Markus Legner">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="T." surname="Klenze" fullname="Tobias Klenze">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="M." surname="Wyss" fullname="Marc Wyss">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="C." surname="Sprenger" fullname="Christoph Sprenger">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="A." surname="Perrig" fullname="Adrian Perrig">
              <organization>ETH Zürich</organization>
            </author>
            <date year="2020"/>
          </front>
        </reference>
        <reference anchor="KRAHENBUHL2023" target="https://www.usenix.org/conference/usenixsecurity23/presentation/krahenbuhl">
          <front>
            <title>FABRID: Flexible Attestation-Based Routing for Inter-Domain Networks</title>
            <author initials="C." surname="Krähenbühl" fullname="Cyrill Krähenbühl">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="M." surname="Wyss" fullname="Marc Wyss">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="D." surname="Basin" fullname="David Basin">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="V." surname="Lenders" fullname="Vincent Lenders">
              <organization>Armasuisse</organization>
            </author>
            <author initials="A." surname="Perrig" fullname="Adrian Perrig">
              <organization>ETH Zürich</organization>
            </author>
            <author initials="M." surname="Strohmeier" fullname="Martin Strohmeier">
              <organization>Armasuisse</organization>
            </author>
            <date year="2020"/>
          </front>
        </reference>
        <reference anchor="I-D.draft-pauly-v6ops-happy-eyeballs-v3-01">
          <front>
            <title>Happy Eyeballs Version 3: Better Connectivity Using Concurrency</title>
            <author fullname="Tommy Pauly" initials="T." surname="Pauly">
              <organization>Apple Inc</organization>
            </author>
            <author fullname="David Schinazi" initials="D." surname="Schinazi">
              <organization>Google LLC</organization>
            </author>
            <author fullname="Nidhi Jaju" initials="N." surname="Jaju">
              <organization>Google LLC</organization>
            </author>
            <author fullname="Kenichi Ishibashi" initials="K." surname="Ishibashi">
              <organization>Google LLC</organization>
            </author>
            <date day="4" month="March" year="2024"/>
            <abstract>
              <t>   Many communication protocols operating over the modern Internet use
   hostnames.  These often resolve to multiple IP addresses, each of
   which may have different performance and connectivity
   characteristics.  Since specific addresses or address families (IPv4
   or IPv6) may be blocked, broken, or sub-optimal on a network, clients
   that attempt multiple connections in parallel have a chance of
   establishing a connection more quickly.  This document specifies
   requirements for algorithms that reduce this user-visible delay and
   provides an example algorithm, referred to as "Happy Eyeballs".  This
   document updates the algorithm description in RFC 8305.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-pauly-v6ops-happy-eyeballs-v3-01"/>
        </reference>
      </references>
    </references>
    <?line 546?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>Many thanks go to Matthias Frei (SCION Association), Seyedali Tabaeiaghdaei (ETH Zurich) for reviewing and contributing to this document.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8V83XIbx3buPZ6iN50qkw4AkhIl26ztaEMkLXFborhJajs7
qZSqMdMA2hzMINMzpGBvVe0HSarORW7OxXmDXB2/yX6SrG+t7p4egLKV5JyK
SrYATE//rF4/3/rpHo1Gg8Y2hTlWO9cn528u1JVxRtfZQv2hNa6xVel2Bno6
rc0dNXEZ/TCqfZN356PTnUGmGzOv6vWxsuWsGrh2urTOUbtmvaJuz69uvh0M
8ior9ZK+5rWeNaOlWZemKEYrXdbzUb/X0T+HgUcHh4MBDft4oGujfVf3VX07
r6t2dawuJxdXLwa3Zk2/5fS4bExdmmZ0ijEGd6ZszfFAKd/6+xf0Web0PfVh
y7l6gSf061Lb4ljxZH5n62Y2ruo5/YzZHKtF06zc8f5+rhvd1Dq7NfXYGmm0
T3/5NQxjm0U7DUTSzlWZ1VjH/kNUU6ogurmG2ocBNt8bS49jWz3Qw/5/hpDj
RbMsdgYD3TaLqiaajJSi3XLH6ruxei1d0Izoj2zSd+bOlv0HtNhjJRwy6aYo
z4zQ73ZpfsczYPIlg/x+rF7QhH7+P1pd6jqv0qF+3+pSTTYaqBd2+fP/Ls2P
KjeqqBw9LXRpXDKVs5uX6h9+/vfaZoveJH6g/sZz6szq3xE/jk2z+HFMbZLp
3IzpzX9z2eLWpDO5scVSl+XGs18crJFXxj9qw698bMSLsbpqaSvmZVXYdMwL
m1WF3nr4CcQubZYSu6zqJTW6Y4a/+vbkq0cHB8fqM3V+efeUfrmZXF7j61sH
tnfrstHv1ayulpG7Pa9l1XI/09Nq/7bWy7y6J26aZTyw1xI3tS7dqqobdW3q
O5sZtyVNJDiBz/wfWez5GYkvvpIk0ddHB4+OpGddz03zK4J2P99v9MoNZHlf
Pzr8Eus5aevalI16szJlp7CI6NANvumBUOIPb89P6BcSHe6UhMNmo2VbNHal
m8Wxf5SbW5pc7SUpIyVWV8UKzPdwi9WtffgBFuHfg1pMdgdt67jhPckl6q+q
khbkjrFQ5oDzy5urVxfH6vTN+fjwYHx4ePRk//HTLx8dfv3lmP59fPT4S0XL
47aj80vVYIMKZhi1++aPL97uBZodPT3gbjEBkZAVhM3PIK9JkfLzm8nzydn5
5MXLU/qHdunxccoAO6xmR3lFfFiqq6ptsPf3xD7q7H1jSmenhVEntaVWVu/0
N/zxgxtOOtuZLAjO/qqdFjbjFTjSritTu/3zq7OTd7r+e3s3XuWzB5hsFJmN
Je56rG70VBur54uc/tlgxWuzNrku7EcaPSz0m2O8Hqvv185tdP2aKNv//dN6
e0E60LaF1fXmZF9YTYxRbT/+tI5J+96Rjn1eLZem2Oj696ZozEOPP61r0tuk
2v7BLJb6VpcbfU8WOn/wMfc9IQmoaQdo6Aveal2otyWJSO1ss/7ocJemru18
c6S8Rj8bz7aWQE9enb24OLsiRjzo8/TZ5fkJNabR12SBSPM06typk4WhjznU
SbMw6pREWl1CplU1UzBVzWI0uSdsEqHHBrsf/FfZ/ZWZl6Z+99aZ0r5HR+8w
w09jfWJLeX2bMW9bt/ns0zaaTOZ3hSl/NBt93lRTq93ms/8J8TkZq+sV2YL5
1rpPFrV1TbVabDf4ZC7/b7Ldd1eTl2cXz9++fLWtTr+dPL86Pz1W3xbmPavO
SQNcyPwweq4d8V9QsmRGhNNGp6J9L0wDOOw+ie3u7+/HLTMUG1SybTND9MjM
vvxKPNmS1l4/ery/AoQsZQ5AAgtTTttF8eu8R7vwXf3zv6H9z/++2NQ2J+va
FsXDLf4neOZ0rIjAdlNxneo7m288+bQO1R8he2VOIrzRp/qjJUoTUtl8LMqQ
4IFryWsy/1848OG5Ei2vCd0slsZuyQxISiz3UIPNCY9GI6WnUOZZMxjcLKwT
H49GITSQO9VUyrXLJRmuH43StP8CbGsDByhX0UlR9wuarII6zY1ZQu8uATQ1
UY36mNLLpbsnls0HEATphR6s6op0ZrFWEAWlm6iMlct0YcY0J6McfSWl3Q1G
06SmUOvLaomNKatGAX/VZgEQc2eGato26t74haDtEuPZ0jYEyGk6Krcua9nX
HdCD3NC4S0vmQVbSDeYWVVvktGSW2gWtYUiLyX07QnyOl81+czkfDwbf0xyU
XmFpNcYaKkezVOa9Xq5IRbiqaKXnjLafKEMNiWeJZKAMFkUrWbY00bXamBhZ
HVMrp20+6HrB4Do3/9xiWdQD0YImMeC9Xdo8L8xg8BnoWld5m7EvMhD6g4wl
UyhCwlKUEnvPBAKzpq3NWJ03NNmq5pl5jEs0IF4xq6IiMKama1kj7ZKltuTB
0pbqvFpR12hKr7qVyezMikX+6adfAN0fPgwfbEBw/WOPUqz/4UPCjJn4GDSb
FqKrzq/PaCfvrLkfD5i35hVhF5p2k/A+s715T2ujHhbVvWdXbHq3Olk7cx81
JbgMbSx7ujDFilafkyJ2qoJ3E7z6lIdBBe8NffgAA8j0Ia4v1kOwAbYVdGug
dslTXUtXiKY4zDj2qcl1o6nBExppRjR+F4kdh+Aa+kVWwED/V5eAdcbOzYy4
spF1eUYl2WF62ylzIIF10A4NdOFE1mnWrIPmalURfzFnd/LmwpSLqpyPwN7o
uqnInVbmzjP2uKePtCM1RHODeBABsJX0bKaXFqhaFhY4EG1m1L3Gymh3abKZ
WTVg1xnJUYSEHTMH5hQgRyN/8cVFRfb4iy9kbRAUxfhSCMdAl1w0P1jQiVt7
zHMfesZRS9oIehm0I1FDl84UhiUSPa1oxJKUU0Hct7KZ83pz1tYs9Z58YfqB
MmM1Ic6YGZNPCfpipvemyEAJjLpswR+kigzCECbHXuny1v1mAJ1wUpV3GJJ3
hFqfgj6Wv4twkFMJxUx2YOf12+ubnaH8qy7e8OerM/LLr85O8fn65eTVq/hh
4Ftcv3zz9tVp96l78+TN69dnF6fyMv2qej8Ndl5P/rQjlNt5c3lD9J282ulW
XmUtsy2YXcjEWozWCauk3SA3LiMGFWo9P7n8v//r8Ijk7TckcI8OD78mHSFf
vjr88ogVhilltKqEMeKvRPb1gIhHu4peYP0yvbLEUqL9yDDci0EAx/wjKPNP
x+q302x1ePR3/gcsuPdjoFnvR6bZ9i9bLwsRH/jpgWEiNXu/b1C6P9/Jn3rf
A92TH3/7rIAlGh1+9ezvmIVOiSsrSMYQH6NOEFreIFJC/EN7VrIqnLHbpS7Z
6DfWEJt9Rqbp+nSoJtfqPAczkv84OC8TuerJ5lBZbkWGpHaCqa9PhXsn194S
Hz5VUyg5/Hj0lXyGpoGEriBvdySGYzLTtnBNbBGML03kHhpXZzDDFXC5alfg
skfjrw6PvnxiiJNIHdl5uWTdIcaGuLKwt5Bv4cclbEdDwkb4aUazt8arQdFO
sKtD1XJEL8w3PKUVCRtWsxlW+fTJ8Mnjp6QfnIRnksHH6luvHiyJMsJSEjui
vwEtNF6BJdOgbzXhBUtozFvBWVUU1T0m0ykvwnyO0OTuFrbaI25XL8ksslFi
sucVsBaMSNYE9Sq7FwAFUdIUz+jFE43pMZ2nhreFCMY9YSfRYlLz07JdTrH8
eVFNYRTJglua3RAYh8kj31n305BG0y5QF8/SyTFzpJPD0+8XWow8TZJ0cVVU
8zUHBUp5X6kvgMrV3FTzWq9oe9nodg8KMyct/QM5XC63rL+7Z6QhdMbQjTi0
+3kHuYudZ2p3aXRJdD5WmB4nN0D1BlNa6lsiJflujpUaTc/WZDSYCnvSU2AB
2o+pLSXsIFNfkwklXFO1TsZyO1gqrBh3PkSPRCFr7oynKAxRyeJA0x0KqTxb
CNgjUb9lK1QxI6HBGBHGBfMPYUlvj2WjMA3ug6deORlXLfSd744ZhX8DVMhp
mIxwGXXo54EXu4a0o5vDbo0ErmZ05FrSJyPaYTbnMKHarZerpmoETwEPk6J5
TjxCknEdre5lVUAkSA2xXsqDMiPObO4NgS0fxseEyHZTS0gWtyXbSepO8LTv
2Kndy5Pnbo/wcikrmfLv2GA8YOUEr0DP2XmqlqUVMnAEDbCvLQsoSpbZe3Y7
Mk0OPkGFoqpW4HzzPiNbL76Pfm+X7VK9A/IjpiznzeLdeDAJVPTwgoHGEtar
Ix/ewE7tcxpBCB1pT74TRy5oYVBLsogEq6xAtTW8Akyj7Jbk1J0uyPuG4pVG
rDgQJ2zikKQR7HwxpaVgrPHGvibkmXqismZdWvwkUqHeTUlHCUnhGjryTd8N
mWNqAENw+l1lc2G2PofKLHYxQ9//HqTw3qmEe4AAACiZIkGBYRTio2tAqw6q
perSHEMxvsJcRabTgcNqMLkHF6CIhbFpZKTaomEB0DTdmoeBwxLQZpjQ1GAU
fadtoaET4LOUOeNtkJWUHpYv+JsZSpM5ATuEVp878RnSnYV+IUgN2wz9ce9V
pSY/qcqHtD06Y5kaknYsTU1TW7X1CtIuGz7sJHzWFjMIJ2JVBdQkW2DWL2I4
QRViPbg1tW6qWix2XANjrAXxSkH/NYLknJ/oo/GXeD1xoKJiZ0i4QBjC2ZoJ
w+KxiphD7ZrxfEzC7sPVQ2yEOnu/oubc+Y1dkpWB30eyKc4jOnTkT8ie3Ws2
1uRq5cyn9NnsEW/89jej0eAasSLeOhp1qddgLKhUwuq0wfAOq7aGJJOrJGwo
Im66CRDBYXTFPtHoMyJ6VQNTRXRCKl5Um3haA4755YHteKpRfkrllQo8ND/+
rh2TX4+2vqd0/IYIsBf8Lxgs0fOkTnWqRHI74yCk52Te+GSKIB7RWDKVxED0
ueyEn3rGNgyeMN8vbdmSpfpCPT4In79Rh08ORF5pKq8rEhgBWMOHBuEZVLWd
s1VEuDUd1dGSMz8TRxYQfBtmAj4ryGC18wVW6cTrTrHcgE2CI7kudM0Ka73R
ho1cJDx5d0XnSwiVAiiakRwXmtaic/DOolrR+HEv7HJpcg5PxdnR2ieQP1EL
vbUTS0+JwdcyPA9GktsUKfiMNBTFI+QgAQQumFzDLgYH169mA60uQXfygWKS
QwJr7HvXgcis5A1yUdtqKrBRF+sikUQ+NWNt+RpglmYfc7mMjaIOYAGCLCCo
4JVc64TW9B8t01t4xRrVc8sX6m3ZuhbKiUXfW/khLQ7usAOym5ky4/hIMoLX
WDzQVIQ+WJ5NC8IuO+3reDAawRMCvLjA5l+ZEJkTl/riOuTa1XMrErp7/ceT
53vs5fjwVBKJoVn6aJPEj0wI8OVi/27+/gZMD6ecSHvmY4o0r9AV/VdLKlip
vyHum6u/JUe1pgeSsuIe1J/J6pmV4ugZN915L6G0iIG++erg6FByE1IU883T
o9Gj44Pjr4eHj74eHz5+NH70+GD89Vc74kI8tNKffnrmc9e0Kq+6D4/Gj8nj
1nA4wNi0LvAWrU7WHfq41DXRsxF7Pk3ihzDCm22c9CcymPqLDI4LhJQ5ha/O
LxPCwpFg6LPq+tkNPEIIc7/zQvZYGoIAvb16NRa2FpAW/D0Dz4DNLXG7OHcg
S3/PBt8DW4AHxCyDAQnd3bIEyk8YSzI/so/JLvLPYS/54aEa0xJX5Tc7i0c7
6he3iiiHYWHQEalDuLQUtgKB2xUi9hLNfUkyv1ZnawPXi3DdY+wlx125cmml
22I9untK6mu0QNOR8U1Hd49HB4cfPnjIfW3mHKg5Rbph6V0WgqgCWWnVI/Kt
bQDanA8LmlZUKzQfsTYrCdCSABcp490ABI4EBvxaRHiPlQ3nEsQUBA3D/Vnv
yPh3yEQIe1kBwIjyQFdKB0UFa0mcsdAgI4KRa2QjCgO1Ds/W+TXDcyqj8xNi
4/I+cRecGoLQLTjRcmtZm8yE3/l8a0rgDN+/6ztMXu163c79PzDhkoQkvs9M
wDq8N7HUXdtwyTZHUP0RUmJ2zT53SSebC/BQrfGs8RChScm3dcki7i30Zgdh
N4eelcU9ZlVx0iegiJv0CK8KadYN5d71znMF3vfrGnemLINdBLyy5HGIwSB1
f29zev9+YRGlaRJEQIBqAK1aVJpcusJK4Ah6AIoC7i9pJF1bmPBkSryrYTpj
YWGagDeivJSgenQG0GRLoTJ3zRGQzpQK7D2vbvaGA1oYFkd6kMUB0oIkIEfH
OyeCxnthGoZTGsbR21Mvlby9UY6ErBI9aBa1MR0zVJtc7CTq5BMcYvqB02OA
C/Hykmwi0q3Ud7SorjGk/PAmy/NlbSSkL7sU7HzngkwNL7G4E6WWyjgrhiFj
UDW5+NNQPT+7vnn3anJzdnESvj2fXJx+f35689J/v7w6PzkbDvjzyZtHY/Wt
ROycGW73Td9gGkiZrRD010XWImeqnowOD7bcYkm5MFNyf2MCvLUBx3iOz4Kd
yXS28KlCjk8C9YHuJEIm75AdaHyOOhdSL3XYGJjbrHUNCbx3zxHiZkpJHAXE
qlkV+S5567MGUKpjQ8TwMgC1CIeQhJDsVPCHJelSc2IYSastRRazql4Ss4Us
DP0NOcHSOrgGqL4TBuzsQDQe7QrwuIypVXK9ijbfdr5Z/USxDsGdzn+RGDJL
GwobRwdfjg4f9eOYq5g9jQ64DSkAaviP/7T7mR+AhKml//s5wY/6s3J1xpr1
zyp3jf8U5yM0oLX/mVqO+M+x+tvk0/Go/+eYWz49kpx++ukx6gl7fzZaPgmf
Hh0d/HLLL+OnzYbU8qdj9fBypTLmm52U4opbhE1yOx8YGVySdqgI+oWo3KWP
/AAf3ESy90UqZgkDGPSyHlxdz1TTXpht5QeSQOC5j66R3YbbEDTv+tmAI6yQ
aGavGcnCAlmLoXhW7J5x8QDbJMIyTYzyIH5QGiPlEsEJ7RzwdAJDGoVdQ+BO
5yOhARolDiCmivlMHGctKh8TRkiWPC9btLXgVx/+QciGY9glOWAsksMubucN
H8aSvqBdHUozODJKaqKs4iQj5UIgIhCIVU6fNJgA6wrpdHN+wwGI82DHApuZ
sLRZrUuKH7ogbLocmFOO8HOe704Xw4EpCWVnMeRB5A100D4b3sV4xmn8982K
7LH9UUcnLZS+8tuEGLj6wvsPvYjVHeiAxFAtSqbycHKYQhjJfSU+83hwTf+6
2Zr1WAQxvZ6NZUckKupAhfCKEMFrJK+A2IxXsphAhoz4OiaU+Z28rcPDLhxN
e4FtpZlJ7M83eKLYyYiuNMdmUnSGTeJtSLri/Y1utJOl8qTTFQ5YUDuV248p
VKk2TiOAHEVJnkl8msMfiHpIfdB2hFqW562yr2aWhLhpas6t+9AwrF9dr2Uk
tNa5XjWekQaCqZe8GA6yoLChRs6KrLruUl0EnRA1oZmT6BvZNY/H4Qnf2bxl
tQGZ4CWFZ0nlTdZjO/gWZDqrwozJhzKdXd2OfDIu5NBnlTL2rC2zXgETQigg
enD4RDlJJROyT54yXesAb00uRjwKsHDLEtmtcwH7vkIrCbJycQVnETyqlvzE
kPhF6CM76cXU/YANF3ULbcohMsT2VixRXmlKP3ZmgKeJ2IjZhXRfSPKFaq+4
HobC0CM5vVQ64bfg5EfQPuQTPSUC2HNTjWjqVmTZNJmElqtAGWEzL8SRymEe
vhHHbtsm60pS0sagLoQb4YzwItRzhMK9lmHXAKlCOdPQl9QEufBuLaiUymsq
ZRszJDqN2Fcw71e1xIeRb+SwOSPJRDt5N2uDXxPLnOzCA8otnGrgHtgbyFCo
8RF+DX2JjYCdyjXp2x+jXvP1PZ5AMXTyzPuN3SPClBBIkkUG0rT/x2xUA7k/
Ii+sAqRYkDT9qqo1J1EZhqNHpEZCN0lWdSZhXaiPMNOPLxAyDfcb5+LOTkic
t85tfCCYJBkFslyhiDgkLH15hWids07rDAZXnJjNpfgOw+atRw4SyKx9T94B
6GV8OrnQahcIbrRHUCevjOQj7n0xJxlAAwJhV20TlZ/PXdIvnJJw+1xA2vNI
GbbpItET4kMF8KjVi7PJxY16cFQJ8H100Ii7GJaEsXVZecMaiuWQYiISddGG
wZuyK8rsHC0MmRMd1V//8i9IYdl62fnAf/3Lv45mhWYIQG4O6rk6B0md+3JC
bmE5xzf0XBt86F2YlPDGXocepUDb/igOKxp1aXMCbZZDTLEVNtI241ikVk25
AgBRBFBFMBFiE20TggV3ln+Z+fzrZs/MAMGR9h1zmMjHa/EeEcQZSDBRoWuL
UEsBIa81DteFOAUnKGR5GkXuOnjHLElj5NHBTa3kv0mFd8kMMra0wML43Acf
fhOKBXNNUw8+RqRgwJOWM5CFd/FLxOJGEr4gs3BL+NKH7km6Tq++M+sB/1+S
nah7y5NyJuXW5F4v/YgoTOYyu0K4uu9rdgGXPloj16NJigjoN8XZDiehSfoK
YyvVHJjAMWIuUCn42WNK5SAD+IFQAZkWqDQA+6IAgGb9Q81io6AsyYbbOw9F
JWKXeAz8UDxsLJuRN47X3aIAySetwjS2HQLOD/nIJhIzmXaGQwSTrrilR5QY
Xwf37R3zbFYWfSY9c9lzbRlw0aSGXNjunbBXh/jJMSaoTQKbBNcwOkWDhqNi
3muIc+Eg2FC6lSaSdt/zhVBdPj+UuFOfwhkhsdzVSnHt9wP1UbyjpwxIgvYS
9FiukyCXl2Gfcg2J9l5ZO7ApLD/p7PAEIjQSEQqFZnddZYQ3ytLgmS/MZY0m
oREj0rAxNqhdWLaRXq1K7E3WKADP+znQJKwP4rlIasCJCz5W6sOW+zWbSaZt
eJOAlLi0Jx4gsb4ivQskQNrV3CN98EyQrCmIl2JuJXHS0QG3ELyH5LSA03uE
WtdqJyrQYCq4DkrGRDgJ0M3n7hVrMTKCsr+iOEhniLB5mHRvOtthm2QCcXbi
ALQkB1Ljhp0HuELkzfkngq1CSN2sCD1DTyIwCIeNudDxMTrw5cdG0U3DB2tD
MZ20QvVhFD3mUmJdc0eM92ww+JZltDa8X8c+U/KR86PsSiBnc/L6Uk1a1PY0
HjwiV8kBmWEiyjIUByesz816bBwybqbzWzE7aAIfHBiz1eVDEpBPf84BexOC
G1KFzxXTUMB2TtRxkq1IfeAIWXjWuxI1CkH/12CbuUFsieNGe8Qw/AuH8jmT
4PtdYpemIpV+2WJDYknR1O+yWOa00kbCSbNQaxVdtVpb92tlK0iTgRIerMmi
sZte5zjvy8BcWreM+e+oIJkvenvFGnMgZf9Re7Pli8zkhZp4otZSxdYiXAcN
L1kCjhbI0gEYu/qFsI26HLA3MNPkdeCoOV/OgCeewnudS93ZIylZiqPDV0sS
DqnnMpBwEEkA76vvNJldfEkqQEIEg1tvzCzMaDyYeDTYo3bBBSFzs61A1eV3
57RBhPPRpEMnsQQZJjlJHgXVbp1rf8kymNLKoROfx94/IWH0FnnCMu6OASJJ
t20sE702VbUnuZ2UNGwQCQZzaARgKG0Y8jxO/cDaqOrxuddOAqCho197oy4+
TxjAG5IfvKQ4n+LsbQafm1loNAEi8HEYbE6oi+VoxbU3Lrrsby/0hEfTos2W
KP2S02MKLkKX15eaKD6SD8DUZ1bH8H+zd2GePnPsMZzmyn4HB8ggvS++ylLi
bjhPzMRtWKJ83XBt3S1IRPwQ63e35yCwqqiEmt62NrhCQwdu4TLmIAk4prGy
DHB5rmzZOIgqx5p9YZh39rnYkk91gAol3BUftPBPQCfAfsKx8zmKz3wDXYT8
jgB62BxR/aQo4bbO5KYI25AB4ROupLL6x2BRwYHI6eU5nNfuZHawIReTG3II
umhFl0hBPozjAr1aN4gJ/QDpIfKNqtmI3hhNq/eyGdTd5wahDQ5lD2n6ZMPy
wh8q6Erdwa++EZsn2OEFcbPjqnHe3LotOW7pDxeEjGT0oby/jAnvvj29HJ1f
7snZsYIdKLxK5lek3+cUaXadihaMFOr3mNtA8DQq0yvwGatJV37GZ1tMIAln
0Po5KDZjzIJLsrV3HAztUGaGM+8htonqFFYGvnwqpI3HA9zvkBw0870v5FhV
dKT8OSVpcXUSD7Th5AvSZ37xG1xfxdDqxhMuCfXAC4GVpfUnMji34eWsw7E1
6qKZsrKfvqi4xtnGWAYfD0GyXuW6GtyZwhEMPthY6xCuCrQbdq4pUujk5ckJ
H0mvh1OSIFdndNNFCa22l1YbBsCeHTgAI+SCsk30+K6vbpEs+vXNW+FBU8MD
+Sy9puA6hqEhUK+QWXmF8oHnuE4n42DPK67Qh4jPEYD1BQamKyrtZhzdWZ9j
3Y6WM/Ti+XZtFRcsxEO6HEfrgo58QGCYuOcWxQwsZbQthfcvesn+UH3ZVVAH
DGgC3uNgGqJz3XIwEG+xjfuD45mWDArYdO4BF3F6NBAeKsoOuX5xNHXkI3PG
a9eYT47ESPe8n4QkpiABgUvmCyuT0Lsn2DRsUSgKZhvFyTEU4aCWOomBDZOD
NCyxaUawK9YRNFVztXEcuu4UB3cfDDLi4LJBPvAjkehIUskqXNsl1BERn8St
/tzJKWwcaKg1iID6urx6j0JDGzQsl8R3sRauvODyEc2ZXqGUj12FShdU/UOj
LarKMyWXayYVnD7vD9XJofPSHx+RijC0Zg2+PX4qp4x5p+uN/cpl8JSof/3L
v2APEL+Kh1ww32gufDQg1FRifYTgWvFK2EENLVn4IWocux/5ElbeLRqFYFbF
xa5Qthguw5FLFPh4EBzLVn0VsOTvBBohhF7YaW3bJRmJOWmxITTvp+9aiG9d
QeickYMrV4bzt2CqcFTd75O4vayM0rDKMFameADjPWOusEV1etWVXqLYqfaj
YVVchCIJIu6Wi92YgJJJ5ppKPgTm04jASVx+H+WSJQI6RWKEvpx+PNhItvgB
utPysQMpdOqtgINpjT+5R3bd1M9iNN+fHLEuHLBQdwZQU618ImthfyBjhcjd
s55mq5ad5628i5wmteXs87GYmc6vBE6UwCgf4A0GsBAYmCwtcr3ErRLFxdxF
GHBXE9Ko5jgD5pvFtDB3R6xyNGpaqZQBh92cXO6fXyqXmVIT+ffYBqLyKJzu
AEKws6RES3LxtY+xBpSQNclEgZXj3QjiRlRpNCe8SRazWD9T14suHjRNAgox
QOkTrP7ismjHAaLdpluKe8JGBPklzvHAVWE4KOLzS8x2006dpicgEsbalg2p
lZJjWXjxmQ+q+pZcHiiajk1QYiUiHvNnQviMj9T1bvA/dcl19k0PD7JW4+Lg
MP+EP+TUatOYpWSvMEF6n096UHfxleAkNvrWpO8HXhSL5yv6A0BjdCIOgqR1
r+P9Ex85IHrT9cwHobW7fcCYigYQBdgH9T229UfOfLee0P7o8y4kj1a3J9PX
vmiEHSYpsYxlJMMBsQ+Rx/YpFw8VWBcqXGjfUCoL9NIbM2EDPa8NKao7VBYk
Bw3WGweWifR8GhcCQVojd11pBuSoutXrqCZ684lnLWNuCq4TJ/9iVnS72L1b
REezVyaeTwldeTWT5IcFYEQ5Y60oBy+3ZM/1qj1vjVmR9eRTHCEWwaVJvjba
15VvKBH0PEmy00HkbkH2TRaX4Du41pfdoGc5FCPugz+IIvRD199LYoZogQ4L
k89DCheJF1kcS6rRzvJVGMktK2WUhY51ttRrOD0LH9vOw8mtklWQj/AdHJA/
vDfsYUm/xfA1/QFSkyO4EOU18EJJGI51pJWESiJPHKz8fy9PfUFyvyxJ6r8g
SZvWsmw1Lhw5Vm89lOh6ojlOLs9FUXX2LhTgxbtV0mWlyb8AjH21FXXKxhfV
olt3Fx13rOatwbYh8ALuuycTcu56OAfxX6Aq5skAAcTFZHvDAWlcgssxnJgX
rSWnhHNz21Y+4oIEJXHhC7ai8kA5FWDm6q5GUuSzjwDYD2LlxbcxMeQYcyV1
dZyyAuQb5zpEFHzySlVFPrK0SEZ2iLvdw/KWnzdh+cOexSzu9dr14glcThTD
NZ6oNhwb3uElSlnPztCrTIkAhkrBGGKl/uYtV7B1xA1RRSikESsk6M4WrMwZ
Kp3KrBxxDsTiw8yc15LjjvfiZGCYmZ0jOA6CR9XQVKsY30tGG/d32mfcp6bx
p5i4El2Ew+OW7e2rYqidnTW9TiIXEtO/57+sJ6Xyf0pzIxXSudRSahWkw/P+
cOtGCMmvtwhG+HDgvmeLEMs37yVNz/o8vM6DzvgN2uVk+T4jG66WQLqTOGAc
y1jUy3aJqM/UkuHaV3+ornsXSdB3NeMiA750TIwGCvkxnvfjuzoj2lu8wPE1
4E8JE5KiujAt303ZrOOR4FWIaobqkV05/4BYFJ8VlZyTT0ERrfYk0W0Qe8DK
SZylUIu7YyF06zIjJVOGJCpfseMSldHdh/FgOAxZB84BGM64T67FA8GpSpil
e9xMxUXK1nn38Zk/aviZ3JE201kXxvQ3uFqp2L8hj7jEtRa42qCf1RbwFtTw
cSwdNOHdaOP3uxvG0pLAGKblIX0Q1cK265JLT4CGQ4HV+fWlk3OSIH0MPsPl
4HTQWv7tuhrHXK32l6R0F0L1b1vqAx8vY7WRk9R+LU1CB0yLXF9cticQgv2n
WP3Enobjk+ZIyobCMQCErd7W4SjN5d3TvcTqiEeCI/uc25F0KSy47FR4wHKP
6EG2sQhxEXyOKd6SNx5spoKjgMndXHJ/imD5JccCHlwrsf6tHOdIype7WB7f
GSLQVAo4bXnHB2eOeRdxJKPMcVoaq0y0Vg4+RiTL+RT/g8G+pMhM9MoWt6V7
lbAeaDKAIuUYh2AjWFC5dECcaUR8t255HROoYKPFj0PVm49xa9e/ju5ofDSO
iVncvo00xhee04hbXxBggCrjoFlI5j7ujh7+6o3QHz6E7jZvef7pp+SiaG4W
hMdfXii5KhYRhpavgyv7y07uL/QTri/sbsFhSAR6LyzfdIQbx7km8fKaHWbo
nGWC1cNFTnx/Lp8ECKi1cxb4SqaEUV4x5pYTdF2KnLGYk9uVnmzeiRfMg9zG
J9H0xBkx/gpUiY0u9UokgFr7dEn/3gdZx4Vecuj8hsU2XqqGR9f+DlW+24XP
9YWr0N6cvolPhRqTi8l2s97VZHLaUlpqKfwc+1sZgbrQyyQLzomUyP90LMlk
k3+zMyM0YnBU5jVsY8O3tsEk0Opek5O/wM2939bGhpKH5Kr5veFHrshWu3yx
aIt7Rfd8XAxH9kPAsrvVL6iNZEHjwX8AwqBi029iAAA=

-->

</rfc>
