Yuxiang Wang

Yuxiang Wang

Auto-generated profile, based on publicly available information

Yuxiang Wang

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 August 2024
Verified
Conference Paper
Open access
BCBiyao Che
Biyao Che
YWYuxiang Wang
Yuxiang Wang
ZWZirui Wan
Zirui Wan
YCYing Chen
Ying Chen
ZWZixiao Wang
Zixiao Wang
JZJiao Zhang
Jiao Zhang
Congestion control plays a crucial role in ensuring the performance of data center networks. However, mainstream RDMA congestion control algorithms still face challenges such as slow congestion response and poor deployability. In this paper, we propose a novel fast-convergence congestion control algorithm, FCC, to address these shortcomings. FCC leverages Explicit Congestion Notification (ECN) and Round-Trip Time (RTT) signals, utilizing the gradient of RTT to enhance response speed and employing a Sigmoid curve for rate increment. Through experiments, we demonstrate that compared to existing state-of-the-art algorithms, FCC achieves superior performance in terms of convergence speed, fairness, and small flow latency metrics.

3 August 2024
Verified
Conference Paper
Open access
ZWZirui Wan
Zirui Wan
JZJiao Zhang
Jiao Zhang
YWYuxiang Wang
Yuxiang Wang
KLKefei Liu
Kefei Liu
HPHaoyu Pan
Haoyu Pan
THTao Huang
Tao Huang
RDMA has been widely deployed in production datacenters. The conventional wisdom believes that the intra-host network delivers stable and high performance. However, intra-host resources witness a relative stagnation in technology trends compared to the evolving RDMA NIC (RNIC). Thus, the RNIC traffic may not get sufficient intra-host resources when it contends with intra-host traffic. A line of recent works from large-scale production datacenter operators demonstrates the emergence of intra-host congestion and associated performance collapse, which forces us to rethink the practice of intra-host congestion control. However, the ability to efficiently control RDMA intra-host networks is far less mature than inter-host networks, which brings challenges in congestion monitoring, intra-host resource allocation and RNIC traffic adjustment. In this paper, we propose RDMA intra-Host Congestion Control (RHCC), which combines sub-RTT granularity intra-host traffic congestion avoidance and proactive RNIC traffic adjustment. We implement RHCC on commodity servers and RNICs and conduct experiments to evaluate the performance. The results show that RHCC can increase/decrease the network throughput/latency by up to 2 × and 1.4 ×, respectively.

7 January 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
ZWZirui Wan
Zirui Wan
JZJiao Zhang
Jiao Zhang
YWYuxiang Wang
Yuxiang Wang
KLKefei Liu
Kefei Liu
HPHaoyu Pan
Haoyu Pan
THTao Huang
Tao Huang
RDMA has been widely deployed in production datacenters. The conventional wisdom believes that the intra-host network delivers stable and high performance. However, intra-host resources witness a relative stagnation in technology trends compared to the evolving RDMA NIC (RNIC). Thus, the RNIC traffic may not get sufficient intra-host resources when it contends with CPU-to-memory traffic. A line of recent works from large-scale production datacenter operators demonstrates the emergence of intra-host congestion and associated performance collapse, which forces us to revisit the practice of intra-host congestion control. However, the ability to efficiently control RDMA intra-host networks is far less mature than inter-host networks, which brings challenges in congestion monitoring, intra-host resource allocation and RNIC traffic adjustment. In this paper, we propose RDMA intra-Host Congestion Control (RHCC), which combines CPU-to-memory traffic congestion avoidance with sub-RTT granularity and proactive RNIC traffic adjustment. RHCC ensures fast congestion avoidance and can work with different inter-host congestion control methods. We implement RHCC on commodity servers and RNICs and conduct experiments to evaluate the performance. The results show that RHCC can increase/decrease the network throughput/latency by up to 2 $\times$ and 1.4 $\times$ , respectively.

16 July 2025 in IEEE Network
Verified
Journal Article
Closed access
BCBiyao Che
Biyao Che
YWYuxiang Wang
Yuxiang Wang
ZWZirui Wan
Zirui Wan
YCYing Chen
Ying Chen
ZWZixiao Wang
Zixiao Wang
JZJiao Zhang
Jiao Zhang
Data center networks are critical infrastructures currently serving fields such as cloud computing and artificial intelligence, where congestion control algorithms play a critical role in improving network performance. In this paper, we focus on the current research status and prospects of congestion control approach in Remote Direct Memory Access (RDMA) networks and propose a new algorithm to address existing shortcomings. Firstly, we classify and summarize current congestion control algorithms, exploring the advantages and disadvantages of the end-to-end and end-network collaboration approaches. We argue that, considering the trade-off between network performance and hardware costs, attention should still be directed towards end-to-end congestion control algorithms. Then, we analyzed issues with mainstream solutions and introduced a new fast convergence congestion control algorithm, FCC. This algorithm is based on Explicit Congestion Notification (ECN) and Round-Trip Time (RTT) signals, leveraging the gradient of RTT and a Sigmoid curve to enhance response speeds. Finally, we conducted a performance evaluation of this algorithm and compared it with existing ones. Experimental results demonstrate that the FCC algorithm achieves superior performance in terms of convergence speed, fairness, and latency for short flows.

1 January 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YWYuxiang Wang
Yuxiang Wang
JZJiao Zhang
Jiao Zhang
LCLeixin Cai
Leixin Cai
THTao Huang
Tao Huang

5 August 2026
Verified
Conference Paper
Open access
YWYuxiang Wang
Yuxiang Wang
JZJiao Zhang
Jiao Zhang
XHXianyu Huang
Xianyu Huang
YRYubo Ruan
Yubo Ruan
YHYuxuan Hu
Yuxuan Hu
THTao Huang
Tao Huang
Network failures in Artificial Intelligence (AI) training clusters can degrade entire jobs, making fast and accurate fault localization critical. Existing active probing systems suffer from two fundamental limitations: probabilistic path coverage that cannot guarantee complete link observability, and binary anomaly detection that fails to distinguish concurrent failures or localize gray failures. Equal-Cost Multi-Path (ECMP) routing is deterministic given the same 5-tuple, and ECMP configurations are accessible in operator-controlled clusters. We exploit this property to derive exact probe paths through offline hash computation without network measurement. Based on this approach, we design a hash-aware probing system that constructs a deterministic coverage matrix to select minimal probes guaranteeing complete link coverage. We introduce edge signatures to ensure fault distinguishability and a tiered diagnosis approach where lightweight iterative localization handles hard failures while sparse regression localizes gray failures. Preliminary evaluations on fat-tree topologies with up to 10,240 hosts show that our system achieves 100% link coverage with 39× fewer probes than R-Pingmesh, F1 score of 0.75–0.92 for multi-link failures, and 0.67 F1 for gray failures where existing methods fail entirely.