Zhaoyi Li

Zhaoyi Li

Auto-generated profile, based on publicly available information

Zhaoyi Li

Central South University, Changsha, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 June 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JHJinbin Hu
Jinbin Hu
JHJiawei Huang
Jiawei Huang
WLWenjun Lyu
Wenjun Lyu
WLWeihe Li
Weihe Li
ZLZhaoyi Li
Zhaoyi Li
THTian He
Tian He
The state-of-the-art datacenter load balancing designs commonly optimize bisection bandwidth with homogeneous switching granularity. Their performances surprisingly degrade under mixed traffic containing both short and long flows. Specifically, the short flows suffer from long-tailed delay, while the throughputs of long flows also degrade dramatically due to low link utilization and packet reordering. To solve these problems, we design a traffic-aware load balancing (TLB) scheme to adaptively adjust the switching granularity of long flows according to the load strength of short ones. Under the heavy load of short flows, the long flows use large switching granularity to help short ones obtain more opportunities in choosing short queues to complete quickly. On the contrary, the long flows reroute flexibly with small switching granularity to achieve high throughput. Furthermore, under extremely bursty scenario, we utilize the packet slicing scheme for long flows to release bandwidth for short ones. The experimental results of NS2 simulation and testbed implementation show that TLB significantly reduces the average flow completion time of short flows by 16%-67% over the state-of-the-art load balancers and achieves the high throughput for long flows. Moreover, for extreme bursty case, at the acceptable throughput degradation of long flows, TLB with packet slicing reduces the deadline missing ratio of bursty short flows by up to 80%.

24 August 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JHJiawei Huang
Jiawei Huang
WZWenlu Zhang
Wenlu Zhang
YLYijun Li
Yijun Li
LLLin Li
Lin Li
ZLZhaoyi Li
Zhaoyi Li
JWJianxin Wang
Jianxin Wang
Identifying heavy flows is essential for network management. However, it is challenging to detect heavy flow quickly and accurately under the highly dynamic traffic and rapid growth of network capacity. Existing heavy flow detection schemes can make a trade-off in efficiency, accuracy and speed. However, these schemes still require memory large enough to obtain acceptable performance. To address this issue, we propose ChainSketch, which has the advantages of good memory efficiency, high accuracy and fast detection. Specifically, ChainSketch uses the selective replacement strategy to mitigate the over-estimation issue. Meanwhile, ChainSketch utilizes the hash chain and compact structure to improve memory efficiency. We implement the ChainSketch on OVS platform, P4-based testbed and large-scale simulations to process heavy hitter and heavy changer detection. The results of trace-driven tests show that, ChainSketch greatly improves the F1-score by up to 3.43 $\times$ compared with the state-of-the-art solutions especially for small memory.

8 May 2023
Verified
Conference Paper
Open access
ZLZhaoyi Li
Zhaoyi Li
JHJiawei Huang
Jiawei Huang
YLYijun Li
Yijun Li
AXAikun Xu
Aikun Xu
SZShengwen Zhou
Shengwen Zhou
JWJianxin Wang
Jianxin Wang
Distributed Machine Learning (DML) techniques are widely used to accelerate the training of large-scale machine learning models. However, during training iterations, gradients need to be frequently aggregated across multiple workers, resulting in communication bottleneck. To reduce the communication overhead of DML, several In-Network Aggregation (INA) protocols are proposed to reduce the volume of aggregation traffic by offloading aggregation functions into switches, thus alleviating network bottlenecks. Nevertheless, these protocols couple the congestion control of in-switch aggregator resources and link bandwidth resources, together with the straggler-oblivious manner in aggregator allocation, leading to low aggregation efficiency. To solve the above problem, we propose an Aggregatoraware in-network Aggregation Transmission Protocol (A2TP), which adopts two congestion windows to decouple the congestion control of two resources and combines with the straggling estimation scheme to efficiently allocate aggregator resources according to the straggler degree for multiple jobs, eliminating the impact of straggler jobs on the overall aggregation process. We implement A2TP at P4-programmable switch and a kernel bypass protocol stack at the end-host. The evaluation results show that A2TP reduces the training time by up to 66% than the state-of-the-art INA protocols in real-world benchmark models.

11 May 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JLJingling Liu
Jingling Liu
JHJiawei Huang
Jiawei Huang
ZLZhaoyi Li
Zhaoyi Li
YLYijun Li
Yijun Li
JWJianxin Wang
Jianxin Wang
THTian He
Tian He
Modern data centers often host multiple applications with diverse network demands. To provide fair bandwidth allocation to several thousand traversing flows, Approximate Fair Queueing (AFQ) utilizes multiple priority queues in switch to approximate ideal fair queueing. However, due to limited number of queues in programmable switches, AFQ easily experiences high packet loss and low link utilization. In this paper, we propose Elastic Fair Queueing (EFQ), which leverages limited priority queues to flexibly achieve both high network utilization and fair bandwidth allocation. EFQ dynamically assigns the free buffer space in priority queues for each packet to obtain high utilization without sacrificing flow-level fairness. The results of simulation experiments and real implementations show that EFQ reduces the average flow completion time by up to 82% over the state-of-the-art fair bandwidth allocation mechanisms.

1 November 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JHJinbin Hu
Jinbin Hu
JHJiawei Huang
Jiawei Huang
ZLZhaoyi Li
Zhaoyi Li
JWJianxin Wang
Jianxin Wang
THTian He
Tian He
Existing reactive or proactive congestion control protocols are hard to simultaneously achieve ultra-low latency and high link utilization across all workloads ranging from delay-sensitive flows to bandwidth-hungry ones in datacenter networks. We present an Anti-ECN (Explicit Congestion Notification) Marking Receiver-driven Transport protocol called AMRT, which achieves both near-zero queueing delay and full link utilization by reasonably increasing sending rate in the case of under-utilization. Specifically, switches mark the ECN bit of data packets once detecting spare bandwidth. When receiving the anti-ECN marked packet, the receiver generates the corresponding marked grant to trigger more data packets. The testbed and simulation experiments show that AMRT effectively reduces the average flow completion time (AFCT) by up to 42% and improves the link utilization by up to 38% over the state-of-the-art receiver-driven transmission schemes.

17 May 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
ZLZhaoyi Li
Zhaoyi Li
PZPing Zhong
Ping Zhong
JHJiawei Huang
Jiawei Huang
FGFeng Gao
Feng Gao
JWJianxin Wang
Jianxin Wang
In tile-based 360° video streaming, the users employ the tile rate allocation algorithm to select appropriate bitrate to maximize the quality of experience (QoE). The preferences and viewports, however, can vary significantly across the different users. Since the users independently choose their bitrate according to their own preferences and viewports, it is hard to ensure QoE fairness for users under the constraint of available bandwidth. In this paper, we propose a QoE-fairness aware bitrate allocation algorithm for multi-users (QBAM) to reduce difference of user QoE. According to the trajectory of the user viewpoint and user preferences for video quality, rebuffer time and quality switching, we leverage multi-agent reinforcement learning to train the bitrate allocation strategy. The experimental results show, compared with the current tile rate allocation algorithm, QBAM effectively improves the QoE fairness.