Revisiting Network Support for RDMA
Not on the map. Why?
Abstract (arXiv)
The advent of RoCE (RDMA over Converged Ethernet) has led to a significant increase in the use of RDMA in datacenter networks. To achieve good performance, RoCE requires a lossless network which is in turn achieved by enabling Priority Flow Control (PFC) within the network. However, PFC brings with it a host of problems such as head-of-the-line blocking, congestion spreading, and occasional deadlocks. Rather than seek to fix these issues, we instead ask: is PFC fundamentally required to support RDMA over Ethernet? We show that the need for PFC is an artifact of current RoCE NIC designs rather than a fundamental requirement. We propose an improved RoCE NIC (IRN) design that makes a few simple changes to the RoCE NIC for better handling of packet losses. We show that IRN (without PFC) outperforms RoCE (with PFC) by 6-83% for typical network scenarios. Thus not only does IRN eliminate the need for PFC, it improves performance in the process! We further show that the changes that IRN introduces can be implemented with modest overheads of about 3-10% to NIC resources. Based on our results, we argue that research and industry should rethink the current trajectory of network support for RDMA.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 5.
8 papers.
- 2025RailS: Load Balancing for All-to-All Communication in Distributed Mixture-of-Experts Trainingcited by 1
- 2023GraphCC: A Practical Graph Learning-based Approach to Congestion Control in Datacenterscited by 0
- 2024Towards a Flexible and High-Fidelity Approach to Distributed DNN Training Emulationcited by 0
- 2026Resilient AI Supercomputer Networking using MRC and SRv6cited by 0
- 2026High-speed Networking for Giga-Scale AI Factoriescited by 0
- 2026OpenURMA: A Clean-Room Open Implementation of the Unified Bus Protocolcited by 0
- 2026Stateful Worlds, Stateless Elasticity: Exact-State Serving for Interactive World Modelscited by 0
- 2026The Life of a Token: from Words to Bits on the Wirecited by 0
- 2026The Life of a Token: from Words to Bits on the Wire17 Sep 2026
- 2026Stateful Worlds, Stateless Elasticity: Exact-State Serving for Interactive World Models11 Jul 2026
- 2026OpenURMA: A Clean-Room Open Implementation of the Unified Bus Protocol27 May 2026
- 2026High-speed Networking for Giga-Scale AI Factories20 May 2026
- 2026Resilient AI Supercomputer Networking using MRC and SRv65 May 2026
- 2025RailS: Load Balancing for All-to-All Communication in Distributed Mixture-of-Experts Training22 Oct 2025
- 2024Towards a Flexible and High-Fidelity Approach to Distributed DNN Training Emulation5 May 2024
- 2023GraphCC: A Practical Graph Learning-based Approach to Congestion Control in Datacenters9 Aug 2023