Ke Cheng

Ke Cheng

Auto-generated profile, based on publicly available information

Ke Cheng

Nanjing University, Nanjing, 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
19 February 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KCKe Cheng
Ke Cheng
Sheng ZhangSheng Zhang
Sheng Zhang
MLMeizhao Liu
Meizhao Liu
YGYingcheng Gu
Yingcheng Gu
LWLiu Wei
Liu Wei
LTLei Tang
Lei Tang
Deploying microservice instances in geo-distributed edge clouds which are located at the network edge and in proximity to end-users can provide on-site processing, thereby improving the quality of service (QoS). To accommodate the time-varying request arrival rate of each edge cloud, the deployment scheme of microservice instances is dynamically adapted, which is called microservice autoscaling. However, existing studies on microservice autoscaling at the edge either only optimize the QoS without considering the cost of deploying microservice instances or simply focus on the cost per individual timeslot, and thus always severely violate the long-term budget constraint. To solve this problem, in this article, we propose GeoScale, a novel method that aims to optimize the average request response time under the long-term cost budget constraint. GeoScale first utilizes the Lyapunov optimization framework to decompose the long-term optimization problem into a series of per-timeslot sub-problems and then applies a signomial geometric programming (SGP)-based algorithm to obtain a near-optimal solution to each NP-hard sub-problem. Through extensive trace-driven experiments, we validate the superiority of GeoScale. The experimental results show that compared with existing strategies and designed baselines, GeoScale can improve QoS by reducing the average request response time up to 87.8% while significantly mitigating the violation of the long-term cost budget constraint.

22 April 2025
Verified
Conference Paper
Open access
KCKe Cheng
Ke Cheng
ZWZhi Wang
Zhi Wang
WHWen Hu
Wen Hu
TYTiannuo Yang
Tiannuo Yang
JLJianguo Li
Jianguo Li
Sheng ZhangSheng Zhang
Sheng Zhang

15 December 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XSXiaohang Shi
Xiaohang Shi
Sheng ZhangSheng Zhang
Sheng Zhang
JWJie Wu
Jie Wu
Ning ChenNing Chen
Ning Chen
KCKe Cheng
Ke Cheng
SLSanglu Lu
Sanglu Lu
Deep convolutional neural network (NN)-based object detectors are not appropriate for straightforward inference on high-resolution videos at edge devices, as maintaining high accuracy often brings about prohibitively long latency. Although existing solutions have attempted to reduce on-device inference latency by selecting a cheaper configuration (e.g., choosing a more lightweight NN or scaling a frame to a smaller size before inference) or eliminating a background containing no object, they often ignore various high-resolution features and fail to optimize for those videos. We thus present AdaPyramid, a framework to reduce as much on-device inference latency as possible, especially for high-resolution videos, while achieving the accuracy demand approximately. We observe that the cheapest configuration to achieve the accuracy demand varies significantly across both different frames and different regions in a frame. The underlying reason is that object features (e.g., the location, size and category of objects) are more uneven in high-resolution videos, both temporally and spatially. Moreover, we observe that the object size presents a prominent hierarchical distribution in high-resolution frames. AdaPyramid thus partitions each frame hierarchically just like a pyramid and chooses a content-aware configuration for each region, which is adapted online based on the feedback. We evaluate the performance of AdaPyramid on a public dataset and our collected real-world videos. The obtained results show that under comparable accuracy to the state-of-the-art solutions, AdaPyramid can decrease inference latency by 40% on average, with up to 2.5× speed-up.

5 May 2021
Verified
Conference Paper
Closed access
KCKe Cheng
Ke Cheng
SQSiyi Quan
Siyi Quan
JYJiaqi Yan
Jiaqi Yan
The challenge of collecting large scale environmental data lies in reducing the cost of allocating data sensors while improving the data quality. Compared with traditional centralized data collecting methods, obtaining environmental data by distributed “crowds” can largely reduce the cost. However, designing such crowdsourcing systems requires an appropriate incentive mechanism to encourage providing accurate and rare environmental data. In this paper, we propose to utilize blockchain-based incentive mechanisms to address the problem. We design and evaluate a blockchain-based system for large scale environmental data acquisition, which consists of a sensor layer to collect distributed environmental data, a valuation layer to evaluate the quality of the data collected, a consensus layer to incentive and motivate high quality data collection, and a ledger layer to record the incentive transactions and the qualified environmental data. The incentive mechanism in the consensus layer is achieved with a Proof-of-Data-Value (PODV) protocol adapted from the Practical Byzantine Fault Tolerance (PBFT) [11] consensus algorithm. We carry out experiments to compare the PODV with contemporary blockchain census protocols including Proof-of-Work (POW) [16] and Proof-of-Stake (POS)[18]. The experimental results show that the proposed system outperforms in encouraging crowds to provide accurate and rare environmental data, and imply that the PODV are superior in terms of throughput and environmental friendliness.

22 July 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
AZAndong Zhu
Andong Zhu
Sheng ZhangSheng Zhang
Sheng Zhang
LMLingkun Meng
Lingkun Meng
XSXiaohang Shi
Xiaohang Shi
XLXiangyu Li
Xiangyu Li
YLYu Liang
Yu Liang
Edge video analytics typically rely on conventional encoding standards to transmit device visual data for server-side inference. Unfortunately, general-purpose compression solutions retain unnecessary visual data that does not contribute to accuracy, resulting in significant latency throughout Video Analytics Pipeline (VAP). While previous approaches have made partial progress, they cannot systematically eliminate VAP redundancy due to uncoordinated subsystem-level optimization. Achieving complete redundancy elimination presents a major challenge, as a lack of spatio-temporal coordination risks offsetting latency gains with computational overhead (associated with redundancy elimination). Crucio overcomes these limitations with an end-to-edge framework that integrates temporally adaptive frame filtering and coordinated video compression. It leverages redesigned asymmetric autoencoders to synchronize inter-frame temporal compression with intra-frame spatial feature extraction. Additionally, Crucio employs a one-pass decoding mechanism for encoded critical frames and dynamically adjusts batching scales to minimize latency. Empirical results demonstrate Crucio’s superiority, outperforming existing solutions (e.g., DDS, Reducto, and STAC) by over a 31% reduction in end-to-end latency at 0.9 accuracy thresholds.

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.