<?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.43 (Ruby 3.3.8) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-john-scion-happy-eyeballs-00" category="exp" submissionType="independent" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="SCION Happy Eyeballs">SCION in Happy Eyeballs Version 3</title>
    <seriesInfo name="Internet-Draft" value="draft-john-scion-happy-eyeballs-00"/>
    <author initials="T." surname="John" fullname="Tony John">
      <organization>OVGU Magdeburg</organization>
      <address>
        <email>tony.john@ovgu.de</email>
      </address>
    </author>
    <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="T." surname="Zäschke" fullname="Tilmann Zäschke" asciiSurname="Zaeschke" asciiFullname="Tilmann Zaeschke">
      <organization>ETH Zurich</organization>
      <address>
        <email>tilmann.zaeschke@inf.ethz.ch</email>
      </address>
    </author>
    <author initials="L." surname="Schulz" fullname="Lars-Christian Schulz">
      <organization>OVGU Magdeburg</organization>
      <address>
        <email>lschulz@ovgu.de</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="2026" month="November" day="17"/>
    <keyword>Happy Eyeballs</keyword>
    <keyword>SCION</keyword>
    <keyword>QUIC</keyword>
    <keyword>path-aware networking</keyword>
    <abstract>
      <?line 80?>

<t>SCION (Scalability, Control, and Isolation On Next-generation networks) is a path-aware inter-domain network architecture in which an endpoint chooses the path of its packets. A service can publish SCION addresses next to its IPv4 and IPv6 addresses in DNS Service Binding (SVCB) and HTTPS records. This document specifies how a Happy Eyeballs Version 3 client uses these addresses. SCION addresses form a third address family, so that the client connects over SCION where SCION works and over IP where it does not. Because one path can fail while others work, the client attempts a SCION address on up to three paths that differ from each other (two by default). It starts these attempts a short delay apart (50 milliseconds by default), each as a separate connection, and uses the first attempt that succeeds. This document is Experimental. It states what is to be measured to confirm or change these defaults.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-john-scion-happy-eyeballs/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/netsys-lab/draft-scion-happy-eyeballs"/>.</t>
    </note>
  </front>
  <middle>
    <?line 84?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>SCION (Scalability, Control, and Isolation On Next-generation networks) <xref target="I-D.dekater-scion-controlplane"/> <xref target="I-D.dekater-scion-dataplane"/> is a path-aware inter-domain network architecture <xref target="RFC9217"/>. A source endpoint looks up paths to the destination Autonomous System (AS) and puts the chosen path into each packet. <xref target="I-D.john-scion-svcb"/> defines the "scion" SvcParamKey, which publishes the SCION addresses of a service endpoint in DNS Service Binding (SVCB) and HTTPS records <xref target="RFC9460"/>. Happy Eyeballs Version 3 (HEv3) <xref target="I-D.ietf-happy-happyeyeballs-v3"/> does not consider SCION addresses.</t>
      <t>HEv3 uses the choice of addresses that a service offers. SCION adds a second choice, the choice of paths. A client usually knows several paths to one SCION address, and these paths cross different ASes and links. One path can work when another does not. A client that attempts a SCION address on a single path falls back to IP when that path does not work, and the application then loses the choice of path although other paths to the same address work.</t>
      <t>This document lets an HEv3 client use both choices. A SCION address is one more endpoint in the HEv3 list of endpoints. When its turn comes, the client attempts it on a small number of paths that differ from each other, one after another and a short delay apart, each as a separate connection (<xref target="attempts"/>). When the first path works and the handshake on it completes within that delay, the client makes only one handshake. The attempts on further paths do not delay attempts to other endpoints.</t>
      <t>This document covers connection establishment only (<xref target="after-establishment"/>). The rules of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> apply unless this document says otherwise. This document does not update HEv3: a client without SCION connectivity ignores the "scion" key, and nothing changes for it.</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?>

<t>This document uses the terms of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> and the term "SCION address" of <xref target="I-D.john-scion-svcb"/>. In this document, "AS" means a SCION AS, and "path" means a SCION path, as in <xref target="I-D.dekater-scion-controlplane"/>. This document also uses the following terms:</t>
      <dl>
        <dt>ISD-AS:</dt>
        <dd>
          <t>The pair of the Isolation Domain (ISD) number and the AS number that together identify an AS.</t>
        </dd>
        <dt>SCION connectivity:</dt>
        <dd>
          <t>A client has SCION connectivity if it can look up paths (Section 4 of <xref target="I-D.dekater-scion-controlplane"/>) and send and receive SCION packets on a chosen path.</t>
        </dd>
        <dt>SCION endpoint:</dt>
        <dd>
          <t>An endpoint whose address is a SCION address.</t>
        </dd>
        <dt>Eligible path:</dt>
        <dd>
          <t>A path to the AS of a SCION endpoint on which the client can attempt that endpoint (<xref target="path-lookup"/>).</t>
        </dd>
        <dt>Candidate paths:</dt>
        <dd>
          <t>The eligible paths that the client selects when it attempts a SCION endpoint (<xref target="path-selection"/>). The client makes at most one connection attempt on each.</t>
        </dd>
        <dt>Path Attempt Count:</dt>
        <dd>
          <t>The largest number of candidate paths that the client selects for one SCION endpoint.</t>
        </dd>
        <dt>Path Attempt Delay:</dt>
        <dd>
          <t>The time between the starts of two attempts on candidate paths of one SCION endpoint.</t>
        </dd>
        <dt>Hop:</dt>
        <dd>
          <t>The traversal of one AS by a path. A path is a sequence of hops. Each hop has the ISD-AS of its AS and the Interface IDs (Section 1.1 of <xref target="I-D.dekater-scion-dataplane"/>) through which the path enters and leaves that AS. An AS in which two path segments join is one hop (Section 2.4.2 of <xref target="I-D.dekater-scion-dataplane"/>).</t>
        </dd>
        <dt>Inter-AS link:</dt>
        <dd>
          <t>A link between two ASes (Section 1.3 of <xref target="I-D.dekater-scion-controlplane"/>), including a peering link. It is identified by the ISD-AS and the Interface ID at each of its two ends. A path traverses one inter-AS link between each hop and the next.</t>
        </dd>
        <dt>Pair of adjacent ASes:</dt>
        <dd>
          <t>The ASes of two consecutive hops of a path. More than one inter-AS link can connect the same pair of adjacent ASes.</t>
        </dd>
        <dt>Transit AS:</dt>
        <dd>
          <t>An AS of a hop that is neither the first nor the last hop of a path. All paths to one SCION endpoint have the same first and last AS.</t>
        </dd>
        <dt>AS hops:</dt>
        <dd>
          <t>The number of inter-AS links that a path traverses.</t>
        </dd>
        <dt>Expiry of a path:</dt>
        <dd>
          <t>The earliest expiration time of the Hop Fields of the path (Section 2.2.2.5 of <xref target="I-D.dekater-scion-controlplane"/>). A path has expired when this time has passed.</t>
        </dd>
      </dl>
    </section>
    <section anchor="resolution">
      <name>Hostname Resolution and Path Lookup</name>
      <section anchor="sending-dns-queries">
        <name>Sending DNS Queries</name>
        <t>A client with SCION connectivity <bcp14>SHOULD</bcp14> send an SVCB or HTTPS query (Section 4.1 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>) for any application protocol that has an SVCB mapping, even if the client has no IPv4 or IPv6 connectivity, because SCION addresses are published only in these records. This document adds no other DNS queries.</t>
      </section>
      <section anchor="scion-endpoints">
        <name>SCION Endpoints</name>
        <t>Each distinct usable SCION address (Section 3.3.1 of <xref target="I-D.john-scion-svcb"/>) of a ServiceMode record yields one SCION endpoint with the record's SvcPriority and port. Its application protocols are those of the record's SVCB ALPN set (Section 7.1 of <xref target="RFC9460"/>) whose transport the client can use over SCION (Section 3.3 of <xref target="I-D.john-scion-svcb"/>). If there are none, the address yields no endpoint.</t>
      </section>
      <section anchor="path-lookup">
        <name>Path Lookup</name>
        <t>An IP address, whether from an address record or from a hint, can be attempted as soon as the client receives it. A SCION address can be attempted only when the client has a path to its AS. When the client creates a SCION endpoint, it therefore starts a path lookup for the endpoint's ISD-AS. SCION endpoints with the same ISD-AS share one lookup. A lookup can be answered from a cache, for example that of a path service on the client's host (a local path service). The limit on the number of destination ASes for which a client looks up paths (Section 5.4 of <xref target="I-D.john-scion-svcb"/>) applies.</t>
        <t>A path is eligible if it has not expired and its maximum transmission unit (MTU, Section 3.4 of <xref target="I-D.dekater-scion-controlplane"/>) is at least the size, without underlay encapsulation, of the largest SCION packet that the client sends on it before the handshake completes. For QUIC, the largest of these packets carries a UDP payload of at least 1200 octets (Section 14.1 of <xref target="RFC9000"/>).</t>
        <t>A SCION endpoint enters the list of endpoints when its path lookup has returned at least one eligible path. If connection attempts have already started, the endpoint is added as Section 7 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> describes. A SCION endpoint in the client's own AS needs no lookup and enters the list at once. Its only path is the empty path (Section 2.4.1 of <xref target="I-D.dekater-scion-dataplane"/>). This path has no expiry, and its MTU is that of the client's AS.</t>
        <t>By default, a client gives up on a path lookup that has not completed within 2 seconds. This limit bounds how long a client with no other endpoint waits. If the lookup fails or returns no eligible path, the client discards the SCION endpoint.</t>
      </section>
    </section>
    <section anchor="sorting">
      <name>Sorting Endpoints</name>
      <t>A SCION endpoint is grouped by its application protocols (<xref target="scion-endpoints"/>) and security requirements (Section 5.1 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>) and by the service priority of its record (Section 5.2 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>), as an IP endpoint is.</t>
      <t>Within a group, the SCION endpoints form a third address family. Destination Address Selection <xref target="RFC6724"/> (Section 5.3 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>) orders the IP endpoints only. A client orders the SCION endpoints among themselves at random, as Section 3.3 of <xref target="I-D.john-scion-svcb"/> recommends, unless local policy sets another order.</t>
      <t>By default, SCION is the first address family. The second is the family of the first IP endpoint after Destination Address Selection, and the third is the other IP family. SCION is first because only SCION attempts give the application a choice of path, and because a host has SCION connectivity only where the host or its network was set up for SCION. <xref target="results"/> reports what this order costs. Local policy or the application can put SCION last instead.</t>
      <t>The client then interleaves the families (Section 5.3 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>). The list starts with as many endpoints of the first family as the Preferred Address Family Count. After these, it takes one endpoint of each family in turn, beginning with the second family.</t>
      <t>For example, take SCION endpoints S1 and S2, IPv6 endpoints x1 and x2, and IPv4 endpoints y1 and y2, all in one group, with x1 first after Destination Address Selection and a Preferred Address Family Count of 1. The list is then S1, x1, y1, S2, x2, y2.</t>
    </section>
    <section anchor="starting">
      <name>Starting Connection Attempts</name>
      <t>A client that orders SCION first (<xref target="sorting"/>) treats a path lookup as HEv3 treats a DNS query for the preferred address family. It applies the conditions of Section 4.2 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> for starting connection attempts as follows:</t>
      <ul spacing="normal">
        <li>
          <t>SCION is the preferred address family while the client has a SCION endpoint that it has not discarded (<xref target="path-lookup"/>).</t>
        </li>
        <li>
          <t>A SCION endpoint in the list of endpoints counts as a positive answer for the SCION family. The client then starts connection attempts without waiting for other answers.</t>
        </li>
        <li>
          <t>A path lookup in progress is an answer that has not been received. Once the client has a positive answer for an IP address family, it waits for the lookup no longer than the Resolution Delay, counted from the first such answer, and then starts with the IP endpoints. A lookup that starts later does not extend this time. A SCION endpoint whose lookup completes later is added to the list (<xref target="path-lookup"/>). A client that wants to wait longer for path lookups can configure a longer Resolution Delay (Section 10 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>), which also lengthens the wait for DNS answers.</t>
        </li>
      </ul>
      <t>A client that orders SCION last does not wait for path lookups.</t>
    </section>
    <section anchor="attempts">
      <name>Connection Attempts</name>
      <t>A SCION endpoint takes its turn in the list of endpoints as an IP endpoint does. When its turn comes, the client selects candidate paths (<xref target="path-selection"/>) and attempts the endpoint on them (<xref target="path-attempts"/>).</t>
      <section anchor="path-selection">
        <name>Candidate Paths</name>
        <t>When the client attempts a SCION endpoint, it selects the candidate paths, in an order set by local policy, from the paths to the endpoint's AS that are eligible at that time. It selects no more than the Path Attempt Count. The default Path Attempt Count is 2. A client <bcp14>MUST NOT</bcp14> use a Path Attempt Count above 3 (<xref target="load"/>). If no path is eligible, the client skips the endpoint and attempts the next one at once.</t>
        <t>Without a more specific policy, a client <bcp14>SHOULD</bcp14> first select a path with the fewest AS hops, at random among equals. For each further candidate path, up to the Path Attempt Count, it <bcp14>SHOULD</bcp14> select the eligible path that has the least overlap with the paths already selected (<xref target="design-rationale"/>). Overlap is compared by the number of shared transit ASes, then of shared pairs of adjacent ASes, then of shared inter-AS links. A transit AS, a pair, or a link counts once, however many selected paths have it. Among paths of equal overlap, the client selects one with the fewest AS hops, at random among equals. Paths that traverse the same inter-AS links count as one path, and the client uses the one with the latest expiry.</t>
        <t>Router clocks need to agree with those of core ASes only to within minutes (Section 4.2.2.3 of <xref target="I-D.dekater-scion-dataplane"/> and Section 7.3 of <xref target="I-D.dekater-scion-controlplane"/>), so a router can treat a path as expired before the client does. A client therefore <bcp14>SHOULD NOT</bcp14> select a path that expires within 5 minutes unless no other path is left.</t>
        <t>The candidate paths of a SCION endpoint do not change once the client has started to attempt it. A client <bcp14>MUST NOT</bcp14> send on an expired path: it does not start an attempt on a candidate path that has expired, and an attempt in progress fails when its path expires.</t>
      </section>
      <section anchor="path-attempts">
        <name>Attempts over Paths</name>
        <t>Each connection attempt to a SCION endpoint uses one candidate path: the client sends every packet of the attempt on that path. In all other respects it is a connection attempt as in Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>.</t>
        <t>The client starts an attempt on the first candidate path. Each time the Path Attempt Delay passes and no attempt has succeeded, it starts an attempt to the same endpoint on the next candidate path, until it has started an attempt on each candidate path. Each attempt is a separate connection (Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>).</t>
        <t>The default Path Attempt Delay is 50 milliseconds (<xref target="design-rationale"/>). A client <bcp14>MAY</bcp14> use another value, for example one that it derives from historical round-trip time data (Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>). A client <bcp14>MUST NOT</bcp14> use a Path Attempt Delay below 10 milliseconds, the lower bound of Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> for the time between two attempts, and <bcp14>SHOULD NOT</bcp14> use one above the Connection Attempt Delay, because it would then attempt the next endpoint before the next candidate path. The lower bound also applies between any attempt on a candidate path and an attempt to another endpoint: when two attempts fall due less than 10 milliseconds apart, the client delays the later one.</t>
        <t>Apart from this bound, the attempts on further candidate paths do not change the time at which the client attempts other endpoints. The client sets the Next Connection Attempt Timer when it starts the first attempt to a SCION endpoint, and not when it starts the further ones. For the Connection Attempt Delay Multiplier, the attempts to one SCION endpoint count as one attempt.</t>
      </section>
      <section anchor="transport">
        <name>Transport Requirements</name>
        <t>Attempts to one SCION endpoint share the client's SCION address and the destination SCION address and port. A client whose transport identifies connections by addresses and ports <bcp14>MUST</bcp14> use a different local port for each concurrent attempt to the same destination SCION address and port. TCP identifies connections in this way, and so does QUIC for a client that uses zero-length connection IDs (Sections 5.1 and 5.2.1 of <xref target="RFC9000"/>).</t>
        <t>The server chooses the paths of its replies, which need not be the reverse (Section 2.4.4 of <xref target="I-D.dekater-scion-dataplane"/>) of the path of the attempt. The client <bcp14>MUST</bcp14> accept replies from the SCION address of the endpoint on any path. It <bcp14>MUST</bcp14> present the same server address to the transport regardless of the path a reply arrives on (Section 9 of <xref target="RFC9000"/>). A reply does not show that the reverse of its path carries the client's packets. The client therefore <bcp14>MUST</bcp14> continue to send on the path of the attempt until the attempt succeeds, fails, or is cancelled.</t>
      </section>
      <section anchor="scmp">
        <name>SCMP Error Messages</name>
        <t>A client <bcp14>SHOULD NOT</bcp14> end an attempt because of a SCION Control Message Protocol (SCMP) error message (Section 6 of <xref target="I-D.dekater-scion-controlplane"/>). Section 8.3.4 of <xref target="I-D.dekater-scion-controlplane"/> specifies no authentication for these messages and advises endpoints to treat them as weak hints. An AS on the path of an attempt could otherwise end that attempt with a forged message. A client whose attempts share a local port needs to ensure that such a message does not close the socket that they share.</t>
      </section>
      <section anchor="scion-required">
        <name>Applications That Require SCION</name>
        <t>An application can require that its connection use SCION. The client then attempts no IP endpoints and waits for path lookups up to the limit of <xref target="path-lookup"/>.</t>
      </section>
      <section anchor="after-establishment">
        <name>After Establishment</name>
        <t>The procedure of this document ends when a connection is established. Its result is one connection on one path. Finding further paths, moving to another path, and using several paths at once belong to the transport. For QUIC, the multipath extension <xref target="RFC10069"/> provides the means to use several paths in one connection. It does not cover the discovery of addresses and leaves the decision to set up or tear down paths to the application. Its use over SCION is not specified here.</t>
      </section>
    </section>
    <section anchor="config">
      <name>Summary of Configurable Values</name>
      <t>In addition to the values of Section 10 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>, this document defines the following values and their defaults. As that section allows, a client <bcp14>MAY</bcp14> use other values, within the limits stated in the sections referenced.</t>
      <ul spacing="normal">
        <li>
          <t>Path Attempt Count (<xref target="path-selection"/>): 2.</t>
        </li>
        <li>
          <t>Path Attempt Delay (<xref target="path-attempts"/>): 50 milliseconds.</t>
        </li>
        <li>
          <t>Address family order (<xref target="sorting"/>): SCION first.</t>
        </li>
        <li>
          <t>Limit on the time of a path lookup (<xref target="path-lookup"/>): 2 seconds.</t>
        </li>
      </ul>
    </section>
    <section anchor="experiment">
      <name>Experiment Goals</name>
      <t>This document is Experimental because attempting SCION addresses on several paths within HEv3 has not been deployed. A participating client that orders SCION first can delay its first attempt to an IP endpoint by up to the Resolution Delay, and by one Connection Attempt Delay for each SCION endpoint ordered before that IP endpoint. A client that orders SCION last does not delay its first attempt to an IP endpoint.</t>
      <t>The experiment is to answer the following questions from clients in use on a production SCION network:</t>
      <ul spacing="normal">
        <li>
          <t>How often does the attempt on the first candidate path fail while an attempt on a further candidate path succeeds? If this is rare, a Path Attempt Count of 1 is the better default.</t>
        </li>
        <li>
          <t>How many attempts does a client start for each connection that it establishes over SCION? Each attempt after the first costs the client and the server a handshake (<xref target="load"/>). If clients often start a second attempt although the first one succeeds, the default Path Attempt Delay is too short.</t>
        </li>
        <li>
          <t>What does ordering SCION first cost the connections that are established over IP, and how often do path lookups complete within the Resolution Delay?</t>
        </li>
        <li>
          <t>How much do the candidate paths overlap, and do they fail together?</t>
        </li>
      </ul>
      <t>The authors will report results, and any change to the defaults, in a revision of this document.</t>
      <section anchor="results">
        <name>Results So Far</name>
        <t>No client in use has been measured yet. The following observations come from path lookups and round-trip time probes from one AS of the SCIERA network <xref target="SCIERA"/> to the 78 ASes reachable from it, in November 2026, and from the prototype of <xref target="implementation-status"/> in a testbed of 12 SCION ASes.</t>
        <ul spacing="normal">
          <li>
            <t>A second path was faster than the first by more than 10 milliseconds in fewer than 1% of selections in production. Attempts on several paths therefore do not find a faster path; they protect against a path that does not work.</t>
          </li>
          <li>
            <t>In two passes of probes about 70 minutes apart, every one of the 19,786 paths answered. How often a path fails over longer periods of use is not known.</t>
          </li>
          <li>
            <t>Paths that share no inter-AS link were rare in production: such a second path existed for 2 of the 78 ASes. When the second path was selected by shared inter-AS links alone, it traversed on average 94% of the pairs of adjacent ASes of the first. With the selection of <xref target="path-selection"/>, it traversed 72% of them.</t>
          </li>
          <li>
            <t>In production, the round-trip time on the first path selected had a median of 39 milliseconds and a maximum of 155 milliseconds. The round-trip time plus 5 milliseconds was at most 50 milliseconds for 68 of the 78 ASes. Twice the round-trip time plus 5 milliseconds was at most 50 milliseconds for 2 of them and at most 100 milliseconds for 74. Handshake times were not measured in production. In the testbed, where a handshake took 28 milliseconds, a client with a Path Attempt Delay of 10 milliseconds made two handshakes for every connection, and a client with a delay of 35 milliseconds or more made one.</t>
          </li>
          <li>
            <t>A path lookup answered from a cache took a median of 2 milliseconds in production and 5 milliseconds in the testbed. A lookup for which the client forced the path service to fetch the paths again took a median of 35 milliseconds in the testbed. In production, it took between 8 and 19 milliseconds for 7 of 14 ASes measured, 377 milliseconds for one, and 9 seconds for 6.</t>
          </li>
          <li>
            <t>In the testbed, where SCION and IP have the same latency, the median connection establishment time with cached paths was 7 milliseconds longer with SCION first than with IP first.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="security">
      <name>Security Considerations</name>
      <t>The security considerations of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> and <xref target="I-D.john-scion-svcb"/> apply. A client that orders SCION first attempts a SCION address in its own AS before any IP address, so the policy on internal targets of Section 5.2 of <xref target="I-D.john-scion-svcb"/> matters for it in particular.</t>
      <t>This document relies on SCION path authorization (Section 7.1 of <xref target="I-D.dekater-scion-dataplane"/>), which ensures that packets follow paths that the ASes on them authorized, and on TLS to authenticate the server. Attacks on the SCION control plane are out of scope except as they affect path selection.</t>
      <section anchor="several-paths">
        <name>Attempts over Several Paths</name>
        <t>Each attempt exposes the client's first flight to the ASes on its path. QUIC Initial packets are protected with keys that anyone who sees the client's first Initial packet can derive (Section 5.2 of <xref target="RFC9001"/>). Each of these ASes can therefore read the TLS ClientHello, including the server name unless Encrypted Client Hello <xref target="RFC9849"/> is used. The client starts an attempt on a further candidate path whenever the earlier attempt is late, so an AS on the earlier path can extend this exposure to a further path by delaying packets.</t>
        <t>An AS on the path of an attempt, or on a path that the server chooses for its replies, can make that attempt fail by dropping its packets. An AS on the path of an attempt can also race forged Initial packets (Section 21.1.1.3 of <xref target="RFC9000"/>) or forge SCMP error messages (<xref target="scmp"/>). None of these actions can make an attempt succeed if success requires a completed QUIC or TLS handshake (Section 6.1 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>), because that handshake authenticates the server. By making the other attempts fail, an AS can make the client use a path that the AS is on.</t>
        <t>An AS on the path of an attempt can replace the remaining path in the header of the attempt's packets with other authorized segments, and restore it on replies (Section 7.2.1 of <xref target="I-D.dekater-scion-dataplane"/>). The success of an attempt therefore shows that the server was reached, not that the packets followed the candidate path.</t>
      </section>
      <section anchor="selection-security">
        <name>Path Selection</name>
        <t>The hops and inter-AS links that the default selection counts are declared by the ASes on the path. ASes can announce many parallel links or fake peering links (Section 8.3.4 of <xref target="I-D.dekater-scion-controlplane"/>) so that their paths appear short or disjoint from others and are selected. Paths that differ only in the links between the same two ASes can fail together, which is why the default selection counts transit ASes and pairs of adjacent ASes before links.</t>
      </section>
      <section anchor="load">
        <name>Load</name>
        <t>Each attempt costs the client and the server a handshake: a key exchange, connection state, and the first flights of both. A Path Attempt Delay shorter than the time in which the first attempt succeeds makes every connection over SCION cost more than one handshake, up to one for each candidate path (<xref target="design-rationale"/>). An attempt that the client cancels can hold server state until the server abandons the handshake. A server that limits the concurrent handshakes of one client address can see one handshake for each candidate path from one client.</t>
        <t>Attempts to one SCION endpoint share the client's and the server's hosts and can share links within both ASes. When packets are lost there, more attempts add load and are no more likely to succeed. This is why the Path Attempt Count is limited to 3.</t>
      </section>
      <section anchor="downgrade">
        <name>Downgrade</name>
        <t>An attacker that blocks SCION packets or path lookups, or that makes the attempts on all paths fail, can make the client connect over IP and lose the choice of path that SCION provides. The client's own control service can do the same by withholding paths, or by delaying its answer beyond the Resolution Delay (<xref target="starting"/>). Applications that require SCION exclude IP endpoints (<xref target="scion-required"/>).</t>
      </section>
    </section>
    <section anchor="privacy-considerations">
      <name>Privacy Considerations</name>
      <t>Path lookups disclose the destination ISD-AS to the client's control service. For uncached paths, core ASes of the destination ISD learn the destination AS and the client's AS, and core ASes of the client's ISD learn the client's AS and the destination ISD (Section 6 of <xref target="I-D.john-scion-svcb"/>). Because a client looks up paths when it creates a SCION endpoint (<xref target="path-lookup"/>), it also discloses the destination for endpoints that it does not attempt and for services that it then reaches over IP.</t>
      <t>Each attempt exposes the client's SCION address and the ClientHello to the ASes on its path (<xref target="several-paths"/>). A Path Attempt Count of 1 limits this exposure to one path for each SCION endpoint. Attempts to one SCION endpoint carry the same two SCION addresses, so an observer on the paths of more than one of these attempts can link the attempts.</t>
      <t>Historical data about paths that the client keeps is partitioned as Sections 5.3 and 9 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> specify. A path cache shared with other applications, such as that of a local path service, is outside the client's control.</t>
    </section>
    <section anchor="iana">
      <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="RFC6724">
          <front>
            <title>Default Address Selection for Internet Protocol Version 6 (IPv6)</title>
            <author fullname="D. Thaler" initials="D." role="editor" surname="Thaler"/>
            <author fullname="R. Draves" initials="R." surname="Draves"/>
            <author fullname="A. Matsumoto" initials="A." surname="Matsumoto"/>
            <author fullname="T. Chown" initials="T." surname="Chown"/>
            <date month="September" year="2012"/>
            <abstract>
              <t>This document describes two algorithms, one for source address selection and one for destination address selection. The algorithms specify default behavior for all Internet Protocol version 6 (IPv6) implementations. They do not override choices made by applications or upper-layer protocols, nor do they preclude the development of more advanced mechanisms for address selection. The two algorithms share a common context, including an optional mechanism for allowing administrators to provide policy that can override the default behavior. In dual-stack implementations, the destination address selection algorithm can consider both IPv4 and IPv6 addresses -- depending on the available source addresses, the algorithm might prefer IPv6 addresses over IPv4 addresses, or vice versa.</t>
              <t>Default address selection as defined in this specification applies to all IPv6 nodes, including both hosts and routers. This document obsoletes RFC 3484. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6724"/>
          <seriesInfo name="DOI" value="10.17487/RFC6724"/>
        </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="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.ietf-happy-happyeyeballs-v3">
          <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="2" month="November" year="2026"/>
            <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 defines the
   algorithm for "Happy Eyeballs", a technique for reducing user-visible
   delays on dual-stack hosts.  This document updates the algorithm in
   RFC 8305.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-happy-happyeyeballs-v3-05"/>
        </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>Independent</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>Independent</organization>
            </author>
            <author fullname="Samuel Hitz" initials="S." surname="Hitz">
              <organization>Anapaya Systems</organization>
            </author>
            <date day="24" month="June" year="2026"/>
            <abstract>
              <t>   This document describes the Data Plane of SCION (Scalability,
   Control, and Isolation On Next-generation networks), a path-aware,
   inter-domain network architecture.

   Unlike IP-based forwarding, SCION embeds inter-domain forwarding
   directives in the packet header, enabling endpoints to construct and
   select end-to-end paths from segments discovered by the Control
   Plane.  The role of the Data Plane is to combine such segments into
   end-to-end paths, and to forward data according to the specified
   path.

   This document describes the SCION packet format, header structure,
   and extension headers.  It also describes the cryptographic
   mechanisms used for path authorization, processing at routers
   including a life of a packet example.

   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-15"/>
        </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="30" month="April" year="2026"/>
            <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 SCION 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 by combining path segments
   obtained 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 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-18"/>
        </reference>
        <reference anchor="I-D.john-scion-svcb">
          <front>
            <title>Publishing SCION Endpoint Addresses in DNS Service Binding (SVCB) Records</title>
            <author fullname="Tony John" initials="T." surname="John">
              <organization>OVGU Magdeburg</organization>
            </author>
            <author fullname="Jelte van Bommel" initials="J." surname="van Bommel">
              <organization>ETH Zurich</organization>
            </author>
            <author fullname="Tilmann Zäschke" initials="T." surname="Zäschke">
              <organization>ETH Zurich</organization>
            </author>
            <author fullname="Lars-Christian Schulz" initials="L." surname="Schulz">
              <organization>OVGU Magdeburg</organization>
            </author>
            <author fullname="Nicola Rustignoli" initials="N." surname="Rustignoli">
              <organization>SCION Association</organization>
            </author>
            <date day="16" month="November" year="2026"/>
            <abstract>
              <t>   This document defines "scion", a Service Parameter Key (SvcParamKey)
   for the Service Binding (SVCB) and HTTPS DNS resource records.  Its
   value lists the addresses at which a service endpoint is reachable
   over SCION (Scalability, Control, and Isolation On Next-generation
   networks), a path-aware inter-domain network architecture.  This
   document specifies the wire format, presentation format, and
   semantics of the key and requests its registration with IANA.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-john-scion-svcb-00"/>
        </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="RFC9001">
          <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="RFC7942">
          <front>
            <title>Improving Awareness of Running Code: The Implementation Status Section</title>
            <author fullname="Y. Sheffer" initials="Y." surname="Sheffer"/>
            <author fullname="A. Farrel" initials="A." surname="Farrel"/>
            <date month="July" year="2016"/>
            <abstract>
              <t>This document describes a simple process that allows authors of Internet-Drafts to record the status of known implementations by including an Implementation Status section. This will allow reviewers and working groups to assign due consideration to documents that have the benefit of running code, which may serve as evidence of valuable experimentation and feedback that have made the implemented protocols more mature.</t>
              <t>This process is not mandatory. Authors of Internet-Drafts are encouraged to consider using the process for their documents, and working groups are invited to think about applying the process to all of their protocol specifications. This document obsoletes RFC 6982, advancing it to a Best Current Practice.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="205"/>
          <seriesInfo name="RFC" value="7942"/>
          <seriesInfo name="DOI" value="10.17487/RFC7942"/>
        </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="RFC9849">
          <front>
            <title>TLS Encrypted Client Hello</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <author fullname="K. Oku" initials="K." surname="Oku"/>
            <author fullname="N. Sullivan" initials="N." surname="Sullivan"/>
            <author fullname="C. A. Wood" initials="C. A." surname="Wood"/>
            <date month="March" year="2026"/>
            <abstract>
              <t>This document describes a mechanism in Transport Layer Security (TLS) for encrypting a message under a server public key.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9849"/>
          <seriesInfo name="DOI" value="10.17487/RFC9849"/>
        </reference>
        <reference anchor="RFC10069">
          <front>
            <title>Managing Multiple Paths for a QUIC Connection</title>
            <author fullname="Y. Liu" initials="Y." role="editor" surname="Liu"/>
            <author fullname="Y. Ma" initials="Y." surname="Ma"/>
            <author fullname="Q. De Coninck" initials="Q." role="editor" surname="De Coninck"/>
            <author fullname="O. Bonaventure" initials="O." surname="Bonaventure"/>
            <author fullname="C. Huitema" initials="C." surname="Huitema"/>
            <author fullname="M. Kühlewind" initials="M." role="editor" surname="Kühlewind"/>
            <date month="November" year="2026"/>
            <abstract>
              <t>This document specifies a multipath extension for the QUIC protocol
 to enable the simultaneous usage of multiple paths for a single
 connection. It introduces explicit path identifiers to create,
 delete, and manage multiple paths. This document does not specify
 address discovery or management, nor how applications using QUIC
 schedule traffic over multiple paths.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="10069"/>
          <seriesInfo name="DOI" value="10.17487/RFC10069"/>
        </reference>
        <reference anchor="SCION-HEV3" target="https://github.com/netsys-lab/scion-hev3/tree/d46107329e06afba4fcd76a99b1cfef3810c8c73">
          <front>
            <title>scion-hev3: Go client library for SCION and IP endpoints, commit d461073</title>
            <author>
              <organization>netsys-lab</organization>
            </author>
            <date year="2026" month="November"/>
          </front>
        </reference>
        <reference anchor="SCIERA" target="https://sciera.readthedocs.io/en/latest/">
          <front>
            <title>SCION Education, Research and Academic Infrastructure (SCIERA)</title>
            <author>
              <organization>SCIERA</organization>
            </author>
            <date year="2026"/>
          </front>
        </reference>
        <reference anchor="SCION-V0.15.1" target="https://github.com/scionproto/scion/releases/tag/v0.15.1">
          <front>
            <title>SCION reference implementation, release v0.15.1</title>
            <author>
              <organization>SCION Association</organization>
            </author>
            <date year="2026" month="August"/>
          </front>
        </reference>
      </references>
    </references>
    <?line 329?>

<section anchor="design-rationale">
      <name>Design Rationale</name>
      <dl>
        <dt>Separate connections:</dt>
        <dd>
          <t>Each attempt on a path is an ordinary connection, so the rules of HEv3 for success and cancellation apply as they are, and neither the transport nor the server needs to change. The cost is a handshake and server state for each attempt after the first. Racing paths within one QUIC connection, by copying its datagrams to further paths below the transport, would avoid that cost. That approach is contrary to Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/>, hides the copies from congestion control and round-trip time estimation, and lets the server's choice of reply path decide which path completes the handshake.</t>
        </dd>
        <dt>Paths that differ:</dt>
        <dd>
          <t>The first path has the fewest AS hops because each AS and each inter-AS link adds delay. A second attempt adds little if its path shares most links with the first. The overlap is counted from the widest scope of failure to the narrowest. The failure of a transit AS affects every path through it. Parallel links between the same pair of adjacent ASes can fail together (<xref target="selection-security"/>). An inter-AS link is the narrowest scope. Section 2.3.3 of <xref target="I-D.dekater-scion-controlplane"/> makes a similar distinction, between AS-disjoint and link-disjoint paths, for the selection of path segments. The selection ranks partial overlap because disjoint paths were rare in production, where selection by links alone mostly chose parallel links (<xref target="results"/>). The default Path Attempt Count of 2 gives the client one alternative at the cost of at most one further handshake. No path failed in the measurements so far (<xref target="results"/>), so whether that alternative is worth its cost is the first question of the experiment (<xref target="experiment"/>).</t>
        </dd>
        <dt>A further path after 50 milliseconds:</dt>
        <dd>
          <t>An attempt on a working path succeeds after one or two round-trip times: a QUIC handshake takes a second round trip when the server's first flight, with its certificate chain, exceeds what a server sends before it has validated the client's address (Section 8.1 of <xref target="RFC9000"/>). A client that waits longer than that before it starts an attempt on a further path makes one handshake when the first path works. When the first path does not work, the connection is established later by the Path Attempt Delay. Starting the attempts 10 milliseconds apart cost a second handshake for every connection in the testbed, and the selected paths differed too little in round-trip time for this to find a faster one (<xref target="results"/>). The default is a fixed value because a fixed value needs no data about the destination, and 50 milliseconds exceeded one round-trip time to most ASes in production, but two round-trip times to few (<xref target="results"/>). When the handshake takes longer than the delay, the client starts the second attempt even when the first path works; the Path Attempt Count bounds that cost, and a client can avoid it with a delay that it derives from round-trip time data. Section 6 of <xref target="I-D.ietf-happy-happyeyeballs-v3"/> permits a delay below the Minimum Connection Attempt Delay, down to 10 milliseconds. That minimum guards against congestion collapse under high packet loss; here the Path Attempt Count, at most 3, bounds the attempts started together.</t>
        </dd>
        <dt>Path lookups within the Resolution Delay:</dt>
        <dd>
          <t>A lookup answered from the cache of a local path service took a few milliseconds, and other lookups took between 8 milliseconds and 9 seconds (<xref target="results"/>). Waiting up to the Resolution Delay, 25 milliseconds by default, adds no parameter and covers most cached lookups when the SVCB or HTTPS answer arrives no later than the first IP answer. When paths are not cached, the first connection can go over IP and later ones over SCION.</t>
        </dd>
      </dl>
    </section>
    <section anchor="implementation-status">
      <name>Implementation Status</name>
      <t>(RFC Editor: please remove this section before publication.)</t>
      <t>This section records the status of known implementations as of November 2026, following <xref target="RFC7942"/>.</t>
      <dl>
        <dt>scion-hev3 <xref target="SCION-HEV3"/>:</dt>
        <dd>
          <t>A research prototype in Go on release v0.15.1 of the SCION reference implementation <xref target="SCION-V0.15.1"/>. It implements this document for QUIC over SCION. Contact: Tony John. Last updated: November 2026.</t>
        </dd>
      </dl>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA60923LbyJXv/AqsXam1UxStm29KKhPZ1sTK+qJYnkklW/vQ
BJoixiDAAKBkjsv/sg/7Jbs/tufaN4CynMpM1QxFNLpPnz73c/pwb29v0pd9
ZU+ye5cvz9+/y8o6e23W6212trVzU1Vd9rNtu7Kps6N7EzOft/bajY0H3pvk
prdXTbs9yezn9aRo8tqsYOaiNYt+75dmWe91Ocy0t8T39qy8t7e/P+k281XZ
4TL9dg2vlHVh1xb+U/eTerOa2/ZkUsDsJxNY/WjyyW5vmrY4mWTZXgIFfUXg
0ae//HT+kj6sTb/cMzemtVlte3j7U1lfTa5tvbE4zVXZLzdz2Bk87LbdXmXm
jxjuMZABE5t+2bQMwGJTVbzTj029zf4MG4XvM9hE2Zem6uD7GX3RbVoe54Y0
7ZWpy19ND2ucZO9//tNP2VtzVdj5pr2iAXZlyuok62HiGWLwj8311WZW2GTh
P9uqt9m1qbMXzWplq2T9PyfrJwNjKM4+vs7+vmnLfBlC8AuuMIMX5/TeH8t6
MbP98tcZDYuQUFYrU9fZ3//vf7p8+cnSLAbQWP44HGOsH7MbX8OpLt2jcIa7
bKTnpWe/you37OSNabu9l8u27ACuOrvMl5vq1wTUNwmowaC7Hm7V0Ts7jvZd
mTeVyT5sAIiruqnKBIB3CQDJwBgI5tvTrmvykr4K4ajL/I9E7TN4aTKpm3YF
Y66JPz78+PLJ08Nj+fh8f39fPx4/oY/ne69mpe0Xwin0X8fh10c6pLCfgI1b
4SpgabOuTG3HH+cgDtqmikYEYqS7zucnkwmcXwIpgHcgH58+Pz7Ubw8PnurH
Z8fP5ePB/v4T+kyo2Xt99jPBmmUqFoX/Lewh+1OT5VUJQimrynlr2m0GSwtS
TV1k5xcZCK11U9Z9N81y4JSyz4rjJwf7T0F60qymvbL9Sbbs+3V38ugRy50Z
DH0USB6/5qO+tfaRTHH43O4/MYu5OV7kxdMn5vnz+UG+sIujZwf7+bP86RHz
hxNN+M8eUsBJ5ien70mWZof7h0/2Dg5482cfTuON87bOik1OlDLNPtjOmjZf
0lZPc1PYVZln5/WiNV3fbvJ+A8L1AU/1cHy7sDHbmllrTdEvLWiIblY2j2z9
qAKAuv7R7g3wtAnw7th+3p8dPJ4djG2gtQvb2jq3WblaV3YFpyf7aW1lTQdi
k1/+5gHRqazbpm/44yOZoHvUm6tHMsutOxjhveAk9p9NJnt7e5mZAzpN3k8m
/MqDy9zAwZVV2W+n2UtmiikTXAeyAefK3tfZO/u537uyNWCYvhI91z3Myi4z
oQYE+gQmKxrgezcsw6Mte8vHCN/fLEs6a0fSWb5sGthuBkdHs2XNIiv7Dj7n
n4C+Ztlp1tn2ugRc5/DeejOvym6p/FEUre3w9RrgBI1Gr55fXB8L61w/CcbA
+q/eXWaXMt0LMAhAXwMqfn754iG98Prjx4tLOMMcDAFY+uMSNgkEtcEDzrq1
zctFCRMtmxvY+y6TRtl5I9sCanAwzAaAo5yByfpl2Rb6dbYwq7KCc+kaeGB6
Qo7MCvKrBnx2WXNtVUzcLIEa9TOeDm2GBoD04KcoNBpEVNPPshc2NwBe1tSC
dETtAgQ2HlAF38OCbUdzTcPFTd/b1brHk4/2ARNlmzXiv1+CbKE5Owa9KBfA
K9mibVaZNXD4NHf2AOgjm2+zwi7MpuofzrJzwDAwSu9w5tfqgPBhJluZbWbW
MCZ78Hg/AxQBKcBZ1UUXTjXldQy9aWE4cIOijXgUkaOHky3KtnMbY5C7TZ5b
OyQA+Hz2eW3bkvi9UpBByADaDD0HDMxttgIOBoIv8E9YGJZYAbsCqZv6ysr2
BNpuxvy5KouispPJfZB9wIogIImb/2Xc+uXL7arw69fRIU6ZwvPvZ/gvX0RF
fv1KfNxsWuA7x/pV0wCpAt0IuTR0IAXI7LJm+E83YKQ2q2bTZZfbDo4oe3B6
yay63jCloADpbM1kDLM2fPosPmayqUTBw2YA/WUtJMDq+F52eZ1fALWs/sMC
kllSibiRgSnvgqgyTjq5bX2nmBEsgcmDWNopVB68Prs+0nO8xSjCvQmfI+11
ZeHEhJdCkwnO5pkAcIig4n7c5ogV/PYaZONQfjF7IffJ69NkKjpVPHcnDzcA
4zb7VDc3HbwK4slU/uxRFkVwMn0zt/CovG1A1rBEwRlPLy2LuqqsP8FS70Nx
RuQIsq+GESxzvPxzMPEmb5FqsEc4vErmXdChzIG2EGKWrTVPQs8d5llyCvwg
s9ZVyRYP/l0D5Q8xTxOYCpT85kqlZMQYHZjiDjRcAI4xFlCVxU2As42H67VQ
Nm8QJ7QSHUi8y7Ij3K+aNiZiXJNmAg7oEUJnhs6yv+IuUNcCn9dolNpuXFGA
2mEsrgB1Gbvdjjhu0xBTAgqcZXikB4j4HNEG3xD42YMvXxSer18fCvBe9hPi
vdrEByCoi25pPqGGxC3ABsHMI0EPplspR04gRNtewSuITaByhN5Ng5ok0Ggw
6WLTBidcNEQ1sicdhkxBgzzi0xPPUcl34WZBehqSWfScQMH9Ix73omeECgSr
3VQsy+4iW5CUt9mmrpBy+tg+MtuOAb4BtZwqT8camzWap0RZJ3BggjnEa7Pp
hTR1P9eg7zJ0PNtEVH9CEY2nhZSB0pV1K5lTcGAzVKSgJq9hahjPB/sKRX5J
fyMaLU6C5w6S7N7bny4/3pvy/7N37+nzh7O//HT+4ewVfr58ffrmjfswkRGX
r9//9OaV/+TffPn+7duzd6/4Zfg2i76a3Ht7+rd7vIF77y8+wpZP39xjngtx
hlqWLQrStesWSBA4oJuAjszbcg5/wDsvXl78738fHMPx/RsoksODg+ekzPGP
ZwdPj+EPlFK8GtED/wno3E7gOMH9wlmQPXOzLsGwQcnbIZvd1BnajoDN3/4n
Yua/TrLfz/P1wfEf5AvccPSl4iz6knA2/GbwMiNx5KuRZRw2o+8TTMfwnv4t
+lvxHnz5+x9Akdhs7+DZD3+YpKzmlCWcxOru/CISBV9S71EE7z0/x8A+Adsy
IQago9PLe2ha1l5RnV4KEaEYSR/id3SScLrfNv9SfgUyaAIruamq5gYZjXZ/
MpmcX77aO708mZyQDFmbksQ6jvUW6Su2DR/A2Icq+xUhp5f6DXs4DXjIKOtK
jM+Wiy3qsdPLmVrAoUTARZ0GX8IGx4TGguS2qcnK9Ebmg0uRk8ce+7ehhQ02
MDAL+gA2my2vrcMw+ais4QI71EGtgpsgDpzeGxwbKuDE8oAJzqryqpyL4cE7
JkUlxgCgj6zPeB2EhA3X0GMEJET+jRsNioHseUTRZo0KYTJ5CdssSUITwvSA
bQhON/BKO1uRU3rDdsHQpBqsyW8Awp0einQoTL9q0OyoI1Wu+0BFBzof4L1A
pJzK1y+bDSMb56sw6gJTeKMjj/e2cxeoRLw5qqCni71Cba2L9eAUgqDub6zY
FuLLIk+Apxuq/hQKGDK62Otm7WZvDep5MJdlMBw/eLzsjs2UNEo2gP6xocgU
jFw2a7DVztA4go/EKsSgxLoaaIFPypPnqGUWBl4+fxWwysHsYBezBP7hQ/T9
yXb1FEhgWZxV7HQL+xC8A3MjT8DyLi6EmKJXOnuFQqjLfgFcqIGKW3AwHc6O
Z4d3gQoQSdvCHaObwKyEn/xxwbLkSgQ7PrqjeJgC9Hm1IQ8PjsPaFj/h9BQe
ANBFoJWgrOHIAvyPYR3pnm1gPhwEDUiic2cslGAZJWW4M7cfqweuK2BwjKiX
hbQpfoHVxH9SEiMECLWi32jzDUa/iYZY1DCtvUU3AQ6wHgEAJY0wq/dY1mOr
oiHbgrIq8U+RjirSEPJe4im1LUkreGsdbEH6qzLwBw4NYDutRv1JJ3uWgDsP
mER+kCxxLlI2AANuWJHiRUe0Ueccx0eCUvvzumy3HiYnPk0LIgZWsThAPEEU
GaIzgdezH0tbFZ1+Q1MH5I7/Pr4jUTpqQY6nFYH4xFXFIBUujI/WBjz9gozl
1yBsMdeDAfmm2rCwBdSQxHtD+iH7cr91D7/CS/ezS8uxDYx3/GUDtG/BtD4N
bfox3SxGnSjVDOMiGB7jqAhIL0CgV9Oh7LnV1HpIYtvU28jdptB63lR8Yrhp
XXEFwwB2cB6vUWctQkWA4+qGA8lNy3HkcAtT4DWOoKYhITTZNWgk5ja70jB2
R1yZYim1+nqIyn8wKmeMY06ZqAsIp8Bn7pxCOAoS8QWmFOscLVWDmjr28h1G
j2ZHIU4HpudDMSw47vO2KRTwbCsEOmQsOmnEH4/8945iaW3ZtHjeFK4Dnx0l
Yjd6Ooy3nqwioX8/Ex7W6ZuLd0Awvd/GU92EC549FLOqR8GC66VGEEW8fdQ8
xMht+ACwCSSAkDL9sH92+hW1gpe6CbU3nFzMO6GlBUxSY/jIRbqAOen0KQiC
9ppMLZhv9EkGzi64AribuQsokE+YdQ2ybBduWqxVjMIMwz6DOZxvmHKCcZYn
2wtBBEWx21oKg6fW3hRtQULdAtWG2EQyH+OCuBan0nfgyFlBzpLJOk9mJL9F
jXZLPBUkSp4QdypT6xbr7saiCBQc5sAtcIS4sP1sMLLD0sFJbR/0DHf575j4
ARH+wMD8uYQudajYsFW54ohXH2mPKKZ9KWEKyYW57G8cDXfU+Xh2fCu3Ej+R
sPBmoLPW2Q1icdY7VYAMiUe5Mp/L1WbFHCO1MtmmhjcevP340zTzDHJnb6kk
0x1TmGIClL8CqjW6s6kL22KMCyxUs+42lWRNhefVYg+9qxEjvSYhhBubM13F
ITsXrJtlPwKasVpnGk3Pq1FUmf233LQob+Esfnp1Ad9uq8YURA66lYPD/f2s
yXsc7a3E41AG7e/vs7l5mkpHMYAJhDSUqh5TF/EEHlhrMbaKp6VAII1HfhhJ
pqF31LGhYypMiW+Z62wxjbiMDqooWHQ4mXrXqIbGn4Jocho5djyDUSR09jGj
hjJStog0mCIGeRBcF9YTJI6UoAl02Np2YBcd3805EaXrrCIU1mSrTR03AMnz
UkZJxG+CjMMXLsc49Wx7RQIWNkRBgPAQncXBqRgmykIjyIeSPFFzgCXHHBzY
ghPMVUMuRWhL1WlAOLsxJYbjz4V/RKKaEjQqkD6TEG82pJsoZg1mA9B/EWa4
QjWWXYImRRsvskD4u68jxA5buQI3cM3uTrlT4T/48iW1Y1ywJd+Q3dCCKwvy
ij3BQB7e3SLE6cTpUpG+VqtEPCzRsMH0h3ednoJrpg4rdGD7gLS/8hEbxsR0
BLO35v1n2atQX8izSw2YsLzByingxADuozujBTasfBdWFxHLBcmxYFgKvVkh
dcKTVWera47XgBIpmtU0FCi3W1aE+9UK5flUUwqiWRugmC0afJ1L/hA0CRdK
eWmUyU9Q+ZHOntKUOo6eKIvzW+ERcs7p1iPwqT0+P5mZAYW5dHEHH68yd2UX
sL5YYyqyUY4MkoUmyQ/yujqNYXtkRwRUzTnVjxRNa4nmNVl/g2ajxZSMrznD
lDlsFksT6ITQkJb6BnIe6RhgpQ7lzpvwtMSOC+Hnih1V6ORml3XXg1qacQrG
pWFRCaI2cBEiOafSdv8Ujas51rmqEpKgBo2eehvSfEgGQhpiRV9QmRcaTEoA
P/JzCjMCoxChkCnBhq5k/wIti6oefTOZGHUjSGR0H6/Kukax6m1aJlIhncnk
R2+eTmnqARNeHhA5XB5O2UP1Tz7zk8+HU62DOg6ebvnpFp9WFQKFMIusInjg
feGmb/OCZGVvRxYi4iA4E2YY8MQPprDYFECa0j4Q4u0h6x08NsTQS2/gnCq3
gAqSx1+DgAOrbpZajCzeBeoa0VgYpkRnJfVC4Mgp1+0eqh++dQ7K2u0wlTHn
vVrhrFjhHDnPiNv2kYy7KhZaUfc3at+ZTjIymIn5bSwGd4EppV0D3y7R3xx5
84aLmAcw3Vi24Lc77b+hpZsjIXScpl83XUnhRfbNHI7l1ALZHUoI4eQxjKiH
gQYRYo1C+FI0gCt0Amx45iXZI1cuB1MrNJHlNseQqnjSBdaY5CNIHNuPCV18
V9JXitHmtizAkGVcX/HqjMIgFPeKSw0IherIerHVbaioEld2mqmO5F6q6gMn
mUveeCxWzPo6GRA/vaXZJGg4Yu1zyEX9bVcmwRM5H0OSVkQTQzJKynFuTM3F
D4gnRQpiKzi7TmPNi/IKK82MjktxFnhr+3e368Q1xxRoZesrRCczF4GEsKB4
8JR1iwQipefrgvT9cC9arTAi5VzdyoilzerGFeHs5LuhkYrgfLuGR7Nhab5q
LIPHSsAVroSOJgdDVu61sBSHwmQ+43hB80uozE8PBnUSb9qZXiT+UsDphRj4
KZU61GLFoO0D7kFoc049b0XFV0F0CpxZDv+3gTtuNFBBbHLugQC+XrmUCVkV
g4QlCzoxakeeIx8dBlyilRcZG4EjL5h5A7LoCHGOoQwNYtbNIEIUn/incp2c
3uBcqdCaSrPEWWd3B2Wv4Z1KnXTuMOqcWAn8i9AiBKkadlJqYW8sZWMoETP1
joX4HOATAl9yaIdNK6mkik966uqRxzBOZOLSEJXmqyIn2WsBYiuOwFxj+Grt
oWUacZEWmopVZWG78qre41yPqTgG8V7eLzuSlab1SUEfLKSAZsFBuZLTZVOW
6P4hJtW6QVZtMCzOWiEJ+VmnhPoSC+1alJ+UwGMVjec6xSAE1miywey2xjum
ABNFlelQXCKbTkfRNCpNkHS++7AvgnS9ZNt8HDhJzeXMAZ0rbvfOWlKYH8PC
t0UkKgRU/QFIGskKpMOnjsJXSE/mCuvb5SVJV+RI9Zw/RZ8LNRcHAFZlvelD
B+aY0ng7c8thtTVZ9i7Xcfd0NKgsk7UCO4ocNGiVy4J0YBA61UBQY7tIF2vY
3hdhJUzL1SQ0oauMfOx2LR69C1qp6Knsolf3b1gKMTBIpTZSiuebEfNLApx0
PMLlZT8mLynjSB6LQwMlacPLETxbZqJaE5NA6mWDzMM0FrwU2pYcj4sDvYI1
1oBO4VN2KtKCgQFASb6RWhjcdoq0jVYIxHCfDAPpyOJbjbWLMxzs3NU2U0Ua
uot8mAD7mvi55FDyGGBceqZE/OSO5lccGdCUUR0DpZZvvD2pdaH89kDwszlI
Ke9OSkfdnERFfOsDz7IcWzeswk6MG1aKAwVU92WlrpTSqBnUMI3vwdHRzqLm
78XrQ0HsqJ3ByIHF0ns1uzSZZ67Tv7EdImG6a1NtkuQa0qG6lWB2UcCcrCzw
K/qmLdH6ajHwvde35ZqPD0XhP7PHu1lJvN25BQ8a/YJwx5IqatCLo2h86MPf
FQ7n3MVlYUEhGAuMQLLqdSw23fDdoUegbqAGANGXbDaV+Hu+xk8I0lFpIOtH
KFXCMsGOyfHRiIZCT5UVt4jERACiVKrjbMWJZJfDeji8UZEVGzSwqKDc1OmB
aI1/qKkQDZ3T2lSsh14YXQ0T+x1omTYzDSVaVHqfKp9Y0bjTQ480Lan00/Vx
fX4YsqDoNb6Et7LGTvMjTN+6kkl/+S29kzaU7672ffRt2R8gRezk26gpewvC
oMSjbhNUjddQReaVjGUt9tHVXXwIEzdf7ruCDPRib5+dk/lR6i2uWlBTLsyo
D0dwtYkvRErqQlxJXhhLojuEQSGPTNOxIGEh4q8eqc/YsjtvRTfnm7YNCCRS
GncB+ePLi13Q6e2AGyM5S+BRMlowwc0BpygKQSbAr7Zt9jiEESqPsLyzo4wa
TvgYbNOxhPZHSZ8hzyS3dTufRiNpoaETMpc5ekZjW8tGe5S43VlUEFWVhvVw
sX0ScRudkgEVvu4VGO/KJ9e6FoMIBQo3sXJkqjUMFTOYj08woJPIyXqiau2V
aYsqWIDFIkEDlNWy4gtV9/MBsoFmebg3RzEX7GogFI/ukjRdduPqhYhr3PXp
OIYqFj3tEF0HMNXpiolaxjswLbZM+I1ekp2yeUteZEnBotxWFVcVYvHa24vs
rG3h4VvAjMErOljAtlqHcftADdpYi7iMmXcM5ParzpddaIXfA1zsYWZptZU8
HTMhvlE7qW88m9257iW4G45W5Qb1ca9JMLEFOqtAMcOb4rpEVvKBOiQp8tYo
XgYi9saaT1Tx1WmpdHJEAaZyMgTc9auMA7f+dqPkvxCaK+BNAWUgJJ30Z0ls
QkHHJRx4w7bG682ZXpbGaRXf/u5p1aiT3kR1PFueWjwfnyzsgFSN0x1y2Frs
KKUABVfOpSlGeapGZpQhcEWaw3SC2yuVeoYRU8CdD9JHYWcfVZJSLySPKJ4t
G6PE2Vl0Ge/L/bFreCxfwVnMbYFYJc4L60PJTeOLrOHGMIinE2Fi4pykMCZu
tWA+GNzULhwCJoHcSI7uIE6zVXNNF3y84eajJxu8BZvc2ZUAIJnR/F4kENPq
qxXZGez79kBBrpKBuqUADwEKrkH3sSDjq0w9XUFK1pV8pd8dCe3g0vO1FIxj
6qoh9za62BxdREC1nJcEDIlBSoYjw+K1uAJrl6IwcEB5jPGkprQUoS3ioND7
cyAJN6uVYVBeStqCqnR/Rn8JhSInM77idQUEtuwFJlz2mgcFnsidsxnThJrC
i+/+VpcsINZV2fr2BNmpBN469e4p7xhEddUDDPy/buovygqndNwqodA8RafW
h+ulUlCKbiSaPZZwOMkOh8Ml4zNMNJykfi1nA+P8KOcEolzxSZhGpnfehAWe
WsEfp5IHCa6ToNgLScE3kcj+1ICvBYdv3Vdf03uHSdcJX/3B28PTG/QlqBOW
kcOgDHeU1yzA2Gi2KD4wNQrbzpFFKe18e0odxS5fVyYxOXBY4oQTWNZecA7T
mlKmhVy9001xVnZ64w1hC+OZJqrmSZOLt+Tm7rwdMYn9mUnnD5c9DjnrHxs0
+5HQyRplWEiIscePxOP6fQhcUp9Duf3XYP41oDZqBnQQnhuPhIXNXNJQ5rj/
6wy6H7iasKSceAuaejqeY8KKDq05mNueEscsNGYK9yqIGXQMv4kCe5HvpOeu
oSKv3cJmNz/E8TGjNTiKBixMilx1cRjVfA8KhZPsmB4NY1vCwFqW49bTBg1+
SSRbbw333wyx9U3DPQwIT3+lTgKIGiJNz85+P7ydwBX06UdvAGi7H+amZUA1
Sd5ccvShgE458gd3gGjcFc1YJtUneXA9HrNlstO7vD8wn3DjKhRCVSUFZWKo
dBo237qoSxMiUNK16PWwik5tI7a1PvBk2WWT/Qham64pUf3aZPLONVcThkPp
R5LP9ejZWnEkPc82c6QWsUoxMc68G+GRbgMnQUtg5Lm6nXJLU/wo7jTmCu++
fOEvwOqRHT99xhmkFrmBDAOapewJBe8A2ZQexJ5ejDSfpkb/BztcskEQNyTb
Q6W7wUo+QiRmuLBrAPLuobtDbrU4RmidE7JYYwTyMSxIkSrGbZDRToN1sAwm
9eSlg99QMlL1didpEZF2syDxkWos76tKWA6sFiwzE5Bw0O+Y5HD/lJO6Mlhb
GOWmon4stMnzWm6ZagMfOTMzxwz2032XvdLOImw/1u5e0sHz6dNnT9QElpsl
s0BMGy+ARW5JaQpqi4Yv+FHwliHDbji1M2XU1lryTaPkfiWuRSI5xuOJOmHh
+dnPZUelQiBhDxV4obLgAk965C7PO9+OJ5FBAtIFqNKnYjmnhqcHHPz8+Dc+
/jGWpI4qLgESX/+oBYXepwosvmTFp4e6zErP1SOEpXDKnZG6lLs7stmlKciH
LbAlJ0x79DwJQRPt6XUZ5J7Hj2N7kiTIQB5Umy6LBxKS9XJ7mmzBs3rybHBY
H29KSXr+KxZQYlhJbQePBCdsOPTpMTakUnWJK3ZMg0i4ToAmPH0utjGLmqmU
IId6t8eODIfPkrRLfNVhNGGDiE/AXJnCEke76Rl05tu061u6RqHTHiVIxAgS
Ch+anrMLafXg6K0y3ltISocD+RiYexR1HQwI0BfU6fkrY4F1A1/mtvAxIb3l
AFplYfs8KlJB+TiEL915un7CWMiEOIVmhZ7RHg6ejxAPHdcx87wSyzQ7evp0
OJYkCk70PIt4wYnsIUFFDVLji92YE6pz6cwkO93ZIYn4iMiBDlALXJCLEkBF
jAe3mlmUkKajb7HyXzxFvBst11heShc2sSe+3NcLLl81tC4D83jgd3SY2XXB
gro13eoCRa7OsANaySULcodLfCy018LLqx2bMHoNQCr5a9Dl3Pg0ClxE92uG
EK8QlFb7OBG7kFu6qUw76H7VWgrzO7+JA+5kbkp34pH7wrenGzSBwSHOTusf
+J4gW4hp8xCp/BGZKqtrSQh8//HNJXmHPipsA4+EjCCDJUain9xVDopyE1xk
66N9gsZU3qzR96REBxengY+1WKAJFCg1FMUjtSWXYmRpjYkYXXu0Ja0xUV8H
HFzfp04TC3JRoiqvli69pRjQlMSMc1Ln3E/aoY/uxrO1JvfgsAWXujP1lsqx
lhiFG180nk9CEJhVGbm9JR2bybc7k4YaHIQnYHO2aMXExOo9WhCP6iUt+trC
UYfNPQIfkvokSHXTWZ23W7o+ze9l9KIA8Oz4OffN3GCbhSg3PFbWstM1x+Cv
1agmt5JowwoRFHhc+RUmCXSgJInqqJybznbD/cVMFAnmVqqgF0sq7OM0EoXd
b8s/UP7HX4F0zJHkDRdyA8mlCxGuFRkFYa6C3EiEo22oSUPSEfhbqRD8jCUM
LTZVkYRHSow+E3kww3+P0lwcXbrHdzmJFaWV5PriisvX33n3AONy4uq4nQWQ
SZgAr2XTR7rhT7kLLqHSO6LEPrAc0mMQr3C5rLtfgfTFIlKyppOF4qiL5NGL
LcKtNC+XKHy9RkmNZ/EEgrMLaysHNIAtflA+fJuKJJsDQk8NXmwjX5dSYqrG
yRL41bp+Y/KuT3qyaBHAnTx2TYWm0skLa4+sNKjUjHGgLg7vfrHYutOMd+Ml
DGZxuwFX3Bhx+FFboE3tBsQaRyy8pGzH95gIrobed+J/LzEzqJEP3XUeaWUT
Rq28I6Y3dlrKklRhuXKg9LT5jspVU9fwXm45/IeVa1VlK1kNmQpJJuyUFKD9
O3KuD8Pu2KV20pSGhtwjFBYryu4XihNzUKZfaisq3JT6f1GBsbQjDVq3CJBR
dy9UAa5vlOuerZEvtSKwXGO5vR27YZ03V4KMu81ifHElN539G+xS8OU+xTAT
1f0dYVBswomdMMGkoBjcNLSVKWfjC6hD5U8gYmdZtC9HnDU6gjB6RJZ2GTao
i+PsGkOVDnCpBxem2Sgquoo6Ubn9aOU/funDy7FC3VnVmHTKCxDIhQ181sum
KhSThKGgPkIRPMc6drk1FPSBPdUBNL9kxiS+q8VDgSvbcLs3PcSgdQsYSfG+
d27WhSN5ltk/U4QVk490QuGvCRh6g9lE4srUczgINoVGYCVBbcwt0Cl6/6Mo
Mmq+oSyq12eq8pPl2nohE2mbEHDY+MUZQjEXhx8x27wCb+aqRcf+y/1CP0th
AZniejpzLv1Pej3GBQFTvvZstG9hoJC4L6RrScaac0xnass0bdhPCWqtnkga
RNNSApHky0PDUvptqPcQ/nJCEZSigRDHY0I6Vt3KOwltP+rdwCmtud02QgHD
C3ZgCeldXOKhsKSDwG2jkg6QM2BSJ50HXDcIV+jBt8OyC7DvTZ460dKJUWPx
mOh3CAvL7KRFkLgpDkUJerhSAVRWEACYhrc6FmMTYw1BWw+eBI39gu4hLEIH
U7oR8XzBi6MFjzh6rLBprHfVC9csYLzPkBaQ7mrhNExnUxCI7GvFezeAkGSR
L2zS4m8Nx7tsWs0BajkIPxJtUzGNOuWL2V3c0/Fq0cCn2+WzEglG3jCX4+3K
fDrRnThT7ic1diSsg6THjgJb07bb2MhI8vvq6nGaimyVIM4H0MWa0XsmujC1
xcWEQiitsOOor8en+ntOiiThDiGjT9auSfxSfAYPPeol1FGzBg7p3TGQxUUz
W9e8kAOqkoQITfpAwEwl9eHb9ow155qS/7HpUYKMSgISNeen706HwbrS1GZQ
k6H9AfEN8ffkdzzwtwFwsldkXmQf1LxAXZNaHJPJ5fBiB/WejOjce9V8Sb1p
QWibJLotMTjXy51KPYi1xDMRVY3FmdJbhDq5uwhSK2Ze2HHTF7dq102NgGgl
IJuMooGaTu6rBF5mnRhKjit2JPBngLLc6SQ1JpCMyScOtzxHDKydqkKKBVW+
Irji9vp80SPa0VRuTpjrppRCSYR/xkWIgJu2MWzAE4kgumHa770HMs2WrqIN
YHU1yTmGkjvxAlgXjeWTccjK+PRFpTcKnBnmrQMuGyYywYq2wuovmBAruYv5
sTnKejRyfLRjaZAm0zuw8W1NF1ig4xRNRZ/jpCW1tySjYuZTzO708WFV9r32
qhNhTFzfcWrKm5UhmSCMeh237IadEW4Q8b2ESwE/aH6JiMbHwEBtg9uR3L88
JQHiPTIJrPpbcgQDdznGK4YXsXM78BBHe98O3UXWPQO/XTySGJ1ScePg5x36
quXD2dFdb4tqq+2sA11WmdZ1EGX2ks2cXu45J9rIb634b8RYWjj5ECRxRQRz
1EU7MelzwPEnUR7+xrCjqXj+XYlvzQX5WfE2v89SE/1UW27NnkYiHgR9jh5+
8wo+ZfK411ugBOkOTEXJDu7+obU63IMhbGKuEinwBd81vlTAF0ZKqowvz4BY
X5g2hpWEvTYM5bBpAEJJvw2DyoLqoF2vHWFoLUdzlyB8ERssEpQhSivDKDLM
sjpJKkv35khbyU+hxoVl8jqZJC3ZNYm86zAUQWI+yBUribLcoDcyeuPGlzCI
MAyjE9LIiJBgW7xOQ3kX0FclkA2mT2whba2M01BUaS1xFrm3eW0qcqUTi37Q
VffZyM2ZQV8ThCZu8mL6YL1vJAUImSvXY8rjyGEi/T2b8Z+6SX6kSIIP42Xl
cr9uPuJhv2KR7to0RZ7v6B0+Jkd3lknkIg33lEna14cgok4EciWroLI61ST1
QJWygOI6zbiUCHF5iywgg2ZRfoYVqLQ56L4WfuvaWwaGc+IU8RbSkgwmRaqh
GdZ39A0LEFIbieib4wojTMS5/5t0T44SUt5Kuw4Nf9UouFuYqG9qnb2T/H63
KywjXS6d1ZUUZ1AQmeyyMqnUGL1FPHZ1ePb9V3ZB8pFHp2t5o/FtWVPdz+4L
uXRRAPCekL1Ykyt5/2pDfTa1UC0yAsEqX3eWG+SC0Xilv2CHgSBApGvjN8Tm
1KmZo6nHbHiTx7VHYGtjlkRPbikElR9LGCt44YQEemg7nC4tNUFaTCp9armo
5EBISkoGtVe+LCSlamn3dVt1+WFS4TIP27hK73W0DVa2l9+nkV/VIqRKUMgh
S4k97lovcTK95IfNvMxI6SQF93CkC4pSzkIqqnLJBPnxgThEprhq4hih3n0O
66PZlY2KQFFG9xtyZkeLQyeTB6C1srOiBO//JFvzL9iCCcI30cvO3f0QXUUN
7uUWzEPxjXWI/qohSQteFwiEqhyTH8ulzlTwLClu9WW4pEzxx5bpUpX//WIu
n5UfVv76lYm01R8S9vWwQNR/aji7F/0ob1CUe8tv+bpV5HeA6UeZej8o/fmz
hdx2Cs+CLiuavA9+xX2WvcFbB/wraMVJvPvZ5P8B+TNfNz1/AAA=

-->

</rfc>
