Xianyu Huang

Xianyu Huang

Auto-generated profile, based on publicly available information

Xianyu Huang

Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
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.