| Internet-Draft | Fast Notification for tunnel-based lossl | June 2026 |
| Hu, et al. | Expires 29 December 2026 | [Page] |
With the rapid development of Large Language Models (LLMs), many emerging AI services require lossless transmission of RDMA traffic over tunnels in Wide Area Network(WAN). Existing network mechanisms were not designed for the responsiveness and scale required by these dynamic services. WAN should support the real-time, lightweight network notification to enhance the responsiveness for traffic engineering, congestion mitigation, and failure protection.¶
This document analyzes typical scenarios where RDMA traffic need to be tunneled across WAN, and proposes fast network notification solutions based on ICMPv6 or UDP.¶
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 29 December 2026.¶
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.¶
For modern AI services such as distributed LLMs training or inference, WAN needs to support the tunneling of RDMA traffic between data centers (DCs). RDMA is a widely used technology in high-performance computing and AI clusters, achieving low latency, reduced CPU overhead, and high network throughput. Currently, mainstream RDMA protocols (e.g., IB, RoCE) operate over best-effort forwarding, where a small number of packet losses can result in a dramatic reduction in the effective throughput. Therefore, WAN requires the FAst Notification for Traffic Engineering and Load balancing to ensure reliable and congestion-free data transfer.¶
[I-D.geng-fantel-fantel-gap-analysis] points existing TE mechanisms face limitations in responsiveness, coverage, and operational overhead, especially in high-speed, large-scale environments. ECN[RFC3168] is a widely deployed congestion control mechanism, which enables a forwarding element to notify the sender for congestion control without having to drop packets. But it still relies on end-to-end signaling, making real-time feedback challenging in long-distance WAN. BFD[RFC5880] is designed for rapid fault detection by sending frequent control packets between peers, but higher probe frequency increases CPU and bandwidth usage, make it struggles to balance detection speed with system overhead.¶
[I-D.ietf-rtgwg-net-notif-ps] is an IETF Problem Statement for Fast Network Notification(FANN), based on the analysis of gaps in current network mechanisms and the operational requirements of modern applications (e.g., AI/ML training), formally defines the scope and core requirements for fast network notifications. Moreover, it futher specifies what information such notifications carry, who the intended recipients are, how they should be delivered, and what kinds of timely actions they may enable.¶
To enable lossless data transmission, some drafts are proposed to support FANN. [I-D.wh-rtgwg-adaptive-routing-arn] proposes a proactive notification mechanism ARN for adaptive routing, and describes the information carried in ARN to notify remote nodes for re-routing. [I-D.liu-rtgwg-adaptive-routing-notification] describes the mechanisms of delivering ARN message.¶
This document specifies the FANN mechanism for scenarios where service traffic is carried over tunnels in WAN. It first introduces the typical scenarios, then specifies the process of fast notification to achieve key TE areas such as congestion control, load balancing, and failure protection, and finally defines the protocol implementation.¶
CNP: Congestion Notification Packet¶
ECN: Explicit Congestion Notification¶
FANN: Fast Network Notification¶
PFC: Priority-based Flow Control¶
RoCEv2: RDMA over Converged Ethernet version 2¶
WAN: Wide Area Network¶
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 growth of computing power of a single DC is limited by space and power supply, making it difficult to meet the fast-growing computing resources demands of LLMs training. Therefore, distributed model training across multiple DCs provides a more efficient and cost-effective solution to aggregate computing resources. In this scenario, TB-scale training parameters need to be rapidly synchronized over WAN.¶
Some customers deploy LLMs by building on-premises AI facilities, but as inference concurrency increases, scaling out these facilities requires significant investment. To address this, distributed model inference between customer on-premise and third-party DC provides a more agile and cost-effective solution. In this scenario, data such as the KV cache and model parameters need to be rapidly synchronized over WAN.¶
In the above scenarios, a large volume of data between DCs need to be synchronized using RDMA protocol. RDMA traffic generated by LLM training or inference is highly concurrent, bursty, and extremely latency-sensitive. Therefore, operators typically encapsulate it in tunnels over the WAN to enable flexible steering and end-to-end service isolation. In these scenarios, the framework for RDMA traffic transmission over WAN tunnels is as follows:¶
+--------------------------------------------------+
| DC1 |
| |
| +-----------+ +-----------+ +-----------+ |
| |AI server 1| |AI server 2| ... |AI server n| |
| +-----------+ +-----------+ +-----------+ |
+------------------------+-------------------------+
|
+------------------------+-------------------------+
| WAN +-----+----+ |
| +------+ingress PE+------+ |
| | +----------+ | |
| | | |
| +--+---+ +--+---+ |
| | R1 + + R2 | |
| +--+---+\ /+--+---+ |
| | \ / | |
| | \+---------+/ | |
| | + R5 + | |
| | /+---------+\ | |
| | / \ | |
| +--+---+/ \+--+---+ |
| | R3 + + R4 | |
| +--+---+ +--+---+ |
| | | |
| | +---------+ | |
| +-------+egress PE+------+ |
| +----+----+ |
+------------------------+-------------------------+
|
+------------------------+-------------------------+
| +-----------+ +-----------+ +-----------+ |
| |AI server 1| |AI server 2| ... |AI server m| |
| +-----------+ +-----------+ +-----------+ |
| |
| DC2 |
+--------------------------------------------------+
Figure 1: Network diagram¶
The AI servers in DC1 sends RDMA traffic to WAN's ingress PE.¶
At the WAN's ingress PE, the RDMA traffic is encapsulated according to the tunnel protocol and forwarded across WAN to egress PE.¶
The WAN's P node(R1-R5) transits the payload from ingress PE to egress PE via tunnels.¶
At the WAN's egress PE, the payload are decapsulated to RDMA packets and transmitted to the AI servers in DC2.¶
Tunneling technologies include various protocols, such as GRE, VXLAN, MPLS, and SRv6. Moreover, AI workloads are highly sensitive to packet loss, latency and throughput. Network failures, congestion or underutilization can all lead to significant waste of compute resources. When transmittig RDMA traffic over tunnels, WAN should support FANN capability to realize rapid response to network conditions. Specifically, WAN devices should support fast notification mechanism to imporve three key TE scenarios: failure protection, flow control, and load balancing.¶
For large-scale and dynamic networks, protection mechanisms need to ensure service continuity in case of failures. According to [I-D.geng-fantel-fantel-gap-analysis], existing failure handling methods, such as BFD and FRR, lack flexibility and responsiveness in complex typologies. Therefore, WAN should support fast notification for failures, allowing near-instantaneous and dynamic protection responses, minimizing failure impact.¶
Upon network failure, the ingress PE should immediately adapt its forwarding policy to steer traffic away from faulty links or nodes. Therefore, the fast-notification-based failure protection process is as follows:¶
notification
+--------------+
| |
| +---+--+ +------+
| | R1 +--x-+ R2 |
| /+------+ ^ +------+\
| / | \
v / failure \
+----------+ / \ +---------+
| |/ \| |
|ingress PE|\ /|egress PE|
| | \ / | |
+----------+ \ / +---------+
\ +------+ +------+ /
\| R3 +----+ R4 |/
+------+ +------+
Figure 2: Failure protection procession¶
When a P node detects a local link/node failure, it collects failure information about the affected link or flow.¶
The P node sends notification to ingress PE with failure information (In addition to the identity of the failed link or node, the notification must also include information about the affected traffic).¶
Ingress PE receives the notification and reroutes the traffic based on its content to exclude the failed link or node: *If backup path is available, ingress PE should switch the service traffic to the backup path. *If multiple feasible paths exist, ingress PE should updates its load-balancing policy to utilize all available paths. Ingress PE should send a corresponding notification to the sender and controller.¶
RDMA traffic is bursty and highly sensitive to packet loss, and WAN require proactive congestion control mechanisms. [RFC6040] redefines how the explicit congestion notification (ECN) field of the IP header should be constructed on entry to and exit from any IP-in-IP tunnel, in order to achieve ECN-based congestion control across WANs between DCs. However, [I-D.geng-fantel-fantel-gap-analysis] analysis that ECN/TCP methods still relies on end-to-end signaling and lacks precise real-time feedback.¶
Currently, PFC is widely used in data centers to prevent data loss due to congestion. PFC uses a step-by-step back-pressure mechanism to control the upstream to stop or continue transmitting traffic. PFC achieves link-layer priority-based traffic control, but still faces problems such as queue head blocking and deadlock due to coarse control granularity.¶
When network congestion occurs, the ingress PE should immediately adapt its forwarding policy to reduce the traffic sent to congested nodes. Therefore, the fast-notification-based congestion control process is as follows:¶
notification
+---------------------------+
| |
| +------+ +-+--+-+
| | R1 +----+ R2 |
| /+------+ +------+\
| / x<---congestion
v / \
+----------+ / \ +---------+
| |/ \| |
|ingress PE|\ /|egress PE|
| | \ / | |
+----------+ \ / +---------+
\ +------+ +------+ /
\| R3 +----+ R4 |/
+------+ +------+
Figure 3: Congestion control procession¶
when a P node detects congestion, it collects congestion information about the congested link or flow.¶
The P node sends notification to ingress PE with congestion information.¶
Ingress PE receives the notification and reroutes the traffic based on its content to exclude the congestion link: *If backup path is available, ingress PE should switch the service traffic to the backup path. *If multiple feasible paths exist, ingress PE should updates its load-balancing policy to utilize all available paths. Ingress PE should reduce the transmission rate of corresponding traffic, and send notification to sender and controller.¶
Devices and links in WAN often carry multiple services simultaneously. In addition to failure and congestion, dynamic load balancing based on network state changes can effectively improve network resource utilization.¶
When significant changes occur in the network state, the ingress PE should dynamically adjust its forwarding strategy to maximize network resource utilization. Therefore, the fast-notification-based load balancing process is as follows:¶
notification
+--------------+
| |
| +---+--+ +------+
| | R1 +----+ R2 |
| /+------+ ^ +------+\
| / | \
v / link utilization \
+----------+ / change \ +---------+
| |/ \| |
|ingress PE|\ /| gress PE|
| | \ node load change/ | |
+----------+ \ | / +---------+
^ \ v /
| \+------+ +------+/
| | R3 +----+ R4 |
| +------+ +---+--+
| |
+--------------------------+
notification
Figure 4: Load balancing for network state changes¶
When a node detects the network state change, it collects the network state change information, such as link utilization, queue buildup.¶
The node sends fast notification to the ingress PE with information about the network state change.¶
Ingress PE receives the fast notification and updates its load-balancing policy to maximize the utilization of network resources.¶
Based on the framework analysis of fast notification in key TE areas, a unified protocol implementation for fast notification should be established, with explicit forwarding procedures to realize tunnel-based lossless transmission of RDMA packets in WAN.¶
The source quench mechanism has been deprecated in ICMPv6 because TCP's built-in congestion avoidance algorithms are more efficient, and source quench may interfere with their normal operation. However, fast network notification is a network-layer mechanism confined to the forwarding plane, designed for event-driven generation and consumption without involving endpoints. This avoids the conflict that led to Source Quench's deprecation, making ICMPv6 suitable as a carrier for fast notifications.¶
This document specifies a new ICMPv6 message to realize rapid notification in key traffic engineering areas including failure protection, congestion control, and load balancing. This ICMPv6 message consists of a fixed ICMPv6 header, and a variable-length metadata stack controlled by a 32-bit bitmap:¶
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Code | Checksum |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Version | Reserved | Hop Limit | Event Type |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Event Sub-Type | Event Identifier (4 bytes) |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Timestamp (8 bytes) |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| |
| Originating Node IPv6 Address (16 bytes) |
| |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Bitmap (32 bits) |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| |
| Metadata Stack (variable) |
| |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 5: new ICMPv6 message for fast notification¶
The 32-bit bitmap field indicates which metadata is present in the metadata stack. Each bit corresponds to a specific metadata type with a fixed length, enabling efficient parsing without TLV overhead. Bits are listed below by their index.¶
Bitmap bits 0 and 1 (Ingress Port ID and Egress Port ID) serve as the location identifier, eliminating the need for a separate Event Location field. The port IDs uniquely indicate where in the network the event occurred, corresponding to "Location of Event: This can be used to indicate the location where the event occurred in the network.¶
Although bits 11 and 12 are logically single-bit flags, they each occupy 4 bytes for alignment purposes, with the upper 31 bits set to zero.¶
The metadata stack is constructed by concatenating metadata fields in ascending bit order. For each bit that is set to 1 in the bitmap, the corresponding metadata field of fixed length is appended to the stack. Bits set to 0 are skipped.¶
For example, if the bitmap has bits 1 (Egress Port ID), 4 (Egress TX Link Utilization), 6 (Latency), and 10 (Signal Degradation) set to 1, the metadata stack will be:¶
While the preceding sections define the Fast Network Notification (FANN) message format using ICMPv6, the same fixed header and 32-bit bitmap structure can be directly carried over UDP. When encapsulated in UDP, the ICMPv6 Type/Code/Checksum fields are simply replaced by the standard UDP header (source port, destination port, length, checksum), while the FANN fixed fields, the 32-bit bitmap, and the metadata stack remain unchanged. The receiving node identifies the FANN message by a well-known UDP destination port (to be allocated by IANA) and processes it identically to the ICMPv6 variant.¶
This approach is consistent with the principle that the solution may reuse existing protocols where appropriate. Moreover, the use of UDP offers practical deployment advantages in environments where ICMPv6 traffic is filtered or where NAT traversal is required, without compromising the notification's timeliness or forwarding-plane efficiency.¶
This document specifies Fast Network Notification (FANN) mechanisms for tunnel-based lossless RDMA transmission in WAN, using ICMPv6 and UDP as transport protocols. While these protocols are widely deployed and well-understood, extending them with new notification semantics introduces potential security considerations that must be addressed.¶
Implementations MUST enforce the rate limiting behavior specified in RFC 4443 [RFC4443] §2.4 for all ICMPv6 messages carrying FANN information.¶
The TLV parser MUST validate that the sum of all TLV Length fields does not exceed the total ICMPv6 payload length. Any packet failing this check MUST be silently discarded.¶
All FANN notifications MUST be sent from a control-plane interface of the originating node (e.g., a loopback interface configured for management), and MUST NOT originate from data-plane forwarding interfaces (e.g., physical ports carrying customer traffic). This ensures that FANN traffic cannot be injected by compromised customer devices.¶
TBD¶