| Internet-Draft | SCION Happy Eyeballs | November 2026 |
| John, et al. | Expires 21 May 2027 | [Page] |
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.¶
This note is to be removed before publishing as an RFC.¶
Status information for this document may be found at https://datatracker.ietf.org/doc/draft-john-scion-happy-eyeballs/.¶
Source for this draft and an issue tracker can be found at https://github.com/netsys-lab/draft-scion-happy-eyeballs.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 21 May 2027.¶
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document.¶
SCION (Scalability, Control, and Isolation On Next-generation networks) [I-D.dekater-scion-controlplane] [I-D.dekater-scion-dataplane] is a path-aware inter-domain network architecture [RFC9217]. A source endpoint looks up paths to the destination Autonomous System (AS) and puts the chosen path into each packet. [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 [RFC9460]. Happy Eyeballs Version 3 (HEv3) [I-D.ietf-happy-happyeyeballs-v3] does not consider SCION addresses.¶
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.¶
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 (Section 6). 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.¶
This document covers connection establishment only (Section 6.6). The rules of [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.¶
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
This document uses the terms of [I-D.ietf-happy-happyeyeballs-v3] and the term "SCION address" of [I-D.john-scion-svcb]. In this document, "AS" means a SCION AS, and "path" means a SCION path, as in [I-D.dekater-scion-controlplane]. This document also uses the following terms:¶
The pair of the Isolation Domain (ISD) number and the AS number that together identify an AS.¶
A client has SCION connectivity if it can look up paths (Section 4 of [I-D.dekater-scion-controlplane]) and send and receive SCION packets on a chosen path.¶
An endpoint whose address is a SCION address.¶
A path to the AS of a SCION endpoint on which the client can attempt that endpoint (Section 3.3).¶
The eligible paths that the client selects when it attempts a SCION endpoint (Section 6.1). The client makes at most one connection attempt on each.¶
The largest number of candidate paths that the client selects for one SCION endpoint.¶
The time between the starts of two attempts on candidate paths of one SCION endpoint.¶
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 [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 [I-D.dekater-scion-dataplane]).¶
A link between two ASes (Section 1.3 of [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.¶
The ASes of two consecutive hops of a path. More than one inter-AS link can connect the same pair of adjacent ASes.¶
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.¶
The number of inter-AS links that a path traverses.¶
The earliest expiration time of the Hop Fields of the path (Section 2.2.2.5 of [I-D.dekater-scion-controlplane]). A path has expired when this time has passed.¶
A client with SCION connectivity SHOULD send an SVCB or HTTPS query (Section 4.1 of [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.¶
Each distinct usable SCION address (Section 3.3.1 of [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 [RFC9460]) whose transport the client can use over SCION (Section 3.3 of [I-D.john-scion-svcb]). If there are none, the address yields no endpoint.¶
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 [I-D.john-scion-svcb]) applies.¶
A path is eligible if it has not expired and its maximum transmission unit (MTU, Section 3.4 of [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 [RFC9000]).¶
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 [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 [I-D.dekater-scion-dataplane]). This path has no expiry, and its MTU is that of the client's AS.¶
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.¶
A SCION endpoint is grouped by its application protocols (Section 3.2) and security requirements (Section 5.1 of [I-D.ietf-happy-happyeyeballs-v3]) and by the service priority of its record (Section 5.2 of [I-D.ietf-happy-happyeyeballs-v3]), as an IP endpoint is.¶
Within a group, the SCION endpoints form a third address family. Destination Address Selection [RFC6724] (Section 5.3 of [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 [I-D.john-scion-svcb] recommends, unless local policy sets another order.¶
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. Section 8.1 reports what this order costs. Local policy or the application can put SCION last instead.¶
The client then interleaves the families (Section 5.3 of [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.¶
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.¶
A client that orders SCION first (Section 4) treats a path lookup as HEv3 treats a DNS query for the preferred address family. It applies the conditions of Section 4.2 of [I-D.ietf-happy-happyeyeballs-v3] for starting connection attempts as follows:¶
SCION is the preferred address family while the client has a SCION endpoint that it has not discarded (Section 3.3).¶
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.¶
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 (Section 3.3). A client that wants to wait longer for path lookups can configure a longer Resolution Delay (Section 10 of [I-D.ietf-happy-happyeyeballs-v3]), which also lengthens the wait for DNS answers.¶
A client that orders SCION last does not wait for path lookups.¶
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 (Section 6.1) and attempts the endpoint on them (Section 6.2).¶
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 MUST NOT use a Path Attempt Count above 3 (Section 9.3). If no path is eligible, the client skips the endpoint and attempts the next one at once.¶
Without a more specific policy, a client SHOULD 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 SHOULD select the eligible path that has the least overlap with the paths already selected (Appendix A). 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.¶
Router clocks need to agree with those of core ASes only to within minutes (Section 4.2.2.3 of [I-D.dekater-scion-dataplane] and Section 7.3 of [I-D.dekater-scion-controlplane]), so a router can treat a path as expired before the client does. A client therefore SHOULD NOT select a path that expires within 5 minutes unless no other path is left.¶
The candidate paths of a SCION endpoint do not change once the client has started to attempt it. A client MUST NOT 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.¶
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 [I-D.ietf-happy-happyeyeballs-v3].¶
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 [I-D.ietf-happy-happyeyeballs-v3]).¶
The default Path Attempt Delay is 50 milliseconds (Appendix A). A client MAY use another value, for example one that it derives from historical round-trip time data (Section 6 of [I-D.ietf-happy-happyeyeballs-v3]). A client MUST NOT use a Path Attempt Delay below 10 milliseconds, the lower bound of Section 6 of [I-D.ietf-happy-happyeyeballs-v3] for the time between two attempts, and SHOULD NOT 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.¶
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.¶
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 MUST 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 [RFC9000]).¶
The server chooses the paths of its replies, which need not be the reverse (Section 2.4.4 of [I-D.dekater-scion-dataplane]) of the path of the attempt. The client MUST accept replies from the SCION address of the endpoint on any path. It MUST present the same server address to the transport regardless of the path a reply arrives on (Section 9 of [RFC9000]). A reply does not show that the reverse of its path carries the client's packets. The client therefore MUST continue to send on the path of the attempt until the attempt succeeds, fails, or is cancelled.¶
A client SHOULD NOT end an attempt because of a SCION Control Message Protocol (SCMP) error message (Section 6 of [I-D.dekater-scion-controlplane]). Section 8.3.4 of [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.¶
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 Section 3.3.¶
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 [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.¶
In addition to the values of Section 10 of [I-D.ietf-happy-happyeyeballs-v3], this document defines the following values and their defaults. As that section allows, a client MAY use other values, within the limits stated in the sections referenced.¶
Path Attempt Count (Section 6.1): 2.¶
Path Attempt Delay (Section 6.2): 50 milliseconds.¶
Limit on the time of a path lookup (Section 3.3): 2 seconds.¶
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.¶
The experiment is to answer the following questions from clients in use on a production SCION network:¶
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.¶
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 (Section 9.3). If clients often start a second attempt although the first one succeeds, the default Path Attempt Delay is too short.¶
What does ordering SCION first cost the connections that are established over IP, and how often do path lookups complete within the Resolution Delay?¶
How much do the candidate paths overlap, and do they fail together?¶
The authors will report results, and any change to the defaults, in a revision of this document.¶
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 [SCIERA] to the 78 ASes reachable from it, in November 2026, and from the prototype of Appendix B in a testbed of 12 SCION ASes.¶
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.¶
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.¶
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 Section 6.1, it traversed 72% of them.¶
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.¶
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.¶
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.¶
The security considerations of [I-D.ietf-happy-happyeyeballs-v3] and [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 [I-D.john-scion-svcb] matters for it in particular.¶
This document relies on SCION path authorization (Section 7.1 of [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.¶
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 [RFC9001]). Each of these ASes can therefore read the TLS ClientHello, including the server name unless Encrypted Client Hello [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.¶
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 [RFC9000]) or forge SCMP error messages (Section 6.4). None of these actions can make an attempt succeed if success requires a completed QUIC or TLS handshake (Section 6.1 of [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.¶
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 [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.¶
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 [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.¶
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 (Appendix A). 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.¶
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.¶
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 (Section 5). Applications that require SCION exclude IP endpoints (Section 6.5).¶
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 [I-D.john-scion-svcb]). Because a client looks up paths when it creates a SCION endpoint (Section 3.3), it also discloses the destination for endpoints that it does not attempt and for services that it then reaches over IP.¶
Each attempt exposes the client's SCION address and the ClientHello to the ASes on its path (Section 9.1). 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.¶
Historical data about paths that the client keeps is partitioned as Sections 5.3 and 9 of [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.¶
This document has no IANA actions.¶
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 [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.¶
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 (Section 9.2). An inter-AS link is the narrowest scope. Section 2.3.3 of [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 (Section 8.1). 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 (Section 8.1), so whether that alternative is worth its cost is the first question of the experiment (Section 8).¶
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 [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 (Section 8.1). 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 (Section 8.1). 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 [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.¶
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 (Section 8.1). 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.¶
(RFC Editor: please remove this section before publication.)¶
This section records the status of known implementations as of November 2026, following [RFC7942].¶
A research prototype in Go on release v0.15.1 of the SCION reference implementation [SCION-V0.15.1]. It implements this document for QUIC over SCION. Contact: Tony John. Last updated: November 2026.¶