计算机科学
服务器
延迟(音频)
计算机网络
GSM演进的增强数据速率
边缘计算
竞争分析
自我认证文件系统
文件服务器
在线算法
文件大小
边缘设备
分布式文件系统
操作系统
响应时间
移动边缘计算
分布式计算
文件系统碎片
SSH文件传输协议
文件共享
移动计算
访问时间
移动电话技术
蜂窝网络
移动设备
文件系统
数据文件
作者
Xin He,Mingyu Cai,Meng Li,Haipeng Dai,Wei Peng,Jian Zhou,Fu Xiao
标识
DOI:10.1109/tmc.2025.3650474
摘要
Edge caching is a critical application scenario in edge networks. By storing diverse files on edge servers and dynamically fetching new files from the cloud, edge networks can provide low-latency file access services for mobile users. In practice, the file fetching latency is non-negligible. Consecutive requests for the same missing file during the fetching phase introduce additional latency (referred to as delayed hits). Existing studies either ignore the delayed hits when making caching decisions or are not applicable to multi-server edge networks. In this paper, we investigate the online caching problem with delayed hits in the multi-server edge networks and prove its hardness. The objective is to minimize the total file access latency. To solve the proposed problem, we propose Cadle, which makes caching decisions based on the latency of different file access operations and weights of files in an online manner, without relying on any prior knowledge of future requests. We prove the competitive ratio of Cadle.We also conduct extensive experiments on the real-world dataset to verify the performance of Cadle. The experimental results show that Cadle reduces the total file access latency by at least 31.8% on average, and improves the hit ratio by at least 25.9% on average compared with state-of-the-art approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI