<?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.39 (Ruby 3.4.9) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-masque-connect-ethernet-11" category="std" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.34.0 -->
  <front>
    <title abbrev="CONNECT-ETHERNET">Proxying Ethernet Frames in HTTP</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-masque-connect-ethernet-11"/>
    <author initials="A. R." surname="Sedeño" fullname="Alejandro R Sedeño">
      <organization>Google LLC</organization>
      <address>
        <email>asedeno@google.com</email>
      </address>
    </author>
    <date year="2026" month="July" day="22"/>
    <area>Transport</area>
    <workgroup>Multiplexed Application Substrate over QUIC Encryption</workgroup>
    <keyword>quic</keyword>
    <keyword>http</keyword>
    <keyword>datagram</keyword>
    <keyword>VPN</keyword>
    <keyword>proxy</keyword>
    <keyword>tunnels</keyword>
    <keyword>masque</keyword>
    <keyword>http-ng</keyword>
    <keyword>layer-2</keyword>
    <keyword>ethernet</keyword>
    <abstract>
      <?line 55?>

<t>This document describes how to proxy Ethernet frames in HTTP. This protocol
is similar to IP proxying in HTTP, but for Layer 2 instead of Layer 3. More
specifically, this document defines a protocol that allows an HTTP client to
create a tunnel to exchange Layer 2 Ethernet frames through an HTTP server
with an attached physical or virtual Ethernet segment.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://ietf-wg-masque.github.io/draft-ietf-masque-connect-ethernet/draft-ietf-masque-connect-ethernet.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-ietf-masque-connect-ethernet/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        MASQUE Working Group mailing list (<eref target="mailto:masque@ietf.org"/>),
        which is archived at <eref target="https://mailarchive.ietf.org/arch/browse/masque/"/>.
        Subscribe at <eref target="https://www.ietf.org/mailman/listinfo/masque/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/ietf-wg-masque/draft-ietf-masque-connect-ethernet"/>.</t>
    </note>
  </front>
  <middle>
    <?line 64?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>HTTP provides the CONNECT method (see <xref section="9.3.6" sectionFormat="of" target="HTTP"/>) for
creating a TCP <xref target="TCP"/> tunnel to a destination, a similar mechanism for
UDP <xref target="CONNECT-UDP"/>, and an additional mechanism for IP
<xref target="CONNECT-IP"/>. However, these mechanisms cannot carry Layer 2 frames
without further encapsulation inside of IP, for instance with EtherIP
<xref target="ETHERIP"/> or L2TP <xref target="L2TP"/> <xref target="L2TPv3"/>, which
consume additional header bytes, reducing the available MTU.</t>
      <t>This document describes a protocol for exchanging IEEE 802.3 <xref target="IEEE802.3"/>
Ethernet frames with an HTTP server. Either participant in the HTTP connection
can then relay Ethernet frames to and from a local or virtual interface. This
can be used by a node to support remote bridging of two Ethernet broadcast
domains to establish a Layer 2 VPN. This can simplify connectivity to
network-connected appliances that are configured to only interact with peers
connected to the same Ethernet broadcast domain.</t>
      <t>This protocol supports all existing versions of HTTP by using HTTP Datagrams
<xref target="HTTP-DGRAM"/>. When using HTTP/2 <xref target="H2"/> or HTTP/3 <xref target="H3"/>, it uses
HTTP Extended CONNECT as described in <xref target="EXT-CONNECT2"/> and
<xref target="EXT-CONNECT3"/>. When using HTTP/1.x <xref target="H1"/>, it uses HTTP Upgrade as
defined in <xref section="7.8" sectionFormat="of" target="HTTP"/>.</t>
      <t>This protocol necessarily incurs additional encapsulation overhead. When
possible, users should use higher-level proxying protocols, such as
<xref target="CONNECT-IP"/> or <xref target="CONNECT-UDP"/>.</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>In this document, we use the term "Ethernet proxy" to refer to the HTTP server
that responds to the Ethernet proxying request. The term "client" is used in the
HTTP sense; the client constructs the Ethernet proxying request. If there are
HTTP intermediaries (as defined in <xref section="3.7" sectionFormat="of" target="HTTP"/>) between the client
and the Ethernet proxy, those are referred to as "intermediaries" in this
document. The term "Ethernet proxying endpoints" refers to both the client and
the Ethernet proxy.</t>
      <t>This document uses terminology from <xref target="QUIC"/>. Where this document
defines protocol types, the definition format uses the notation from <xref section="1.3" sectionFormat="of" target="QUIC"/>. This specification uses the variable-length integer encoding
from <xref section="16" sectionFormat="of" target="QUIC"/>. Variable-length integer values do not
need to be encoded in the minimum number of bytes necessary.</t>
      <t>Note that, when the HTTP version in use does not support multiplexing streams
(such as HTTP/1.1), any reference to "stream" in this document represents the
entire connection.</t>
    </section>
    <section anchor="client-config">
      <name>Configuration of Clients</name>
      <t>Clients are configured to use Ethernet proxying over HTTP via a URI Template
<xref target="TEMPLATE"/>. The URI Templates used by this protocol do not require
any variables; implementations or extensions <bcp14>MAY</bcp14> specify their own. URI
Templates specified for this protocol <bcp14>MAY</bcp14> use the well-known location
<xref target="WELL-KNOWN"/> registered by this document (see <xref target="iana-suffix"/>).</t>
      <t>Examples are shown below:</t>
      <artwork><![CDATA[
https://example.org/.well-known/masque/ethernet/
https://proxy.example.org:4443/masque/ethernet/
https://masque.example.org/?user=bob
]]></artwork>
      <t>An implementation that supports connecting to multiple Ethernet segments might
add a "vlan-identifier" variable to specify the segment to which to connect. The
optionality of variables needs to be considered when defining the template so
that variables are either self-identifying or possible to exclude in the syntax.
How valid values for such variables are communicated to the client is not a part
of this protocol.</t>
      <t>Hypothetical examples are shown below:</t>
      <artwork><![CDATA[
https://proxy.example.org:4443/masque/ethernet?vlan={vlan-identifier}
https://etherproxy.example.org/{vlan-identifier}
]]></artwork>
      <t>The following requirements apply to the URI Template:</t>
      <ul spacing="normal">
        <li>
          <t>The URI Template <bcp14>MUST</bcp14> be a template of type level 3 or lower (see <xref section="1.2" sectionFormat="of" target="TEMPLATE"/>).</t>
        </li>
        <li>
          <t>The URI Template <bcp14>MUST</bcp14> be in absolute form (see <xref section="4.3" sectionFormat="of" target="URI"/>)
and <bcp14>MUST</bcp14> include non-empty scheme, authority, and path components.</t>
        </li>
        <li>
          <t>The path component of the URI Template <bcp14>MUST</bcp14> start with a slash "/".</t>
        </li>
        <li>
          <t>All template variables <bcp14>MUST</bcp14> be within the path or query components of the URI.</t>
        </li>
        <li>
          <t>The URI Template <bcp14>MUST NOT</bcp14> contain any non-ASCII Unicode characters and <bcp14>MUST</bcp14>
only contain ASCII characters in the range 0x21-0x7E inclusive (note that
percent-encoding is allowed; see <xref section="2.1" sectionFormat="of" target="URI"/>).</t>
        </li>
        <li>
          <t>The URI Template <bcp14>MUST NOT</bcp14> use Reserved Expansion ("+" operator), Fragment
Expansion ("#" operator), Label Expansion with Dot-Prefix, Path Segment
Expansion with Slash-Prefix, nor Path-Style Parameter Expansion with
Semicolon-Prefix.</t>
        </li>
      </ul>
      <t>Clients <bcp14>SHOULD</bcp14> validate the requirements above; however, clients <bcp14>MAY</bcp14> use a
general-purpose URI Template implementation that lacks this specific
validation. If a client detects that any of the requirements above are not met
by a URI Template, the client <bcp14>MUST</bcp14> reject its configuration and abort the
request without sending it to the Ethernet proxy.</t>
    </section>
    <section anchor="tunnelling-ethernet-frames-over-http">
      <name>Tunnelling Ethernet frames over HTTP</name>
      <t>To allow negotiation of a tunnel for Ethernet frames over HTTP, this document
defines the "connect-ethernet" HTTP upgrade token. The resulting Ethernet
tunnels use the Capsule Protocol (see <xref section="3.2" sectionFormat="of" target="HTTP-DGRAM"/>) with HTTP
Datagrams in the format defined in <xref target="payload-format"/>.</t>
      <t>To initiate an Ethernet tunnel associated with a single HTTP stream, a client
issues a request containing the "connect-ethernet" upgrade token.</t>
      <t>By virtue of the definition of the Capsule Protocol (see <xref section="3.2" sectionFormat="of" target="HTTP-DGRAM"/>), Ethernet proxying requests do not carry any message content.
Similarly, successful Ethernet proxying responses also do not carry any message
content.</t>
      <t>Ethernet proxying over HTTP <bcp14>MUST</bcp14> be operated over TLS or QUIC encryption, or another
equivalent encryption protocol, to provide confidentiality, integrity, and
authentication.</t>
      <section anchor="ethernet-proxy-handling">
        <name>Ethernet Proxy Handling</name>
        <t>Upon receiving an Ethernet proxying request:</t>
        <ul spacing="normal">
          <li>
            <t>If the recipient is configured to use another HTTP proxy, it will act as an
intermediary by forwarding the request to another HTTP server. Note that
such intermediaries may need to re-encode the request if they forward it
using a version of HTTP that is different from the one used to receive it,
as the request encoding differs by version (see below).</t>
          </li>
          <li>
            <t>Otherwise, the recipient will act as an Ethernet proxy. The Ethernet proxy
can choose to reject the Ethernet proxying request or establish an Ethernet
tunnel.</t>
          </li>
        </ul>
        <t>The lifetime of the Ethernet tunnel is tied to the Ethernet proxying request
stream.</t>
        <t>A successful response (as defined in Sections <xref format="counter" target="resp1"/> and <xref format="counter" target="resp23"/>)
indicates that the Ethernet proxy has established an Ethernet tunnel and is
willing to proxy Ethernet frames. Any response other than a successful response
indicates that the request has failed; thus, the client <bcp14>MUST</bcp14> abort the request.</t>
      </section>
      <section anchor="req1">
        <name>HTTP/1.1 Request</name>
        <t>When using HTTP/1.1 <xref target="H1"/>, an Ethernet proxying request will meet the following
requirements:</t>
        <ul spacing="normal">
          <li>
            <t>The method <bcp14>SHALL</bcp14> be "GET".</t>
          </li>
          <li>
            <t>The request <bcp14>SHALL</bcp14> include a single Host header field containing the host
and optional port of the Ethernet proxy.</t>
          </li>
          <li>
            <t>The request <bcp14>SHALL</bcp14> include a Connection header field with value "Upgrade"
(note that this requirement is case-insensitive as per <xref section="7.6.1" sectionFormat="of" target="HTTP"/>).</t>
          </li>
          <li>
            <t>The request <bcp14>SHALL</bcp14> include an Upgrade header field with value "connect-ethernet".</t>
          </li>
        </ul>
        <t>An Ethernet proxying request that does not conform to these restrictions is
malformed. The recipient of such a malformed request <bcp14>MUST</bcp14> respond with an error
and <bcp14>SHOULD</bcp14> use the 400 (Bad Request) status code.</t>
        <t>For example, if the client is configured with the URI Template
"https://example.org/.well-known/masque/ethernet/" and wishes to open an
Ethernet tunnel, it could send the following request.</t>
        <figure anchor="fig-req-h1">
          <name>Example HTTP/1.1 Request</name>
          <sourcecode type="http-message"><![CDATA[
GET https://example.org/.well-known/masque/ethernet/ HTTP/1.1
Host: example.org
Connection: Upgrade
Upgrade: connect-ethernet
Capsule-Protocol: ?1
]]></sourcecode>
        </figure>
      </section>
      <section anchor="resp1">
        <name>HTTP/1.1 Response</name>
        <t>The server indicates success by replying with a response that conforms to the
following requirements:</t>
        <ul spacing="normal">
          <li>
            <t>The HTTP status code on the response <bcp14>SHALL</bcp14> be 101 (Switching Protocols).</t>
          </li>
          <li>
            <t>The response <bcp14>SHALL</bcp14> include a Connection header field with value "Upgrade"
(note that this requirement is case-insensitive as per <xref section="7.6.1" sectionFormat="of" target="HTTP"/>).</t>
          </li>
          <li>
            <t>The response <bcp14>SHALL</bcp14> include a single Upgrade header field with value
"connect-ethernet".</t>
          </li>
          <li>
            <t>The response <bcp14>SHALL</bcp14> meet the requirements of HTTP responses that start the
Capsule Protocol; see <xref section="3.2" sectionFormat="of" target="HTTP-DGRAM"/>.</t>
          </li>
        </ul>
        <t>If any of these requirements are not met, the client <bcp14>MUST</bcp14> treat this proxying
attempt as failed and close the connection.</t>
        <t>For example, the server could respond with:</t>
        <figure anchor="fig-resp-h1">
          <name>Example HTTP/1.1 Response</name>
          <sourcecode type="http-message"><![CDATA[
HTTP/1.1 101 Switching Protocols
Connection: Upgrade
Upgrade: connect-ethernet
Capsule-Protocol: ?1
]]></sourcecode>
        </figure>
      </section>
      <section anchor="req23">
        <name>HTTP/2 and HTTP/3 Requests</name>
        <t>When using HTTP/2 <xref target="H2"/> or HTTP/3 <xref target="H3"/>, Ethernet proxying requests use HTTP
Extended CONNECT. This requires that servers send an HTTP Setting as specified
in <xref target="EXT-CONNECT2"/> and <xref target="EXT-CONNECT3"/> and that requests use HTTP
pseudo-header fields with the following requirements:</t>
        <ul spacing="normal">
          <li>
            <t>The :method pseudo-header field <bcp14>SHALL</bcp14> be "CONNECT".</t>
          </li>
          <li>
            <t>The :protocol pseudo-header field <bcp14>SHALL</bcp14> be "connect-ethernet".</t>
          </li>
          <li>
            <t>The :authority pseudo-header field <bcp14>SHALL</bcp14> contain the authority of the IP
proxy.</t>
          </li>
          <li>
            <t>The :path and :scheme pseudo-header fields <bcp14>SHALL NOT</bcp14> be empty. Their values
<bcp14>SHALL</bcp14> contain the scheme and path from the configured URI Template; see
<xref target="client-config"/>.</t>
          </li>
        </ul>
        <t>An Ethernet proxying request that does not conform to these restrictions is
malformed; see <xref section="8.1.1" sectionFormat="of" target="H2"/> and <xref section="4.1.2" sectionFormat="of" target="H3"/>.</t>
        <t>For example, if the client is configured with the URI Template
"https://example.org/.well-known/masque/ethernet/" and wishes to open an
Ethernet tunnel, it could send the following request.</t>
        <figure anchor="fig-req-h2">
          <name>Example HTTP/2 or HTTP/3 Request</name>
          <sourcecode type="http-message"><![CDATA[
HEADERS
:method = CONNECT
:protocol = connect-ethernet
:scheme = https
:path = /.well-known/masque/ethernet/
:authority = example.org
capsule-protocol = ?1
]]></sourcecode>
        </figure>
      </section>
      <section anchor="resp23">
        <name>HTTP/2 and HTTP/3 Responses</name>
        <t>The server indicates success by replying with a response that conforms to the
following requirements:</t>
        <ul spacing="normal">
          <li>
            <t>The HTTP status code on the response <bcp14>SHALL</bcp14> be in the 2xx (Successful) range.</t>
          </li>
          <li>
            <t>The response <bcp14>SHALL</bcp14> meet the requirements of HTTP responses that start the
Capsule Protocol; see <xref section="3.2" sectionFormat="of" target="HTTP-DGRAM"/>.</t>
          </li>
        </ul>
        <t>If any of these requirements are not met, the client <bcp14>MUST</bcp14> treat this proxying
attempt as failed and abort the request. As an example, any status code in the
3xx range will be treated as a failure and cause the client to abort the
request.</t>
        <t>For example, the server could respond with:</t>
        <figure anchor="fig-resp-h2">
          <name>Example HTTP/2 or HTTP/3 Response</name>
          <sourcecode type="http-message"><![CDATA[
HEADERS
:status = 200
capsule-protocol = ?1
]]></sourcecode>
        </figure>
      </section>
    </section>
    <section anchor="context-identifiers">
      <name>Context Identifiers</name>
      <t>The mechanism for proxying Ethernet frames in HTTP defined in this document
allows future extensions to exchange HTTP Datagrams that have different
semantics, similar to the extension mechanisms specified in <xref section="5" sectionFormat="of" target="CONNECT-IP"/>. Some of these extensions could augment Ethernet payloads with
additional data or compress Ethernet frame header fields. To provide this
extension point, all HTTP Datagrams associated with Ethernet proxying request
streams start with a Context ID field; see <xref target="payload-format"/>.</t>
      <t>Context IDs are 62-bit integers (0-2<sup>62</sup>-1). Context IDs are encoded as
variable-length integers; see <xref section="16" sectionFormat="of" target="QUIC"/>. The Context ID value of 0
is reserved for Ethernet payloads, while non-zero values are dynamically
allocated. Non-zero even-numbered Context-IDs are client allocated, and
odd-numbered Context IDs are proxy-allocated. The Context ID namespace is tied
to a given HTTP request; it is possible for a Context ID with the same numeric
value to be simultaneously allocated in distinct requests, potentially with
different semantics. Context IDs <bcp14>MUST NOT</bcp14> be re-allocated within a given HTTP
request but <bcp14>MAY</bcp14> be allocated in any order. The Context ID allocation
restrictions to the use of even-numbered and odd-numbered Context IDs exist in
order to avoid the need for synchronization between endpoints. However, once a
Context ID has been allocated, those restrictions do not apply to the use of the
Context ID; it can be used by either the client or the Ethernet proxy,
independent of which endpoint initially allocated it.</t>
      <t>Registration is the action by which an endpoint informs its peer of the
semantics and format of a given Context ID. This document does not define how
registration occurs. Future extensions <bcp14>MAY</bcp14> use HTTP header fields or capsules
to register Context IDs. Depending on the method being used, it is possible for
datagrams to be received with Context IDs that have not yet been registered.
For instance, this can be due to reordering of the packet containing the
datagram and the packet containing the registration message during transmission.</t>
    </section>
    <section anchor="payload-format">
      <name>HTTP Datagram Payload Format</name>
      <t>When associated with Ethernet proxying request streams, the HTTP Datagram
Payload field of HTTP Datagrams (see <xref target="HTTP-DGRAM"/>) has the format defined in
<xref target="dgram-format"/>. Note that when HTTP Datagrams are encoded using QUIC DATAGRAM
frames, the Context ID field defined below directly follows the Quarter Stream
ID field which is at the start of the QUIC DATAGRAM frame payload.</t>
      <figure anchor="dgram-format">
        <name>Ethernet Proxying HTTP Datagram Format</name>
        <artwork><![CDATA[
Ethernet Proxying HTTP Datagram Payload {
  Context ID (i),
  Payload (..),
}
]]></artwork>
      </figure>
      <t>The Ethernet Proxying HTTP Datagram Payload contains the following fields:</t>
      <dl spacing="compact">
        <dt>Context ID:</dt>
        <dd>
          <t>A variable-length integer that contains the value of the Context ID. If an
HTTP/3 datagram which carries an unknown Context ID is received, the receiver
<bcp14>SHALL</bcp14> either drop that datagram silently or buffer it temporarily (on the order
of a round trip) while awaiting the registration of the corresponding Context
ID.</t>
        </dd>
        <dt>Payload:</dt>
        <dd>
          <t>The payload of the datagram, whose semantics depend on value of the previous
field. Note that this field can be empty.</t>
        </dd>
      </dl>
      <t>Ethernet frames are encoded using HTTP Datagrams with the Context ID set to
zero. When the Context ID is set to zero, the Payload field contains a full
Layer 2 Ethernet Frame (from the MAC destination field until the last byte of
the Frame check sequence field), as defined by IEEE 802.3 <xref target="IEEE802.3"/>. A
complete frame could include an IEEE 802.1Q <xref target="IEEE802.1Q"/> tag (see
<xref target="vlan-recommendations"/>).</t>
      <t>The Frame check sequence field is included in the proxied Ethernet frame rather
than being omitted and recomputed by the Ethernet proxying endpoints for
simplicity and to reduce compute requirements, though a future extension could
introduce a different encoding.</t>
      <t>If an Ethernet proxy receives an HTTP Datagram before it has received the
corresponding request, it <bcp14>SHALL</bcp14> either drop that HTTP Datagram silently or
buffer it temporarily (on the order of a round trip) while awaiting the
corresponding request.</t>
      <t>Note that buffering datagrams (either because the request was not yet received
or because the Context ID is not yet known) consumes resources. Receivers that
buffer datagrams <bcp14>SHOULD</bcp14> apply buffering limits in order to reduce the risk of
resource exhaustion occurring. For example, receivers can limit the total number
of buffered datagrams or the cumulative size of buffered datagrams on a
per-stream, per-context, or per-connection basis.</t>
    </section>
    <section anchor="ethernet-frame-handling">
      <name>Ethernet Frame Handling</name>
      <t>This document defines a tunnelling mechanism that is conceptually an Ethernet
link. An Ethernet proxying connection established between two Ethernet proxying
endpoints emulates a single Ethernet link between those two endpoints. This
provides an Ethernet MAC service that will deliver each Ethernet frame that is
received at the ingress to the egress at the other end of the tunnel.</t>
      <t>Endpoints implementing this mechanism might need to handle some of the
responsibilities of an Ethernet switch or bridge if they do not delegate them to
another component of the endpoint such as a kernel. Those responsibilities are
beyond the scope of this document, and include, but are not limited to, the
handling of broadcast packets and multicast groups, topological loop prevention
using a spanning tree protocol (STP, RSTP, etc.) <xref target="IEEE802.1Q"/>, or the local
termination of PAUSE frames.</t>
      <t>Implementations <bcp14>SHOULD</bcp14> be aware of physical topology and work to prevent
loops. Strategies could include implementing STP or RSTP, or delegating that
responsibility to a dedicated ethernet-handling device.</t>
      <t>If an Ethernet proxying endpoint fails to deliver a frame to an underlying
Ethernet segment, the endpoint <bcp14>MUST</bcp14> drop the frame.</t>
    </section>
    <section anchor="examples">
      <name>Examples</name>
      <t>Ethernet proxying in HTTP enables the bridging of Ethernet broadcast domains.
These examples are provided to help illustrate some of the ways in which Ethernet
proxying can be used.</t>
      <section anchor="example-remote">
        <name>Remote Access L2VPN</name>
        <t>The following example shows a point to point VPN setup where a client
appears to be connected to a remote Layer 2 network.</t>
        <figure anchor="diagram-tunnel">
          <name>L2VPN Tunnel Setup</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="128" width="520" viewBox="0 0 520 128" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,96" fill="none" stroke="black"/>
                <path d="M 80,32 L 80,96" fill="none" stroke="black"/>
                <path d="M 248,32 L 248,96" fill="none" stroke="black"/>
                <path d="M 320,32 L 320,96" fill="none" stroke="black"/>
                <path d="M 424,32 L 424,96" fill="none" stroke="black"/>
                <path d="M 8,32 L 80,32" fill="none" stroke="black"/>
                <path d="M 248,32 L 320,32" fill="none" stroke="black"/>
                <path d="M 424,32 L 456,32" fill="none" stroke="black"/>
                <path d="M 80,48 L 248,48" fill="none" stroke="black"/>
                <path d="M 88,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 224,64 L 240,64" fill="none" stroke="black"/>
                <path d="M 320,64 L 456,64" fill="none" stroke="black"/>
                <path d="M 80,80 L 248,80" fill="none" stroke="black"/>
                <path d="M 8,96 L 80,96" fill="none" stroke="black"/>
                <path d="M 248,96 L 320,96" fill="none" stroke="black"/>
                <path d="M 424,96 L 456,96" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="464,96 452,90.4 452,101.6" fill="black" transform="rotate(0,456,96)"/>
                <polygon class="arrowhead" points="464,64 452,58.4 452,69.6" fill="black" transform="rotate(0,456,64)"/>
                <polygon class="arrowhead" points="464,32 452,26.4 452,37.6" fill="black" transform="rotate(0,456,32)"/>
                <polygon class="arrowhead" points="96,64 84,58.4 84,69.6" fill="black" transform="rotate(180,88,64)"/>
                <g class="text">
                  <text x="484" y="36">HOST</text>
                  <text x="512" y="36">1</text>
                  <text x="284" y="52">L2</text>
                  <text x="360" y="52">Layer</text>
                  <text x="392" y="52">2</text>
                  <text x="44" y="68">Client</text>
                  <text x="128" y="68">Layer</text>
                  <text x="160" y="68">2</text>
                  <text x="196" y="68">Tunnel</text>
                  <text x="288" y="68">Proxy</text>
                  <text x="484" y="68">HOST</text>
                  <text x="512" y="68">2</text>
                  <text x="376" y="84">Broadcast</text>
                  <text x="364" y="100">Domain</text>
                  <text x="484" y="100">HOST</text>
                  <text x="512" y="100">3</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+--------+                    +--------+            +---> HOST 1
|        +--------------------+   L2   |  Layer 2   |
| Client |<--Layer 2 Tunnel---|  Proxy +------------+---> HOST 2
|        +--------------------+        |  Broadcast |
+--------+                    +--------+  Domain    +---> HOST 3

]]></artwork>
          </artset>
        </figure>
        <t>In this case, the client connects to the Ethernet proxy and immediately can
start sending Ethernet frames to the attached broadcast domain.</t>
        <figure anchor="fig-full-tunnel">
          <name>VPN Full-Tunnel Example</name>
          <artwork><![CDATA[
[[ From Client ]]             [[ From Ethernet Proxy ]]

SETTINGS
  H3_DATAGRAM = 1

                              SETTINGS
                                ENABLE_CONNECT_PROTOCOL = 1
                                H3_DATAGRAM = 1

STREAM(44): HEADERS
:method = CONNECT
:protocol = connect-ethernet
:scheme = https
:path = /.well-known/masque/ethernet/
:authority = proxy.example.com
capsule-protocol = ?1

                              STREAM(44): HEADERS
                              :status = 200
                              capsule-protocol = ?1

DATAGRAM
Quarter Stream ID = 11
Context ID = 0
Payload = Encapsulated Ethernet Frame

                              DATAGRAM
                              Quarter Stream ID = 11
                              Context ID = 0
                              Payload = Encapsulated Ethernet Frame
]]></artwork>
        </figure>
      </section>
      <section anchor="site-to-site-l2vpn">
        <name>Site-to-Site L2VPN</name>
        <t>The following example shows a site-to-site VPN setup where a client
joins a locally attached broadcast domain to a remote broadcast domain
through the Proxy.</t>
        <figure anchor="diagram-s2s">
          <name>Site-to-site L2VPN Example</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="256" width="432" viewBox="0 0 432 256" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 80,32 L 80,96" fill="none" stroke="black"/>
                <path d="M 96,96 L 96,192" fill="none" stroke="black"/>
                <path d="M 152,32 L 152,96" fill="none" stroke="black"/>
                <path d="M 280,32 L 280,96" fill="none" stroke="black"/>
                <path d="M 336,96 L 336,192" fill="none" stroke="black"/>
                <path d="M 352,32 L 352,96" fill="none" stroke="black"/>
                <path d="M 80,32 L 152,32" fill="none" stroke="black"/>
                <path d="M 280,32 L 352,32" fill="none" stroke="black"/>
                <path d="M 152,48 L 280,48" fill="none" stroke="black"/>
                <path d="M 160,64 L 176,64" fill="none" stroke="black"/>
                <path d="M 256,64 L 272,64" fill="none" stroke="black"/>
                <path d="M 152,80 L 280,80" fill="none" stroke="black"/>
                <path d="M 80,96 L 152,96" fill="none" stroke="black"/>
                <path d="M 280,96 L 352,96" fill="none" stroke="black"/>
                <path d="M 64,128 L 96,128" fill="none" stroke="black"/>
                <path d="M 336,128 L 368,128" fill="none" stroke="black"/>
                <path d="M 64,160 L 96,160" fill="none" stroke="black"/>
                <path d="M 336,160 L 368,160" fill="none" stroke="black"/>
                <path d="M 64,192 L 96,192" fill="none" stroke="black"/>
                <path d="M 336,192 L 368,192" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="376,192 364,186.4 364,197.6" fill="black" transform="rotate(0,368,192)"/>
                <polygon class="arrowhead" points="376,160 364,154.4 364,165.6" fill="black" transform="rotate(0,368,160)"/>
                <polygon class="arrowhead" points="376,128 364,122.4 364,133.6" fill="black" transform="rotate(0,368,128)"/>
                <polygon class="arrowhead" points="72,192 60,186.4 60,197.6" fill="black" transform="rotate(180,64,192)"/>
                <polygon class="arrowhead" points="72,160 60,154.4 60,165.6" fill="black" transform="rotate(180,64,160)"/>
                <polygon class="arrowhead" points="72,128 60,122.4 60,133.6" fill="black" transform="rotate(180,64,128)"/>
                <g class="text">
                  <text x="316" y="52">L2</text>
                  <text x="116" y="68">Client</text>
                  <text x="188" y="68">L2</text>
                  <text x="228" y="68">Tunnel</text>
                  <text x="320" y="68">Proxy</text>
                  <text x="20" y="132">HOST</text>
                  <text x="48" y="132">A</text>
                  <text x="128" y="132">Layer</text>
                  <text x="160" y="132">2</text>
                  <text x="288" y="132">Layer</text>
                  <text x="320" y="132">2</text>
                  <text x="396" y="132">HOST</text>
                  <text x="424" y="132">1</text>
                  <text x="144" y="148">Broadcast</text>
                  <text x="288" y="148">Broadcast</text>
                  <text x="20" y="164">HOST</text>
                  <text x="48" y="164">B</text>
                  <text x="132" y="164">Domain</text>
                  <text x="300" y="164">Domain</text>
                  <text x="396" y="164">HOST</text>
                  <text x="424" y="164">2</text>
                  <text x="20" y="196">HOST</text>
                  <text x="48" y="196">C</text>
                  <text x="396" y="196">HOST</text>
                  <text x="424" y="196">3</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
         +--------+               +--------+
         |        +---------------+   L2   |
         | Client |---L2 Tunnel---|  Proxy |
         |        +---------------+        |
         +-+------+               +------+-+
           |                             |
HOST A <---+ Layer 2             Layer 2 +---> HOST 1
           | Broadcast         Broadcast |
HOST B <---+ Domain               Domain +---> HOST 2
           |                             |
HOST C <---+                             +---> HOST 3



]]></artwork>
          </artset>
        </figure>
        <t>In this case, the client connects to the Ethernet proxy and immediately can
start relaying Ethernet frames from its attached broadcast domain to the
proxy. The difference between this example and <xref target="example-remote"/> is limited to
what the Client is doing with the tunnel; the exchange between the Client and
the Proxy is the same as in <xref target="fig-full-tunnel"/> above.</t>
      </section>
    </section>
    <section anchor="performance-considerations">
      <name>Performance Considerations</name>
      <t>When the protocol running inside the tunnel uses congestion control (e.g.,
<xref target="TCP"/> or <xref target="QUIC"/>), the proxied traffic will incur at least two nested
congestion controllers. Implementers will benefit from reading the guidance in
<xref section="3.1.11" sectionFormat="of" target="UDP-USAGE"/>. By default, the tunneling of Ethernet
frames <bcp14>MUST NOT</bcp14> assume that the carried Ethernet frames contain congestion
controlled traffic. Optimizations for traffic flows carried within the Ethernet
Frames <bcp14>MAY</bcp14> be done in cases where the content of the Ethernet Frames have been
identified to be congestion controlled traffic.</t>
      <t>Some implementations might find it benefitial to maintain a small buffer of
frames to be sent through the tunnel to smooth out short term variations and
bursts in tunnel capacity. As such a buffer is limited, Ethernet frames can get
dropped when the buffer limit is exceeded.</t>
      <t>When the protocol running inside the tunnel uses loss recovery (e.g., <xref target="TCP"/> or
<xref target="QUIC"/>) and the outer HTTP connection runs over TCP, the proxied traffic will
incur at least two nested loss recovery mechanisms. This can reduce performance,
as both can sometimes independently retransmit the same data. To avoid this,
Ethernet proxying <bcp14>SHOULD</bcp14> be performed over HTTP/3 to allow leveraging the QUIC
DATAGRAM frame.</t>
      <section anchor="mtu-and-frame-ordering-considerations">
        <name>MTU and Frame Ordering Considerations</name>
        <t>When using HTTP/3 with the QUIC Datagram extension <xref target="QUIC-DGRAM"/>,
Ethernet frames can be transmitted in QUIC DATAGRAM frames. Since DATAGRAM
frames cannot be fragmented, they can only carry Ethernet frames up to a given
length determined by the QUIC connection configuration and the Path MTU
(PMTU). Implementations <bcp14>MAY</bcp14> rely on <xref target="QUIC"/>'s use of <xref target="DPLPMTUD"/> to
probe and discover the PMTU over the connection's lifetime, and adjust any
associated interface MTU as needed. Furthermore, the UDP packets carrying these
frames could be reordered by the network.</t>
        <t>When using HTTP/1.1 or HTTP/2, and when using HTTP/3 without the QUIC Datagram
extension <xref target="QUIC-DGRAM"/>, Ethernet frames are transmitted in DATAGRAM capsules as
defined in <xref target="HTTP-DGRAM"/>. DATAGRAM capsules are transmitted reliably over an
underlying stream, maintaining frame order, though they could be split across
multiple QUIC or TCP packets.</t>
        <t>The trade-off between supporting a larger MTU and avoiding fragmentation should
be considered when deciding what mode(s) to operate in. Implementations <bcp14>SHOULD
NOT</bcp14> intentionally reorder Ethernet frames, but are not required to provide
guaranteed in-order delivery. If in-order delivery of Ethernet frames is
required, DATAGRAM capsules can be used.</t>
      </section>
      <section anchor="vlan-recommendations">
        <name>IEEE 802.1Q tagging</name>
        <t>When the proxy transports Etherent frames that carry an IEEE 802.1Q
<xref target="IEEE802.1Q"/> VLAN tag, these are by default transparently forwarded through
the tunnel. When the tunnel ingress and/or egress interprets the tags, there
must be agreement (signaled or manually configured) on how to consistently
process each tag at the ingress and the egress. The procedure for this
signalling/configuration is not defined in this document.</t>
        <t>A proxy that is used for access to multiple VLANs <bcp14>MAY</bcp14> map each individual
VLAN to a distinct URI, such that each Ethernet proxying request is
associated with only one VLAN. This provides flexibility in forwarding,
while meeting the requirements for the relative priority and ordering
between frames associated with a VLAN. To reduce overhead, the IEEE 802.1Q
field could be stripped and, when required, could be reapplied at the egress
associating the frame with the appropriate priority and VLAN.</t>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>There are risks in allowing arbitrary clients to establish a tunnel to a Layer 2
network. Bad actors could abuse this capability to attack hosts on that network
that they would otherwise be unable to reach. HTTP servers that support Ethernet
proxying <bcp14>SHOULD</bcp14> restrict its use to authorized users who have properly
authenticated to the HTTP server. Depending on the deployment, possible
authentication mechanisms include mutual TLS between IP proxying endpoints,
HTTP-based authentication via the HTTP Authorization header field <xref target="HTTP"/>, or
even bearer tokens. Once authenticated, proxies can enforce policies on
authorized users to further constrain client behavior or deal with possible
abuse. For example, proxies can rate limit individual clients that send an
excessively large amount of traffic through the proxy.</t>
      <t>Users of this protocol may send arbitrary Ethernet frames through the tunnel,
including frames with arbitrary source MAC addresses. This could allow
impersonation of other hosts, poisoning of ARP <xref target="RFC826"/>, NDP <xref target="RFC4861"/> and
CAM (Content Addressable Memory) tables, and cause a denial of service to other
hosts on the network. These are the same attacks available to an arbitrary
client with physical access to the network. An implementation that is intended
for point-to-site connections might limit clients to a single source MAC
address, or Ethernet proxying endpoints might be configured to limit forwarding
to pre-configured MAC addresses, or clients could be authenticated by
<xref target="IEEE802.1X"/> Port Based Network Access Control, though such filtering is outside
the scope of this protocol. Dynamic signalling or negotiation of MAC address
filtering is left to future extensions.</t>
      <t>This protocol is agnostic to where on the Ethernet segment a gateway for
higher-level routing might be located. A client may connect via an Ethernet
proxy and discover an existing gateway on the Ethernet segment, supply a new
gateway to the Ethernet segment, both, or neither.</t>
      <t>Opportunistic sending of Ethernet frames is not allowed in HTTP/1.x because a
server could reject the HTTP Upgrade and attempt to parse the Ethernet frames as
a subsequent HTTP request, allowing request smuggling attacks; see
<xref target="OPTIMISTIC"/>. In particular, an intermediary that re-encodes a request
from HTTP/2 or 3 to HTTP/1.1 <bcp14>MUST NOT</bcp14> forward any received capsules until it has
parsed a successful Ethernet proxying response.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="http-upgrade-token">
        <name>HTTP Upgrade Token</name>
        <t>This document will request IANA to register "connect-ethernet" in the HTTP
Upgrade Token Registry maintained at
&lt;<eref target="https://www.iana.org/assignments/http-upgrade-tokens"/>&gt;.</t>
        <dl spacing="compact">
          <dt>Value:</dt>
          <dd>
            <t>connect-ethernet</t>
          </dd>
          <dt>Description:</dt>
          <dd>
            <t>Proxying of Ethernet Payloads</t>
          </dd>
          <dt>Expected Version Tokens:</dt>
          <dd>
            <t>None</t>
          </dd>
          <dt>References:</dt>
          <dd>
            <t>This document</t>
          </dd>
        </dl>
      </section>
      <section anchor="iana-suffix">
        <name>Updates to the MASQUE URI Suffixes Registry</name>
        <t>This document will request IANA to register "ethernet" in the MASQUE URI
Suffixes Registry maintained at &lt;<eref target="https://www.iana.org/assignments/masque"/>&gt;,
created by <xref section="12.2" sectionFormat="of" target="CONNECT-IP"/>.</t>
        <table anchor="iana-suffixes-table">
          <name>New MASQUE URI Suffixes</name>
          <thead>
            <tr>
              <th align="left">Path Segment</th>
              <th align="left">Description</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">ethernet</td>
              <td align="left">Ethernet Proxying</td>
              <td align="left">This Document</td>
            </tr>
          </tbody>
        </table>
      </section>
    </section>
  </middle>
  <back>
    <displayreference target="H1" to="HTTP/1.1"/>
    <displayreference target="H2" to="HTTP/2"/>
    <displayreference target="H3" to="HTTP/3"/>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="H1">
          <front>
            <title>HTTP/1.1</title>
            <author fullname="R. Fielding" initials="R." role="editor" surname="Fielding"/>
            <author fullname="M. Nottingham" initials="M." role="editor" surname="Nottingham"/>
            <author fullname="J. Reschke" initials="J." role="editor" surname="Reschke"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document specifies the HTTP/1.1 message syntax, message parsing, connection management, and related security concerns.</t>
              <t>This document obsoletes portions of RFC 7230.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="99"/>
          <seriesInfo name="RFC" value="9112"/>
          <seriesInfo name="DOI" value="10.17487/RFC9112"/>
        </reference>
        <reference anchor="H2">
          <front>
            <title>HTTP/2</title>
            <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
            <author fullname="C. Benfield" initials="C." role="editor" surname="Benfield"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>This specification describes an optimized expression of the semantics of the Hypertext Transfer Protocol (HTTP), referred to as HTTP version 2 (HTTP/2). HTTP/2 enables a more efficient use of network resources and a reduced latency by introducing field compression and allowing multiple concurrent exchanges on the same connection.</t>
              <t>This document obsoletes RFCs 7540 and 8740.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9113"/>
          <seriesInfo name="DOI" value="10.17487/RFC9113"/>
        </reference>
        <reference anchor="H3">
          <front>
            <title>HTTP/3</title>
            <author fullname="M. Bishop" initials="M." role="editor" surname="Bishop"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>The QUIC transport protocol has several features that are desirable in a transport for HTTP, such as stream multiplexing, per-stream flow control, and low-latency connection establishment. This document describes a mapping of HTTP semantics over QUIC. This document also identifies HTTP/2 features that are subsumed by QUIC and describes how HTTP/2 extensions can be ported to HTTP/3.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9114"/>
          <seriesInfo name="DOI" value="10.17487/RFC9114"/>
        </reference>
        <reference anchor="IEEE802.3">
          <front>
            <title>IEEE Standard for Ethernet</title>
            <author>
              <organization/>
            </author>
            <date month="July" year="2022"/>
          </front>
          <seriesInfo name="DOI" value="10.1109/ieeestd.2022.9844436"/>
          <seriesInfo name="ISBN" value="[&quot;9781504487252&quot;]"/>
          <refcontent>IEEE</refcontent>
        </reference>
        <reference anchor="IEEE802.1Q">
          <front>
            <title>IEEE Standard for Local and Metropolitan Area Networks--Bridges and Bridged Networks</title>
            <author>
              <organization/>
            </author>
            <date month="December" year="2022"/>
          </front>
          <seriesInfo name="DOI" value="10.1109/ieeestd.2022.10004498"/>
          <seriesInfo name="ISBN" value="[&quot;9781504491884&quot;]"/>
          <refcontent>IEEE</refcontent>
        </reference>
        <reference anchor="HTTP">
          <front>
            <title>HTTP Semantics</title>
            <author fullname="R. Fielding" initials="R." role="editor" surname="Fielding"/>
            <author fullname="M. Nottingham" initials="M." role="editor" surname="Nottingham"/>
            <author fullname="J. Reschke" initials="J." role="editor" surname="Reschke"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document describes the overall architecture of HTTP, establishes common terminology, and defines aspects of the protocol that are shared by all versions. In this definition are core protocol elements, extensibility mechanisms, and the "http" and "https" Uniform Resource Identifier (URI) schemes.</t>
              <t>This document updates RFC 3864 and obsoletes RFCs 2818, 7231, 7232, 7233, 7235, 7538, 7615, 7694, and portions of 7230.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="97"/>
          <seriesInfo name="RFC" value="9110"/>
          <seriesInfo name="DOI" value="10.17487/RFC9110"/>
        </reference>
        <reference anchor="TCP">
          <front>
            <title>Transmission Control Protocol (TCP)</title>
            <author fullname="W. Eddy" initials="W." role="editor" surname="Eddy"/>
            <date month="August" year="2022"/>
            <abstract>
              <t>This document specifies the Transmission Control Protocol (TCP). TCP is an important transport-layer protocol in the Internet protocol stack, and it has continuously evolved over decades of use and growth of the Internet. Over this time, a number of changes have been made to TCP as it was specified in RFC 793, though these have only been documented in a piecemeal fashion. This document collects and brings those changes together with the protocol specification from RFC 793. This document obsoletes RFC 793, as well as RFCs 879, 2873, 6093, 6429, 6528, and 6691 that updated parts of RFC 793. It updates RFCs 1011 and 1122, and it should be considered as a replacement for the portions of those documents dealing with TCP requirements. It also updates RFC 5961 by adding a small clarification in reset handling while in the SYN-RECEIVED state. The TCP header control bits from RFC 793 have also been updated based on RFC 3168.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="7"/>
          <seriesInfo name="RFC" value="9293"/>
          <seriesInfo name="DOI" value="10.17487/RFC9293"/>
        </reference>
        <reference anchor="CONNECT-UDP">
          <front>
            <title>Proxying UDP in HTTP</title>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <date month="August" year="2022"/>
            <abstract>
              <t>This document describes how to proxy UDP in HTTP, similar to how the HTTP CONNECT method allows proxying TCP in HTTP. More specifically, this document defines a protocol that allows an HTTP client to create a tunnel for UDP communications through an HTTP server that acts as a proxy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9298"/>
          <seriesInfo name="DOI" value="10.17487/RFC9298"/>
        </reference>
        <reference anchor="CONNECT-IP">
          <front>
            <title>Proxying IP in HTTP</title>
            <author fullname="T. Pauly" initials="T." role="editor" surname="Pauly"/>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <author fullname="A. Chernyakhovsky" initials="A." surname="Chernyakhovsky"/>
            <author fullname="M. Kühlewind" initials="M." surname="Kühlewind"/>
            <author fullname="M. Westerlund" initials="M." surname="Westerlund"/>
            <date month="October" year="2023"/>
            <abstract>
              <t>This document describes how to proxy IP packets in HTTP. This protocol is similar to UDP proxying in HTTP but allows transmitting arbitrary IP packets. More specifically, this document defines a protocol that allows an HTTP client to create an IP tunnel through an HTTP server that acts as an IP proxy. This document updates RFC 9298.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9484"/>
          <seriesInfo name="DOI" value="10.17487/RFC9484"/>
        </reference>
        <reference anchor="HTTP-DGRAM">
          <front>
            <title>HTTP Datagrams and the Capsule Protocol</title>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <author fullname="L. Pardue" initials="L." surname="Pardue"/>
            <date month="August" year="2022"/>
            <abstract>
              <t>This document describes HTTP Datagrams, a convention for conveying multiplexed, potentially unreliable datagrams inside an HTTP connection.</t>
              <t>In HTTP/3, HTTP Datagrams can be sent unreliably using the QUIC DATAGRAM extension. When the QUIC DATAGRAM frame is unavailable or undesirable, HTTP Datagrams can be sent using the Capsule Protocol, which is a more general convention for conveying data in HTTP connections.</t>
              <t>HTTP Datagrams and the Capsule Protocol are intended for use by HTTP extensions, not applications.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9297"/>
          <seriesInfo name="DOI" value="10.17487/RFC9297"/>
        </reference>
        <reference anchor="EXT-CONNECT2">
          <front>
            <title>Bootstrapping WebSockets with HTTP/2</title>
            <author fullname="P. McManus" initials="P." surname="McManus"/>
            <date month="September" year="2018"/>
            <abstract>
              <t>This document defines a mechanism for running the WebSocket Protocol (RFC 6455) over a single stream of an HTTP/2 connection.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8441"/>
          <seriesInfo name="DOI" value="10.17487/RFC8441"/>
        </reference>
        <reference anchor="EXT-CONNECT3">
          <front>
            <title>Bootstrapping WebSockets with HTTP/3</title>
            <author fullname="R. Hamilton" initials="R." surname="Hamilton"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>The mechanism for running the WebSocket Protocol over a single stream of an HTTP/2 connection is equally applicable to HTTP/3, but the HTTP-version-specific details need to be specified. This document describes how the mechanism is adapted for HTTP/3.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9220"/>
          <seriesInfo name="DOI" value="10.17487/RFC9220"/>
        </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>
        <reference anchor="QUIC">
          <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="TEMPLATE">
          <front>
            <title>URI Template</title>
            <author fullname="J. Gregorio" initials="J." surname="Gregorio"/>
            <author fullname="R. Fielding" initials="R." surname="Fielding"/>
            <author fullname="M. Hadley" initials="M." surname="Hadley"/>
            <author fullname="M. Nottingham" initials="M." surname="Nottingham"/>
            <author fullname="D. Orchard" initials="D." surname="Orchard"/>
            <date month="March" year="2012"/>
            <abstract>
              <t>A URI Template is a compact sequence of characters for describing a range of Uniform Resource Identifiers through variable expansion. This specification defines the URI Template syntax and the process for expanding a URI Template into a URI reference, along with guidelines for the use of URI Templates on the Internet. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6570"/>
          <seriesInfo name="DOI" value="10.17487/RFC6570"/>
        </reference>
        <reference anchor="WELL-KNOWN">
          <front>
            <title>Well-Known Uniform Resource Identifiers (URIs)</title>
            <author fullname="M. Nottingham" initials="M." surname="Nottingham"/>
            <date month="May" year="2019"/>
            <abstract>
              <t>This memo defines a path prefix for "well-known locations", "/.well-known/", in selected Uniform Resource Identifier (URI) schemes.</t>
              <t>In doing so, it obsoletes RFC 5785 and updates the URI schemes defined in RFC 7230 to reserve that space. It also updates RFC 7595 to track URI schemes that support well-known URIs in their registry.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8615"/>
          <seriesInfo name="DOI" value="10.17487/RFC8615"/>
        </reference>
        <reference anchor="URI">
          <front>
            <title>Uniform Resource Identifier (URI): Generic Syntax</title>
            <author fullname="T. Berners-Lee" initials="T." surname="Berners-Lee"/>
            <author fullname="R. Fielding" initials="R." surname="Fielding"/>
            <author fullname="L. Masinter" initials="L." surname="Masinter"/>
            <date month="January" year="2005"/>
            <abstract>
              <t>A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or physical resource. This specification defines the generic URI syntax and a process for resolving URI references that might be in relative form, along with guidelines and security considerations for the use of URIs on the Internet. The URI syntax defines a grammar that is a superset of all valid URIs, allowing an implementation to parse the common components of a URI reference without knowing the scheme-specific requirements of every possible identifier. This specification does not define a generative grammar for URIs; that task is performed by the individual specifications of each URI scheme. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="66"/>
          <seriesInfo name="RFC" value="3986"/>
          <seriesInfo name="DOI" value="10.17487/RFC3986"/>
        </reference>
        <reference anchor="QUIC-DGRAM">
          <front>
            <title>An Unreliable Datagram Extension to QUIC</title>
            <author fullname="T. Pauly" initials="T." surname="Pauly"/>
            <author fullname="E. Kinnear" initials="E." surname="Kinnear"/>
            <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
            <date month="March" year="2022"/>
            <abstract>
              <t>This document defines an extension to the QUIC transport protocol to add support for sending and receiving unreliable datagrams over a QUIC connection.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9221"/>
          <seriesInfo name="DOI" value="10.17487/RFC9221"/>
        </reference>
        <reference anchor="DPLPMTUD">
          <front>
            <title>Packetization Layer Path MTU Discovery for Datagram Transports</title>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="T. Jones" initials="T." surname="Jones"/>
            <author fullname="M. Tüxen" initials="M." surname="Tüxen"/>
            <author fullname="I. Rüngeler" initials="I." surname="Rüngeler"/>
            <author fullname="T. Völker" initials="T." surname="Völker"/>
            <date month="September" year="2020"/>
            <abstract>
              <t>This document specifies Datagram Packetization Layer Path MTU Discovery (DPLPMTUD). This is a robust method for Path MTU Discovery (PMTUD) for datagram Packetization Layers (PLs). It allows a PL, or a datagram application that uses a PL, to discover whether a network path can support the current size of datagram. This can be used to detect and reduce the message size when a sender encounters a packet black hole. It can also probe a network path to discover whether the maximum packet size can be increased. This provides functionality for datagram transports that is equivalent to the PLPMTUD specification for TCP, specified in RFC 4821, which it updates. It also updates the UDP Usage Guidelines to refer to this method for use with UDP datagrams and updates SCTP.</t>
              <t>The document provides implementation notes for incorporating Datagram PMTUD into IETF datagram transports or applications that use datagram transports.</t>
              <t>This specification updates RFC 4960, RFC 4821, RFC 6951, RFC 8085, and RFC 8261.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8899"/>
          <seriesInfo name="DOI" value="10.17487/RFC8899"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="IEEE802.1X">
          <front>
            <title>IEEE Standard for Local and Metropolitan Area Networks--Port-Based Network Access Control</title>
            <author>
              <organization/>
            </author>
            <date month="February" year="2020"/>
          </front>
          <seriesInfo name="DOI" value="10.1109/ieeestd.2020.9018454"/>
          <seriesInfo name="ISBN" value="[&quot;9781504464406&quot;]"/>
          <refcontent>IEEE</refcontent>
        </reference>
        <reference anchor="ETHERIP">
          <front>
            <title>EtherIP: Tunneling Ethernet Frames in IP Datagrams</title>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <author fullname="S. Hollenbeck" initials="S." surname="Hollenbeck"/>
            <date month="September" year="2002"/>
            <abstract>
              <t>This document describes EtherIP, an early tunneling protocol, to
provide informational and historical context for the assignment of IP
protocol 97. EtherIP tunnels Ethernet and IEEE 802.3 media access
control frames in IP datagrams so that non-IP traffic can traverse an
IP internet. The protocol is very lightweight, and it does not
provide protection against infinite loops.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3378"/>
          <seriesInfo name="DOI" value="10.17487/RFC3378"/>
        </reference>
        <reference anchor="L2TP">
          <front>
            <title>Layer Two Tunneling Protocol "L2TP"</title>
            <author fullname="W. Townsley" initials="W." surname="Townsley"/>
            <author fullname="A. Valencia" initials="A." surname="Valencia"/>
            <author fullname="A. Rubens" initials="A." surname="Rubens"/>
            <author fullname="G. Pall" initials="G." surname="Pall"/>
            <author fullname="G. Zorn" initials="G." surname="Zorn"/>
            <author fullname="B. Palter" initials="B." surname="Palter"/>
            <date month="August" year="1999"/>
            <abstract>
              <t>This document describes the Layer Two Tunneling Protocol (L2TP). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2661"/>
          <seriesInfo name="DOI" value="10.17487/RFC2661"/>
        </reference>
        <reference anchor="L2TPv3">
          <front>
            <title>Layer Two Tunneling Protocol - Version 3 (L2TPv3)</title>
            <author fullname="J. Lau" initials="J." role="editor" surname="Lau"/>
            <author fullname="M. Townsley" initials="M." role="editor" surname="Townsley"/>
            <author fullname="I. Goyret" initials="I." role="editor" surname="Goyret"/>
            <date month="March" year="2005"/>
            <abstract>
              <t>This document describes "version 3" of the Layer Two Tunneling Protocol (L2TPv3). L2TPv3 defines the base control protocol and encapsulation for tunneling multiple Layer 2 connections between two IP nodes. Additional documents detail the specifics for each data link type being emulated. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3931"/>
          <seriesInfo name="DOI" value="10.17487/RFC3931"/>
        </reference>
        <reference anchor="UDP-USAGE">
          <front>
            <title>UDP Usage Guidelines</title>
            <author fullname="L. Eggert" initials="L." surname="Eggert"/>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst"/>
            <author fullname="G. Shepherd" initials="G." surname="Shepherd"/>
            <date month="March" year="2017"/>
            <abstract>
              <t>The User Datagram Protocol (UDP) provides a minimal message-passing transport that has no inherent congestion control mechanisms. This document provides guidelines on the use of UDP for the designers of applications, tunnels, and other protocols that use UDP. Congestion control guidelines are a primary focus, but the document also provides guidance on other topics, including message sizes, reliability, checksums, middlebox traversal, the use of Explicit Congestion Notification (ECN), Differentiated Services Code Points (DSCPs), and ports.</t>
              <t>Because congestion control is critical to the stable operation of the Internet, applications and other protocols that choose to use UDP as an Internet transport must employ mechanisms to prevent congestion collapse and to establish some degree of fairness with concurrent traffic. They may also need to implement additional mechanisms, depending on how they use UDP.</t>
              <t>Some guidance is also applicable to the design of other protocols (e.g., protocols layered directly on IP or via IP-based tunnels), especially when these protocols do not themselves provide congestion control.</t>
              <t>This document obsoletes RFC 5405 and adds guidelines for multicast UDP usage.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="145"/>
          <seriesInfo name="RFC" value="8085"/>
          <seriesInfo name="DOI" value="10.17487/RFC8085"/>
        </reference>
        <reference anchor="RFC826">
          <front>
            <title>An Ethernet Address Resolution Protocol: Or Converting Network Protocol Addresses to 48.bit Ethernet Address for Transmission on Ethernet Hardware</title>
            <author fullname="D. Plummer" initials="D." surname="Plummer"/>
            <date month="November" year="1982"/>
            <abstract>
              <t>The purpose of this RFC is to present a method of Converting Protocol Addresses (e.g., IP addresses) to Local Network Addresses (e.g., Ethernet addresses). This is an issue of general concern in the ARPA Internet Community at this time. The method proposed here is presented for your consideration and comment. This is not the specification of an Internet Standard.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="37"/>
          <seriesInfo name="RFC" value="826"/>
          <seriesInfo name="DOI" value="10.17487/RFC826"/>
        </reference>
        <reference anchor="RFC4861">
          <front>
            <title>Neighbor Discovery for IP version 6 (IPv6)</title>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <author fullname="E. Nordmark" initials="E." surname="Nordmark"/>
            <author fullname="W. Simpson" initials="W." surname="Simpson"/>
            <author fullname="H. Soliman" initials="H." surname="Soliman"/>
            <date month="September" year="2007"/>
            <abstract>
              <t>This document specifies the Neighbor Discovery protocol for IP Version 6. IPv6 nodes on the same link use Neighbor Discovery to discover each other's presence, to determine each other's link-layer addresses, to find routers, and to maintain reachability information about the paths to active neighbors. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4861"/>
          <seriesInfo name="DOI" value="10.17487/RFC4861"/>
        </reference>
        <reference anchor="OPTIMISTIC">
          <front>
            <title>Security Considerations for Optimistic Protocol Transitions in HTTP/1.1</title>
            <author fullname="B. Schwartz" initials="B." surname="Schwartz"/>
            <date month="March" year="2026"/>
            <abstract>
              <t>In HTTP/1.1, the client can request a change to a new protocol on the existing connection. This document discusses the security considerations that apply to data sent by the client before this request is confirmed and adds new requirements to RFCs 9112 and 9298 to avoid related security issues.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9931"/>
          <seriesInfo name="DOI" value="10.17487/RFC9931"/>
        </reference>
      </references>
    </references>
    <?line 696?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>Much of the initial version of this draft borrows heavily from <xref target="CONNECT-IP"/>.</t>
      <t>The author would like to thank Alexander Chernyakhovsky and David Schinazi
for their advice while preparing this document, and Etienne Dechamps for
useful discussion on the subject material. Additionally, Mirja Kühlewind,
Magnus Westerlund, Martin Thompson, and Gorry Fairhurst provided valuable
feedback on the document.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+V923Lb1pbg+/6KfeSHlk5IWpQcx1bipBlJjlUty4okJ911
KnUKJDZJxCDAxgYkM7LOt8wvzPs8Tf/YrNu+ACRlp6anpmtGD7YEYt/WXvcb
+/2+qrM6N0d657IqP66yYqZP67mpClPr11WyMFZnhX5zc3O5o5LxuDK38Orx
u4uL0+Ob/unNm9Ori9ObHTVJajMrq9WRtnWq0nJSwNAjnVbJtO5npp72F4n9
98b0J2VRmEndN7JIfzhUthkvMmuzsqhXSxh1dnrzWhXNYmyqI5XCzEcKhllT
2MYe6bpqjIJdHKqkMgns5qZKCrssq3pH3ZXVh1lVNkt4/LbJ62yZm48m1aPl
Ms9gj7CEvm7Gtq5gVl3emkr//P7sWJ8Wk2q1xI931AezgmnSI6X7+t+bbIL/
z+t6if/DZpIZQAV//+XyAv9bItjwl7qBk+UWf+WzuoH9Yoa/5snKVP0D/NUd
Xt2aooHTae03Pbr++f3pDjxhUOz8CifCS/kJX8DniyTL4Tkv8c8I2kFZzfCT
pJrM4RNc0h49fYov4qPs1gzca0/xwdNxVd5Z85SneIpDZ1k9b8YwmK7qbia3
9fTz94ejcwCmraOl27MMePZBVn7BfF/wymBeL/IdpZKmnpcV3hPsQQOaAnKM
BvpqoK9Nav7jv5f0mBFxlJvfkyKtSn3V+hRgkhTZH4QZR/qnspzlRp+fH9OH
hmGdWBhQlP88o08Hk3KhVFFWCxh0S5f3ZnhE77860levj18Ohwf0Z5rZJVz6
EVHP0+FgiK8edF493PAqDn9z2Hnx2YYXcfDZ6enpi/2DweGRPnl3NhjuD4bD
/ZdP8fH1zcngYP/gYPDyxbNnzw6fR28Pf37k9eH+/v6zZy9fKJUV0/igfvS/
bh29P3i5P3zx7OtnSvX7fZ0QrU1qpW7mmdXAGJqFKWqdGjupsjFwl3l5p+uS
ySiwnmmL9Qw0jYZ36nJS5gp+t9kC0RuHnl3yaCQTGdDT4wYmKSt9jlSnDxA7
apOkupzKo8OBfltWRtmlmWRTYA55vurpurPLaVbANhK/NLyQ1BreBQrSCS+m
J3mGb9elmgBHAsaSCDPA3ZmPk3lSzIzfSfeM9RxIezb3s1lTAV9Sd0A0+Cyp
62QyBx62nK8sbhNwVt9mVd3Ar34ua2a444FisC+yNM2NUk/0WVFXZdpMEMGV
ogXgLLdZSisbLaxcL4C6ylTvWmP0/f21oQH65eBw8Bxh9hcc+Yoxcf/hYQ9h
y6dFqCf65vgShv0F/qOXDl4ePjxEQEjwwuFVorMe/Omub2EQOpld0ITvT2gW
J17gT5ntxcMDjCpSAkiaZjgNHL81GvBARYPPeOyzF88eHgb6TXlnAKp4wcaa
MNDqSVIUZQ3/VdXK3xFfDd1BiYjUVAhobYpJsrRNzoIEUArAiNA5A4TDHSCS
JcXEaLo8uhza1A8kKHlHh4ffwGnwEs8PbvC4P+D/+MnB8+dD+ESe3B7S2y8P
h3j2u3k2mZMUBMyMQTAHpIadjVfAgnu6MnDVeCN4tcktSoAxMLS3N+8H2ykw
wm48hCAszoJ0rYm5wK48o3l4UF0cdsgaIfBAn2YEtGVS1dkkWyawKJAn7oyp
htk64iXcAT4vYP/A3NYppKS7n1blAjablx0iyIraVNNkYphN0Gxjoxtg2wAX
GFGUcE0wiW2WqCbAKosSqHRcZSkdE26wvivDsiAfk3SS2BoUGRABBe0A8Bdg
mVk4p0cTUAGENeGagNOgZUxX/mS3Wb1CrgBzomLiBBlsK0F9BDHFCkOpDI6a
ZrMGrhCXK4t8xScD7snwXRpTWRUmgbcQmBZgtGHvmvfu7t1fsQDBIhODu84s
UTBcGOpfFmFBtwOAayx+Qn+diN5jkcLwSf/kp6vRW6HOb5DCfsX7C0OeHgDK
vDlgTGdhhQ8OEZmzGi/HMjc6/VibIoXjOE6UWI+bKSIMrHj6rzd9+fgA1wRx
hpQCSKHanx7yjg72N+1oOPiIWxhGW+DTvV/C2QBFEquY48u6jgt+M3jh4ALz
dgEKt2GsTaqMLmzSVDamzzbLQI0TKZY3p5YlaL1AoD3cDIyzwG3yFP/Q82wG
N9rPgWvlQby5RYHUbTOZ447v7wPHY2iHJ8BAacNP9HFZgK5Z0xUjLZ3gOWmP
Fs9jNGi9GtVeCzro++ubnR7/ry/e0e9Xp6AnX52e4O/Xb0bn5/4XJW9cv3n3
/vwk/BZGHr97+/b04oQHw1PdeqRA5/23HebuO+8ub87eXYzOd5hTxPwKSQQw
HgibqGJZGSIkvLIIWX48vvyf/234DJEGOepw+JI4Kv7xYvgNiALgpKbg1YjE
+E+gnpUCojQJMnEiDbi2rE4Q0gldzF0BvLYyAM2//g0h89uR/m48WQ6ffS8P
8MCthw5mrYcEs/Una4MZiBsebVjGQ7P1vAPp9n5H/9b628E9evjdDzlQgu4P
X/zwPWgVZ537AJFELJZYENzHQu94HkTouoO3VZmpqRyjirUb4nqVAbOtSK17
oT0B4ntlwACwNTJZtworW4Agljk8ixQlk4OV+C3NJToZSkwwGCe1/dwKZ1N8
A5AMEI1nIzxbmDQD2gZWsUuMaQN7OBx8E9jDHmBofWdMEe1CIbatL49oV1pa
kAElrB/W2Wmv7clBOfDHEFk/FDDUZQlTwECamCA8LkGGRKBB7rm+qTU9gdgk
LpQVZV7OViyGgaTQcCZ2C9aCsFsk0Xiwcgp0UJ/BqrVEbwxLYkGajQxZCj4C
hYz5pawlkFZDUEQA0rgyrkgb9fo7DfBT3ALgUPcBDlrM4OAI0BmrcGUKMFLt
qfWQ1dzuoX7ZMs1tkgPawEFxryDg+eaAOdH8Hi1BES+yRbPQ7M3AJUhT80ID
4X2ByggSRI+4UaAVEco4F1JaWuJA0FWdHrNwHg68c0BzgwJ6VwSDtzr3kNut
GBEMKqew0R1+ewObrQxwVqAjJhiFMoN1E9HVnDQhVUWE2lQfE0pZff+EkavP
ysyDUu6TdQ0Hj7SOuuST4dNnCaha76/O9I0BxQrsKhT2N6dvL89HN6d4Sc+/
/maf8cC03rNe96tbkppvi0geDqUQKg5N7LcatTeDMEhYTJIqDLoJ60XAMQXV
cFaTwV3eFQNcVoVlBRdhbVSk24vjBI5f3pk8738oUKagNku4DWf79fT8vP8v
F+9+vSAl5/nwa5BXlZmBjmaq6ED+ssRaA00y6dtmOs0+AgOCGzr9mOBhGOos
u8YGTNYjpf7xj38o56Yx/Bo5hgZhT84x5F0yfgBziGjYEfoVtr8v/p94nR9Q
03k1Lse0EzUqOnBnfdgrqQ7x0KQpPcKv2b0WCG02B0abgkqgd27zpOiDbQbI
C7dR7fhrJisg3KIbjo/JwsJfZElCK1UuWY9DTR7w3KOLRpK3QvMoZGA1vCIi
YOZsYoXVgh3aliz1whx4O4aNJGvyqdsx0wEYTqIdihchb1Lj2IpdAbg+DhSY
tciKstQxJMQ7YgDtVSblYtEUyCSD3SBiIGOekpCdptAUitEWkOnNagmSw9Tk
ezBfhllfhig/4D29uu/c1kPAT3xvbaqn6wMIlZALTEv0zDi5DkTOyIHm1sqd
O+YUsO2/rrEPTdrcmNw47hHCBUSXZn38EK8HFoKLaztMlNbDwQG+7fgUE+Qj
i6C6ObZl3tSG5GDXBfOMZd5fYDA7BF48hznR3QtKBU0CRgfhRlEWfZgdMNVO
5nBy4PvkIQXcZYV3mYAEA1QApQvB4vfVfk5n3bhbsIArsUUTbfMEbOGdpzs0
zQg0Zg+sgHvukDhGUJcWA/ABIlSraDfRso8ADJVaILc6QbAB/8Yzj66Pz870
e0BvtPMn8wRNZlR6HIQAWKTru4E8IHpRtlaRn27/48Gwv//xm1MGrM1ujd4t
nIyGuZammqCMc6oEkhB5BE36rW5f3sFgiOeCczyOB3gsFA5XhvTjFKziZUKS
R+/ufLWjS1gzqcsKZPnrKiGeBRuJX3rSeuk8AaqMPqc7Oynr/iWoAdnHnr7E
W7g26zPRm9d4t/7dAm4L3+9f1yvgRpcJemUAbp1RMM21WcAl5HAnPHYQ5L8Y
L8SskprFYJtGxyD6v0V3MDvqJjLQyc1EzUwBB8z7y6Zaot7cAuMmKZInkw+W
+ZnTEpVsADUZVPkTxwZTOBFbCeiOKVYOHdf3SKwPWSYAQZF/Kd5IL+atdLeV
+R1m1hlLs0hvIn/mGBU51LTEENHO5wg6GCNXvdk8IkXshjyseStqJ04zr0gB
ZywZP0Fozco681qbd1Oj1Ng6vuMU9zo9bmlnLRzEulsjHpW6/GAKVtBAq0Tp
He1UScTMq0XH5CkBDHM6U4cVHjJrDf4nNLcIYemc3knl6FnMipbRtkxWeZmk
ff6M3TmlJkOEPPdFAIQAJ7G2nGQkOR3rg1Pkzp4lRbrnEUll1jbkVHUXKlzH
6QMbQNaGllI/rti3aRwSRqaSPPkyUKkWqHrbzV9nyYgbHPF/gfbJjJSbmiIL
1+yyxygJaBhovkybfOOUaNWjHZbkttw6sfITq8esACdBmLnBHdBHN+fXKEMo
dmt87LaHz5ICtZVKId0CsSMZhje8XtOTmBMGQpgsSZ0gRa/HVp6XmxRoxE9Z
U0fCexLOTWFz/QbeQzJU6j0cHmAwMdkthUaK7VAH7UP/VRwPOCRbOo1s3VKS
Y2kXwUH3QYbcAgQveogTFHeKwqDec7BCiwEQ/S6pUod+DivJpx5N6Zz2F5Gg
Y02y4wZZJCvt7N3KsBA0rakzOpBfGbaJc7EjNvFGrXM0E8NF/pJNyUCt2ejH
CUExYEuOlkKIAp+vezhbYltLelHMs1g8uFuIKIOUVJTAAPB3eOq7zAqvDoBv
A7PLb4mLtZ/hTtDzP5mXKJBom8TsH/U1kWUZoglhIZyOmc6A1dk8m4LevfB8
oMuaAGx1FjT6rSsq5lIw6yimXUepXdeWMBEw5++/w3fE1+7+PDhEBTQD8TQh
q5ducH19PYdZ/TlNupG3wqwZxtlYhm2LAw/0iDwYsl1GW1i2QGa8fp5Ne3Ow
x01NkyxHXa2eN3ZdXnuR7H2DRPDOnQI6Gs90/wQ+Hz4otR5nGPo4w2Pkz/i2
MKYWaSW2i4p1Dm+hSICWvcXAEHd+Or3Z8Sqlm5I/dhZBEFUlHp1DhWAy5WlX
Ks3hBbEpnMmrycfUxTynezy+7LH3F7VXJQFKpqrekagLJpAE9Zp1jQgAxA0T
a/oZJQBlmIqA9AnioBWheU6aNiZOsBv2c1ssfNRn6wbXBPWA/BXb75MO4L10
yMPRnmPitKQB1VUmpAVYv0hyfMGkTkFyfAhgzk487V/xa4hKSY5zH3Y1VVVW
5GUWNdtpVM/29/Xuj0nqkHYPbbi6QQGTYijjNTm5yLTuCd+O/AKRFKKVulah
2vmznqQdwrA75AfkPAGpjnqw6vAFEm0TioWhGtwmj4gswe7nDCunUwBN6D+7
p5Ceg1RypKNxKuDxkcMXJf8f6S5+KFHK+k4pO9I/DMk3cX+knwAk+7Dz/nyo
KePu1Y546dY4y85Dl+EI30OOg9yYhQNLbB14nXBClH2VWeaEmqKxetZJKCqY
6eIuarPXxHMe0XM93uhSzGU3qedJw/2h3r2GNSdznM3BwcbU2BrzX5RjbNmj
MNPPMA6YcSPr2Di55/4tO9PpRkGVZq8o+V/wxvSaAdD1PGywlWAPaPF629Z2
rdtg165LRVQgau8bJL6nkhpdPqQusUgl6p7kpXCfVtSgxWrqgL9M5jFHO9pA
2J4YEMU2YNh/PqXa5eOkyjcT0+oBHV9yHa6cYUVqAqhM63rCIxkSjxhqyNrJ
3O0mTkg8TK7UoQwB2TIbdQk616bmtK0oYqHIOo4TLbzSF+dXyEMJ33a3tLSm
Sct+TBg2iI7PsJkj0XA2TBJpPbKRQFBHPsLy+MDtJHnk3aSPTOF8h3iQ8L5o
R2eX6BZsaUZH5OdEWB2xN3bT3Fb74D/FDtF5S8pA5iKM6FRbW18m9C5dbzBF
AjuW08QbYKb7+3Z07uH/lELTZUYvBkN2hL4JWBX82+IxR8z/f1AleXM6Ojm9
ulYOvV85elUBc1+tcyiHNa9Yn1GMT6/044G6CJVftRSZiTC8aMlNusnBRoZ3
EHGoDTpKh+85kcXaCnG+/6LqipDTwcePoLV4M3KP4wD/H0nsdYtXj8gD4ukQ
txCDVJJuDgFyHDQhUxZASotSXhZcIy7RVMyoJomzSXy29Lrz+39fTXDEJpt9
pQ/2978I+VHcfwn2R2IfddbafKz1mQ9FSjJdOy/Zs9Ut2e2x66Xtapc882lT
IxijbIQ4r7ydoMl4N09A5/UeNWXNIkH/JaYNhrx5hK6fM06JDmkMrTynr1Fd
jpMNB/q69M4p29ogX1fScHg9SBj2vrNSoKI0SSysQThjPLBCrtCGVUvXtiAi
g/OW0qLCMSjvqUcZfB3AdP34n/OW2Xa801/2Ce/Cke+GgEJ4lUn0+UF/nNUu
d8jq3f3+wXe2WX7//OC7p/h/f7g30N1RLpMosWpLMpPtshBOYgrpUSbeNRtR
8Pm+IjVRIo2t2I+7H0o4zzmk/IepSpdegPtKV0Wy4HoJQlBKKkDHsbxqbk3R
53wnVE55A313Kpd85gayh71M07UhHhB0P/1oqc7BsMLHLpOJcf5QRRUHM7D7
CseV6WK/RRmO7NAlVuDZWzfrdQpKqoYdmYpjho1LPgX6afI6KUzZ2HwVzoGk
klIy9SRoxj1Yqua4AqaaIs4HN7cnyvbV+3jwGNlxOLaLoccH80FDrHbBQCkm
LcQ7ItFRpejY7wBNXsOchZYaJ3wBmTWgSvsuyTu47aYolRzWVLQesffbMmNF
ieIFlJqyKibzqnQVVz5X0icsRpUaJeaqJRExke92jK9H2MMplK0jSMSplfQh
50FZEyYkfOhUC0g+TiSoympT7ib6mM0SDTB22HH6kDuHBBTzNoagfLuidC6J
AGccxUiYescrmSUp4olY98HwMRYAuFN47OHSCI50UkyX0SOcUuzCUPjh9HkW
OxhxV1W8q3KCSewD/XpN7LhYPBFV25BB3s1i1iqKg3DWWowiA31CEKMAn6RH
sk48NvgMr6C3gURVGoRbyWRBsSDh4zESBuGHB1xhPYShshKXQzcgBcPV6Uho
W1AgbSSEQxjsCkMoZWXywXQDuX5X2mX3bnxNt0DrgqppQ/PXWLkqpa8Uz2+J
LH3J3Fi/5tu9f9KRNeJS+GLB5nJEeyHF1K2l3Fps8zp1NkhPiS+3Y+9zCcOt
BdrV/X2K44JUDIFFzpHrCudI4LGLhGK7J6ObES6mWGPijXclsV+XgnzAhQE/
6nwl5hnv8OcGRDmg4zVBQPmhTHCYwMMKMIt8uffWFkQRkStgSy8Yib54evMN
3qP+H7a9m+1hFNN9ujsYwN8PXiONQedV0s+sxDiyI8bWl+5LcNXdorOrmKaP
Yk0G/jjSo61p1c5QC7N5daN9ZZx1UyhRqD0R8UVglgAGmYEgm4ITZCOwkdrC
pO9Dt/hXpdg0E96dVuVSXBdudpthIkCOwhBkJUpgyqsBW6isuHJnVzgS0b4i
RlqVDVJ2lS33RB1K7pKs3kjYcs5JWYmJgm/J1gHbAF0E5ATHm7lHJJ/iIVtF
zQslWuDvLGaQY7ZACmrybQZKiKLLiumLeJpE+ZizsWMJcQv1JNjaqx1UtEHu
IMJ0zZJ1WuwQq9eSoruxhgpgUQOUyqvOC5iERe9ofIfvr810PPqA5djkuVor
mKV+BHrXu7vejo7julKZpgGw5fR5jmVwmG+Phgs+4AkmczP5AJsBnogqBo3a
6+koBg6SeFvpI5jGCmGXG8zX5PnI1okii37s8Odo8PBnLIlNZsRKgUFSFitg
cLkAscwpaZbDEDePbhUhKYv5MgPk9GivdawmQM45F9sUImPLRVbXosrR2sum
dpnlmxIIvGJGgpgrHCfoXiKhV3LBKeUX40Qt7wTpZlTYvGbAMshAheLaZIyt
BL3Y5XI450c3rUCIPpRfe642NrBJTBEhweS1BBTWbcIUeUjKxhbW0Z454h/q
C/iH/gL+sXlLcTmIcCpKawlyWHY6NsGj4vMJEuv1Hnd6VbbfbVOke5tY7Z6W
+mKyDsummmDmxZXwWFau3OnDhiTizNp22HGeLVBlBfz09oDgCu04sx+QKN06
gBpz2GJQP3GOgW45gyq/EeRqND/NVZd1kkuBDTJu3gPce9ijqPCgAFMh5i2a
cX8QJ930MmhUammqvkvtw98nDDbKMJO/XbhynNjMkvbWYVQhJ6xbee26CtQh
fTO4jFxC1AQNoCVWOKMVEWUJwfsfMCNmA7lG24ozb3xJWlzl7J2CgcYNwYe2
JrFO/zYuGpW2UYgPZosMN6q99r0FYrpFPo3ehmziNED0FqYmx+vUJpnMu4xL
YKA8DYt6Bpsi75DzXvFf8iGnBZGsZBHpc6lO/Ql9mjBTIYA5AJ5KSHxu2xxv
D6s2vIdLiXM3G2c5kLEhr298TktxSdIxsLTc+Ew4sUjhxGYmyc8YRlEuA28t
996bf66YK9EfcI0cwSwGb3srWLU4NqtSbBE7KZey71bRJiVcsfDgHhnOhUz0
RCcn0azmgrxEJL6mnE0ctjmpGIeeUvMa5PflEksEqVAkL4GToo7CVcfKpf+B
AlKwbVQZE6qjdq8x0fiK/jX1ZLDXEZw9R8NU/a+4HtGrXpej99enLlcMxEan
kktY1JgYcEVg8c00ZM8s0LBKn5PQaN8KDwGYfU3tgmYI5rasb2ET7B03yWeA
X+S2GdGAc7aubOW6YqRSlOP7IXnApwYJZosUjGUz+dmJJhxJJY6MStakgQFT
fCWoelL41GtjG/meRAaKdsOMTap+NqXqOie2KbjkA0fGnRW2diaAm7oRt3FU
UyQMhEnQ5EsNrKKRfk0RLYKsW5F0YbvB88bACYNbh/P3rrjpw4iDTucHv1xe
gEUta/e5JcRDt4pIPqZKJ2qUQWBCDKFfcA5Qapsl2rQY6PAFv1RKHtWHhZYN
iWs/4dRb6Q4hscMksbcgMb7qy89XesPP5k/x6ff6zTu4w6H6tPZu/IPjzg/g
H3jN7QP+gFFcr6E/fdfvuw+4yABGwcuc7dyaM1r24AuWpR947UePDp/+xGlP
CHU6pz1UwXTOSIr3XesZNp75tvkcmP3QLNHucSXtmCzUCp/JfW2pS2ceuqCM
6NpgWRGYs+w3cDUbGxqYkJ/PtfLZ0KQDD/C3v4HmALaN3MFvv7XA4D7tZJ7/
9ptS16c3N2cXP11T36i/e4/FK8ADtQmi4Sca+fjP6cXox/PTv0v45++XV+9u
3h2/O6c1Pjd2bU/XN1eno7e7z57tHen/e/HxdmUhtvXaHCj8HAg3HObxEe3o
5OPvbtmSd4y1HVuo1gOEh7HX/JXe9969V9jpTvqRxOYiKayfO6hf8/HXtuzo
8UGd/T7+8pedJo7voj+hwxOQI7zGx8IWRMYhY0BxcQ3aUL8u+/g/S4vPyQYr
I/D/7ZLh95I9HKTHoGK/jSe0ZEX3Q+WahpEXRRKPIvHhQbWVs4YPwstbmXcQ
F/HLTlTAC+ebpMSnL5yZ34j3/NWje/4q3nM098afT4pExEh/RxMGYRd+3LOW
/GwtEGSV+4mlF434URYIAir6kYctSflnT3AsCzz205aJ61LRHliH/tcxtrJ8
jCjgP180UmevTbKRvHnoKniUEtAkicpwnLdoYiKbNLOeJjnFrKPcPaBVHewc
dedqQ459ella+iykYEB+K5kSkm8R93c5brdSYbyXqB6FkBPLORQdJoRZcFhL
Str1panI14+nOZZWAom0ZvKeVM//q4btJ+k+F7bJvU/ggmaGHSnos6jQtjKD
2aCn7u9vjn2HKM4R2Ou1vIegZU+n2YTNc2plhaZ1bvAq0NgvYGKTqvUlcoPx
Qm92oY9GEoIKM82kogukga9CmzVZSuelUFHIgBoOhpQn+MP7k8v+++vRT9Tn
48X+i6/R8/rjCn0nCdidvejcHTtDQkUhjp5Y6pnnK4E4xtD1lVqfYRmOp/zx
PGwG+t2yBhT6Q0xL6vMhYJtStMlNH5W8+61JQ12J1KdY34YLJnhxd9I+x1dc
rpXeyGgKb2JYU/kWCGkwNNZuJmwd9C40oLp9TtjtMc2QdGt3ZRmZxthsVmrt
tV1gTo24/8qpCqotZkVQRlckk0LrR7sosfEQlTTPKd8LmxZRHMm3I1PjprLs
LZSBINYT9DNTJpoUwzjHqyfi3vodgtU3A0CjDbt07TjIIuWx7DUkRjExJiXb
8E+TWF5a8i5jJepKqEsH6lKeunxkGA7v6iwjDx0sI2XWMHQ7JaqtlNjZScjg
ipoSitN1GXhMT2EaBd4JNS0ElMASQwS+T2jI0csuwek6MDP0kVLulcvsyGxv
g0cguFtkVVe1KzG/2pWjYzONKpk5poBQU+1wK5vub2/eEyjZrfrORec38soo
v/4wMHKO5DpvfohDSBuruJvhAdbtrcXExJ3gYCLpNRsCxOguypCzdULXrs/o
mPwq5HyRKCZJSWlQQUXS3bVBiQwJTUoCr9ivAH1gIXhDm4nQa73ZAIfcYDAA
VO1ewr97EdcWckTmVKHsJvAwJv+TdQk0ALCTy3McekKc+cVLbLAHwhRuf8xy
N80sISQvh3fn/wq7+yfri1ulsWv6e2Op84KK8hl8a0/GAW67gylgr7kj66Ks
RD/B1rHOO0lgFKyyxl8Aue4ofYRCEgFywQOzqZTTZX8e8EbvNmIZsrc1RFMx
ogU8axV4RDHXDnJ5vHJ5NWv9KVupwpve70wK14rB+xVfCKhmwTPo+xg4jk9p
AERvBCwfzGOEdaC0yxwYRDKpgBEp352JgFASW3N3IlHNGutx+uV06rUo6fTE
zuE8qTCZwNE7sRnZyCz09uAumWpj46UJDyDVblGmZtfuSVI/eRCzYh3hmV1h
G0tCt4IzUokFcuiqc1dtv7lEPNOon4CagQWcwFR0T32eRFyzK8p/WHvacpS6
7GDrCoGBT6xf7pqDM446A/4RW71/sjHK3BZ6oLLWroW+JN5yGb60p05C94Z4
EdUJbf9yPrrAhV2PZYTQ2GtsskRSsXiR3gAUnSWtQUUBm5A/4OrcJewDSPEU
Q4L8l+8Dyvo2LM0JQpUBVLTEaoEMjZFWadkMrhVFUQVIXnBYLZST7CG/k17k
hFa2pp0iYyOPMYWpMHzfCUU5xsqbYvOExqQY8nZ94BQvj8rq0zZjzuJkvPUc
cKrZl0uSwCClKlLqKvuy48ZoeAnMwxfJkveMFReAlnBgxVdEgQeXqvr+6kx6
ydL07WDcWgIZHKSbbUaCCzVZnDw0auco4BSbE0rAIyuiXhQ9xRFxrKaIW1P4
0oapxHvQbqSI7bLK2HFHWaiiAyjHRhwbXevVIrvy0WfXgZelRozOLgnFsTYM
3C85VUIaMwZyjGQJtXIOEUpGAw8ldzZmpV4fgUGgoVbUcqZ1MNouGoVgEzX0
tKvl3LgmpRREt9Kull1SSTXOgM6wr5Z0T+o0ro47sovbw3WnBvMqSTEVtax8
+v6YswZIlVwmUeAKTfUP1DTAatdtSeZRztDCfsI4C4U4sd0GsavCteGrENUG
cfMRVzMj3S3XYzqiWLpkX/IaNNx3Q/y6f1DKEtmf85ItJQQ0Crm4i0tomdHq
fbKWngoKcV6uOFDmMlI73WDiugkXFlw01Jccm9Q4/Iy/o8DHzHvcn2eMXzCh
O9Ni90u/wZGcLlmvj2YtgAOkCqOWsCQgR8XNhIAfvaM06vjsPTEzWIYYTDBG
C6HEzB4MahdqDZoALdcDnzvqkqHMzo+xATgDCnPME87Nzco9uBCJOqkc8fok
l8Uu85wq4C8XsVLxqkKjzWI/NuA4pCroZFE2YimLxRQboa4i8z2dodvakDrZ
8NSebLZ9N0OQRZj4jbfs9SPX/N7PIRktmPSQpClyA+MNMiYrJFcFZjjsqgxB
bE4FIJpCbMvgM3FtjK7oewJQ3z54jld9ceIePHvx3HVCPwbtYPdYfAcjXpm7
/xtQk1egB1GAtheVY2EAukBTHztOuASNkneiIuoOKrK+8bI9+LiIG9jo+wY4
7uxBogRTGDFc5D1Ir9YCWzqCZizvseBZUVEVUpB3YAbDwvkzGKMiNuhTWsL9
KLkfCtc/lvvGU467HWx5jSDUFKcO9KO3WlhA67gteRHS5kvjlfpb+JqV3/Ql
ssIfiUNcMIhcCPuYPTxeMychPs3ymq1jABgYJSg61HpCiG/vqU+4mkcH/QQ3
2WkUF51CtVbIzbRm5tApFVjrko8p1rMCUApptBRvV9n2j/l2rGDrAjDuEtIT
VasVPtAjCVV/Jb4qaOQYEtK1IAQ3ES46sqRtplKdo3wNglt2y8Z6JJxy+k4J
c6fc211fuH8bvSw9hidl7QFU3pFwa4qMIOECxhvVf65i4caSLs2CvsTA5fMl
qlMc6XtPtb/WAFmcFH4ihiaV5AKuGaGgt8AJx5xvWrdqp3pBy/DVBItmNiOM
EQ7AdebAmLCd/Nuz6xvppU3fYQKGTyHfBdIA86bWSK1eZdJTQDqKRR30uFV3
qMUkD5I3z72f17Ub42bXkjfmzSXOCubUUEUgSNvNo7Y3siN97Gx0MVrTxaQC
2kP6BmVuN92PPOEOZjRNXB+zoR1g9CUpqjWzluKhlbfSSe9U3/3tt11X9n53
dzfAftD8bV8WyZoU6qdUJyudBvusHOx9D0f7BZPKKSt9LcauTuirFagfFL3h
qwlifJVoLCYHfVxymssv0nqNdm1p6AWYCFj9JGEbK3nwcbXrlvR0APL7Zcrd
vJjQ+EvSqO7/mrpew0ceNPdP4nbYf/Iy1i4hLKXWl2rdgv6iW+CMhL3ve/JV
UeSDigo4D7gIvFVlq9SnVr9WjhdGd+NiiB66FDX8dNSKtHb+3PjsE+fvOCjg
rOuVJJ/42k4cSD9RiDECurH9mtUADjVemLtNV4Z3C2vqMbAOpLDRBJM2wELn
jt4wq6szfLUzTXIuun6LQk4CI1JjF3cUZNMZv0EOeG+FX3OH2vItJmhLv/8O
ZNFaZ21XrJU8+2AYz5LiA35t3McEnWT6GMGwSj7My1v7gSXICUyc6mvsRJP8
kSmxWDOQKClpUmzhgkIA7Manm7ZTMU9rkFhgO5+gEbFYcpY9sHZkSCigGssn
k74fzZg4/CJBCZyA9B75Cmpsy/k2q35P9L/8x/+Y5wY4ddpTb0HmNlb/iuGC
Km/Qkn2LLLjANFJYr5SvQvmpRP/O6ySr5hiJCVl4WHKCd6mmxqR4U9408v6J
/wVJKTSLRHIAAA==

-->

</rfc>
