Gangyi Luo

Gangyi Luo

Auto-generated profile, based on publicly available information

Gangyi Luo

China Mobile (Suzhou) Software Technology Company Ltd., Suzhou, Jiangsu, 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
5 August 2025 in Computer Networks
Verified
Journal Article
Closed access
HSHesheng Sun
Hesheng Sun
ZQZhuzhong Qian
Zhuzhong Qian
AZAndong Zhu
Andong Zhu
Sheng ZhangSheng Zhang
Sheng Zhang
SLSanglu Lu
Sanglu Lu
GLGangyi Luo
Gangyi Luo

2 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
GZGongming Zhao
Gongming Zhao
YDYichen Dong
Yichen Dong
HXHongli Xu
Hongli Xu
JFJin Fang
Jin Fang
ZYZhen Yao
Zhen Yao
CXChu Xu
Chu Xu
Distributed training (DT) has emerged as a solution to address the growing computational resource demands of training large-scale machine learning models. To meet this need, cloud providers typically build GPU clusters to accommodate DT jobs. For DT job requests, cloud providers need to determine in which GPUs place workers (i.e., job placement). Existing approaches usually place workers on as few idle machines as possible to minimize communication time. However, this scheme will lead to a resource fragmentation problem, which degrades the resource utilization rate of the GPU cluster and increases training costs for cloud providers. In this paper, we propose $\textsf {Titan}$ , a novel job placement scheme that mitigates the influence of resource fragmentation by enhancing the utilization of non-idle machines. To further optimize resource allocation, we introduce a dynamic defragmentation algorithm that migrates fragmented jobs to consolidate GPU resources, enabling efficient placement of large-scale training jobs. $\textsf {Titan}$ formulates a multi-objective non-linear optimization problem and proves its NP-hardness. To solve this problem, $\textsf {Titan}$ presents an effective submodular-based greedy algorithm with a tight approximation ratio ( $1-\frac {1}{e}$ ). We evaluate $\textsf {Titan}$ with a large-scale simulation employing real-world job traces and a small-scale testbed consisting of 8 servers with 32 logical GPUs. Experimental results show that $\textsf {Titan}$ can achieve near-optimal training throughput while improving the efficiency of the cluster by 74.9% compared to the state-of-the-art solutions.

9 May 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
AZAndong Zhu
Andong Zhu
JQJi Qi
Ji Qi
Sheng ZhangSheng Zhang
Sheng Zhang
GLGangyi Luo
Gangyi Luo
KCKe Cheng
Ke Cheng
SLSanglu Lu
Sanglu Lu
Increased videos captured by widely deployed cameras are being analyzed by computer vision-based Deep Neural Networks (DNNs) on servers rather than being streamed for humans. Unfortunately, the conventional codecs (e.g., H.26x and MPEG-x) originally designed for video streaming lack content-aware feature extraction and hinder machine-centric video analytics, making it difficult to achieve the required high accuracy with tolerable delay. Neural codecs (e.g., autoencoder) now hold impressive compression performance and have been widely advocated in video streaming. While autoencoder shows transformative potential, the application in video analytics is hampered by low accuracy in detecting small objects of high-resolution videos and the serious challenges posed by multi-video streaming. To this end, we propose AdaStreamer with adaptive neural codecs to enable real machine-centric high-accuracy multi-video analytics. We also investigate how to achieve optimal accuracy under delay constraints via careful scheduling in Compression Ratios (CRs, the ratio of the compressed size to the original data size) and bandwidth allocation, and further propose a Markov-based Adaptive Compression and Bandwidth Allocation algorithm (MACBA). We have practically developed a prototype of AdaStreamer, based on which extensive experiments verify its accuracy improvement (up to 15%) compared to state-of-the-art coding and streaming solutions.

2 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
LLLong Li
Long Li
GZGongming Zhao
Gongming Zhao
CXChu Xu
Chu Xu
HXHongli Xu
Hongli Xu
BWBaoqing Wang
Baoqing Wang
GLGangyi Luo
Gangyi Luo
The increasing demands of tenants are driving the growth of single virtual private cloud (VPC), leading to a trend towards cross-cluster VPC deployments, which fuels an increasing demand for cross-cluster VPC communication. However, the rapid growth of cross-cluster traffic and its inherently dynamic nature have exposed critical limitations in existing network solutions, which now struggle to maintain required throughput levels and ensure reliable communication. This growing inadequacy has consequently created persistent network performance bottlenecks in cross-cluster communication systems. To address this issue, we present HiReC, a system designed to achieve high-throughput and reliable cross-cluster VPC communication. To optimize throughput performance, HiReC leverages multiple gateways with a rounding-based mapping algorithm that ensures effective load balancing to forward cross-cluster traffic. Furthermore, HiReC augments gateway forwarding efficiency through implementation of the eXpress Data Path (XDP) framework, leveraging kernel-bypass techniques to accelerate packet processing. For reliability enhancement, HiReC employs a low-overhead, eBPF-based monitoring module and adaptive load adjustment mechanism to dynamically adjust traffic distribution among gateways, effectively handling gateway node or link failures. We implement our system and evaluate its performance through testbed experiments and simulation experiments. The results show that HiReC can effectively improve the throughput of cross-cluster communication and deal with abnormal events. For example, HiReC improves the throughput by $3.8\times $ and reduces the failure recovery latency by $19\times $ compared with state-of-the-art solutions.