Network Working Group V. Dvojmoc
Internet-Draft Apartma Matevz / CM
Intended status: Informational 15 November 2026
Expires: 19 May 2027
Depth and Fanout Bounding for Agent-to-Agent Discovery Forwarding
draft-dvojmoc-reception-forwarding-limits-00
Abstract
This document describes a mechanism, deployed in production as
part of the "AI Docking Port" discovery protocol, for bounding the
traffic cost of stateless agent-to-agent forwarding across a
network of independent nodes with no central registry. When a
node forwards a request to its neighbors, and those neighbors may
forward again, request cost grows as fanout^depth; absent an
explicit bound this cost is paid by relaying operators rather than
the requester. This document specifies two operator-controlled
limits, max_depth and max_fanout, published in a node's discovery
manifest, and the forwarding behavior they constrain. It is
submitted for discussion as a possible contribution to ongoing
community work on agent discovery and invocation protocols,
including the W3C Community Group "AI Agent Protocol".
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/.
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 19 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.
Dvojmoc Expires 19 May 2027 [Page 1]
Internet-Draft Depth/Fanout Bounding for Forwarding November 2026
Table of Contents
1. Introduction
2. Terminology
3. Problem Statement
4. Mechanism Overview
4.1. Depth is an Operator Ceiling, Not a Client Parameter
4.2. Fanout is the Real Tunable Lever
4.3. Neighbor Lists are Curated, Not Discovered
5. Manifest Fields
5.1. limits_default.max_depth
5.2. limits_default.max_fanout
5.3. Example
6. Relation to Client-Walked Discovery Mechanisms
7. Security Considerations
8. Privacy Considerations
9. IANA Considerations
10. Implementation Status
11. References
11.1. Normative References
11.2. Informative References
Acknowledgements
Author's Address
1. Introduction
Several current and proposed mechanisms allow an AI agent to
discover a service provider it has not previously integrated with,
using a well-known, domain-anchored document rather than a central
registry (e.g. [W3C-AI-AGENT-PROTOCOL]). Where such discovery is
itself delegated server-side -- a node, on receiving a request it
cannot answer locally, forwards that request to other nodes it
knows, which may do the same in turn -- the traffic cost of a
single incoming request is not bounded by default.
This document describes a forwarding-limit mechanism designed and
deployed as part of the "AI Docking Port" project's Reception
layer, operating in production since 2026-10. It is offered here
as a candidate building block for any protocol that performs
server-side forwarding between independently operated nodes,
including as a possible addition to the W3C Community Group "AI
Agent Protocol" draft, which at the time of writing does not yet
specify a cost-bounding mechanism for this case.
2. Terminology
Node: An independently operated service that answers discovery
requests about itself, and optionally forwards requests it
cannot answer to other nodes it knows ("neighbors").
Hop: One forwarding step from a node to one of its neighbors.
Depth: The maximum number of sequential hops a single original
request may travel before forwarding must stop.
Fanout: The number of neighbors a node queries, in parallel, for
a single incoming request it forwards.
Reception: The forwarding behavior described in this document, as
implemented by the AI Docking Port project.
Dvojmoc Expires 19 May 2027 [Page 2]
Internet-Draft Depth/Fanout Bounding for Forwarding November 2026
3. Problem Statement
In a server-side forwarding design, a node that cannot answer a
request locally may relay it to its known neighbors on the
requester's behalf. If each node that receives a forwarded
request may itself forward to its own neighbors, the number of
downstream requests triggered by one original request grows as
fanout^depth. A small, legitimate agent request can therefore
turn into a disproportionate amount of network traffic, and the
cost of that traffic is paid by the relaying operators along the
path, not by the original requester or the agent that sent the
request.
This is distinct from, and not solved by, mechanisms in which the
client itself walks a list of known node domains and queries each
one directly (e.g. the VRP "peers" extension [VRP-PEERS]). In a
client-walked design, each node answers only for itself and the
cost of every fetch is paid by the walking client; no node ever
relays on another node's behalf, so there is no fanout multiplier.
The mechanism in this document addresses the server-side relay
case specifically, where that distinction does not hold.
4. Mechanism Overview
4.1. Depth is an Operator Ceiling, Not a Client Parameter
Each node fixes its own maximum forwarding depth as part of its
deployment configuration. This value is NOT settable by the
requesting agent and is not varied by geography, query type, or
any other request attribute. In practice, depth 0 (the node
answers from its own data) and depth 1 (the node forwards once, to
its immediate neighbors) are the only values that matter; a design
allowing deeper chains gains little additional reach while
multiplying cost, and was rejected during the design of the
reference implementation for exactly this reason.
4.2. Fanout is the Real Tunable Lever
Where depth is deliberately left coarse, max_fanout is the
parameter operators are expected to actually tune. It bounds how
many neighbors a single forwarding node queries in parallel for
one incoming request. Candidate neighbors SHOULD be ordered by
relevance to the original request (e.g. geographic proximity for a
location-bound query) before the fanout cap is applied, so that
the limited budget is spent on the most useful candidates first.
4.3. Neighbor Lists are Curated, Not Discovered
A node's list of neighbors is maintained out-of-band by its
operator (e.g. a locally held `nodes.json`), not discovered
automatically and not published in a shared, queryable registry.
Dvojmoc Expires 19 May 2027 [Page 3]
Internet-Draft Depth/Fanout Bounding for Forwarding November 2026
This keeps the trust relationship implied by forwarding (I will
relay on this neighbor's behalf) an explicit, reversible decision
made by a human operator, consistent with the no-central-registry
property shared with [W3C-AI-AGENT-PROTOCOL] and [VRP-CORE].
5. Manifest Fields
A node publishes its limits as part of its discovery manifest
(reference implementation: `.well-known/cm-ai-docking-port.json`).
5.1. limits_default.max_depth
Integer. The maximum number of sequential forwarding hops this
node will participate in for a single original request, counting
the node's own answer as depth 0. Operator-fixed; not accepted as
a request parameter from the agent.
5.2. limits_default.max_fanout
Integer. The maximum number of neighbors this node will query in
parallel when forwarding a single request it cannot answer
locally. Operator-fixed; not accepted as a request parameter from
the agent.
5.3. Example
{
"limits_default": {
"max_depth": 2,
"max_fanout": 2
}
}
(The reference implementation at the time of writing runs with
max_depth 2 and max_fanout 2; the fanout value is largely
theoretical today, as the live node has only one real neighbor.)
6. Relation to Client-Walked Discovery Mechanisms
Protocols in which a client itself walks a published list of node
domains -- for example the Vacation Rental Protocol's experimental
`peers` extension [VRP-PEERS], where a node names other domains it
knows and an agent, index, or search engine walks them directly --
bound a structurally different risk: the client's own sequential
fetch budget, not a server-side amplification factor. A node that
would not accept max_depth 3 on its own Reception endpoint (which
would risk cascading load across other operators) can safely
appear as an entry in a depth-3 client walk, because no node
relays on another's behalf in that design. Implementers combining
Dvojmoc Expires 19 May 2027 [Page 4]
Internet-Draft Depth/Fanout Bounding for Forwarding November 2026
both mechanisms should not treat the two "depth" numbers as
comparable or expect them to converge.
7. Security Considerations
Without an enforced max_depth and max_fanout, a network of
forwarding nodes is exposed to amplification: a single small
request can be multiplied into a disproportionate volume of
downstream requests, which may be usable as a denial-of-service
vector against relaying operators even absent malicious intent on
the part of the original requester. Enforcing both limits at the
forwarding node, server-side, regardless of any value the
requesting agent attempts to supply, is REQUIRED for safe
deployment of this mechanism. Operators SHOULD also apply ordinary
rate limiting independent of these caps.
8. Privacy Considerations
Forwarding necessarily discloses the existence and content of a
request to the operator of each neighbor node queried. Operators
SHOULD only forward requests consistent with what they would be
willing to disclose to any curated neighbor, and SHOULD document
this in their own privacy-facing materials.
9. IANA Considerations
This document has no IANA actions.
10. Implementation Status
[Note to RFC Editor: Please remove this section before
publication, per RFC 7942.]
This mechanism is implemented and running in production as part of
the AI Docking Port project's Reception layer, on a real,
independently reachable node, since 2026-10. A second,
independently operated node for multi-node testing exists as of
2026-11. No other independent implementation is known at the time
of writing; wider implementation experience is invited.
11. References
11.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997.
Dvojmoc Expires 19 May 2027 [Page 5]
Internet-Draft Depth/Fanout Bounding for Forwarding November 2026
11.2. Informative References
[W3C-AI-AGENT-PROTOCOL]
W3C Community Group, "AI Agent Protocol",
.
[VRP-CORE]
Abbas, R., "Vacation Rental Protocol (VRP) Core v0.1",
.
[VRP-PEERS]
Abbas, R., "VRP peers v0.1 (Experimental)",
.
[DVOJMOC-JOURNAL]
Dvojmoc, V., "CM AI Docking Port: From Experiment to
Protocol for Connected Systems", 7 October 2026,
.
Acknowledgements
The author thanks Rouiada Abbas, author of the Vacation Rental
Protocol, for independent review of the depth/fanout reasoning in
this document and for identifying the distinction described in
Section 6, and the chairs of the W3C Community Group "AI Agent
Protocol" for their consideration of this mechanism as a possible
contribution to that group's work.
Author's Address
Viljem Dvojmoc
Apartma Matevz
Email: viljem.d@gmail.com
URI: https://apartmamatevz.si
Dvojmoc Expires 19 May 2027 [Page 6]