Zhuo Jiang

Zhuo Jiang

Auto-generated profile, based on publicly available information

Zhuo Jiang

Bytedance, Beijing, China

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
29 March 2018 in IEEE Access
Verified
Journal Article
Open access
ZJZhuo Jiang
Zhuo Jiang
QWQian Wu
Qian Wu
HLHewu Li
Hewu Li
JWJianping Wu
Jianping Wu
Satellite networks are multilayered, and the number of satellites in a single constellation is also increasing. These characteristics make satellite network more suitable for multipath transmission like multipath transmission control protocol (MPTCP). With the use of MPTCP, the bandwidth of different satellite channels can be aggregated, and the mobility performance of users can be improved. Furthermore, software defined networking (SDN) is introduced to the MPTCP to solve the shared bottleneck problem. However, the performance of existing scheme is still far from optimal. The main problems include: (1) static number setting of MPTCP subflows on a per host basis and (2) unaware of the traffic load during the subflow route selection. The shared bottleneck problem is more serious in the satellite network with lattice-like topology. To solve the above problems, we propose an sdn cooperated MPTCP (scMPTCP) architecture and its related algorithms. We extend TCP options to piggyback the relevant control information to flexibly support the communication between the subflows of transport layer and SDN controller. Then, we propose a load and shared bottleneck aware subflow route selection algorithm and adjust algorithm. These two algorithms select routes for new subflows based on the available bandwidth of each route and avoid the bottleneck of other subflows, and also can adapt to the changes of network load. We implement the scMPTCP and its algorithms. The evaluation results show that compared with searching over the non-overlapping paths or shortest paths schemes, our scheme can achieve much higher total system throughput. Moreover, by adjusting the subflows which share bottlenecks, the total aggregated throughput of that connection is also improved greatly.

4 August 2024
Verified
Conference Paper
Open access
KLKefei Liu
Kefei Liu
ZJZhuo Jiang
Zhuo Jiang
JZJiao Zhang
Jiao Zhang
SGShixian Guo
Shixian Guo
XZXuan Zhang
Xuan Zhang
THTao Huang
Tao Huang
RoCE services are sensitive to network failures and performance bottlenecks, which become more common as the RoCE network scales. In addition, some non-network problems behave like network problems and can waste troubleshooting time. However, existing mechanisms cannot quickly detect and locate network problems or determine whether the service problem is network-related. In this paper, we propose R-Pingmesh, the first service-aware RoCE network monitoring and diagnostic system based on end-to-end probing. R-Pingmesh can accurately measure network RTT and end-host processing delay based on commodity RDMA NICs (RNICs), distinguish between RNIC and in-network packet drops, and judge whether a problem is network-related and assess its impact on services. We have deployed R-Pingmesh on tens of thousands of RNICs for over 6 months. One-month evaluation results show that 85% of the problems located by R-Pingmesh are accurate, where all 157 switch network problems are accurate. R-Pingmesh efficiently detects and locates 14 types of problems during deployment, and we share our experience in dealing with them.

27 August 2025
Verified
Conference Paper
Open access
CQChenchen Qi
Chenchen Qi
WWWenfei Wu
Wenfei Wu
YWYongcan Wang
Yongcan Wang
KHKeqiang He
Keqiang He
YKYu-Hsiang (Sean) Kao
Yu-Hsiang (Sean) Kao
SDShan Ding
Shan Ding

12 October 2025
Verified
Conference Paper
Open access
YDYangtao Deng
Yangtao Deng
LZLei Zhang
Lei Zhang
QWQinlong Wang
Qinlong Wang
XZXiaoyun Zhi
Xiaoyun Zhi
XZXinlei Zhang
Xinlei Zhang
HXHong Xu
Hong Xu

27 August 2025
Verified
Conference Paper
Open access
SGShixian Guo
Shixian Guo
KLKefei Liu
Kefei Liu
YLYulin Lai
Yulin Lai
YBYangyang Bai
Yangyang Bai
ZZZiwei Zhao
Ziwei Zhao
THTao Huang
Tao Huang

25 November 2024 in Proceedings of the ACM on Networking
Verified
Journal Article
Open access
ZWZirui Wan
Zirui Wan
JZJiao Zhang
Jiao Zhang
HWHaoran Wei
Haoran Wei
ZJZhuo Jiang
Zhuo Jiang
XZXiaolong Zhong
Xiaolong Zhong
THTao Huang
Tao Huang
Together with the construction of RDMA networks for data center applications, the RDMA-coupled DCQCN dominates the RDMA Congestion Control (CC). However, DCQCN suffers severe performance problems in high-speed RDMA networks with modern high-performance distributed applications such as machine learning training. This paper presents RECC, inspired by both the latest emerging programmability of RDMA NICs (RNICs) and limitations in existing RDMA congestion control mechanisms. RECC comprehensively leverages RTT and ECN events from RNICs to handle congestion timely and precisely, along with a History-aware Burst Smooth mechanism to avoid wrong rate decisions under various traffic patterns. We implement RECC completely based on commercial RNICs without any modifications to switches, RDMA protocol stack, and applications. The results of microbenchmark testbed experiments and real Machine Learning (ML) workload experiments with hundreds of 200G RNICs show that RECC can significantly reduce network tail latency and pause duration by up to 64.4% and 95%, respectively, compared with DCQCN. In addition, large-scale simulations with realistic workloads demonstrate that RECC achieves comparable performance with HPCC.