Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chenxu Wang 0007

dblp:16/10143-7 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-6347-3233ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network management and operations · 94% Network optimization and economics · 6%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 46% Cloud and datacenter computing · 27% Parallel and multicore computing · 27%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
collective communication
1.012026
xCCLTuner: Treating xCCL as Black-Box and Automatically Tuning · INFOCOM 2026
Network management and operations › fault management
failure localization
0.912025
Towards LLM-Based Failure Localization in Production-Scale Networks · SIGCOMM 2025
Network management and operations › fault management
fault diagnosis
0.912025
Towards LLM-Based Failure Localization in Production-Scale Networks · SIGCOMM 2025
Network management and operations › fault management › fault diagnosis
root cause analysis
0.912025
Towards LLM-Based Failure Localization in Production-Scale Networks · SIGCOMM 2025
Cloud and datacenter computing
cluster resource management and scheduling
0.612022
PushBox: Making Use of Every Bit of Time to Accelerate Completion of Data-Parallel Jobs · IEEE Trans. Parallel Distributed Syst. 2022
Parallel and multicore computing › parallel scheduling
data-parallel job scheduling
0.612022
PushBox: Making Use of Every Bit of Time to Accelerate Completion of Data-Parallel Jobs · IEEE Trans. Parallel Distributed Syst. 2022
Network optimization and economics › resource allocation
bandwidth allocation
0.212022
PushBox: Making Use of Every Bit of Time to Accelerate Completion of Data-Parallel Jobs · IEEE Trans. Parallel Distributed Syst. 2022

Methods — techniques the papers use, named apart from their topics

joint scheduling algorithm · 1.1bin-packing formulation · 1.1black-box optimization · 1.0auto-tuning · 1.0large language model · 0.9
YearPublicationVenuePosition
2026 xCCLTuner: Treating xCCL as Black-Box and Automatically Tuning
Chenxu Wang 0007, Zhehao Lin, Peirui Cao, Xiaohu Xu, Wan-Chun Dou, Guihai Chen, Chen Tian 0001
INFOCOM1
2026 Networked Agent Memory and Causality Representation: Experiences towards Interpretable Cloud-Scale Root-Causing
Yanyu Ren, Xianshang Lin, Chenxu Wang 0007, Li Chen 0008, Shuai Wang 0028, Kaihui Gao, Dan Li 0001, Chen Tian 0001, Yunguang Li, Ennan Zhai
SIGCOMM3
2025 Towards LLM-Based Failure Localization in Production-Scale Networks
abstract
Root causing and failure localization are critical to maintain reliability in cloud network operations. When an incident is reported, network operators must review massive volumes of monitoring data and identify the root cause (i.e., error device) as fast as possible, making it extremely challenging even for experienced operators. Large language models (LLMs) have shown great potential in text understanding and reasoning. In this paper, we present BiAn, an LLM-based framework designed to assist operators in efficient incident investigation. BiAn processes monitoring data and generates error device rankings with detailed explanations. To date, BiAn has been deployed in our network infrastructure for 10 months and it has successfully assisted operators in identifying error devices more quickly, reducing time to root causing by 20.5% (55.2% for high-risk incidents). Extensive performance evaluations based on 17 months of real cases further demonstrate that BiAn achieves accurate and fast failure localization. It improves accuracy by 9.2% compared to the baseline approach.
Chenxu Wang 0007, Xumiao Zhang, Runwei Lu, Xianshang Lin, Xuan Zeng 0002, Zhe An, Gongwei Wu, Chen Tian 0001, Guihai Chen, Guyue Liu, Yuhong Liao, Dennis Cai, Ennan Zhai
SIGCOMM1
2022 PushBox: Making Use of Every Bit of Time to Accelerate Completion of Data-Parallel Jobs
abstract
To minimize a job's completion time, we need to minimize the completion time of its final stage's last task. Scheduling of machine slots and networks largely dominates the variable part of each task's duration. Finding an optimal schedule is NP-hard even for offline and simplified scenarios. Previous work does lead to improved performance with various strategies. State-of-the-art task placement and network scheduling efforts are largely disjunctive. Without joint optimization, they are sub-optimal and myopic in many scenarios. Task placement usually treats the network as a black box. Thus, we use prioritized bandwidth allocation among tasks making the network bothpredictableandefficientto achieve joint scheduling. With this feature, joint scheduling can be transformed into a specialbin-packing problem. Over this minimal yet power-enough abstraction, we propose PushBox to schedule data-parallel jobs in multi-tenant clusters. When designing the joint scheduling algorithm, we not only embrace the wisdom of prior art but also respect administrators’ fairness intent, which is so far largely ignored. We implement PushBox on Hadoop 3. PushBox performs persistently well on both a small testbed and a trace-driven simulator.
Chen Tian 0001, Yi Wang 0004, Bingchuan Tian, Yang Zhao 0013, Chenxu Wang 0007, Hao-Ran Guan, Wan-Chun Dou, Guihai Chen
IEEE Trans. Parallel Distributed Syst.6