Participant Relationship Protocol

Back to matrix

G01-ND: Yes

Rationale

Select a connected tree of direct Ethernet adjacencies. Every transit node has a root-prefix FIB entry listing its neighbors and the native multicast v5 strategy at /. Producers register their own names locally. For known globally scoped names without forwarding hints, longest-prefix lookup uses the local producer registration where present and otherwise /. The multicast implementation sends to eligible next hops, excluding the incoming non-ad-hoc face. Induction along the unique tree path therefore reaches each producer; signed Data returns through pending Interest records. No transit node, root node or control service needs a catalog of remote producers, names or prefixes. Set hop budget and Interest lifetime to cover the finite diameter and provision the offered load. Root-prefix neighbor lists are adjacency state, not a global reachability catalog. This is a concrete native construction permitted by the existing local-FIB profile, not NLSR or an added overlay. Flooding can consume network-wide bandwidth and PIT memory per request; G05 remains Pending and no efficient billion-device operation is asserted.

Assessment method

Constructive architecture inference from NFD 24.07 source; no NFD or scale execution

Source context

NFD multicast v5, next-hop eligibility, longest-prefix lookup and PIT Data return

Outstanding qualification

Validate a branched direct-Ethernet topology with producers in different branches, empty caches and known non-local names. Inspect FIB/RIB, PIT and producer registration at every role; exercise withdrawal and re-registration locally. No capacity claim follows.

Public sources

Editorial evidence references

The following identifiers refer to research records not included in this public package; they are not public links.