Jingling Liu

Dr. Jingling Liu


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
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.

3 April 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
JLJingling Liu
Jingling Liu
JHJiawei Huang
Jiawei Huang
WLWenjun Lv
Wenjun Lv
JWJianxin Wang
Jianxin Wang
Modern data centers host diverse applications, which generate a mix of short flows with stringent latency requirement and long flows requiring large sustained throughput. To solve the problem of resource competition between the mixed flows, we propose an adaptive traffic isolation scheme APS. Based on the packet spraying scheme in the multipath transmission, APS dynamically separates long flows from short ones on different paths to provide the low latency for the short flows. Meanwhile, to resolve the out-of-order problem, APS limits the long flows to a few paths with Equal Cost Multi Path (ECMP). Experimental results of NS2 simulation and Mininet implementation show that, APS reduces the average completion time for short flows by up to 60% and increases the throughputs for long flows by about 1.68x over the state-of-the-art multipath transmission schemes.

4 March 2021 in IEEE Access
Verified
Journal Article
Open access
WLWeihe Li
Weihe Li
JLJingling Liu
Jingling Liu
SWShiqi Wang
Shiqi Wang
TZTao Zhang
Tao Zhang
SZShaojun Zou
Shaojun Zou
JHJiawei Huang
Jiawei Huang
Due to the explosive growth of all kinds of Internet services, data centers have become an irreplaceable and vital infrastructure to support this soaring trend. Compared with traditional networks, data center networks (DCNs) have unique features, such as high bandwidth, low latency, many-to-one communication mode, shallow buffered switches, and multi-root topology. These new characteristics pose a lot of challenges to previous network technics (e.g., Ethernet, Equal Cost Multi-path (ECMP), TCP), making them hard to adapt to DCNs and leading to severe performance degradation. In order to solve these challenges, DCNs have attracted a lot of attention from the industry and academia in recent years, and many new mechanisms in different layers are proposed to improve the transmission performance of data center networks. In the meantime, many surveys have emerged currently to introduce the current research of data center networks. However, previous surveys of DCNs mainly focus on only one specific network layer, making them difficult for readers to know about advanced researches on a holistic level. To help readers comprehend the current research progress of data center networks quickly, we employ a multi-layered top down taxonomy to classify the literature and propose several probable dimensions for future research in this area.

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.

28 May 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WLWeihe Li
Weihe Li
JHJiawei Huang
Jiawei Huang
YLYu Liang
Yu Liang
QSQichen Su
Qichen Su
JLJingling Liu
Jingling Liu
JWJianxin Wang
Jianxin Wang
Adaptive Bitrate (ABR) algorithms have become increasingly important for delivering high-quality video content over fluctuating networks. Considering the complexity of video scenes, video chunks can be separated into two categories: those with intricate scenes and those with simple scenes. In practice, it has been observed that improving the quality of intricate chunks yields more substantial improvements in Quality of Experience (QoE) compared with focusing solely on simple chunks. However, the current ABR schemes either treat all chunks equally or rely on fixed linear-based reward functions, which limits their ability to meet real-world requirements. To tackle these limitations, this paper introduces a novel ABR approach called CAST (Complex-scene Aware bitrate algorithm via Self-play reinforcemenT learning), which considers the scene complexity and formulates the bitrate adaptation task as an explicit objective. Leveraging the power of parallel computing with multiple agents, CAST trains a neural network to achieve superior video playback quality for intricate scenes while minimizing playback freezing time. Moreover, we also introduce a new variant of our proposed approach called CAST-DU, to address the critical issue of efficiently managing users’ limited cellular data budgets while ensuring a satisfactory viewing experience. Furthermore, we present CAST-Live, tailored for live streaming scenarios with constrained playback buffers and considerations for energy costs. Extensive trace-driven evaluations and subjective tests demonstrate that CAST, CAST-DU, and CAST-Live outperform existing off-the-shelf schemes, delivering a superior video streaming experience over fluctuating networks while efficiently utilizing data resources. Moreover, CAST-Live demonstrates effectiveness even under limited buffer size constraints while incurring minimal energy costs.

28 September 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JLJingling Liu
Jingling Liu
JHJiawei Huang
Jiawei Huang
WLWeihe Li
Weihe Li
JWJianxin Wang
Jianxin Wang
THTian He
Tian He
Datacenter networks provide large bisection bandwidth by load balancing traffic over rich parallel paths in multi-rooted tree topologies. Nevertheless, production datacenters operate under various path diversities caused by traffic dynamics, hardware failures and heterogeneous switching equipment. Therefore, the load balancing schemes in data center should be resilient to network asymmetry. Prior fine-grained schemes such as RPS and Presto are prone to experience packet reordering problem under asymmetric topology since they split flows into small units which are spread across all parallel paths. The coarse-grained solutions such as ECMP and LetFlow effectively avoid packet reordering, but easily leading to under-utilization of multiple paths. To solve these problems, we propose a load balancing mechanism called AG, which adaptively adjusts switching granularity according to the asymmetric degree of multiple paths. AG increases switching granularity to alleviate packet reordering under large degrees of topology asymmetry, while reducing switching granularity to obtain high link utilization under small degrees of topology asymmetry. Moreover, we design a switch-based scheme which measures the difference of one-way delay of multiple paths to obtain accurate state of topology asymmetry with low overhead. AG is a practical switch-based solution without modification at end hosts. The experimental results of NS2 simulations and real implementation show that AG reduces the average and $99^{th}$ flow completion time by up to 54% and 65% compared with the state-of-the-art load balancing schemes, respectively.