Skip to main content

Media over QUIC Relay Fabric Protocol
draft-evens-moq-fabric-00

Document Type Active Internet-Draft (individual)
Author Tim Evens
Last updated 2026-11-18
RFC stream (None)
Intended RFC status (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date (None)
Responsible AD (None)
Send notices to (None)
draft-evens-moq-fabric-00
Media Over QUIC                                                 T. Evens
Internet-Draft                                                     Cisco
Intended status: Standards Track                        18 November 2026
Expires: 22 May 2027

                 Media over QUIC Relay Fabric Protocol
                       draft-evens-moq-fabric-00

Abstract

   This document defines moq-fabric, the relay fabric protocol used by
   Media over QUIC ([MOQT]) relays to exchange node, announce, and
   subscribe information and to forward objects between relays.  The
   fabric is split into control peering and data peering.  Control
   peering stays established and carries the information bases.  Data
   peering carries objects and MAY be pre-established or opened on
   demand.  The two functions MAY share one QUIC session or use separate
   sessions.  A fabric session uses mutual TLS, together with an
   OPTIONAL token for authentication and authorization, before the peers
   exchange fabric state.

About This Document

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

   The latest revision of this draft can be found at
   https://timevens.github.io/draft-evens-moq-fabric/draft-evens-moq-
   fabric.html.  Status information for this document may be found at
   https://datatracker.ietf.org/doc/draft-evens-moq-fabric/.

   Discussion of this document takes place on the Media Over QUIC
   Working Group mailing list (mailto:moq@ietf.org), which is archived
   at https://mailarchive.ietf.org/arch/browse/moq/.  Subscribe at
   https://www.ietf.org/mailman/listinfo/moq/.

   Source for this draft and an issue tracker can be found at
   https://github.com/TimEvens/draft-evens-moq-fabric.

Status of This Memo

   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/.

Evens                      Expires 22 May 2027                  [Page 1]
Internet-Draft                 moq-fabric                  November 2026

   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 22 May 2027.

Copyright Notice

   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.  Code Components
   extracted from this document must include Revised BSD License text as
   described in Section 4.e of the Trust Legal Provisions and are
   provided without warranty as described in the Revised BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   4
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Overview  . . . . . . . . . . . . . . . . . . . . . . . . . .   5
     3.1.  Relay Types . . . . . . . . . . . . . . . . . . . . . . .   6
       3.1.1.  Via . . . . . . . . . . . . . . . . . . . . . . . . .   6
       3.1.2.  Edge  . . . . . . . . . . . . . . . . . . . . . . . .   7
       3.1.3.  Stub  . . . . . . . . . . . . . . . . . . . . . . . .   7
     3.2.  Relay Roles . . . . . . . . . . . . . . . . . . . . . . .   7
     3.3.  Topologies  . . . . . . . . . . . . . . . . . . . . . . .   8
     3.4.  End-to-End Example  . . . . . . . . . . . . . . . . . . .   8
   4.  Fabric Sessions . . . . . . . . . . . . . . . . . . . . . . .   9
     4.1.  Control Peering . . . . . . . . . . . . . . . . . . . . .   9
     4.2.  Data Peering  . . . . . . . . . . . . . . . . . . . . . .  10
     4.3.  Same Session or Separate Sessions . . . . . . . . . . . .  10
     4.4.  Pre-established and On-demand Data Peering  . . . . . . .  11
     4.5.  What Each Session Exchanges . . . . . . . . . . . . . . .  11
   5.  Information Bases . . . . . . . . . . . . . . . . . . . . . .  12
     5.1.  Node Information Base . . . . . . . . . . . . . . . . . .  12
       5.1.1.  Node ID . . . . . . . . . . . . . . . . . . . . . . .  13
       5.1.2.  Node Attributes . . . . . . . . . . . . . . . . . . .  13
       5.1.3.  Node Path . . . . . . . . . . . . . . . . . . . . . .  14
     5.2.  Announce Information Base . . . . . . . . . . . . . . . .  15
     5.3.  Subscribe Information Base  . . . . . . . . . . . . . . .  15
     5.4.  Forwarding Information Base . . . . . . . . . . . . . . .  18
     5.5.  Subscriber Node Set . . . . . . . . . . . . . . . . . . .  19

Evens                      Expires 22 May 2027                  [Page 2]
Internet-Draft                 moq-fabric                  November 2026

   6.  Names and Hashes  . . . . . . . . . . . . . . . . . . . . . .  20
   7.  Connection Establishment  . . . . . . . . . . . . . . . . . .  21
     7.1.  Transport . . . . . . . . . . . . . . . . . . . . . . . .  21
     7.2.  Authentication  . . . . . . . . . . . . . . . . . . . . .  21
     7.3.  Handshake Messages  . . . . . . . . . . . . . . . . . . .  23
   8.  Path Selection  . . . . . . . . . . . . . . . . . . . . . . .  23
   9.  Data Forwarding . . . . . . . . . . . . . . . . . . . . . . .  24
     9.1.  Pipeline Forwarding . . . . . . . . . . . . . . . . . . .  25
     9.2.  Opening a Flow  . . . . . . . . . . . . . . . . . . . . .  25
     9.3.  Path Changes and Stopped Flows  . . . . . . . . . . . . .  26
   10. Message Encoding  . . . . . . . . . . . . . . . . . . . . . .  27
     10.1.  Variable-Length Integers . . . . . . . . . . . . . . . .  27
     10.2.  Common Header  . . . . . . . . . . . . . . . . . . . . .  27
     10.3.  Message Types  . . . . . . . . . . . . . . . . . . . . .  28
     10.4.  Node Information . . . . . . . . . . . . . . . . . . . .  29
     10.5.  CONNECT  . . . . . . . . . . . . . . . . . . . . . . . .  29
     10.6.  CONNECT_RESPONSE . . . . . . . . . . . . . . . . . . . .  30
     10.7.  Node Advertisement and Withdrawal  . . . . . . . . . . .  31
     10.8.  Subscribe Information  . . . . . . . . . . . . . . . . .  31
     10.9.  Announce Information . . . . . . . . . . . . . . . . . .  33
     10.10. Subscriber Node Set  . . . . . . . . . . . . . . . . . .  34
     10.11. Data Headers . . . . . . . . . . . . . . . . . . . . . .  34
       10.11.1.  Datagram  . . . . . . . . . . . . . . . . . . . . .  35
       10.11.2.  New Stream  . . . . . . . . . . . . . . . . . . . .  36
       10.11.3.  Existing Stream Bytes . . . . . . . . . . . . . . .  36
   11. Error Handling  . . . . . . . . . . . . . . . . . . . . . . .  36
   12. Operational Considerations  . . . . . . . . . . . . . . . . .  38
     12.1.  Redirecting Clients  . . . . . . . . . . . . . . . . . .  38
     12.2.  Subscribe Churn  . . . . . . . . . . . . . . . . . . . .  38
   13. Security Considerations . . . . . . . . . . . . . . . . . . .  38
   14. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  39
     14.1.  ALPN Identification  . . . . . . . . . . . . . . . . . .  39
     14.2.  Fabric Registries  . . . . . . . . . . . . . . . . . . .  40
       14.2.1.  Message Type Registry  . . . . . . . . . . . . . . .  40
       14.2.2.  Session Modes  . . . . . . . . . . . . . . . . . . .  40
       14.2.3.  Node Type Registry . . . . . . . . . . . . . . . . .  40
       14.2.4.  Response Codes . . . . . . . . . . . . . . . . . . .  40
       14.2.5.  QUIC Application Error Codes . . . . . . . . . . . .  40
   15. Normative References  . . . . . . . . . . . . . . . . . . . .  40
   Appendix A.  Acknowledgments  . . . . . . . . . . . . . . . . . .  41
   Author's Address  . . . . . . . . . . . . . . . . . . . . . . . .  41

Evens                      Expires 22 May 2027                  [Page 3]
Internet-Draft                 moq-fabric                  November 2026

1.  Introduction

   [MOQT] defines how a client publishes and subscribes to tracks at a
   relay.  It leaves the relay-to-relay topology, the information a
   relay needs about other relays, and the encoding used to move objects
   between relays unspecified.  A deployment that floods every announce
   and subscribe on the same path used for objects couples control-plane
   state to the data path and makes traffic engineering, fan-out, and
   policy enforcement difficult.

   This document specifies moq-fabric.  Each relay keeps information
   bases that describe the nodes it can reach, the tracks that have been
   announced, and the subscribes that are active.  Relays exchange those
   bases on control peering.  They forward object bytes on data peering,
   using a subscriber node set to say which subscriber relays need the
   objects.  Each hop chooses its own next hop from the node information
   base.

   Control peering is always on for a peering relationship that
   exchanges information bases.  Data peering MAY already be up, or a
   relay MAY open it when a forwarding path needs it.  One QUIC
   connection can carry both, or the functions can use different
   connections.  Several data connections MAY exist between the same
   pair of relays.

   The QUIC handshake authenticates both endpoints with mutual TLS.  An
   OPTIONAL token authenticates and authorizes the session as well,
   before the peers exchange information bases.

2.  Terminology

   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.

   The terms Client, Server, Publisher, Subscriber, Track, Track
   Namespace, and Object are imported from [MOQT].

   Node:  A relay that participates in the fabric.  A node has a Node
      ID, a node type, and a contact address.

   Node ID:  An unsigned 64-bit identifier that is unique among the
      nodes that exchange information bases.

   Control peering:  A peering function that exchanges information

Evens                      Expires 22 May 2027                  [Page 4]
Internet-Draft                 moq-fabric                  November 2026

      bases.  It is kept established for the life of the peering
      relationship.

   Data peering:  A peering function that forwards objects.  It MAY be
      established before there is anything to send, or opened when a
      path needs it.

   Fabric session:  One QUIC connection between two nodes, used for
      control peering, data peering, or both.

   Origin relay:  The Edge node that holds the publisher, or the Edge
      parent of a Stub that holds the publisher.  This document also
      calls it an o-relay.

   Subscriber relay:  The Edge node that holds the subscriber, or the
      Edge parent of a Stub that holds the subscriber.  This document
      also calls it an s-relay.

   Via relay:  A node of type Via. This document also calls it a
      v-relay.

   Subscriber node set (SNS):  The set of subscriber-relay Node IDs that
      are to receive one flow of objects on a single data session,
      together with the session-local identifier for that set.

3.  Overview

   Relays peer over [QUIC].  A session has one bidirectional stream for
   fabric control messages.  Object bytes use unidirectional streams and
   QUIC DATAGRAM frames.  The application-layer protocol negotiation
   (ALPN) token is the ASCII string moq-fabric.

   Three session modes are negotiated in the first fabric message:

       +=======+=========+=========================================+
       | Value | Name    | What the session carries                |
       +=======+=========+=========================================+
       | 0     | Control | Information bases.  No object payloads. |
       +-------+---------+-----------------------------------------+
       | 1     | Data    | Objects, plus the session-local         |
       |       |         | subscriber node set.                    |
       +-------+---------+-----------------------------------------+
       | 2     | Both    | Information bases and objects on the    |
       |       |         | same QUIC connection.                   |
       +-------+---------+-----------------------------------------+

                       Table 1: Fabric session modes

Evens                      Expires 22 May 2027                  [Page 5]
Internet-Draft                 moq-fabric                  November 2026

   Control peering uses mode Control or mode Both.  Data peering uses
   mode Data or mode Both.  A data session still has the bidirectional
   stream, because that stream carries the connect exchange and the
   subscriber node set for that session.  A data session does not
   synchronize the information bases of other nodes.

3.1.  Relay Types

   The node type is configured for the relay and is advertised with the
   node.  A change of type requires the node to drop its fabric sessions
   and reconnect so peers learn the new type.

           +=======+======+====================================+
           | Value | Name | Behavior                           |
           +=======+======+====================================+
           | 0     | Via  | Forwards between relays.  Does not |
           |       |      | accept [MOQT] clients.             |
           +-------+------+------------------------------------+
           | 1     | Edge | Accepts [MOQT] clients and peers   |
           |       |      | with Via, Edge, and Stub nodes.    |
           +-------+------+------------------------------------+
           | 2     | Stub | Accepts local clients, dials one   |
           |       |      | or more Edge parents, and does not |
           |       |      | accept inbound fabric sessions.    |
           +-------+------+------------------------------------+

                            Table 2: Node types

3.1.1.  Via

   A Via node is an aggregation and steering hop.  It keeps the node
   information base so it can choose a next hop.  It forwards objects
   from the subscriber node set on each data session.  It does not need
   the full announce and subscribe tables in order to forward.  When a
   Via sits on the control path, it stores and propagates announce and
   subscribe information so the information bases can reach Edge nodes
   that are not directly connected.

   Via nodes are placed where many Edge nodes can share one fan-out.  An
   Edge node uses a Via when a direct mesh would duplicate too much
   traffic, violate policy, or cross a poor network path.

Evens                      Expires 22 May 2027                  [Page 6]
Internet-Draft                 moq-fabric                  November 2026

3.1.2.  Edge

   An Edge node accepts [MOQT] client sessions and fabric sessions.  It
   is the node that turns a client announce or subscribe into
   information-base state, and the node that turns received objects back
   into [MOQT] objects for local subscribers.  It computes subscriber
   node sets for the data sessions it sends on.

   An Edge node MAY sit behind a load balancer or an anycast address.
   The contact string advertised for the node is the name or address
   peers use to open a session, which MAY be the load balancer rather
   than an individual process.

3.1.3.  Stub

   A Stub node is a lightweight child of one or more Edge parents.  It
   dials those parents, uses session mode Both, and sends objects in
   both directions on the sessions it opened.  That lets a Stub sit
   behind address translation or a firewall.  A Stub does not accept
   inbound fabric sessions and is not installed in the node information
   base of any node other than its parents.

   The parent Edge regenerates announce and subscribe state with its own
   Node ID as the source.  Other relays see the parent, not the Stub.  A
   Stub that has many local subscribers still produces one fabric
   subscribe for a track at the parent.  The parent is the s-relay and
   the o-relay for the rest of the network.

   A client implementation MAY speak this protocol as a Stub instead of
   opening a [MOQT] session to an Edge.  The Edge still presents that
   client to the rest of the network as its own.

3.2.  Relay Roles

   Type and role are different.  The type is configured.  The role
   follows the clients attached to an Edge or to a Stub's parent.

   *  An origin relay is the Edge that receives a publish or announce
      from a publisher, or the Edge parent of the Stub that receives it.

   *  A subscriber relay is the Edge that receives a subscribe, or the
      Edge parent of the Stub that receives it.

   *  A Via node does not take either role.  It forwards.

   One Edge is an origin relay for some tracks and a subscriber relay
   for others at the same time.

Evens                      Expires 22 May 2027                  [Page 7]
Internet-Draft                 moq-fabric                  November 2026

3.3.  Topologies

   Path selection prefers a direct session from the origin Edge to each
   subscriber Edge when policy, loss, delay, and fan-out allow it.  This
   is a hub at the origin and a spoke to each subscriber relay.

      Publisher --> Origin Edge --+--> Subscriber Edge --> Subscriber
                                  |
                                  +--> Subscriber Edge --> Subscriber

   When several subscriber Edges share a region, or when the direct path
   is not allowed, the origin Edge forwards to a Via. The Via splits the
   same objects toward the subscriber Edges.  Further Via hops MAY be
   added to steer the network path.  Via nodes can be added or removed
   for a track without resetting the publisher's [MOQT] session.  An
   object stream already open on the previous hop drains there, as
   specified in Section 9.3.  A new stream and every datagram use the
   new hop.

   Publisher --> Origin Edge --> Via --> Subscriber Edge --> Subscriber
                                   |
                                   +----> Subscriber Edge --> Subscriber

3.4.  End-to-End Example

   A publisher and a subscriber meet through two Edges.  A Stub, when
   one is present, is hidden behind its parent Edge.

   1.  The publisher announces at an Edge, or at a Stub.  The Edge that
       owns the publisher originates an announce whose source Node ID is
       that Edge.  A Stub's parent uses its own Node ID, so the rest of
       the network does not see the Stub.  Control peering floods the
       announce.

   2.  The subscriber subscribes at an Edge, or at a Stub.  That Edge
       originates one subscribe for the track, again under its own Node
       ID.  Many local clients, including clients of a Stub, collapse to
       that one subscribe.  Control peering carries it toward the origin
       Edge.

   3.  The origin Edge matches the subscribe to the announce by the
       namespace and the full-name hash.  It selects a data session
       toward the subscriber Edge.  The session may be direct or may
       pass through one or more Via nodes.

Evens                      Expires 22 May 2027                  [Page 8]
Internet-Draft                 moq-fabric                  November 2026

   4.  The origin creates a subscriber node set on that data session.
       The set lists the subscriber Edge.  Each hop that receives the
       set chooses its own next data session and advertises the subset
       of Node IDs that use that session.

   5.  Objects follow those data sessions.  The header names the set
       identifier and the full-name hash.  The subscriber Edge removes
       the fabric header and delivers the objects to its local
       subscriber, or to the Stub on the combined session the Stub
       opened.

4.  Fabric Sessions

4.1.  Control Peering

   Control peering exchanges the node, announce, and subscribe
   information bases.  It is always on.  A node that participates in
   those bases keeps a control session up to each control peer for as
   long as that peering relationship exists.  The control session does
   not follow the path objects take.  A small set of control sessions,
   including a redundant session for availability, can serve many data
   sessions.

   There is one control relationship between two nodes.  If both nodes
   open a session in mode Control or mode Both, the session initiated by
   the node with the lower Node ID is the control session.  The other
   endpoint closes the extra control session.  Data sessions are not
   limited by this rule.

   When a control session ends, each side removes node, announce, and
   subscribe state learned only through that session and selects paths
   again.  Object state that belongs to a data session is removed when
   that data session ends.

   The initiator of a session opens one bidirectional QUIC stream and
   sends every control message on it.  CONNECT is the first message.
   The acceptor does not open a bidirectional stream.  It latches onto
   the initiator's stream and sends CONNECT_RESPONSE and later control
   messages on it.

   The initiator MAY open a replacement bidirectional stream.  The
   acceptor keeps using the current control stream until a complete,
   well-formed control message arrives on the new stream.  That message
   adopts the new stream as the control stream.  The acceptor then
   resets the previous control stream with application error
   SWITCH_NEW_STREAM when that stream is still open.  A new stream whose
   first complete message is malformed is reset, and the current control
   stream stays in use.  Two control streams are not in use at once.  A

Evens                      Expires 22 May 2027                  [Page 9]
Internet-Draft                 moq-fabric                  November 2026

   bidirectional stream that arrives at the initiator, which did not
   open it, is reset.  The initiator continues to use the stream it
   opened.

4.2.  Data Peering

   Data peering forwards object bytes.  QUIC streams opened for objects
   are unidirectional and are opened by the sender.  A session MAY carry
   objects in one direction or in both.  Both directions are REQUIRED
   for a Stub, and for any node that MUST receive return traffic on a
   connection it opened because of address translation or a firewall.
   Additional data sessions between the same pair spread object streams
   across paths that the network can load-balance.

   The bidirectional stream on a data session carries CONNECT,
   CONNECT_RESPONSE, and the subscriber node set for that session.  It
   does not carry the shared information bases.

   A subscriber node set is meaningful only on the session that will
   receive the objects.  The sender allocates the set identifier.  The
   receiver uses it to choose the next data sessions.

4.3.  Same Session or Separate Sessions

   Mode Both puts control peering and data peering on one QUIC
   connection.  The information bases and the subscriber node sets share
   that connection's control stream.  Object bytes still use
   unidirectional streams and datagrams on that connection.  A Stub uses
   this mode.

   Mode Control and mode Data split the functions.  The control session
   stays up and carries the information bases.  Each data session is a
   separate QUIC connection.  Object bytes and that session's subscriber
   node sets stay on the data connection.  A node MAY have one control
   session and zero or more data sessions toward the same peer.

      +-------------------+          +-------------------+
      | Control session   |          | One session       |
      | (always on)       |          | mode Both         |
      | modes: Control    |          | bases and objects |
      +-------------------+          +-------------------+
              |                               |
              +--> Data session (pre-set)     +--> objects and bases
              |
              +--> Data session (on demand)

Evens                      Expires 22 May 2027                 [Page 10]
Internet-Draft                 moq-fabric                  November 2026

4.4.  Pre-established and On-demand Data Peering

   Data peering has two establishment styles.

   *  Pre-established.  The data session is configured and connected
      before a subscriber needs it.  Path selection can use it
      immediately.  This is appropriate for Via hops and for Edge pairs
      that exchange objects continuously.

   *  On demand.  The data session is opened when path selection needs a
      next hop that has no data session, and it MAY be closed when no
      subscriber node set still uses it.  Control peering is not opened
      and closed this way.

   An implementation MAY use either style, or both.  Closing a data
   session does not withdraw information bases.  Closing the control
   session does.

4.5.  What Each Session Exchanges

   +======================+=================+==============+===========+
   | Message family       | Control session | Data session | Mode Both |
   +======================+=================+==============+===========+
   | CONNECT and          |       yes       |     yes      |    yes    |
   | response             |                 |              |           |
   +----------------------+-----------------+--------------+-----------+
   | Node information     |       yes       |      no      |    yes    |
   | base                 |                 |              |           |
   +----------------------+-----------------+--------------+-----------+
   | Announce             |       yes       |      no      |    yes    |
   | information base     |                 |              |           |
   +----------------------+-----------------+--------------+-----------+
   | Subscribe            |       yes       |      no      |    yes    |
   | information base     |                 |              |           |
   +----------------------+-----------------+--------------+-----------+
   | Subscriber node      |        no       |     yes      |    yes    |
   | set                  |                 |              |           |
   +----------------------+-----------------+--------------+-----------+
   | Object payloads      |        no       |     yes      |    yes    |
   +----------------------+-----------------+--------------+-----------+

                   Table 3: Messages by session function

   CONNECT on every session carries the sender's own node information so
   the peer can identify the Node ID.  That self description is not a
   dump of the node information base.  The dump follows, on a control or
   both session, after a successful response.

Evens                      Expires 22 May 2027                 [Page 11]
Internet-Draft                 moq-fabric                  November 2026

5.  Information Bases

   Information bases are the control-plane state.  Nodes advertise
   entries and withdraw them.  A relay also keeps a forwarding
   information base that it computes locally and does not advertise as a
   base of its own.  The subscriber node set is session state used by
   data forwarding.  It is specified with the bases because it names the
   subscriber relays that the bases imply.

   +============+===============+=====================================+
   | Base       | Scope         | Contents                            |
   +============+===============+=====================================+
   | Node (NIB) | Control peers | Identity, location, cost, and path  |
   |            |               | of each reachable node              |
   +------------+---------------+-------------------------------------+
   | Announce   | Control peers | Announced namespaces and tracks,    |
   | (AIB)      |               | with the origin node                |
   +------------+---------------+-------------------------------------+
   | Subscribe  | Control peers | Active subscribes, with the         |
   | (SIB)      |               | subscriber relay and its parameters |
   +------------+---------------+-------------------------------------+
   | Forwarding | Local         | Next hop chosen for a node or for   |
   | (FIB)      |               | an object flow                      |
   +------------+---------------+-------------------------------------+
   | Subscriber | One data      | Session-local id and the set of     |
   | node set   | session       | subscriber relays for one flow      |
   +------------+---------------+-------------------------------------+

               Table 4: Information bases and related state

5.1.  Node Information Base

   The node information base records how to reach other nodes.  A node
   advertises itself with an empty path.  A node that forwards an
   advertisement appends itself to the path.  The receiver stores one
   candidate per peer that advertised a given Node ID and selects one of
   those candidates as the best next hop.

   An advertisement is sent to a control peer only when all of the
   following are true:

   *  The peer's Node ID is not the Node ID being advertised.

   *  The peer's Node ID does not already appear in the path.

   *  The advertisement is new or is better than the candidate already
      stored from this session.

Evens                      Expires 22 May 2027                 [Page 12]
Internet-Draft                 moq-fabric                  November 2026

   A withdrawal of a node is propagated when that advertisement was the
   last remaining way to reach the Node ID.  While another session still
   reaches the node, the withdrawal is not forwarded.  Receipt of a
   withdrawal removes the candidate learned from that session and runs
   path selection again.

   Stub nodes are not inserted into the node information base beyond
   their parent.

5.1.1.  Node ID

   Every node that appears in the node information base MUST be
   configured with a distinct Node ID.  When two advertisements carry
   the same Node ID on different sessions, path selection keeps the
   better candidate.  Operators assign the identifier.  A deployment
   that hashes a host name or a device identifier to fill the 64-bit
   value MUST ensure the result does not collide inside the fabric.

   The textual form is <high>:<low>.  The colon is REQUIRED.  Each side
   is an unsigned 32-bit integer in decimal, or two unsigned 16-bit
   integers separated by a dot.  The two styles MAY be mixed.

               +=================+============+============+
               | Text            |       High |        Low |
               +=================+============+============+
               | 1:1             |          1 |          1 |
               +-----------------+------------+------------+
               | 1.2:1234        | 0x00010002 |       1234 |
               +-----------------+------------+------------+
               | 100.2:9001.2001 | 0x00640002 | 0x232907D1 |
               +-----------------+------------+------------+
               | 123456:789.100  |     123456 | 0x03150064 |
               +-----------------+------------+------------+

                     Table 5: Node ID textual examples

   The canonical display form is four decimal 16-bit fields,
   high.high:low.low.  Implementations use the 64-bit value on the wire.

5.1.2.  Node Attributes

   A node advertisement carries:

   Id:  The Node ID, as an unsigned 64-bit integer.

   Type:  The node type from Section 3.1.

   Contact:  An octet string that tells a peer how to open a QUIC

Evens                      Expires 22 May 2027                 [Page 13]
Internet-Draft                 moq-fabric                  November 2026

      connection to this node.  It is typically a DNS name or an address
      literal, and it MAY include a port.  The contact MAY name a load
      balancer or an anycast address.

   Longitude, Latitude:  The node location in degrees, as binary64
      values.  Policy use of these values is deployment-specific.

   Metric:  An unsigned 64-bit cost.  Lower sums are preferred.  The
      default node metric is 100.  Let M be the node metric and S the
      metric configured for one fabric session.  The cost advertised on
      that session, in a self-advertisement and in a path item this node
      appends, is max(M, S).  A session metric lower than or equal to M
      leaves the advertised cost equal to M.

   Path:  The ordered list of hops that forwarded this advertisement.
      Empty when the node advertises itself.

5.1.3.  Node Path

   Each path item records the node that forwarded the advertisement, the
   smoothed round-trip time of the session on which that node received
   it, and the metric that node advertised on the session that carried
   the hop.

    +=========+======+===============================================+
    | Field   | Size | Meaning                                       |
    +=========+======+===============================================+
    | Node ID |    8 | Node that appended this item                  |
    +---------+------+-----------------------------------------------+
    | SRTT    |    8 | Smoothed round-trip time, in microseconds, of |
    |         |      | the session the advertisement was received on |
    +---------+------+-----------------------------------------------+
    | Metric  |    8 | Metric advertised by that node on the session |
    |         |      | used for this hop                             |
    +---------+------+-----------------------------------------------+

                         Table 6: Node path item

   The path supports two decisions.  A node refuses to forward an
   advertisement to a Node ID that is already listed, which stops loops.
   Path selection uses the length of the path, the sum of the metrics,
   and the sum of the smoothed round-trip times.

   Sum of metrics is the advertised node metric plus the metric in every
   path item.  A direct advertisement has an empty path, so its sum is
   the node metric alone.  Sum of SRTT is the sum of the SRTT fields.  A
   direct advertisement has sum zero.

Evens                      Expires 22 May 2027                 [Page 14]
Internet-Draft                 moq-fabric                  November 2026

5.2.  Announce Information Base

   The announce information base records namespaces and tracks that
   publishers have announced.  An Edge or Stub originates an entry when
   a local publisher announces.  The source Node ID is the Edge that
   owns the publisher.  A Stub's parent uses its own Node ID.

   An entry is either a single track or a namespace that covers many
   tracks.  Both kinds carry the namespace tuples.  A namespace entry
   has an empty track name.  Receivers index entries by the full-name
   hash and by successive namespace-tuple hashes so a later subscribe
   can find a matching announce.  The full-name hash is checked against
   those octets as defined in Section 10.9.

   Announce state is flooded on control peering, subject to policy.  A
   relay MAY drop an announcement on input or on output.  A subscriber
   relay uses the entries it keeps to answer a [MOQT] subscriber and to
   learn publisher parameters that were conveyed by the local [MOQT]
   stack.  Relays that only forward fabric messages use the hash and the
   source Node ID.

   A withdrawal is sent when the publisher unannounces.  The withdrawal
   is propagated on control peering the same way as the advertisement.
   Duplicate advertisements for the same source and full-name hash are
   not forwarded again.

5.3.  Subscribe Information Base

   The subscribe information base records active subscribes.  The
   subscriber relay originates an entry when it accepts a [MOQT]
   subscribe, or when its Stub child sends one.  The source Node ID is
   that Edge.  One entry represents the subscriber relay, not each local
   client.  Many clients on one Edge collapse to one fabric subscribe
   per track.  Different subscribe parameters do not create another
   entry.  A later update replaces the parameters of that same entry.

   Each advertisement and withdrawal of an entry carries a 16-bit epoch
   and a 16-bit sequence number.  The epoch names the counter.  The
   sequence number orders updates of that same counter and is used only
   to detect a delayed update.  Neither value is part of the entry
   identity.  The entry identity is the source Node ID and the track.
   The source increments the sequence number by one for each update of
   that entry, wrapping from 65535 to 0, and leaves the epoch unchanged.
   That wrap is a continuation.  A reset is not a wrap.  The source
   increments the epoch by one, wrapping from 65535 to 0, and starts the
   sequence at 0.  Intermediate nodes forward the epoch and the sequence
   unchanged.

Evens                      Expires 22 May 2027                 [Page 15]
Internet-Draft                 moq-fabric                  November 2026

   A receiver stores the epoch and the greatest sequence number it has
   accepted in that epoch for that source and track.  Withdrawing the
   entry removes the subscribe and updates the forwarding information
   base, and the receiver keeps that epoch and sequence number while the
   source is still reachable.  Sequence numbers are compared only when
   the epochs are equal.  A later advertisement or withdrawal in the
   same epoch is accepted only when its sequence number is greater,
   except for the equal advertisement described below.  When a message
   in the same epoch arrives with a lower sequence number, that message
   is a delayed update and MUST be ignored, because a greater sequence
   number was already received.  An equal sequence number in the same
   epoch MUST be ignored while the entry is present, and MUST be ignored
   after the receiver has accepted a withdrawal for that sequence.  This
   stops a delayed advertisement from restoring a subscribe that was
   withdrawn.  An equal advertisement in the same epoch MUST be accepted
   when the entry was removed because the source became unreachable and
   the receiver has not accepted a withdrawal at that sequence.  That
   advertisement resumes the same subscribe.  The comparison uses the
   unsigned distance (received - stored) mod 65536.  A distance of 1
   through 32767 means the received sequence is greater, so after the
   counter wraps inside the same epoch, 0 is greater than 65535.  A
   distance of 32768 through 65535 means the received sequence is lower.
   A distance of 0 means the sequences are equal.

   A different epoch is a different counter.  The receiver MUST NOT
   compare its sequence number with the retained sequence.  Epoch 1
   sequence 0 is not a continuation of epoch 0 sequence 65535, even
   though the sequence distance from 65535 to 0 is 1.  While the
   receiver retains an epoch, an advertisement or withdrawal with any
   other epoch MUST be ignored and MUST NOT cancel the retention
   interval.  When the receiver holds no epoch for that source and
   track, the message is a new baseline and both values are stored.

   When a receiver removes a source Node ID from its node information
   base and no remaining session reaches that source, the receiver
   starts a retention interval for the epoch and sequence numbers of
   that source.  The interval is 30 seconds and is not negotiated.  The
   receiver counts those 30 seconds from the moment it removes the
   source.  Receivers do not share a clock.  A receiver that removes the
   source later starts its interval later, and its interval can still be
   running after another receiver has discarded the same sequences.  A
   withdrawal that leaves the source reachable through another session
   MUST NOT start an interval and MUST NOT discard the sequences.  If
   that withdrawal never makes the source unreachable, because a newer
   node advertisement has already installed another session, no interval
   starts from it.

Evens                      Expires 22 May 2027                 [Page 16]
Internet-Draft                 moq-fabric                  November 2026

   While an interval runs, the retained epoch and sequences stay in
   force.  The source becoming reachable again does not cancel the
   interval and does not move its deadline earlier or later.  A greater
   sequence number in the same epoch means the source continued its
   counter, including a wrap from 65535 to 0.  The receiver MUST cancel
   the interval and keep that sequence.  A different epoch does not.  If
   the interval is not cancelled, the receiver MUST discard the retained
   epoch and sequences when it ends.  The next advertisement for that
   source is then a new baseline, and its epoch and sequence number are
   stored even when the counter has started over.

   A source that still has the last epoch and sequence number it sent
   MUST continue from those values as soon as it returns.  It MUST NOT
   wait, it MUST NOT change the epoch, and it MUST NOT start the
   sequence over.  The age of the saved values does not matter.  A
   continuation uses the same epoch, so a receiver accepts it whether or
   not that receiver's interval has ended.

   A source that does not have the last epoch and sequence number it
   sent has reset the counter.  It increments the epoch and starts the
   sequence at 0.  It counts its wait from the moment it restarts.
   Restart is the moment the source is ready to open fabric sessions,
   not the moment any receiver removes it.  There is no bound on how
   late a node withdrawal can arrive.  A receiver can remove the source
   after the restart, and its retention interval can still be running
   after any fixed pair of baselines.  If those baselines arrived while
   the old sequence was retained, they were ignored, and nothing remains
   to be delivered when the interval ends.  The source therefore MUST
   NOT stop after a scheduled number of transmissions.

   The source MUST NOT send a subscribe advertisement or a subscribe
   withdrawal until 30 seconds after that restart.  It MAY send node
   advertisements during the wait, so receivers can observe that it is
   back.  When the wait ends, the source MUST send the current subscribe
   state of each entry it still holds.  It MUST send that current state
   again at least once every 30 seconds for as long as the entry exists.
   Each of those sends is an update in the new epoch: the source
   increments the sequence number by one even when the parameters are
   unchanged, and it does not increment the epoch again.  An equal
   retransmission would be ignored by a peer that already has the entry,
   and that peer would not forward it.  A later receiver that had
   discarded the old sequence would then see nothing.  When the source
   withdraws the entry, it stops this repetition and sends the
   withdrawal with the next sequence number in that epoch.

   A receiver that still retains the old epoch MUST ignore these
   updates, whatever their sequence numbers are, and MUST NOT forward
   them.  The modular sequence test does not apply across epochs, so a

Evens                      Expires 22 May 2027                 [Page 17]
Internet-Draft                 moq-fabric                  November 2026

   reset sequence of 0 does not become acceptable merely because the
   retained sequence is 65535.  When that receiver's own interval ends
   it discards the retained epoch and sequences, however long after the
   restart that is.  It then has no stored epoch.  The next of these
   updates is a new baseline, and the receiver MUST forward it.  A
   receiver that has already accepted the new counter MUST accept the
   following update, because its sequence number is greater, and MUST
   forward it.  The repetition runs until the entry is withdrawn, so a
   removal that happens long after the restart is still followed by an
   update the receiver can accept.  A source that has never sent a
   subscribe sequence is not resetting a counter.  It starts at epoch 0
   and MAY send the first advertisement immediately, and it does not
   repeat that advertisement on this timer.

   The entry carries the track hashes, the subscribe parameters, and the
   namespace and track-name octets.  The octets let the origin relay
   construct the [MOQT] subscribe toward the publisher.  Other relays
   can forward the entry without interpreting the name.  A receiver MUST
   recompute the hashes from the name octets and MUST treat a mismatch
   as a malformed message.

   Policy MAY filter subscribe advertisements the way it filters
   announces.  An origin relay that never receives a subscribe does not
   forward objects for it.  That is how a deployment keeps a publisher
   inside a region or a service class.

   On receipt, the origin relay compares the subscribe with the announce
   information base.  Tuple hashes are compared in order.  A shorter
   namespace matches when each of its tuples equals the corresponding
   tuple of the longer name.  An exact track match uses the full-name
   hash.  A match causes the origin relay to subscribe toward the
   publisher, if it has not already, and to build a subscriber node set
   toward the source node of the subscribe.

   A withdrawal removes the entry and updates the forwarding information
   base.  The receiver keeps the epoch and sequence number for the
   retention rules in Section 5.3.  The source node sends the withdrawal
   when its local subscribers for that track are gone.

5.4.  Forwarding Information Base

   The forwarding information base is local.  It is not encoded as an
   information-base message.

Evens                      Expires 22 May 2027                 [Page 18]
Internet-Draft                 moq-fabric                  November 2026

   For each remote Node ID the node keeps the fabric session that path
   selection chose.  For each object flow the node keeps the mapping
   from an ingress subscriber-node-set identifier to the egress session
   and the egress identifier.  A local subscriber is represented by a
   zero session identifier and a zero set identifier, which means the
   object is delivered to the [MOQT] stack on this node.

   The table is updated when a node advertisement changes the best
   session, when a subscribe is added or removed, and when a subscriber
   node set arrives.  An object stream that is already open keeps its
   previous egress until that stream ends.  A new stream, and every
   datagram, uses the session currently in the table.  Section 9.3
   states when forwarding stops.

5.5.  Subscriber Node Set

   The subscriber node set is the data-plane description of who needs a
   flow.  It lists subscriber-relay Node IDs.  It does not list the hops
   between them.  Each hop looks those Node IDs up in the node
   information base and chooses the next data session.

   The sender allocates a 32-bit identifier for the set on the session
   that will carry the objects.  The identifier starts at 1 and
   increases.  It MAY skip values.  It wraps to 1 after 4294967294.
   Zero is reserved and means "no set".  The same identifier is updated
   in place when subscribers are added or removed, so object streams
   that already cite the identifier stay valid.

   The set is advertised on the control stream of the data session, or
   of the combined session, that will receive the objects.  It is not
   propagated as an information base.  When the receiving node is itself
   listed, it delivers matching objects to local subscribers, using the
   full-name hash carried on the object header.  For every other Node ID
   in the set, it builds an egress set toward the chosen next hop and
   advertises that egress set on that next session.

   A withdrawal retires one identifier on that session.  Ending the
   session retires every identifier learned on it.

   Objects MAY arrive before the set advertisement that names their
   identifier.  The receiver SHOULD hold those objects until the
   advertisement arrives, and MUST discard them if the session ends or
   the identifier is withdrawn first.

Evens                      Expires 22 May 2027                 [Page 19]
Internet-Draft                 moq-fabric                  November 2026

6.  Names and Hashes

   Namespace tuples and track names are opaque octet strings, in the
   same order [MOQT] uses.  Relays hash them so that forwarding state
   and object headers stay fixed size.

   The hash function is CityHash64 [CITYHASH] over the octet string.  An
   empty string hashes as CityHash64 of zero octets.

   The namespace hash is computed one tuple at a time, in tuple order.
   An empty namespace hashes as CityHash64 of zero octets.  The hash of
   the first tuple is CityHash64 of that tuple's octets, so a namespace
   of one tuple has the same hash as that tuple.  Each following tuple
   updates the hash.  The previous hash is encoded as 8 octets in
   network byte order and placed before the next tuple's octets, and
   CityHash64 of that sequence replaces the hash:

 namespace_hash(tuples):
     if tuples is empty:
         return CityHash64 of zero octets
     h = CityHash64 of the first tuple
     for each following tuple:
         h = CityHash64 of (h as 8 octets, most significant octet first,
                            followed by the tuple octets)
     return h

                        Figure 1: Namespace hash

   Each tuple stays on its own boundary.  The hash of ("a", "bc")
   differs from the hash of ("ab", "c"), and the hash of ("a", "b")
   differs from the hash of ("b", "a").

   The name hash is CityHash64 of the track-name octets.  The full-name
   hash combines those two values, starting from zero:

   hash_combine(seed, value):
       seed = seed XOR (value + 0x9e3779b9 + (seed << 6) + (value >> 2))
       all arithmetic is modulo 2^64

   full_name_hash = 0
   hash_combine(full_name_hash, namespace_hash)
   hash_combine(full_name_hash, name_hash)

                          Figure 2: Full-name hash

Evens                      Expires 22 May 2027                 [Page 20]
Internet-Draft                 moq-fabric                  November 2026

   Prefix matching compares the CityHash64 of each tuple by itself, in
   order.  The chained namespace hash is the namespace input to the
   full-name hash.  A namespace A is a prefix of namespace B when A has
   no more tuples than B and each tuple hash of A equals the tuple hash
   of B at the same index.

   CityHash64 has a 64-bit output, so distinct names can share a hash.
   Recomputing a hash from the octets in the same message and comparing
   it with the hash field detects a malformed message.  Two different
   names that produce one hash stay one forwarding key.

   The forwarding identity of a track is its full-name hash.  Announce
   entries, subscribe entries, and object delivery match on that hash.
   Prefix matching matches on tuple hashes.  Two different octet strings
   with the same hash are the same key.  A node MUST keep one entry for
   that hash and MUST handle the announces, subscribes, and objects
   under it as one track.  The name octets travel with announce and
   subscribe messages so an endpoint can rebuild the [MOQT] name.
   Forwarding does not use those octets as a second identity.

7.  Connection Establishment

7.1.  Transport

   The connection uses [QUIC] with the TLS handshake specified by
   [QUIC-TLS].  Implementations MUST NOT negotiate a TLS version older
   than TLS 1.3 [TLS].  The ALPN token MUST be moq-fabric.

   Either node MAY open the connection.  The node that opens it is the
   initiator and sends CONNECT.  The node that accepts it sends
   CONNECT_RESPONSE.

7.2.  Authentication

   Authentication and authorization are part of session setup and finish
   before information bases are exchanged.  Every session uses mutual
   TLS.  A deployment MAY also use a token for authentication and
   authorization.  The token is OPTIONAL.  When the acceptor's policy
   does not require one, the mutual TLS identity is sufficient to
   authorize the session.

   *  Each node presents a certificate in the TLS handshake and MUST
      authenticate the peer.

   *  The initiator MUST NOT send CONNECT until the handshake has
      completed and the peer certificate has been accepted.

Evens                      Expires 22 May 2027                 [Page 21]
Internet-Draft                 moq-fabric                  November 2026

   *  The acceptor MUST NOT send fabric messages, and MUST NOT accept
      CONNECT, until it has authenticated the initiator.

   *  A failed mutual TLS authentication closes the QUIC connection.  No
      information-base state is created.

   *  When a token is used, the initiator places it in CONNECT.  The
      acceptor checks it before accepting the session.  The token MAY
      identify the peer and MAY authorize the Node ID and the requested
      session mode.

   *  A missing token that the policy requires, a token that fails
      authentication, or a token that does not authorize the session is
      rejected with response code Not Authorized.  The acceptor then
      closes the connection.  No information-base state is created.

   Certificate material is configuration.  Fabric messages do not carry
   certificates or private keys, and implementations MUST NOT embed that
   material in source.  Before use, the certificate MUST satisfy all of
   the following:

   *  The current time is within the certificate validity period.

   *  The signature uses SHA-256 or a stronger hash.  MD5 and SHA-1
      signatures MUST be rejected.

   *  An RSA key is at least 2048 bits.  An elliptic-curve key uses
      P-256 or a stronger curve.

   *  The certificate chains to a trust anchor configured for this
      fabric, or matches a peer credential that was configured
      explicitly.

   A self-signed certificate is suitable only where every peer is
   configured to trust that exact certificate, such as a laboratory or a
   closed relay domain.  It is not a substitute for a trust anchor on an
   open network.

   Mutual TLS establishes the peer identity.  CONNECT carries the Node
   ID, the requested session mode, and the OPTIONAL token.  The acceptor
   binds the Node ID to the mutual TLS identity and, when a token is
   present, to that token.  A Node ID that the policy does not allow for
   that identity is rejected with response code Not Authorized.  A
   requested mode that the policy does not allow is rejected with
   response code Fabric Mode Not Allowed.  The token is an opaque octet
   string.  Its format and the authority that issues it are deployment
   policy.  Implementations MUST NOT embed tokens in source.

Evens                      Expires 22 May 2027                 [Page 22]
Internet-Draft                 moq-fabric                  November 2026

   Deployments SHOULD use the key-exchange groups provided by their QUIC
   stack for TLS 1.3, including a hybrid post-quantum group when the
   stack and the peer both support one.  Signature algorithms and
   certificate keys remain the ones listed above.

7.3.  Handshake Messages

   After the QUIC handshake, the initiator opens the control stream and
   sends CONNECT.  The message contains the session mode, the
   initiator's own node information with an empty path, and the OPTIONAL
   authentication and authorization token.  The acceptor evaluates the
   mutual TLS identity and that token, then responds with
   CONNECT_RESPONSE.  On success the response contains the acceptor's
   own node information, again with an empty path.  On failure the
   response contains only the response code, and the acceptor closes the
   connection.

   A control session or a mode Both session then synchronizes state.
   Each side sends the node, announce, and subscribe entries it is
   willing to advertise to that peer.  The two directions are
   independent and MAY occur in either order.  A data session does not
   send that synchronization.  It sends subscriber node sets later, as
   object flows are created.

      Initiator                         Acceptor
         |                                 |
         |-------- QUIC + mutual TLS ----->|
         |                                 |
         |-------- CONNECT --------------->|  OPTIONAL token
         |<------- CONNECT_RESPONSE -------|
         |                                 |
         |==== information bases =========>|   (Control or Both only)
         |<=== information bases ==========|

8.  Path Selection

   For each Node ID, the node compares the candidates advertised by its
   sessions.  The first of these tests that differs chooses the
   candidate:

   1.  Lower selection cost.  The cost is the sum of metrics carried in
       the advertisement, plus max(0, S - M) for the session that would
       be the next hop.  M is the selecting node's metric and S is the
       metric configured on that next-hop session.  Each metric inside
       the sum is the advertised cost written by the node that sent that
       hop, the greater of that node's metric and the session metric it
       used.  When S is lower than or equal to M, the added term is
       zero.

Evens                      Expires 22 May 2027                 [Page 23]
Internet-Draft                 moq-fabric                  November 2026

   2.  Fewer path items.

   3.  Lower sum of smoothed round-trip times.

   When all three are equal, the node keeps the candidate it already
   selected.  A repeated advertisement does not move existing object
   streams.

   Changing a session metric recomputes the affected paths and re-
   advertises the local node, and the other nodes known on that session,
   with the new cost.

   The inputs available to selection grow over time.  Load, geographic
   policy, and reachability probes can refine the metric that a node
   advertises.  This document fixes the comparison order so those
   refinements have a stable effect: they change the metric or the
   measured delay, and every node applies the same three tests.

9.  Data Forwarding

   Objects move from the origin relay to each subscriber relay.
   Intermediate Via nodes do not parse [MOQT] object payloads.  They
   read the fabric header, look up the subscriber node set, and write
   the same payload bytes on the next sessions.  The origin and
   subscriber relays are the points that convert between [MOQT] and this
   encapsulation.

   The origin relay builds one subscriber node set per egress data
   session.  The set contains the subscriber relays whose best path uses
   that session.  The origin then sends the objects on that session with
   the set identifier in the fabric header.

   A Via or Edge that receives the set splits it.  Node IDs that share
   the same next hop are placed in one egress set.  The egress set is
   advertised on that next session with a new session-local identifier,
   and the node records the mapping from the ingress identifier to that
   egress identifier.  If the node's own Node ID is in the set, the
   full-name hash in the object header selects the local [MOQT]
   subscribers.  The fabric header is removed before those bytes are
   handed to [MOQT].

Evens                      Expires 22 May 2027                 [Page 24]
Internet-Draft                 moq-fabric                  November 2026

        Publisher
           |  MOQT objects
           v
        Origin Edge
           |  SNS 1 = { s-relay A, s-relay B }
           v
        Via
           |  SNS 7 = { s-relay A }          SNS 8 = { s-relay B }
           +----------------+----------------+
           v                                 v
        s-relay A                          s-relay B
           |  MOQT objects                    |  MOQT objects
           v                                  v
        Subscribers                        Subscribers

9.1.  Pipeline Forwarding

   Datagram objects are forwarded as whole datagrams.  A datagram that
   does not fit the next hop is dropped.  This protocol does not
   fragment datagrams.  Publishers that need to cross a smaller maximum
   transmission unit send objects on streams, or send datagrams that fit
   the smallest hop.

   A stream is pipelined.  The first bytes of a new unidirectional
   stream carry a fabric header.  Every following byte on that stream is
   payload and is written through without a further fabric header.  A
   relay does not reassemble the [MOQT] object before forwarding.
   Reassembly is the subscriber's job, and the job of a relay that has
   chosen to cache.  A caching relay acts as a [MOQT] subscriber and
   publisher on that track.

   A new [MOQT] group or subgroup arrives as a new QUIC stream.  The
   relay mirrors that transition: the new stream gets a new fabric
   header, and the previous stream ends.  One active fabric stream
   represents the current stream for that flow on a session.

   The time-to-live in a new-stream header applies to the objects on
   that stream.  The timer for an object starts when the object is
   received.  The priority in that header is the priority of the egress
   QUIC stream and the priority offered to local [MOQT] subscribers.

9.2.  Opening a Flow

   When the origin relay has both a publisher and at least one matching
   subscribe, it:

   1.  Groups the subscriber relays by the data session path selection
       chose.

Evens                      Expires 22 May 2027                 [Page 25]
Internet-Draft                 moq-fabric                  November 2026

   2.  Allocates a subscriber node set identifier on each of those
       sessions and advertises the set.

   3.  Sends object bytes with that identifier in the header.

   A later subscribe that uses an existing session is added to the
   existing set, under the same identifier.  A subscribe that is the
   last one on a session withdraws the identifier.

9.3.  Path Changes and Stopped Flows

   An open object stream stays on the egress session that accepted it.
   A datagram and a new stream use the session path selection has chosen
   now.  The node does not open a replacement stream for bytes already
   in flight.  The next [MOQT] group or subgroup is a new stream and
   takes the new path.

   Forwarding of new objects toward a subscriber stops when that
   subscriber is removed from the set, when its subscribe is withdrawn,
   or when the egress session is no longer the selected next hop.  If
   that egress has no open stream for the flow, the node drops the
   egress at once.  When the set no longer names any subscriber on that
   session, the node withdraws the subscriber node set identifier there.
   If the egress still has an open stream, the node marks the egress
   draining.  Bytes that continue that stream are still written.  A
   datagram or a new stream skips a draining egress.  When the stream
   ends, the node drops the egress and withdraws the set identifier if
   no subscriber remains on it.

   A subscriber node set withdrawal retires that identifier.  The
   receiver stops forwarding new objects for it, finishes the streams it
   opened for that set, and discards objects it was holding for the
   identifier.  An identifier that has been withdrawn, or that was never
   advertised on the session, is stale.  The receiver MUST discard
   objects that cite a stale identifier, and it MUST NOT create an
   egress for one.  Objects that arrive before the first advertisement
   of an identifier are the case in Section 5.5: they are held, and they
   are discarded if the session ends or the identifier is withdrawn
   first.

   If the egress session fails before a draining stream ends, the stream
   ends with the session.  The node removes that egress and every set
   identifier learned on the session.  It does not rebuild the
   interrupted stream.  A later new stream uses a session that path
   selection still considers available.

Evens                      Expires 22 May 2027                 [Page 26]
Internet-Draft                 moq-fabric                  November 2026

10.  Message Encoding

   Octets are sent in network byte order.  Unless a field states
   otherwise, multi-byte integers are unsigned and big-endian.  A
   binary64 value is the IEEE 754 encoding of that floating-point
   number, also big-endian.

   Diagrams name a field and the size in octets. varint is the variable-
   length integer defined in Section 10.1.  A field in brackets is
   present only when the condition in the text is met.  A repeated field
   continues until the enclosing message length is exhausted, unless a
   count is given.

10.1.  Variable-Length Integers

   A varint MUST use the variable-length integer encoding in [MOQT],
   Section 8.1.  The number of leading 1 bits in the first octet gives
   the length.  An encoding is one to nine octets and represents an
   unsigned integer of up to 64 bits.  A sender MAY use any encoding
   length that can represent the value.  A receiver MUST accept any such
   encoding.

10.2.  Common Header

   Every control message begins with this header.  Object payloads do
   not.

   Common Header {
     Protocol Version (1) = 1,
     Message Type (2),
     Message Length (4),
   }

                          Figure 3: Common header

   Protocol Version is 1.  A receiver that does not support the version
   MUST close the connection.

   Message Length is the number of octets after the header.  It does not
   include the seven header octets.  A receiver assembles a message by
   reading the header and then exactly Message Length octets.  Control
   messages are concatenated on the bidirectional stream.

Evens                      Expires 22 May 2027                 [Page 27]
Internet-Draft                 moq-fabric                  November 2026

10.3.  Message Types

         +======+========================+=======================+
         | Type | Name                   | Carried on            |
         +======+========================+=======================+
         |    1 | CONNECT                | Control stream, first |
         |      |                        | from initiator        |
         +------+------------------------+-----------------------+
         |    2 | CONNECT_RESPONSE       | Control stream, first |
         |      |                        | from acceptor         |
         +------+------------------------+-----------------------+
         |    3 | DATA_OBJECT            | Reserved.  Not sent   |
         |      |                        | as a control message. |
         +------+------------------------+-----------------------+
         |    4 | NODE_INFO_ADV          | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |    5 | NODE_INFO_WD           | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |    6 | SUBSCRIBE_INFO_ADV     | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |    7 | SUBSCRIBE_INFO_WD      | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |    8 | ANNOUNCE_INFO_ADV      | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |    9 | ANNOUNCE_INFO_WD       | Control or Both       |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |   10 | SUBSCRIBE_NODE_SET_ADV | Data session, or Both |
         |      |                        | session               |
         +------+------------------------+-----------------------+
         |   11 | SUBSCRIBE_NODE_SET_WD  | Data session, or Both |
         |      |                        | session               |
         +------+------------------------+-----------------------+

                       Table 7: Control message types

   Message type 0, message type 3, and any type that is not assigned in
   the table are unknown.  An unknown type is a connection error,
   application error INVALID_CTRL_MSG_TYPE.

Evens                      Expires 22 May 2027                 [Page 28]
Internet-Draft                 moq-fabric                  November 2026

10.4.  Node Information

   Node information is embedded in CONNECT and CONNECT_RESPONSE and is
   the body of the node advertisement and withdrawal messages.  The path
   occupies whatever remains of the enclosing length.  The number of
   path items is that remainder divided by 24.  A remainder that is not
   a multiple of 24 is a malformed message.

   Node Info {
     Node ID (8),
     Node Type (1),
     Contact Length (varint),
     Contact (..),
     Longitude (8),
     Latitude (8),
     Metric (8),
     Path Item (..) ...,
   }

   Path Item {
     Node ID (8),
     SRTT Microseconds (8),
     Metric (8),
   }

                         Figure 4: Node information

   Node Type is a value from Section 3.1.  Any other value is malformed.
   An unknown type in CONNECT is rejected with response code Connect
   Error, and the acceptor then closes the connection.  An unknown type
   in CONNECT_RESPONSE makes the initiator close the connection, and no
   information-base state is created.  An unknown type in a node
   advertisement or withdrawal is a connection error, application error
   INVALID_ENCODING.  Contact Length is a Section 10.1 count of the
   following octets.

10.5.  CONNECT

   CONNECT is the first message on the control stream.  Any other first
   message is a connection error.

Evens                      Expires 22 May 2027                 [Page 29]
Internet-Draft                 moq-fabric                  November 2026

   CONNECT Message {
     Common Header (type = 1),
     Peer Mode (1),
     Token Present (1),
     [Token Length (varint),
      Token (..)],
     Node Info (..),
   }

                             Figure 5: CONNECT

   Peer Mode is a value from the session mode table.  Any other value is
   rejected with response code Fabric Mode Not Allowed, and the acceptor
   then closes the connection.  Token Present is 1 when a token follows
   and 0 when mutual TLS alone is used.  Any other value is a malformed
   message.  Token Length is a Section 10.1 count of the following token
   octets.  The token is opaque.  Node Info describes the initiator and
   has an empty path.  The token fields come before Node Info so the
   node path can still occupy the remainder of the message.

10.6.  CONNECT_RESPONSE

   CONNECT_RESPONSE is the first message the acceptor sends.  Creating a
   unidirectional stream before it arrives is a connection error.

   CONNECT_RESPONSE Message {
     Common Header (type = 2),
     Response Code (2),
     [Node Info (..)],
   }

                         Figure 6: CONNECT_RESPONSE

   Node Info is present only when Response Code is 0.  It describes the
   acceptor and has an empty path.

Evens                      Expires 22 May 2027                 [Page 30]
Internet-Draft                 moq-fabric                  November 2026

   +======+================+==========================================+
   | Code | Name           | Meaning                                  |
   +======+================+==========================================+
   |    0 | No Error       | The session is accepted.                 |
   +------+----------------+------------------------------------------+
   |    1 | Connect Error  | The connect request cannot be completed. |
   +------+----------------+------------------------------------------+
   |    2 | Not Authorized | The authenticated identity is not        |
   |      |                | allowed.                                 |
   +------+----------------+------------------------------------------+
   |    3 | Fabric Mode    | The requested session mode is not        |
   |      | Not Allowed    | allowed.                                 |
   +------+----------------+------------------------------------------+

                         Table 8: Response codes

10.7.  Node Advertisement and Withdrawal

   NODE_INFO_ADV Message {
     Common Header (type = 4),
     Node Info (..),
   }

   NODE_INFO_WD Message {
     Common Header (type = 5),
     Node Info (..),
   }

                    Figure 7: Node information messages

   The withdrawal carries the same structure so the receiver can drop
   the matching candidate, including an inferior path, rather than every
   candidate for that Node ID.  The path in a withdrawal is the path of
   the candidate being removed.

10.8.  Subscribe Information

Evens                      Expires 22 May 2027                 [Page 31]
Internet-Draft                 moq-fabric                  November 2026

   SUBSCRIBE_INFO_ADV Message {
     Common Header (type = 6),
     Epoch (2),
     Sequence (2),
     Source Node ID (8),
     Namespace Hash (8),
     Name Hash (8),
     Full Name Hash (8),
     Priority (1),
     Delivery Timeout (8),
     Expires (8),
     Forward (8),
     New Group Present (1),
     [New Group Request ID (8)],
     Track Name (..),
   }

   SUBSCRIBE_INFO_WD Message {
     Common Header (type = 7),
     Epoch (2),
     Sequence (2),
     Source Node ID (8),
     Namespace Hash (8),
     Name Hash (8),
     Full Name Hash (8),
     Priority (1),
     Delivery Timeout (8),
     Expires (8),
     Forward (8),
     New Group Present (1),
     [New Group Request ID (8)],
     Track Name (..),
   }

                  Figure 8: Subscribe information messages

   Epoch names the counter and Sequence is the delayed-update counter
   inside that epoch, as defined in Section 5.3.  A continuation leaves
   Epoch unchanged, including when Sequence wraps from 65535 to 0.  A
   reset increments Epoch and starts Sequence at 0.  Source Node ID is
   the subscriber relay.  The three hashes are defined in Section 6.
   Priority is the subscriber's priority.  Delivery Timeout and Expires
   are milliseconds.  Zero means the parameter is unset.  Forward is
   zero to pause forwarding and non-zero to forward.  New Group Present
   is 1 when New Group Request ID follows and 0 when it does not.  Any
   other value is a malformed message.

Evens                      Expires 22 May 2027                 [Page 32]
Internet-Draft                 moq-fabric                  November 2026

   Track Name {
     Tuple Count (1),
     Tuple Length (2),
     Tuple Octets (..),
     ...
     Name Length (2),
     Name Octets (..),
   }

                            Figure 9: Track name

   Tuple Count is the number of namespace tuples.  Each tuple is a
   16-bit length and that many octets.  Name Length is a 16-bit length
   of Name Octets.  Zero means those octets are empty.  Tuple Count and
   the lengths MUST fit in the message.  A count or length that runs
   past Message Length is a malformed message.  Subscribe and announce
   messages use this same structure.

10.9.  Announce Information

   ANNOUNCE_INFO_ADV Message {
     Common Header (type = 8),
     Source Node ID (8),
     Full Name Hash (8),
     Track Name (..),
     Flags (1),
   }

   ANNOUNCE_INFO_WD Message {
     Common Header (type = 9),
     Source Node ID (8),
     Full Name Hash (8),
     Track Name (..),
     Flags (1),
   }

                  Figure 10: Announce information messages

   Source Node ID is the origin relay.  Track Name is the structure in
   Figure 9.  It carries the namespace tuples and the track-name octets
   for an advertisement and for a withdrawal.  Full Name Hash is the
   full-name hash defined in Section 6.  The message does not carry the
   namespace hash or the name hash.  The receiver derives both from
   Track Name.

   Bit 0 of Flags selects the kind.  Zero is a single track.  One is a
   namespace.  All other flag bits MUST be sent as zero and MUST be
   ignored on receipt.

Evens                      Expires 22 May 2027                 [Page 33]
Internet-Draft                 moq-fabric                  November 2026

   A track announcement uses Name Octets as the track name.  Name Length
   MAY be zero, and the announcement is still a track.  A namespace
   announcement covers the tracks in the namespace given by the tuples.
   Its Name Length MUST be zero, and Name Octets MUST be empty.  A
   namespace announcement with a non-zero Name Length is a malformed
   message.

   The receiver MUST recompute the full-name hash from Track Name and
   MUST treat a mismatch with Full Name Hash as a malformed message.
   The namespace hash and the name hash are the values defined in
   Section 6.  The name hash is CityHash64 of Name Octets, which is the
   hash of zero octets when Name Length is zero.  The same check applies
   to a track announcement, a namespace announcement, an advertisement,
   and a withdrawal.

10.10.  Subscriber Node Set

   SUBSCRIBE_NODE_SET_ADV Message {
     Common Header (type = 10),
     SNS ID (4),
     Priority (1),
     Node Count (2),
     Node ID (8) ...,
   }

   SUBSCRIBE_NODE_SET_WD Message {
     Common Header (type = 11),
     SNS ID (4),
   }

                  Figure 11: Subscriber node set messages

   SNS ID is the session-local identifier.  Priority is the priority to
   apply to the flow.  Node Count is the number of following Node IDs.
   The list is a set: order is not significant, and a sender MUST NOT
   repeat a Node ID.  The receiver looks up each Node ID in the node
   information base.  Node IDs that are not known are kept with the set
   until a later node advertisement makes a next hop available, or until
   the set is withdrawn.

10.11.  Data Headers

   Object bytes are carried in QUIC DATAGRAM frames and on
   unidirectional streams.  They are not carried on the bidirectional
   control stream.

Evens                      Expires 22 May 2027                 [Page 34]
Internet-Draft                 moq-fabric                  November 2026

   A datagram and the first bytes of a new stream start with a data
   header.  Header Length counts every octet of the header, including
   itself.  The payload starts at that offset.  Header Length MUST NOT
   exceed 255, and for the types defined here it is 14 for a datagram
   and 19 for a new stream.

   Data Header {
     Header Length (1),
     Data Type (1),
     ... type-specific fields ...,
   }

                           Figure 12: Data header

       +======+=================+========+========================+
       | Type | Name            | Header | Use                    |
       |      |                 | length |                        |
       +======+=================+========+========================+
       |    0 | DATAGRAM        |     14 | One datagram object.   |
       +------+-----------------+--------+------------------------+
       |    1 | EXISTING_STREAM |   none | Not a wire value.  A   |
       |      |                 |        | received header with   |
       |      |                 |        | this type is an error. |
       +------+-----------------+--------+------------------------+
       |    2 | NEW_STREAM      |     19 | First bytes of a       |
       |      |                 |        | unidirectional stream. |
       +------+-----------------+--------+------------------------+

                           Table 9: Data types

10.11.1.  Datagram

   DATAGRAM {
     Header Length (1) = 14,
     Data Type (1) = 0,
     SNS ID (4),
     Full Name Hash (8),
     Payload (..),
   }

                         Figure 13: Datagram object

   The payload is the remainder of the QUIC datagram.  SNS ID selects
   the subscriber node set on this session.  Full Name Hash selects
   local subscribers when this node is in the set.

Evens                      Expires 22 May 2027                 [Page 35]
Internet-Draft                 moq-fabric                  November 2026

10.11.2.  New Stream

   A unidirectional stream MUST begin with NEW_STREAM.  A stream that
   does not is reset.  The header is not repeated.  Every octet after
   the header, on that stream, is payload.

   NEW_STREAM {
     Header Length (1) = 19,
     Data Type (1) = 2,
     SNS ID (4),
     Full Name Hash (8),
     Priority (1),
     TTL Milliseconds (4),
     Payload (..),
   }

                        Figure 14: New stream header

   Priority is the QUIC priority of the egress streams created from this
   stream.  TTL Milliseconds is the object lifetime described in
   Section 9.1.

10.11.3.  Existing Stream Bytes

   After NEW_STREAM, further payload on the same QUIC stream is sent
   with no fabric header.  The SNS ID, full-name hash, priority, and
   time-to-live stay those of the NEW_STREAM header that opened the
   stream.  An implementation classifies those bytes as existing-stream
   data locally.  It does not put Data Type 1 on the wire.  A stream
   whose first header has a Data Type other than 2, including type 1, is
   reset with application error INVALID_START_OF_STREAM.  A datagram
   whose Data Type is not 0 is discarded.

11.  Error Handling

   Transport failures and protocol violations close the QUIC connection
   or reset the offending stream, using an application error code.

Evens                      Expires 22 May 2027                 [Page 36]
Internet-Draft                 moq-fabric                  November 2026

    +======+=========================+============+===================+
    | Code | Name                    | Where      | Meaning           |
    +======+=========================+============+===================+
    |    1 | CLOSE                   | Connection | The endpoint is   |
    |      |                         |            | closing the       |
    |      |                         |            | session.          |
    +------+-------------------------+------------+-------------------+
    |    2 | REDIRECT                | Connection | The peer SHOULD   |
    |      |                         |            | move to another   |
    |      |                         |            | relay.            |
    +------+-------------------------+------------+-------------------+
    |    8 | NOT_AUTHORIZED          | Connection | Authentication or |
    |      |                         |            | policy refused    |
    |      |                         |            | the peer.         |
    +------+-------------------------+------------+-------------------+
    |   32 | CONNECT_MISSING         | Connection | The first control |
    |      |                         |            | message was not   |
    |      |                         |            | CONNECT.          |
    +------+-------------------------+------------+-------------------+
    |   33 | CONNECT_RESP_MISSING    | Connection | A unidirectional  |
    |      |                         |            | stream was opened |
    |      |                         |            | before            |
    |      |                         |            | CONNECT_RESPONSE. |
    +------+-------------------------+------------+-------------------+
    |   34 | INVALID_CTRL_MSG_TYPE   | Connection | The message type  |
    |      |                         |            | is unknown.       |
    +------+-------------------------+------------+-------------------+
    |   35 | INVALID_ENCODING        | Connection | A length,         |
    |      |                         | or stream  | version, or field |
    |      |                         |            | is malformed.     |
    +------+-------------------------+------------+-------------------+
    |   36 | INVALID_START_OF_STREAM | Stream     | A new stream did  |
    |      |                         |            | not start with    |
    |      |                         |            | NEW_STREAM.       |
    +------+-------------------------+------------+-------------------+
    |  128 | SWITCH_NEW_STREAM       | Stream     | The acceptor      |
    |      |                         |            | reset the         |
    |      |                         |            | previous control  |
    |      |                         |            | stream.           |
    +------+-------------------------+------------+-------------------+

                   Table 10: QUIC application error codes

   A CONNECT_RESPONSE with a non-zero response code refuses the session.
   An unknown response code is a refusal as well.  The initiator closes
   the connection and creates no information-base state.  The acceptor
   closes the connection after sending a non-zero code.  Response code 2
   corresponds to a peer that completed mutual TLS and then failed token

Evens                      Expires 22 May 2027                 [Page 37]
Internet-Draft                 moq-fabric                  November 2026

   authentication, token authorization, or the Node ID policy.  A TLS
   failure does not produce CONNECT_RESPONSE, because CONNECT is not
   sent when the handshake fails.

12.  Operational Considerations

12.1.  Redirecting Clients

   Source routing by subscriber node set works best when subscribers to
   the same track share Edge nodes.  A load balancer that spreads those
   subscribers across many Edges enlarges the set.  An Edge that sees
   the same subscribe on a nearby Edge MAY redirect the [MOQT] client
   with GOAWAY and a new connection URL, when capacity allows.  The
   information bases provide the subscribe and node data for that
   decision.

12.2.  Subscribe Churn

   A subscriber that leaves and rejoins quickly would otherwise withdraw
   and re-advertise a subscribe across the control plane.  A subscriber
   relay SHOULD delay a withdrawal for a short local interval.  If the
   client subscribes to the same track again before the interval ends,
   the relay cancels the withdrawal.  The delay is a local timer.  It is
   not negotiated and MUST be bounded so a departed subscriber does not
   keep receiving objects for long.  Five seconds is a reasonable
   default.

13.  Security Considerations

   Mutual TLS, as specified in Section 7.2, authenticates every fabric
   session.  An OPTIONAL token in CONNECT provides additional
   authentication and authorization.  A node that skips verification of
   the peer certificate accepts a session from any endpoint that
   completes the handshake and can then inject node, announce, and
   subscribe state.  Implementations MUST authenticate the peer before
   CONNECT.  A token is a credential.  Implementations MUST NOT log it,
   and they MUST treat a missing or rejected token as Not Authorized
   when local policy requires one.

   The certificate checks in Section 7.2 exclude expired credentials,
   weak public keys, and MD5 or SHA-1 signatures.  Trust anchors and any
   explicitly trusted self-signed certificates are deployment
   configuration.  A self-signed certificate used beyond a closed domain
   will not be accepted by a peer that requires a chain to a known
   anchor.

Evens                      Expires 22 May 2027                 [Page 38]
Internet-Draft                 moq-fabric                  November 2026

   The authenticated identity is bound to the Node ID in CONNECT.
   Without that binding, a peer that holds a valid certificate could
   advertise a Node ID it does not own and attract object flows.  Policy
   at the acceptor enforces the binding and returns Not Authorized when
   it fails.

   The name hashes in Section 6 are 64-bit CityHash64 forwarding keys.
   A collision merges two names into one fabric track, so objects for
   one name can be delivered on the subscribe state of the other.  A
   peer that is allowed to choose track names can attempt that
   collision.  The hash check on a subscribe or an announce accepts the
   message when the hash field matches the octets in that same message.
   A second name that hashes to a key already in use joins that same
   track.

   Control peering distributes the names of tracks and the identities of
   the relays that publish or subscribe.  Filtering announce and
   subscribe advertisements is the mechanism that keeps a track inside a
   region or a customer boundary.  A missing filter is a data leak,
   because an origin relay that learns a subscribe will forward objects
   toward that subscriber relay.

   Object payloads are opaque to intermediate relays and are protected
   by the QUIC session on each hop.  This protocol does not add a second
   encryption layer.  End-to-end confidentiality and integrity of [MOQT]
   objects are the responsibility of the application and of [MOQT], not
   of the fabric encapsulation.  Each hop can read the payload bytes it
   forwards.

   The subscriber node set tells a data peer which Edge nodes receive a
   flow.  That is visible to every hop on the data path.  Deployments
   that treat the set of receivers as sensitive keep data sessions
   inside the same trust domain that already carries the objects.

   An implementation MUST bound the memory used for information bases,
   for subscriber node sets, and for objects that arrive before their
   set advertisement.  An unbounded buffer is a denial-of-service
   vector.

14.  IANA Considerations

14.1.  ALPN Identification

   IANA is requested to add the following entry to the "TLS Application-
   Layer Protocol Negotiation (ALPN) Protocol IDs" registry:

Evens                      Expires 22 May 2027                 [Page 39]
Internet-Draft                 moq-fabric                  November 2026

      +=======================+=========================+===========+
      | Protocol              | Identification Sequence | Reference |
      +=======================+=========================+===========+
      | Media over QUIC Relay | moq-fabric              | This      |
      | Fabric Protocol       |                         | document  |
      +-----------------------+-------------------------+-----------+

                       Table 11: ALPN identification

14.2.  Fabric Registries

   IANA is requested to create a "MOQ Relay Fabric" registry group
   containing the registries below.  New registrations in each registry
   use the Specification Required policy [RFC8126].

14.2.1.  Message Type Registry

   The registry covers the 16-bit message type in the common header.
   Values 0 and 12 through 65535 are unassigned.  Values 1 through 11
   are assigned by Section 10.3.

14.2.2.  Session Modes

   The registry covers the 8-bit peer mode in CONNECT.  Values 0, 1, and
   2 are assigned by the session mode table.  Values 3 through 255 are
   unassigned.

14.2.3.  Node Type Registry

   The registry covers the 8-bit node type.  Values 0, 1, and 2 are
   assigned by Section 3.1.  Values 3 through 255 are unassigned.

14.2.4.  Response Codes

   The registry covers the 16-bit response code in CONNECT_RESPONSE.
   Values 0 through 3 are assigned by the response code table.  Values 4
   through 65535 are unassigned.

14.2.5.  QUIC Application Error Codes

   The registry covers the application error codes used with this ALPN.
   The values in the error code table are assigned by this document.
   Unlisted values are unassigned.

15.  Normative References

   [CITYHASH] Pike, G. and J. Alakuijala, "CityHash, a family of hash
              functions", 2011, <https://github.com/google/cityhash>.

Evens                      Expires 22 May 2027                 [Page 40]
Internet-Draft                 moq-fabric                  November 2026

   [MOQT]     Nandakumar, S., Vasiliev, V., Swett, I., and A. Frindell,
              "Media over QUIC Transport", Work in Progress, Internet-
              Draft, draft-ietf-moq-transport-23, 2 November 2026,
              <https://datatracker.ietf.org/doc/html/draft-ietf-moq-
              transport-23>.

   [QUIC]     Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based
              Multiplexed and Secure Transport", RFC 9000,
              DOI 10.17487/RFC9000, May 2021,
              <https://www.rfc-editor.org/rfc/rfc9000>.

   [QUIC-TLS] Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure
              QUIC", RFC 9001, DOI 10.17487/RFC9001, May 2021,
              <https://www.rfc-editor.org/rfc/rfc9001>.

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/rfc/rfc2119>.

   [RFC8126]  Cotton, M., Leiba, B., and T. Narten, "Guidelines for
              Writing an IANA Considerations Section in RFCs", BCP 26,
              RFC 8126, DOI 10.17487/RFC8126, June 2017,
              <https://www.rfc-editor.org/rfc/rfc8126>.

   [RFC8174]  Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
              2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
              May 2017, <https://www.rfc-editor.org/rfc/rfc8174>.

   [TLS]      Rescorla, E., "The Transport Layer Security (TLS) Protocol
              Version 1.3", RFC 8446, DOI 10.17487/RFC8446, August 2018,
              <https://www.rfc-editor.org/rfc/rfc8446>.

Appendix A.  Acknowledgments

   The fabric design reflected here was developed alongside the moq-
   fabric relay library.

Author's Address

   Tim Evens
   Cisco
   Email: tievens@cisco.com

Evens                      Expires 22 May 2027                 [Page 41]