Kechao Cai

Kechao Cai

Auto-generated profile, based on publicly available information

Kechao Cai

School of Electronics and Communication Engineering, Shenzhen Campus of Sun Yat-sen University, Shenzhen, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
23 January 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KCKechao Cai
Kechao Cai
HXHong Xie
Hong Xie
JLJohn C. S. Lui
John C. S. Lui
Mining the characteristics of information spreading in networks is crucial in communication studies, network security management, epidemic investigations, etc. Previous works are restrictive because they mainly focused on the information source detection using either a single observation, or multiple but independent observations of the underlying network while assuming a homogeneous information spreading rate. We conduct a theoretical and experimental study on information spreading, and propose a new and novel estimation framework to estimate 1) information spreading rates, 2) start time of the information source, and 3) the location of information source by utilizing multiple sequential and dependent snapshots where information can spread at heterogeneous rates. Our framework generalizes the current state-of-the-art rumor centrality [1] and the union rumor centrality [2]. Furthermore, we allow heterogeneous information spreading rates at different branches of a network. Our framework provides conditional maximum likelihood estimators for the above three metrics and is more accurate than rumor centrality and Jordan center in both synthetic networks and real-world networks. Applying our framework to the Twitter's retweet networks, we can accurately determine who made the initial tweet and at what time the tweet was sent. Furthermore, we also validate that the rates of information spreading are indeed heterogeneous among different parts of a retweet network.

10 May 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
KCKechao Cai
Kechao Cai
XLXutong Liu
Xutong Liu
YCYu-Zhen Janice Chen
Yu-Zhen Janice Chen
JLJohn C.S. Lui
John C.S. Lui
There have been studies that consider optimizing applications in an online learning context using multi-armed bandit models. However, existing frameworks are problematic as they only consider finding the optimal decisions to minimize the regret, but neglect the constraints (or guarantee) requirements that may be excessively violated. In this paper, we formulate the stochastic constrained multi-armed bandit model with either ‘`time-varying’' or ‘`stochastic’' multi-level rewards for network application optimizations with guarantee by taking both regret and violation into consideration. Alongside this model, we design two constrained multi-armed bandit policies, Learning with Guarantee with time-Varying rewards (LG-V) and Learning with Guarantee with Stochastic rewards (LG-S), with provable sub-linear regret and violation bounds. Moreover, we illustrate how our policies can be applied to several emerging network application optimizations, namely, opportunistic multichannel selection, data-guaranteed mobile crowdsensing, and stability-guaranteed crowdsourced transcoding. To show the effectiveness of LG-V and LG-S in optimizing these applications with different requirements, we also conduct extensive simulations by comparing both LG-V and LG-S with existing state-of-the-art policies. We also show the impact of parameter variations, namely, the variations of the guarantee threshold and the number of selected arms, on the regrets and violations of LG-V and LG-S.

3 July 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SLShuling Li
Shuling Li
YSYaping Sun
Yaping Sun
JZJinbei Zhang
Jinbei Zhang
KCKechao Cai
Kechao Cai
SCShuguang Cui
Shuguang Cui
XXXiaodong Xu
Xiaodong Xu
Semantic communication has drawn substantial attention as a promising paradigm to achieve effective and intelligent communications. However, efficient image semantic communication encounters challenges with a lower testing compression ratio (CR) and signal-to-noise ratio (SNR) compared to the training phase. To tackle this issue, we propose an innovative semantic knowledge base (SKB)-enabled generative semantic communication system for image classification task and image generation task. Specifically, a lightweight SKB, comprising class-level information, is exploited to guide the semantic communication process, which enables us to transmit only the relevant indices. This approach promotes the completion of the image classification task at the transmitter and significantly reduces the transmission load. Meanwhile, the class-level knowledge in the SKB facilitates the image generation task by allowing controllable generation, making it possible to generate class-consistent images in resource-constrained and low SNR scenarios. Furthermore, an adaptive CR and mode selection mechanism is designed to automatically adjust the CR and task mode, which allows the proposed system accommodate various CR and SNR conditions. Evaluation results indicate that the proposed method outperforms the benchmarks and achieves superior performance with minimal CR and SNR.

3 March 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JZJinbei Zhang
Jinbei Zhang
CCChunpeng Chen
Chunpeng Chen
KCKechao Cai
Kechao Cai
JLJohn C. S. Lui
John C. S. Lui
This paper proposes a replacement algorithm for file caching in mobile edge computing (MEC) networks. While there are numerous schemes for file replacement, it remains a challenge to achieve good, robust, and predictable performance simultaneously. To address this challenge, we introduce a general scheme called Incremental Least-Recently-Used (iLRU), which builds on the classic Least-Recently-Used (LRU) algorithm. iLRU initially caches only a “portion” of the file upon the first request and incrementally caches more when there are more requests for the file. In this regard, the request frequency can be inferred from the cached size without incurring additional overhead, where a larger cached size represents a higher request frequency. We derive the theoretical hit ratio of iLRU based on the Time-to-Live (TTL) analysis. With the Time-to-Live (TTL) analysis, we can theoretically derive the hit ratio and properties of iLRU and notably show that iLRU allocates more cache space to popular files, resulting in a higher hit ratio than LRU. Simulation results demonstrate the superior performance of iLRU and validate the accuracy of the theoretical hit ratio. Furthermore, we conduct simulations over various real-world traces to show that iLRU outperforms existing schemes across various real-world traces, defenestrating the robustness of iLRU.

30 May 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KHKai Huang
Kai Huang
XWXiaoxia Wang
Xiaoxia Wang
JZJinbei Zhang
Jinbei Zhang
KCKechao Cai
Kechao Cai
ZXzhu xiangwei
zhu xiangwei
Coded caching is an effective method to reduce the traffic load on network bottleneck. While the heterogeneities on the number of requests and cache sizes in coded caching have been studied independently, their joint impact is still unclear. This paper investigates coded caching in scenarios with heterogeneous number of requests and cache sizes. We propose two achievable schemes. The first scheme, based on file grouping and multi-round decentralized coded caching, is demonstrated to be order optimal under the worst setting, i.e., when user with the i -th smallest cache has the i -th largest number of requests. Moreover, we obtain an important insight that the lower bound of the achievable rate is predominantly influenced by users with high Xi / Mi ratios, where Xi and Mi represent the number of requests and cache size of user i , respectively. Since the achievable rate of our first scheme is difficult to analyze in the general setting, we further propose the second scheme to derive a tractable upper bound. Based on the insight, the second scheme rearranges the users according to their Xi / Mi ratios and employs a threshold to divide them into the head users who may have a large impact on the lower bound, and the tail users who may have a small impact on the lower bound. The server transmits the demands of the head users directly while applying the first scheme in groups among the tail users. Under the general setting, the gap between the rate of our second scheme and the lower bound is proved to be within a logarithmic factor. Simulations are conducted to verify the superior performance of our proposed schemes.

11 December 2024 in IEEE Networking Letters
Verified
Journal Article
Closed access
ZSZhenghao Sha
Zhenghao Sha
KCKechao Cai
Kechao Cai
JZJinbei Zhang
Jinbei Zhang
Online caching at the network edge is becoming increasingly important for alleviating the transmission pressure on backbone networks. Previous studies on online caching policies mainly use the static regret as the performance metric, which relies on a fixed benchmark and lacks the capacity to ensure optimal performance in non-stationary environments. In this letter, we introduce the strongly adaptive regret into online caching and propose a Strongly Adaptive online caching scheme (). Our scheme focuses on the performance over time intervals with a length between τand τ, where τand τare the lower and upper bound on how long the environment changes, respectively. consists of multiple interval caches operating in a lazy restart mode to make candidate caching decisions, and an aggregated cache that weights the these candidate decisions to determine the final caching decision. We prove that the regret upper bound is sub-linear with respect to the time interval’s length τ, i.e., O(τlog(τ/τ)). Our experiment results demonstrate that achieves the highest cache hit ratio and the lowest regret compared to other caching policies in non-stationary environments.