Jianglong Nie

Jianglong Nie

Auto-generated profile, based on publicly available information

Jianglong Nie

Peking University, Beijing, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
26 April 2026
Verified
Conference Paper
Open access
YXYuchen Xu
Yuchen Xu
JNJianglong Nie
Jianglong Nie
BLBaojia Li
Baojia Li
MCMingzhuo Chen
Mingzhuo Chen
HLHao Lu
Hao Lu
WWWenfei Wu
Wenfei Wu

30 November 2025
Verified
Conference Paper
Open access
YYYidan Yuan
Yidan Yuan
JNJianglong Nie
Jianglong Nie
YXYuchen Xu
Yuchen Xu
YYYitao Yuan
Yitao Yuan
SFShaoke Fang
Shaoke Fang
WWWenfei Wu
Wenfei Wu

11 August 2026
Verified
Conference Paper
Open access
YYYitao Yuan
Yitao Yuan
JNJianglong Nie
Jianglong Nie
TBTianyu Bai
Tianyu Bai
RZRuizhe Zhou
Ruizhe Zhou
SCSiyuan Cao
Siyuan Cao
WWWenfei Wu
Wenfei Wu

6 August 2025
Verified
Conference Paper
Open access
CZChenyue Zheng
Chenyue Zheng
YZYuchao Zhang
Yuchao Zhang
WWWenfei Wu
Wenfei Wu
ZJZhuo Jiang
Zhuo Jiang
LWLei Wang
Lei Wang
WWWendong Wang
Wendong Wang

27 February 2026 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
JNJianglong Nie
Jianglong Nie
YYYidan Yuan
Yidan Yuan
YXYuchen Xu
Yuchen Xu
YYYitao Yuan
Yitao Yuan
KYKehan Yao
Kehan Yao
WWWenfei Wu
Wenfei Wu
In-network aggregation (INA) has emerged as a key technology to alleviate communication bottlenecks in large-scale distributed training, but its performance is often hindered by suboptimal routing. Existing INA-aware routing algorithms suffer from certain limitations: they either lack a global, multi-job coordination mechanism, or operate on incomplete network models that ignore key hardware constraints such as switch processing capacity. These deficiencies lead to network congestion and inefficient resource utilization, ultimately undermining the full potential of INA. To address these challenges, we present INARouting, a novel framework that holistically solves the multi-job hierarchical aggregation routing problem. We propose TINA, a hierarchical aggregation protocol that supports multi-job in-network aggregation. To address different deployment scenarios, we develop two variants: INARouting-Opt that provides optimal solutions for moderate-scale networks, and INARouting-Relax, a fast and effective heuristic using LP-relaxation and a greedy score-based rounding algorithm for large-scale deployments. Through extensive experiments on various scales of Fat-Tree and Spine-Leaf topologies, we demonstrate that INARouting significantly outperforms state-of-the-art methods. INARouting- Opt achieves provably optimal solutions, reducing average job completion time by up to 56% compared to existing methods. Meanwhile, INARouting-Relax outperforms existing algorithms while being 5× faster in solving time, enabling efficient routing in large-scale, dynamic environments.