]> Cisco

United States fcalabri@cisco.com

Blue Fern Consulting

United States carlos@bluefern.consulting

Huawei

China bill.wu@huawei.com

Huawei

Italy giuseppe.fioccola@huawei.com

Apple

United States sowjredd@gmail.com

Operations and Management BPM benchmarking terminology AI training AI inference network fabric RDMA RoCEv2 UET collective communication AllReduce JCT TTFT KV cache This document defines benchmarking terminology for evaluating Ethernet-based network fabrics used in distributed Artificial Intelligence (AI) training and inference workloads. It consolidates and extends terms from "Benchmarking Terminology for Network Interconnect Devices" (RFC 1242) and "Data Center Benchmarking Terminology" (RFC 8238). Definitions cover collective communication primitives, RDMA transport mechanisms (RoCEv2 and Ultra Ethernet Transport), congestion control behaviors, AI-specific Key Performance Indicators (KPIs), and fabric topology concepts. This document is a companion to the AI training and inference fabric benchmarking methodology documents. Those documents are intended to be read together with the terminology defined here. Where definitions herein overlap with the foundational benchmarking terminology in RFC 1242 or RFC 8238, this document provides AI fabric context extensions and refinements; the foundational definitions in those RFCs remain authoritative for general network benchmarking. About This Document The latest revision of this draft can be found at . Status information for this document may be found at . Source for this draft and an issue tracker can be found at .

Introduction

Requirements Language 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 when, and only when, they appear in all capitals, as shown here.

Scope and Purpose This document defines terminology for benchmarking Ethernet-based AI network fabrics in controlled laboratory environments. The defined terms cover: distributed AI training collective communication patterns, LLM inference serving architectures, RDMA transport semantics (RoCEv2 and UET), congestion control mechanisms, fabric topology characteristics, and performance metric definitions. This document does not define acceptance criteria, performance requirements, or configuration recommendations. It does not address benchmarking of live operational networks, intra-node (NVLink/PCIe) interconnects, or storage networking.

Relationship to Existing BMWG Work This document extends the foundational BMWG terminology established in (network interconnect benchmarking terminology) and (data center benchmarking terminology). Where terms are defined in those RFCs, this document provides AI fabric context extensions; the core definitions remain as established. This document also extends the test methodology framework of and as applied in the companion AI fabric methodology documents.

Relationship to Companion Documents This document is one of three companion Internet-Drafts addressing AI fabric benchmarking:

• This document: Terminology definitions.
• : Benchmarking methodology for AI training workloads.
• : Benchmarking methodology for AI inference serving workloads.

Implementers and evaluators SHOULD read this terminology document before applying the companion methodology documents. Terms defined here are used normatively in those documents and are not redefined there unless the specific workload context introduces a substantive difference, which is noted explicitly.

General Benchmarking Terms The following terms establish the general measurement framework applicable to all AI fabric benchmarking activities. General Benchmarking Terms

Term	Definition
AI Fabric	The dedicated Ethernet backend network interconnecting accelerators (GPUs/XPUs) for distributed AI training and inference workloads. Typically implemented as a Clos (fat-tree) topology, non-blocking or oversubscribed (see Oversubscription Ratio), running RoCEv2 or UET. The AI fabric is separate from the front-end management and storage network.
DUT	Device Under Test. The network element(s) whose performance characteristics are being measured. In AI fabric benchmarking the DUT is one or more fabric elements: leaf switches, spine switches, NICs, or the complete fabric assembly.
SUT	System Under Test. The complete AI compute system including accelerators, NICs, the fabric DUT, and serving/training software, when end-to-end metrics are the measurement objective.
TG	Traffic Generator. Test equipment capable of generating and receiving network traffic at specified rates with nanosecond-resolution timestamping sufficient for the measurements defined in the companion methodology documents.
JFI	Jain's Fairness Index. A scalar measure of flow-level throughput fairness across n flows : JFI = (Σxᵢ)² / (n · Σxᵢ²) where xᵢ is the throughput of flow i. A value of 1.0 indicates perfect fairness; lower values indicate disparity. SHOULD be reported alongside throughput measurements for all multi-flow AI fabric tests.
Offered Load	The total traffic rate presented to the DUT from test equipment, expressed as a fraction of line rate (0–100%) or as absolute bit/s. Offered load is controlled independently of DUT absorption, enabling characterization of saturation behavior.
Trial Duration	The time interval over which a single measurement is conducted. For AI fabric tests, the RECOMMENDED minimum is 60 seconds for throughput tests and 300 seconds for congestion and stability sub-tests, per the methodology in as extended in the companion methodology documents. Soak tests use a substantially longer duration (minimum 24 hours) per the Soak Test definition in .
Warmup Period	A pre-measurement interval, used when specified by a test procedure, during which traffic is sent but results are not recorded. Ensures adaptive routing tables, PFC watermarks, and DCQCN/UET congestion controllers reach steady state before measurement begins. RECOMMENDED minimum: 10 seconds.
Binary Search	An iterative test procedure for determining the maximum offered load at which a DUT meets a specified acceptance criterion (e.g., zero packet loss). The search halves the candidate load range at each iteration, converging to a resolution of 0.1% offered load within 10 iterations, assuming an initial search range of 0-100% offered load.
Percentile Latency	A latency statistic expressing that the specified fraction of all measured latency samples fall at or below the reported value. Denoted Pxx (e.g., P50, P95, P99, P99.9). Tail latency (P99 and above) is especially relevant for AI fabric benchmarking because SLO violations are determined by worst-case, not median, performance.
Observation Point	The location at which a reported value is obtained. Three classes are distinguished: (a) the Fabric DUT Boundary, observed by test equipment or at the NIC Ethernet port; (b) counters or telemetry read from the DUT, such as egress queue occupancy, ECN-marked packet counts, or PFC PAUSE counts on a switch port; and (c) an endpoint software boundary, such as RDMA verb posting, completion queue polling, or the application request/response boundary. Values obtained at different Observation Points are not interchangeable, even when they carry the same name, and are not combined into a single reported value. Reports MUST state the Observation Point of each reported value. For class (b), the report also states the port, direction (ingress or egress), and traffic class to which the value applies, and labels the value as DUT-reported. DUT-reported values come from the DUT itself and are not independently verified by test equipment; states the conditions under which they are used.

Collective Communication Terms The following terms define the collective communication operations that are the primary traffic sources in distributed AI workloads. Collective Communication Terms

Term	Definition
Collective Operation	A coordinated communication pattern executed simultaneously across all accelerators in a training or inference group. Core collectives: AllReduce (gradient aggregation), AllGather (parameter distribution), ReduceScatter (partial reduction + scatter), and AllToAll (expert dispatch in MoE models).
AllReduce	A collective in which each participant contributes a tensor and all participants receive the element-wise sum (or other reduction) of all contributions. The dominant communication primitive in data-parallel and tensor-parallel training. BusBW is the primary KPI.
AllGather	A collective in which each participant contributes a shard of a tensor and all participants receive the concatenation of all shards. Used in tensor-parallel layer sharding to reconstruct distributed activations or parameters.
ReduceScatter	A collective combining an element-wise reduction with a scatter, so each participant receives a distinct slice of the reduced result. Used in ZeRO-stage optimizer strategies and as the first half of a ring-AllReduce.
AllToAll	A collective in which each participant sends a distinct payload to every other participant and receives a distinct payload from every other participant. The critical collective for Mixture-of-Experts token dispatch. Generates N(N−1) independent point-to-point flows for N participants.
Ring Algorithm	An AllReduce (or AllGather/ReduceScatter) algorithm structured as a logical ring of participants. Each participant sends to its right neighbor and receives from its left neighbor, taking N−1 steps for AllGather or ReduceScatter alone, and 2(N−1) steps for AllReduce (a ReduceScatter phase followed by an AllGather phase). Ring AllReduce transfers 2(N−1)/N times the message size per accelerator (the AllReduce algo_factor in the BusBW definition), approaching 2× for large N, and is bandwidth-optimal. Standard baseline for BusBW calculation.
BusBW	The effective data throughput per accelerator during a collective operation, computed as: BusBW = (data_size × algo_factor) / time algo_factor is a fixed normalization constant defined per collective type below (derived from the ideal ring algorithm for AllReduce, AllGather, and ReduceScatter; representing the non-local data fraction for AllToAll), applied regardless of the algorithm actually selected by the collective library at runtime. This makes BusBW algorithm-invariant: the same hardware moving the same data volume in the same time yields the same BusBW whether the library selects ring, tree, or recursive doubling. The algo_factor calculation MUST conform to the formula specified here. Collective algo_factor AllReduce 2 × (n−1) / n AllGather (n−1) / n ReduceScatter (n−1) / n AllToAll (n−1) / n n = number of participating accelerators. Worked example — AllReduce, n=8, data_size=1 GB, time=10 ms: algo_factor = 2 × (8−1) / 8 = 1.75 BusBW = (1 GB × 1.75) / 10 ms = 175 GB/s Reports MUST state: collective type, algo_factor value, collective library name and version, and n. The algorithm actually selected by the library SHOULD be reported as diagnostic information when known. Units: GB/s or Gbps; reports MUST state which.
CCL	Collective Communication Library. A software library providing optimized implementations of collective operations (AllReduce, AllGather, etc.) over a specific transport. The CCL implementation MUST be documented in the test report.
SPMD	Single Program Multiple Data. The execution model underlying bulk-synchronous distributed training, in which all accelerators execute identical computation on distinct data partitions, synchronizing at collective barriers between steps.
Bulk Synchronous Parallel (BSP)	A distributed computation model structured as alternating compute and communicate phases with a global synchronization barrier between phases. Standard training workloads follow BSP: forward pass → backward pass → AllReduce gradient sync → optimizer step.

Distributed Parallelism Strategy Terms The following terms define the parallelism strategies used in distributed AI model training and inference, which determine traffic patterns and fabric requirements. Distributed Parallelism Strategy Terms

Term	Definition
Data Parallelism (DP)	A distributed training strategy replicating the full model on each accelerator, partitioning the training dataset across replicas. Gradient synchronization after each backward pass requires an AllReduce across all DP ranks. Memory-efficient for small models; communication overhead scales with parameter count.
Tensor Parallelism (TP)	A distributed training and inference strategy partitioning individual weight matrices across multiple accelerators. Each rank computes a partial result; AllGather or ReduceScatter collectives are required within each layer to aggregate results. Dominant parallelism within a node (intra-node).
Pipeline Parallelism (PP)	A distributed strategy assigning contiguous groups of transformer layers to distinct stages (accelerators or nodes). Each stage processes one microbatch and forwards activations to the next stage. Generates point-to-point inter-stage traffic across the fabric (activations and gradients).
Expert Parallelism (EP)	A parallelism strategy for Mixture-of-Experts models distributing expert sub-networks across accelerators. Each token is routed to its designated experts (typically top-K of E total experts), requiring AllToAll communication for dispatch. Wide EP (e.g., 96-way) generates dense inter-node AllToAll at every MoE layer.
MoE	Mixture of Experts. A transformer architecture replacing dense feed-forward layers with a set of E expert sub-networks, of which only top-K experts (K commonly ranges from 2 to 8 depending on the architecture) are activated per token via a learned router. MoE enables large model capacity with sub-linear compute, but introduces AllToAll communication requirements proportional to E and sequence length.
DP Attention	Data Parallelism applied to the attention computation, where the KV cache is partitioned across data-parallel ranks. Each rank holds 1/DP_SIZE of the KV cache; AllToAll communication exchanges attention outputs. Used in inference to reduce per-accelerator memory footprint for long contexts.
ZeRO	Zero Redundancy Optimizer . A memory optimization strategy for data-parallel training that shards model states (parameters, gradients, optimizer states) across DP ranks instead of replicating them. Stage 1 shards optimizer states; Stage 2 adds gradient sharding; Stage 3 adds parameter sharding. Each stage increases AllGather/ReduceScatter communication.

Network Transport Terms

RoCEv2 and RDMA Terms The following terms define RDMA and RoCEv2 transport semantics as used in AI fabric benchmarking. UET, PDC, and ROD are included here for direct comparison with their RoCEv2 counterparts; full UET-specific terms are defined in . RoCEv2 and RDMA Terms

Term	Definition
RDMA	Remote Direct Memory Access. A transport mechanism enabling direct memory-to-memory data transfer between hosts without involving the destination CPU, providing zero-copy semantics and kernel bypass. Implementations include InfiniBand Verbs (native IB), iWARP (RDMA over TCP), and RoCEv2 (RDMA over Converged Ethernet v2).
RoCEv2	RDMA over Converged Ethernet version 2. An RDMA transport encapsulating InfiniBand transport layer (BTH) over UDP/IP, enabling RDMA semantics on standard Ethernet infrastructure. Reliable Connected (RC) mode recovers packet loss via PSN-based retransmission, so losslessness is a performance necessity rather than a strict correctness requirement; lossless fabric operation (PFC or equivalent) is nonetheless the deployed norm because loss-driven retransmission incurs a substantial latency and throughput penalty at scale (cf. loss-resilient RoCE variants such as Improved RoCE NIC (IRN)). Standardized in IBTA InfiniBand Architecture Volume 1, Annex A17 (RoCEv2, September 2014) ; transported over UDP destination port 4791.
QP	Queue Pair. The fundamental RDMA communication endpoint comprising a Send Queue (SQ) and Receive Queue (RQ). QPs are connection-oriented in Reliable Connected (RC) mode. Multiple QPs per source-destination pair are used to increase ECMP entropy in fabric load balancing.
Reliable Connected (RC)	An RDMA QP transport service type providing reliable, in-order delivery between exactly two endpoints. The primary QP type for AI collective operations via RoCEv2. Requires connection setup before data transfer and maintains per-QP state for retransmission.
RDMA Verb	An operation primitive of the RDMA programming model. Key verbs: SEND/RECV (two-sided, receiver must post a buffer), WRITE (one-sided, target memory written directly), READ (one-sided, remote memory read), and Atomic (compare-and-swap, fetch-and-add). AI collectives predominantly use WRITE and SEND.
UET	Ultra Ethernet Transport. A transport protocol defined by the Ultra Ethernet Consortium (UEC) Specification 1.0 as a next-generation AI/HPC fabric transport. UET uses lightweight, in-band connection setup (no separate handshake round-trip) rather than RoCEv2-style pre-established connections, and supports native packet spraying (RUD), and integrates multipath load balancing and congestion control. Transported over UDP destination port 4793, IANA-assigned to Ultra Ethernet Transport.
PDC	Packet Delivery Context. The ephemeral, lightweight transport endpoint in UET, analogous to but distinct from an RDMA Queue Pair. PDCs establish state in-band, with setup piggybacked on the first data packet rather than a separate handshake round-trip, enabling low-latency initiation and reduced per-flow state in the NIC and switch.
ROD	Reliable Ordered Delivery. A UET transport service providing reliable, in-order packet delivery, semantically equivalent to RoCEv2 RC mode. Suitable for legacy RDMA applications requiring strict ordering guarantees.

Ultra Ethernet Transport (UET) Terms The following terms define UET-specific concepts introduced by the Ultra Ethernet Consortium (UEC) Specification 1.0 . Ultra Ethernet Transport (UET) Terms

Term	Definition
RUD	Reliable Unordered Delivery. A UET transport service providing reliable delivery without maintaining packet order across paths. Enables native packet spraying across ECMP paths without reorder-buffer overhead at the receiver NIC. The preferred UET service class for AI training collectives.
RUDI	Reliable Unordered Delivery for Idempotent operations. A UET transport service optimized for operations safe to execute more than once (e.g., RDMA Writes to non-accumulating targets), allowing simplified retransmission logic with reduced state overhead.
UUD	Unreliable Unordered Delivery. A UET transport service providing best-effort, unordered packet delivery with minimal overhead. Suitable for telemetry, speculative operations, or workloads with application-layer loss tolerance.
UEC Profile	A defined subset of UET features targeting a specific use case: AI Base (core AI training/inference, mandatory feature set), AI Full (AI Base plus deferred send, exact-match tagging, extended atomics), or HPC (latency-optimized for traditional HPC workloads with fine-grained synchronization).
LLR	Link Layer Retry. An optional UEC link-layer enhancement providing fast per-hop error recovery at the Ethernet link layer. LLR detects symbol errors at the FEC level and replays the affected frame from a local replay buffer instead of dropping it, reducing the frequency of transport-layer retransmission and improving tail latency.
Packet Trimming	An optional UEC network-layer behavior in which a congested switch, rather than dropping the full packet, forwards only the packet header (trimmed packet) toward the receiver. Trimming enables the receiver to detect loss and initiate selective retransmission more rapidly, reducing bandwidth waste versus silent drop.
PRI	Packet Rate Improvement. An optional UEC link-layer feature that compresses redundant Ethernet and IP header fields on a link, reducing per-packet overhead and increasing the effective packet rate, particularly for the small packets characteristic of AI/HPC synchronization traffic.
CBFC	Credit-Based Flow Control. An optional UEC link-layer buffer management mechanism using explicit credit grants from downstream to upstream devices. CBFC provides backpressure without transmitting PFC PAUSE frames, eliminating the head-of-line blocking and storm propagation risks associated with PFC.
Entropy Value	Carried in the UDP source port field when UDP encapsulation is used (or the equivalent-position PDS Entropy Header field in IP-only mode), used to distribute packets of a single message across available ECMP paths. Unlike RoCEv2's fixed-per-connection source port, UET varies this field per packet, providing explicit spray entropy as part of the standard IP 5-tuple. Enables hardware-assisted packet spraying using existing ECMP hashing without requiring transport-layer state in the switch.
GIN	GPU-Initiated Networking. A communication paradigm in which GPU threads directly initiate network RDMA operations (sends, one-sided writes/reads) to the NIC hardware without CPU involvement, eliminating the CPU-GPU synchronization round-trip. GIN predates UEC and is not specific to UET; established implementations include NVSHMEM and InfiniBand GPUDirect Async (IBGDA) on RDMA/RoCEv2 fabrics. Reduces effective latency for fine-grained operations; the saving is implementation- and platform-dependent and is not fixed by this definition.
KVTL	KV Cache Transfer Library. A term of art used by this document set for a software library providing standardized point-to-point data transfer primitives (register, transfer, notify) for inference engines, abstracting underlying transport mechanisms (intra-node interconnect, RDMA, PCIe, storage interfaces); it is not itself specific to UET or to any single transport. Comparable production libraries with similar goals include NVIDIA NIXL, Mooncake TransferEngine, and LMCache. Enables transport-agnostic KV cache migration in disaggregated serving architectures.

UET Transport Services Comparison UET Transport Services Comparison

Service	Ordered	Reliable	Retransmission Complexity	Primary Use Case
ROD	Yes	Yes	Full per-PDC state	Legacy RDMA / ordered AI ops
RUD	No	Yes	Reduced (unordered)	AI training collectives with spray
RUDI	No	Yes	Minimal (idempotent)	RDMA Writes; simple retransmit
UUD	No	No	None	Telemetry, speculative ops

Congestion Control and Fabric Behavior Terms The following terms define congestion management mechanisms and associated fabric behaviors critical to AI workload performance. Congestion Control and Fabric Behavior Terms

Term	Definition
PFC	Priority Flow Control (IEEE 802.1Qbb). A lossless Ethernet mechanism in which a receiver transmits a PAUSE frame to its upstream neighbor on a specific priority class when its ingress buffer approaches a configured threshold, temporarily halting transmission of that priority. Required for lossless RoCEv2 operation. PFC operates hop-by-hop and can propagate congestion upstream (PFC storm risk).
PFC Storm	A pathological condition in which PFC PAUSE frames propagate across multiple hops, causing widespread throughput degradation or deadlock unrelated to the original congestion source. Detection and mitigation SHOULD be part of soak test evaluation per the companion methodology documents.
PFC Deadlock	A circular PFC dependency in which sets of flows mutually pause each other indefinitely, resulting in zero progress for affected traffic classes. Deadlock risk is elevated in non-tree topologies and MUST be evaluated in fabric-level soak tests.
ECN	Explicit Congestion Notification (). An IP-layer mechanism in which a congested router marks packets with the Congestion Experienced (CE) codepoint in the IP ECN field instead of dropping them. The receiver echoes congestion feedback to the sender via the transport protocol, triggering rate reduction. Used with RoCEv2 as part of DCQCN.
DCQCN	Data Center Quantized Congestion Notification . An end-to-end congestion control algorithm for RoCEv2 flows, combining ECN marking at congested switches with rate-based sender reduction using an AIMD scheme. PFC and DCQCN are distinct mechanisms. PFC prevents packet loss during DCQCN convergence; it is not part of the DCQCN algorithm.
ECN Marking Ratio	The fraction of packets (expressed as a percentage) that are marked with the CE codepoint in the IP ECN field over a measurement interval. A high ECN Marking Ratio indicates persistent congestion and is a primary Fabric Health Indicator.
Incast	A traffic pattern in which multiple sources simultaneously send to a single destination, potentially overwhelming the destination's NIC receive buffer and the switch's egress port buffer. Incast is a dominant congestion mechanism in tree-based reductions, AllGather fan-in, and AllToAll hotspots; ring-based AllReduce, by construction, does not create incast since each participant exchanges only with its immediate neighbors.
Incast Ratio	The ratio of concurrent senders to receivers in an incast communication pattern (N:1). The incast ratio determines the oversubscription factor at the destination port and is a primary test parameter for congestion characterization.
Packet Spray	A load balancing strategy distributing individual packets of a single RDMA message across all available ECMP paths, maximizing link utilization at the cost of potential out-of-order delivery at the receiver. Native in UET (RUD mode); requires NIC reorder buffering for RoCEv2 RC mode.
DLB / Flowlet	Dynamic Load Balancing using flowlet detection. A per-flow rerouting mechanism that reassigns a flow to a new ECMP path when the flow has been idle longer than the flowlet gap threshold (implementation-configurable; values of roughly 500 ns–2 µs are typical, but the threshold is not fixed by this definition), reducing out-of-order packet risk compared to packet spray while improving utilization over static per-flow ECMP.
ECMP	Equal-Cost Multi-Path routing. A forwarding mechanism distributing traffic across multiple equal-cost paths, typically via hash of the IP 5-tuple (or entropy field in UET). ECMP imbalance (MMR > 1.0) is a primary fabric efficiency metric for AI traffic.
MMR	Max-Mean Ratio. The ratio of the flow count (or traffic load) on the most heavily utilized link to the average flow count per link across all fabric links. MMR = 1.0 indicates perfect ECMP balance; MMR > 1.0 quantifies imbalance that degrades effective fabric bandwidth.

Load Balancing Strategy Comparison Load Balancing Strategy Comparison

Strategy	Granularity	Reorder Risk	Utilization	Complexity
ECMP (5-tuple hash)	Per-flow	None	Low (elephant flow bias)	Low
DLB / Flowlet	Per-flowlet	Low	Medium	Medium
Packet Spray (RoCEv2)	Per-packet	High	High	High (NIC reorder buffer)
Packet Spray (UET RUD)	Per-packet	None (transport tolerates OOO)	High	Low

Fabric Topology and Infrastructure Terms The following terms define fabric topology architectures and infrastructure components referenced in the companion methodology documents. Fabric Topology and Infrastructure Terms

Term	Definition
Fabric DUT Boundary	The precise measurement boundary for BMWG AI fabric benchmarks. Defined as the NIC Ethernet port (transmit side at source, receive side at destination). All benchmarked metrics (throughput, latency, loss, congestion) are measured at or between NIC Ethernet ports. Intra-node segments (NVLink, PCIe Gen4/5, CXL) are outside the DUT boundary and MUST NOT be included in fabric benchmark results without explicit labelling as a separate measurement component.
Intra-Node Transfer Overhead	The latency and bandwidth consumed by data movement within a single server node: specifically, the GPU-to-NIC path via PCIe or CXL, and GPU-to-GPU communication via NVLink. Intra-node transfer overhead is a contextual measurement reported alongside fabric benchmarks as a separate measurement component wherever the companion methodology documents require it, but is not itself the benchmarked entity in any test defined in those documents.
Fabric-Visible Data Volume (S_fabric)	The data volume per participant that crosses the Fabric DUT Boundary during a collective operation, counted in application payload bytes with each byte counted once, using the byte-counting rule of the Fabric_Goodput definition in §10: transport headers, framing overhead, padding, and retransmitted or duplicate bytes are excluded. S_fabric may be less than the application-level data size when collective placement satisfies part of the operation within a node, as in a hierarchical AllReduce that reduces across an intra-node accelerator interconnect before reducing across the fabric. S_fabric describes the workload offered to the fabric and is not a measurement of the traffic the fabric carried; retransmission, replication, and multi-hop forwarding are behaviours of the Fabric DUT and are reported by the companion methodology documents as separate quantities. S_fabric is the quantity against which fabric-boundary collective results are interpreted; the application-level data size and S_fabric are distinct and are reported separately by the companion methodology documents.
Clos / Fat-Tree Topology	A multi-stage switch topology providing non-blocking or oversubscribed connectivity between all leaf-to-leaf pairs. In AI fabric deployments, a two-tier (leaf-spine) or three-tier (leaf-spine-superspine) Clos is standard. Full bisection bandwidth (1:1) is the target for training fabrics; 2:1 or 4:1 oversubscription may be acceptable for inference fabrics.
Rail-Optimized Topology	A topology in which the NIC ports of each server are distributed across multiple ToR switches (one NIC port per switch), such that collective traffic between adjacent servers traverses different physical paths. Minimizes switch-to-switch traffic during ring AllReduce, maximizing effective BusBW. Requires rail-aware (topology-aware) collective placement.
Bisection Bandwidth	The aggregate bandwidth across the minimum cut that divides the fabric into two equal halves. Non-blocking fabrics provide bisection bandwidth equal to half the total edge (server-facing) bandwidth. Limits worst-case all-to-all communication throughput.
Oversubscription Ratio	The ratio of a leaf switch's total server-facing (downlink) bandwidth to its total uplink bandwidth toward the spine layer. A 1:1 ratio is non-blocking; higher ratios (e.g., 2:1, 4:1) reduce fabric cost but may bottleneck all-to-all and AllReduce patterns when all server ports are active simultaneously. Distinct from the edge-to-bisection-bandwidth ratio described under Bisection Bandwidth, which is 2:1 even for a non-blocking fabric.
ToR Switch	Top-of-Rack switch. The first-hop aggregation switch connecting accelerator servers in a rack to the spine layer of the fabric. In rail-optimized topologies, multiple ToR switches serve a single rack, with each server's NICs distributed across ToRs.
Spine / Superspine	Intermediate and top-layer switches in a multi-tier Clos fabric, providing inter-rack and inter-pod connectivity respectively. Spine switches aggregate multiple ToR switches; superspine switches aggregate multiple spine pods.
NIC	Network Interface Controller. The hardware device providing network connectivity for an accelerator host. AI fabric NICs support RDMA (RoCEv2 or UET), hardware offload for collective operations, and, optionally, GPU-Initiated Networking (GIN). NIC model and firmware version MUST be documented in all benchmark reports.
Buffer Occupancy	The instantaneous or time-averaged fill level of a switch port's packet buffer, expressed in bytes or as a fraction of total buffer capacity. Elevated sustained buffer occupancy indicates congestion. P99 buffer occupancy is a Fabric Health Indicator in the companion methodology documents.
Zero-Impact Failover	A failover event during which no statistically significant increase in JCT or TTFT is observed, within the measurement tolerance specified by the companion methodology. The term denotes the measured outcome, not a specific mechanism. NOTE: This outcome is typically achieved via pre-programmed alternate paths and hardware-level fast reroute (FRR) with sub-microsecond detection, rather than routing-protocol convergence. The mechanism is informative and not part of the definition.
Link Utilization	The fraction of the nominal link capacity actually used for data transmission over a measurement interval, expressed as a percentage. Reported as mean, P95, and P99 per link. High asymmetric link utilization (low average but high peak) is characteristic of bursty AI inference traffic.

Training-Specific Terms The following terms are specific to AI training workload benchmarking and are used normatively in . Training-Specific Terms

Term	Definition
JCT	Job Completion Time. The wall-clock elapsed time from the start of a training job (or benchmark iteration) until all participating accelerators complete their work, inclusive of all forward pass, backward pass, and collective communication phases. JCT is the primary end-to-end training efficiency KPI.
Roofline JCT	The theoretical minimum JCT under ideal network conditions, namely: load balancing across all paths, zero contention and queuing, no retransmissions, and no fabric failures. Computed as Roofline JCT = computation_time + serialization_delay, where serialization_delay = (8 × S × algo_factor) / B_acc, with S = message size in bytes, algo_factor = the fixed per-collective normalization constant from the BusBW definition, and B_acc = the sum of NIC line rates for that accelerator's own NICs, in bits/second (not aggregated across accelerators); the factor 8 converts bytes to bits. Stating these assumptions explicitly ensures the reference is reproducible across implementations. Provides a baseline for evaluating fabric overhead.
JCT Ratio	The ratio of measured JCT to Roofline JCT. A value of 1.0 indicates no network-induced overhead. Values > 1.0 quantify fabric inefficiency: JCT Ratio = JCT_measured / JCT_roofline. The JCT Ratio is the primary comparative metric for AI training fabric benchmarking.
Gradient Synchronization	The AllReduce collective operation performed after the backward pass of each training step to sum the locally computed gradients across all data-parallel replicas. The dominant communication event in data-parallel training, occurring once per training step (often split across multiple AllReduce calls when gradients are bucketed across layers).
Step Time	The wall-clock duration of a single training iteration (forward pass + backward pass + gradient synchronization + optimizer step). Step time = computation time + communication time, where the communication time is dominated by the AllReduce collective.
Soak Test	A sustained-load test run for an extended period (minimum 24 hours for stability evaluation) at a defined offered load fraction (e.g., 70% or 90% of maximum throughput). Soak tests detect buffer leaks, ECMP imbalance drift, PFC storm initiation, and long-tail error accumulation not visible in short-duration tests.

Inference-Specific Terms The following terms are specific to AI inference serving workload benchmarking. Most are used normatively in ; Speculative Decoding and PagedAttention are defined here for completeness and to support future benchmarking work, and are not currently referenced by that document. Inference-Specific Terms

Term	Definition
TTFT	Time to First Token. The elapsed time from receipt of an inference request by the serving system to emission of the first output token. Encompasses prompt processing (prefill), KV cache generation, optional KV cache transfer (in disaggregated architectures), and emission of the first output token at the end of the prefill phase. Interactive serving deployments typically target TTFT < 500 ms at P99 (informative; not a requirement of this document).
ITL	Inter-Token Latency. The elapsed time between successive output tokens during the autoregressive decode phase. Measured at P50, P95, P99, and P99.9 to characterize tail latency behavior. Interactive serving deployments typically target ITL < 50 ms at P99 (informative; not a requirement of this document).
TPS	Tokens Per Second. Aggregate throughput of the inference serving system, measured as the total number of tokens processed per second across all concurrent requests. Reported separately for input-side (prefill) TPS and output-side (decode) TPS.
KV Cache	Key-Value Cache. The intermediate attention state (key and value projection matrices from multi-head attention layers) computed during the prefill phase and reused during each decode step to avoid redundant recomputation. KV cache size scales with: layers × KV_attention_heads (H_kv) × head_dim × sequence_length × precision. Under GQA/MQA the number of KV heads (H_kv) differs from the total number of attention heads (see the S_KV definition). The attention head configuration MUST be reported in all benchmark results.
Prefill Phase	The compute-bound phase of LLM inference in which the entire input prompt is processed in parallel to generate the KV cache and the first output token. Characterized by high arithmetic intensity and high accelerator utilization; values in the range of 200–400 ops/byte and 90–95% utilization are commonly observed on current-generation hardware, but these are illustrative and vary with model, batch size, and accelerator, and are not part of the definition. Prefill latency dominates TTFT for long prompts.
Decode Phase	The memory-bandwidth-bound phase of LLM inference in which output tokens are generated autoregressively, one token per forward pass, by reading the KV cache. Characterized by low arithmetic intensity and lower accelerator utilization; values in the range of 60–80 ops/byte and 20–40% utilization are commonly observed on current-generation hardware, but these are illustrative and vary with model, batch size, and accelerator, and are not part of the definition. Decode throughput limits TPS.
Disaggregated Serving	An inference serving architecture in which the prefill phase and decode phase are executed on physically separate groups of accelerators (workers), connected by a network fabric. Allows independent scaling of prefill and decode resources (xPyD) but introduces KV cache transfer as a fabric-critical data movement.
xPyD Ratio	The allocation ratio of x prefill workers to y decode workers in a disaggregated serving cluster. Example: 3P9D denotes 3 prefill workers and 9 decode workers. xPyD is informal notation in wide use across disaggregated-serving implementations; it has no single canonical source. The optimal xPyD ratio depends on model size, prompt/output length distributions, and TTFT/ITL SLO targets.
Continuous Batching	A dynamic inference scheduling technique that inserts new requests into an active decode batch as slots become available (without waiting for the current batch to complete), improving accelerator utilization compared to static batching. Generates variable batch sizes that affect fabric traffic burstiness.
PagedAttention	A KV cache memory management technique storing attention keys and values in fixed-size, non-contiguous virtual pages (typically 16–64 KB), inspired by OS virtual memory management. Reduces memory fragmentation and enables efficient KV cache sharing across requests with common prefixes.
Prefix Caching	Reuse of previously computed KV cache segments for inference requests sharing a common prompt prefix (e.g., a fixed system prompt), eliminating redundant prefill computation. Prefix cache hit rate is a secondary KPI for inference serving efficiency.
Normal Dispatch	An AllToAll MoE dispatch communication mode optimized for the prefill phase. Payload sizes are variable (depending on token-to-expert routing), generating dynamic tensor shapes incompatible with static graph capture. Maximizes throughput for large batches at the cost of higher per-dispatch latency.
Low-Latency Dispatch	An AllToAll MoE dispatch communication mode optimized for the decode phase. Payload sizes are padded to fixed maximum dimensions (compatible with static graph capture), enabling lower kernel-launch overhead at the cost of slight bandwidth inefficiency. Target: < 200 µs per dispatch round trip.
Expert Choice Routing	A token routing strategy in which experts select which tokens to process, rather than tokens selecting experts. Each expert accepts its top-C tokens by affinity score, producing perfect load balance but non-uniform AllToAll message sizes across EP ranks.
Auxiliary Loss Top-k	A top-k routing variant that adds a load-balancing auxiliary loss during training to encourage uniform token distribution across experts. Produces near-uniform AllToAll traffic in inference and reduces hot-spot risk on the fabric.
Top-k with Token Drop	A top-k routing variant in which tokens destined for overloaded experts are dropped or redirected to a fallback. Reduces worst-case dispatch traffic volume at the cost of model output quality under load.
T_dispatch	The dispatch payload per source-destination accelerator pair per MoE layer, computed as: T_dispatch = (B × k × H_model × P_bytes) / N where B = per-GPU batch size (tokens), k = top-k routing count, H_model = hidden dimension, P_bytes = bytes per element (BF16=2, FP8=1), N = EP group size. The corresponding total egress per accelerator per MoE layer, summed over its N-1 destination peers, is T_dispatch × (N - 1), defined as T_egress in the companion inference benchmarking document. Used as the canonical traffic volume parameter in that document's MoE test matrix.
SLO	Service Level Objective. A quantitative target for an inference serving KPI. AI inference SLOs typically specify maximum TTFT (e.g., < 500 ms P99) and maximum ITL (e.g., < 50 ms P99) under a specified request arrival rate.
Speculative Decoding	An inference acceleration technique using a small draft model to generate candidate token sequences verified in parallel by the target model. Reduces effective ITL but generates bursty, variable-length KV cache traffic; noted as a future benchmarking area not fully specified in the current companion documents.
S_KV	The total size in bytes of the KV cache state generated by a single inference request across all transformer layers and all context tokens, computed as: S_KV = 2 × L × H_kv × D × C × P_bytes. Where: L = number of transformer layers; H_kv = number of KV attention heads per layer (H_kv ≤ H_total for GQA/MQA); D = per-head key/value dimension (head_dim), typically model_dim / H_total; C = context length in tokens (prompt + generated tokens); P_bytes = precision in bytes per element (FP16/BF16 = 2, FP8/INT8 = 1); Factor 2 accounts for both K and V tensors, each of shape [H_kv, D] per layer per token.

See the Canonical MoE Test Matrix in the AllToAll Dispatch Throughput test of for the test matrix referenced by T_dispatch above.

Inference Phase Characteristics Inference Phase Characteristics

Phase	Compute Bound	Arithmetic Intensity	Accelerator Util.	Primary KPI
Prefill	Yes	200–400 ops/byte	90–95%	TTFT
Decode	No (memory BW bound)	60–80 ops/byte	20–40%	ITL, TPS

NOTE: The arithmetic intensity and utilization figures above are illustrative values for current-generation hardware. They vary with model architecture, batch size, and accelerator, and are not normative.

KPI Classification Terms The following terms define the three-tier KPI taxonomy used across both companion methodology documents. KPI Classification Terms

Term	Definition
Primary KPI	A top-level performance indicator directly representing end-user experience or training efficiency. In training: JCT Ratio and BusBW. In inference: TTFT, ITL, and TPS. Primary KPIs are the principal reporting metric and the basis for comparative benchmarking across DUT implementations.
Secondary KPI	A fabric-level performance indicator providing mechanistic explanation for primary KPI values. Examples: per-phase collective throughput breakdown, KV cache transfer goodput, AllToAll dispatch latency, ECMP imbalance (MMR), and link utilization. Secondary KPIs enable root-cause analysis of Primary KPI deviations.
Fabric Health Indicator (FHI)	An operational metric characterizing fabric stability and anomaly conditions rather than peak performance. FHIs include: PFC event rate, PFC storm occurrence, ECN marking ratio, packet loss rate, buffer occupancy (P99), and retransmission rate. FHIs SHOULD be continuously monitored and reported throughout all test categories.
Goodput	The application-useful data delivered per unit time, excluding retransmissions, protocol overhead, and padding. Benchmark reports MUST specify the qualified Goodput metric (e.g., Inference_Goodput or Fabric_Goodput) to avoid ambiguity. Fabric_Goodput: RDMA message payload bytes successfully delivered per unit time at the DUT boundary, excluding transport headers, framing overhead, padding, and retransmitted bytes. This is the numerator quantity in KV_xfer_bandwidth and EP_alltoall_bandwidth, both defined in the companion inference benchmarking document (). Units: GB/s or Gbps; reports MUST state which. Inference_Goodput: Output tokens successfully delivered per unit time, counting only requests that complete without preemption, eviction, or error. Corresponds to TPS_output over successfully completed requests only. Units: tokens/second. The two planes MUST NOT be conflated. KV_xfer_bandwidth measures Fabric_Goodput; it does not measure Inference_Goodput.
Zero Packet Loss	A test acceptance criterion requiring that no packets are dropped by the DUT during the measurement interval. For RoCEv2, zero packet loss is the target operating condition. UET is designed to tolerate loss (RUD retransmission across sprayed paths, packet trimming); the applicable acceptance criterion for UET is zero application-visible loss rather than zero wire-level loss, and it depends on the transport service (ROD/RUD/RUDI/UUD) under test. The binary search procedure in the companion methodology documents determines the maximum offered load satisfying this criterion.

KPI Tier Summary The examples below are illustrative and non-exhaustive; the companion methodology documents may add KPIs at each tier as appropriate to their specific workload focus, provided the tier semantics described above are preserved. KPI Tier Summary

Tier	Training Examples	Inference Examples	Purpose
Primary KPI	JCT Ratio, BusBW	TTFT, ITL, TPS	Direct end-user experience / business impact
Secondary KPI	AllReduce BusBW, MMR, Link Utilization	AllToAll dispatch latency, KV transfer goodput	Root cause analysis of Primary KPI deviations
Fabric Health Indicator (FHI)	PFC events, ECN ratio, packet loss, buffer P99, retx rate	PFC events, ECN ratio, packet loss, buffer P99	Ongoing fabric stability and anomaly detection

Referenced Standards Abbreviations The following abbreviations refer to normative and informative IETF documents referenced throughout this document and the companion methodology documents. Expansions for technical acronyms used across the companion documents are listed in the Acronyms appendix (). Referenced Standards Abbreviations

Reference	Definition
RFC 1242	"Benchmarking Terminology for Network Interconnect Devices" (Bradner, 1991). Defines foundational benchmarking terms (throughput, latency, frame loss rate, back-to-back frames). The baseline terminology reference for BMWG work. Where terms in this document overlap with RFC 1242 definitions, this document contextualizes and extends those definitions for AI fabric benchmarking.
RFC 2544	"Benchmarking Methodology for Network Interconnect Devices" (Bradner & McQuaid, 1999). Defines test methodologies for throughput, latency, frame loss rate, and back-to-back measurements. The AI fabric methodology documents extend RFC 2544 procedures for AI-specific traffic patterns and test durations.
RFC 8238	"Data Center Benchmarking Terminology" (Avramov & Rapp, 2017). Extends RFC 1242 with data-center benchmarking terminology, including latency and jitter definitions, physical-layer calibration, line rate, buffering, microburst, and application throughput. Incast, ECN, and buffer occupancy concepts in this document align with RFC 8238 definitions.
RFC 8239	"Data Center Benchmarking Methodology" (Avramov & Rapp, 2017). Defines test methodologies for data center network functions including incast, ECN marking, and lossless behavior. The AI fabric companion methodology documents extend RFC 8239 for distributed AI collective traffic patterns.
RFC 2119 / RFC 8174	"Key words for use in RFCs to Indicate Requirement Levels" (Bradner, 1997; Leiba, 2017). Define the normative requirement language: MUST, MUST NOT, REQUIRED, SHALL, SHALL NOT, SHOULD, SHOULD NOT, RECOMMENDED, NOT RECOMMENDED, MAY, and OPTIONAL. RFC 8174 clarifies that these terms are normative only when in uppercase; lowercase uses are not normative.

IANA Considerations This document has no IANA actions. Note that UDP destination port 4793, referenced in and specified in the Ultra Ethernet Specification , has been assigned by IANA to the Ultra Ethernet Transport (assignment date 2025-06-16); this document does not request any IANA assignment.

Security Considerations This document defines terminology and does not specify any protocol mechanism. It therefore introduces no new protocol-level security considerations beyond those of the underlying technologies it references. The considerations below follow the BMWG convention established in and apply to any benchmarking activity conducted using the terms defined herein. Benchmarking activities as described in the companion methodology documents are limited to technology characterization of AI fabrics using controlled stimuli in a laboratory environment, with dedicated address space and the constraints specified in those documents. The benchmarking network topology will be an independent test setup and MUST NOT be connected to devices that may forward the test traffic into a production network or misroute traffic to the test management network. This isolation requirement is particularly important for AI fabric benchmarking because the hop-by-hop flow-control mechanisms referenced in (PFC) and in (CBFC) propagate backpressure toward traffic sources and can extend the blast radius of a misconfigured test beyond the immediate DUT; DCQCN () reduces, but does not eliminate, reliance on these mechanisms. Benchmarking is performed on a "black-box" basis, relying on measurements observable external to the DUT or SUT as defined in . Some tests in the companion methodology documents also report counters or telemetry read from the DUT, such as switch queue occupancy, or ECN-marked packet and PFC PAUSE counts on links not attached to test equipment. These values are read only through management or telemetry interfaces available in a production deployment of the device and are labeled DUT-reported. Reading them requires no capability added for benchmarking and leaves the DUT's security posture unchanged. Special capabilities SHOULD NOT exist in the DUT specifically for benchmarking purposes. Any implications for network security arising from the DUT SHOULD be identical in the lab and in production networks. In particular, RDMA memory-region permissions and KV cache telemetry exposure are properties of the deployed configuration, not of the benchmarking methodology, and SHOULD reflect production posture during testing. Synthetic inputs SHOULD be used for the inference benchmarks referencing the KV Cache and S_KV terms in so that no production prompt content is processed in the test environment.

Acronyms The following acronyms are used in this document and in the companion methodology documents ( and ). Substantive definitions for protocol- and benchmarking-relevant terms are provided in the body of this document; the table below provides expansions only. Acronyms specific to only one companion methodology document are expanded on first use within that document and are not duplicated here. Acronyms

Acronym	Expansion
AI	Artificial Intelligence
AIMD	Additive Increase Multiplicative Decrease
API	Application Programming Interface
ASIC	Application-Specific Integrated Circuit
BGP	Border Gateway Protocol
BMWG	Benchmarking Methodology Working Group
BSP	Bulk Synchronous Parallel
BTH	Base Transport Header
BusBW	Bus Bandwidth
CBFC	Credit-Based Flow Control
CCL	Collective Communication Library
CDF	Cumulative Distribution Function
CMS	Congestion Management Sub-layer (UET)
CRC	Cyclic Redundancy Check
CV	Coefficient of Variation
CXL	Compute Express Link
DCQCN	Data Center Quantized Congestion Notification
DLB	Dynamic Load Balancing
DMA	Direct Memory Access
DP	Data Parallelism
DSCP	Differentiated Services Code Point
DUT	Device Under Test
ECMP	Equal-Cost Multi-Path
ECN	Explicit Congestion Notification
EP	Expert Parallelism
FEC	Forward Error Correction
FHI	Fabric Health Indicator
FRR	Fast Reroute
GIN	GPU-Initiated Networking
GPU	Graphics Processing Unit
GQA	Grouped-Query Attention
HBM	High Bandwidth Memory
HOL	Head-of-Line
HPC	High-Performance Computing
ICRC	Invariant CRC
ImmDt	Immediate Data
INT	In-band Network Telemetry
IRN	Improved RoCE NIC
ITL	Inter-Token Latency
JCT	Job Completion Time
JFI	Jain's Fairness Index
KPI	Key Performance Indicator
KVTL	KV Cache Transfer Library
LLM	Large Language Model
LLR	Link Layer Retry
MAC	Media Access Control
MHA	Multi-Head Attention
ML	Machine Learning
MMR	Max-Mean Ratio
MoE	Mixture of Experts
MQA	Multi-Query Attention
MTU	Maximum Transmission Unit
NIC	Network Interface Controller
NOS	Network Operating System
OFED	OpenFabrics Enterprise Distribution
OOO	Out-of-Order
OSPF	Open Shortest Path First
PCIe	Peripheral Component Interconnect Express
PDC	Packet Delivery Context
PDS	Packet Delivery Sub-layer (UET)
PFC	Priority Flow Control
PP	Pipeline Parallelism
PRI	Packet Rate Improvement
PSN	Packet Sequence Number
QP	Queue Pair
RC	Reliable Connected
RDMA	Remote Direct Memory Access
RETH	RDMA Extended Transport Header
RoCEv2	RDMA over Converged Ethernet version 2
ROD	Reliable Ordered Delivery
RTT	Round-Trip Time
RUD	Reliable Unordered Delivery
RUDI	Reliable Unordered Delivery for Idempotent operations
SES	Semantic Sub-layer (UET)
SLO	Service Level Objective
SPMD	Single Program Multiple Data
SUT	System Under Test
TCAM	Ternary Content-Addressable Memory
TG	Traffic Generator
ToR	Top-of-Rack
TP	Tensor Parallelism
TPS	Tokens Per Second
TSS	Transport Security Sub-layer (UET)
TTFT	Time to First Token
UEC	Ultra Ethernet Consortium
UET	Ultra Ethernet Transport
UUD	Unreliable Unordered Delivery
VLAN	Virtual LAN
VOQ	Virtual Output Queue
WE	Workload Emulator
XPU	accelerator processing unit (generic)
xPyD	x Prefill workers : y Decode workers (disaggregated serving ratio)
ZeRO	Zero Redundancy Optimizer

Acknowledgments This work has benefited from the discussions that occurred during the joint IPPM and BMWG meeting and on the BMWG mailing list. Thanks to Carsten Rossenhoevel and Mohamed Boucadair for valuable review and comments. Thanks to Andrew Yourtchenko for a thorough review of the document set. Thanks to Niangen Ye for the review comments on Fabric-Visible Data Volume provenance and on forwarding-work accounting, which prompted the byte-counting rule stated in this document.

References Normative References Ultra Ethernet Consortium In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. This memo discusses and defines a number of terms that are used in describing performance benchmarking tests and the results of such tests. This memo provides information for the Internet community. It does not specify an Internet standard. The purposes of this informational document are to establish definitions and describe measurement techniques for data center benchmarking, as well as to introduce new terminology applicable to performance evaluations of data center network equipment. This document establishes the important concepts for benchmarking network switches and routers in the data center and is a prerequisite for the test methodology document (RFC 8239). Many of these terms and methods may be applicable to network equipment beyond the scope of this document as the technologies originally applied in the data center are deployed elsewhere. This document is a republication of RFC 1944 correcting the values for the IP addresses which were assigned to be used as the default addresses for networking test equipment. This memo provides information for the Internet community. The purpose of this informational document is to establish test and evaluation methodology and measurement techniques for physical network equipment in the data center. RFC 8238 is a prerequisite for this document, as it contains terminology that is considered normative. Many of these terms and methods may be applicable beyond the scope of this document as the technologies originally applied in the data center are deployed elsewhere. This memo specifies the incorporation of ECN (Explicit Congestion Notification) to TCP and IP, including ECN's use of two bits in the IP header. [STANDARDS-TRACK] Informative References InfiniBand Trade Association DeepSeek AI Cisco Blue Fern Consulting Huawei Huawei Apple This document defines benchmarking terminology, methodologies, and Key Performance Indicators (KPIs) for evaluating Ethernet-based AI training network fabrics. As large-scale distributed Artificial Intelligence / Machine Learning (AI/ML) training clusters grow to tens of thousands of accelerators (GPUs or generic accelerator processing units (XPUs)), the backend network fabric determines Job Completion Time (JCT), training throughput, and accelerator utilization. This document establishes vendor-independent, reproducible test procedures for benchmarking fabric-level performance under realistic AI training workloads. The tests cover Remote Direct Memory Access (RDMA) over Converged Ethernet version 2 (RoCEv2) transport, the Ultra Ethernet Transport (UET) protocol defined by the Ultra Ethernet Consortium (UEC) Specification 1.0, congestion management (Priority Flow Control (PFC), Explicit Congestion Notification (ECN), Data Center Quantized Congestion Notification (DCQCN), Credit-Based Flow Control (CBFC)), load balancing strategies (Equal-Cost Multi-Path (ECMP), Dynamic Load Balancing (DLB), packet spraying), collective communication patterns (AllReduce, AllToAll, AllGather), and scale/ soak testing. The methodology enables direct, reproducible comparison across switch ASICs, NIC transport stacks (RoCEv2 and UET), and fabric architectures (2-tier Clos, 3-tier Clos, and rail-optimized). Cisco Blue Fern Consulting Huawei Huawei Apple This document defines benchmarking terminology, methodologies, and Key Performance Indicators (KPIs) for evaluating Ethernet-based AI inference serving network fabrics. As Large Language Model (LLM) inference deployments scale to disaggregated prefill/decode architectures spanning hundreds or thousands of accelerators (GPUs/ XPUs), the interconnect fabric determines Time to First Token (TTFT), Inter-Token Latency (ITL), and aggregate throughput in tokens per second (TPS). This document establishes vendor-independent, reproducible test procedures for benchmarking fabric-level performance under realistic AI inference workloads. Coverage includes RDMA-based KV cache transfer between disaggregated prefill and decode workers, Mixture-of-Experts (MoE) expert parallelism AllToAll communication, request routing and load balancing for inference serving, congestion management under bursty inference traffic patterns, and scale/soak testing. The methodology enables direct comparison across NIC transport stacks (RoCEv2 and UET) and fabric architectures. This document is a companion to the AI training fabric benchmarking methodology, which addresses training workloads.

Appendix A: Term Cross-Reference to Companion Documents The following table identifies which terms from this document are used in each companion methodology document. Term Cross-Reference to Companion Documents

Term Category	Used in Training Bench	Used in Inference Bench
General Benchmarking Terms (§2)	All terms	All terms
Collective Communication (§3)	AllReduce, AllGather, AllToAll, BusBW, CCL	AllToAll, BusBW
Parallelism Strategies (§4)	PP, EP, MoE, ZeRO	DP, TP, EP, MoE, DP Attention
RDMA / RoCEv2 (§5.1)	RDMA, RoCEv2, QP, RC mode, UET, PDC, ROD	RDMA, RoCEv2, QP, RC mode, RDMA Verb, UET, PDC, ROD
UET Terms (§5.2)	RUD, RUDI, UUD, LLR, Packet Trimming, PRI, CBFC, UEC Profile, Entropy Value	RUD, GIN
Congestion Control (§6)	PFC, PFC Storm, PFC Deadlock, ECN, DCQCN, ECN Marking Ratio, Incast, Incast Ratio, Packet Spray, DLB/Flowlet, ECMP, MMR	PFC, ECN, DCQCN, Incast, Packet Spray, ECMP
Fabric Topology (§7)	Fabric DUT Boundary, Intra-Node Transfer Overhead, Fabric-Visible Data Volume, Clos, Rail-Optimized, Bisection BW, Oversubscription, Spine, NIC, Zero-Impact Failover, Link Utilization	Fabric DUT Boundary, Fabric-Visible Data Volume, Clos, Oversubscription, Spine, NIC, Link Utilization
Training-Specific (§8)	JCT, Roofline JCT, JCT Ratio, Gradient Sync, Step Time, Soak Test	Soak Test
Inference-Specific (§9)	—	TTFT, ITL, TPS, KV Cache, Prefill, Decode, Disaggregated Serving, xPyD, Continuous Batching, Normal/Low-Latency Dispatch, Expert Choice Routing, Top-k with Token Drop, Auxiliary Loss Top-k, T_dispatch, S_KV, SLO
KPI Classification (§10)	Primary KPI (JCT Ratio, BusBW), Secondary KPI, FHI, Goodput, Zero Packet Loss	Primary KPI (TTFT, ITL, TPS), Secondary KPI, FHI, Goodput, Zero Packet Loss

Appendix B: Term Taxonomy Summary The following table provides a concise summary of all defined terms organized by category, with the section reference for the full definition. Complete Term Taxonomy

Section	Term(s)	Category
2	DUT, SUT, TG, JFI, Offered Load, Trial Duration, Warmup Period, Binary Search, Percentile Latency, Observation Point, AI Fabric	General Benchmarking
3	Collective Operation, AllReduce, AllGather, ReduceScatter, AllToAll, Ring Algorithm, BusBW, CCL, SPMD, BSP	Collective Communication
4	Data Parallelism, Tensor Parallelism, Pipeline Parallelism, Expert Parallelism, MoE, DP Attention, ZeRO	Parallelism Strategies
5.1	RDMA, RoCEv2, QP, Reliable Connected (RC), RDMA Verb, UET, PDC, ROD	Transport — RDMA / RoCEv2
5.2	RUD, RUDI, UUD, UEC Profile, LLR, Packet Trimming, PRI, CBFC, Entropy Value, GIN, KVTL	Transport — UET
6	PFC, PFC Storm, PFC Deadlock, ECN, DCQCN, ECN Marking Ratio, Incast, Incast Ratio, Packet Spray, DLB/Flowlet, ECMP, MMR	Congestion Control
7	Fabric DUT Boundary, Intra-Node Transfer Overhead, Fabric-Visible Data Volume, Clos/Fat-Tree, Rail-Optimized, Bisection Bandwidth, Oversubscription Ratio, ToR Switch, Spine/Superspine, NIC, Buffer Occupancy, Zero-Impact Failover, Link Utilization	Fabric Topology
8	JCT, Roofline JCT, JCT Ratio, Gradient Synchronization, Step Time, Soak Test	Training-Specific
9	TTFT, ITL, TPS, KV Cache, Prefill Phase, Decode Phase, Disaggregated Serving, xPyD Ratio, Continuous Batching, PagedAttention, Prefix Caching, Normal Dispatch, Low-Latency Dispatch, Expert Choice Routing, Auxiliary Loss Top-k, Top-k with Token Drop, T_dispatch, SLO, Speculative Decoding, S_KV	Inference-Specific
10	Primary KPI, Secondary KPI, Fabric Health Indicator, Goodput, Zero Packet Loss	KPI Classification
11	RFC 1242, RFC 2544, RFC 8238, RFC 8239, RFC 2119/8174	Referenced Standards