Demo Data from EDBT 2026 / reviewers in the wild / expert
Yi He 0017
dblp:65/425-17
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
0009-0005-7430-428XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 since 2021Computer networks · 2 · 2 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
1 paper |
Datacenter networks · 50% Transport protocols and congestion control · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Datacenter networks
load balancing |
0.8 | 1 | 2024 | Enhancing Load Balancing With In-Network Recirculation to Prevent Packet Reordering in Lossless Data Centers · IEEE/ACM Trans. Netw. 2024 |
Transport protocols and congestion control
packet reordering |
0.8 | 1 | 2024 | Enhancing Load Balancing With In-Network Recirculation to Prevent Packet Reordering in Lossless Data Centers · IEEE/ACM Trans. Netw. 2024 |
Methods — techniques the papers use, named apart from their topics
in-network recirculation · 1.5PFC prediction · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | TaLB: Tensor-aware Load Balancing for Distributed DNN Training AccelerationabstractIncreasingly large-scale models and rich data sets make communication overhead a key bottleneck for distributed Deep Neural Network (DNN) training, constantly attracting the attention of academia and industry. Despite continuous efforts, prior solutions such as pipelining computation/communication and in-network gradient compression/scheduling do not focus on how to accelerate DNN training through load balancing in datacenter networks (DCNs). However, the existing load balancing mechanisms are unaware of tensor integrity and priority for gradient parameter synchronization during the DNN training iterations, resulting in severe tensor tail latency and slow model convergence speed. In this paper, we present a Tensor-aware Load Balancing (TaLB) scheme to accelerate DNN training. Specifically, TaLB identifies the different priority tensors and makes (re)routing decisions based on the tensor-level granularity to cut the high-priority tensors tail delay. The testbed implementation and large-scale NS-3 simulation results show that TaLB effectively accelerates DNN training speed. For example, TaLB significantly reduces the average flow completion time (FCT) by up to 55%, and accelerates the model training speed up to 2.37× on VGG19, ResNet50 and AlexNet models. Jinbin Hu 0001, Yi He 0017, Wangqing Luo, Jiawei Huang 0001, Jianxin Wang 0001, Jin Wang 0001 |
IWQoS | 2 |
| 2024 | Enhancing Load Balancing With In-Network Recirculation to Prevent Packet Reordering in Lossless Data CentersabstractMany existing load balancing mechanisms work effectively in lossy datacenter networks (DCNs), but they suffer from serious packet reordering in lossless Ethernet DCNs deployed with the hop-by-hop Priority-based Flow Control (PFC). The key reason is that the prior solutions are not able to perceive PFC triggering correctly and in a timely manner when making load balancing decisions. Once the forwarding path pauses transmission due to PFC triggering, the packets allocated on it are blocked, inevitably leading to out-of-order packets and retransmission. In this paper, we present an Reordering-robust Load Balancing (RLB) scheme with PFC prediction in lossless DCNs. At its heart, RLB leverages the derivative of ingress queue length to predict PFC triggering and proactively notifies the upstream switches to choose an appropriate rerouting path or perform packet recirculation to avoid reordering. Furthermore, under switch failure scenarios, RLB adjusts the recirculation threshold adaptively to mitigate the risk of packets over-recirculation. We have implemented RLB in the hardware programmable switch. As a building block for existing load balancing mechanisms, we have integrated RLB into Presto, LetFlow, Hermes and DRILL. The evaluation results show that the RLB-enhanced solutions deliver significant performance by avoiding packet reordering. For example, it reduces the$99^{th}$percentile flow completion time (FCT) by up to 72%, 67%, 58% and 54% over DRILL, Presto, LetFlow and Hermes, respectively. Jinbin Hu 0001, Yi He 0017, Wangqing Luo, Jiawei Huang 0001, Jin Wang 0001 |
IEEE/ACM Trans. Netw. | 2 |
| 2023 | Deep Reinforcement Learning Based Load Balancing for Heterogeneous Traffic in Datacenter Networks
Jinbin Hu 0001, Wangqing Luo, Yi He 0017, Jin Wang 0001, Dengyong Zhang |
ICA3PP (3) | 3 |
| 2023 | RLB: Reordering-Robust Load Balancing in Lossless Datacenter NetworksabstractMany existing load balancing mechanisms work effectively in lossy datacenter networks (DCNs), but they suffer from serious packet reordering in lossless Ethernet DCNs deployed with the hop-by-hop Priority-based Flow Control (PFC). The key reason is that the prior solutions are not able to correctly and timely perceive PFC triggering when making load balancing decisions. Once the forwarding path pauses transmission due to PFC triggering, the packets allocated on it are blocked, inevitably leading to out-of-order packets and retransmission. In this paper, we present a Reordering-robust Load Balancing (RLB) scheme with PFC prediction in lossless DCNs. At its heart, RLB leverages the derivative of ingress queue length to predict PFC triggering and proactively notifies the upstream switches to choose an appropriate rerouting path or perform packet recirculation to avoid reordering. As a building block for existing load balancing mechanisms, we have integrated RLB into Presto, LetFlow, Hermes and DRILL. The test results show that the RLB-enhanced solutions deliver significant performance by avoiding packet reordering. For example, it reduces the 99th percentile flow completion time (FCT) by up to 58%, 67%, 72% and 54% over Presto, LetFlow, Hermes and DRILL, respectively. Jinbin Hu 0001, Yi He 0017, Jin Wang 0001, Wangqing Luo, Jiawei Huang 0001 |
ICPP | 2 |