Proactive Caching for Low Access-Delay Services under Uncertain Predictions
Proactive Caching for Low Access-Delay Services under Uncertain Predictions
复制标题
DOI：
10.1145/3309697.3331471
复制
发表时间：
2019-03
期刊：
影响因子：
--
通讯作者：
Ran Liu;E. Yeh;A. Eryilmaz
中科院分区：
文献类型：
--
作者：
Ran Liu;E. Yeh;A. Eryilmaz
对时延敏感的业务的网络流量已成为网络中的主导部分。借助预测信息的主动缓存已被提议作为增强延迟性能的有前途的方法。在本文中，我们分析研究了如何有效利用不确定的预测信息来设计具有可证明良好的访问延迟特性的主动缓存策略的问题。我们首先得出系统可以支持的每个请求的平均主动服务量的上限。然后，我们使用创新的马尔可夫链分析来分析一系列基于阈值的主动策略的行为，并表明通过正确选择阈值可以最大化每个请求的主动服务的平均数量。最后，我们提出了UNIFORM策略，它是具有最佳阈值的基于阈值的策略。令人惊讶的是，我们发现它在延迟方面优于常用的最早截止日期优先（EDF）类型的主动策略。我们进行了大量的数值实验来证明阈值对延迟性能的影响，并明确比较 EDF 策略和 UNIFORM 策略的性能。
Network traffic for delay-sensitive services has become a dominant part in the network. Proactive caching with the aid of predictive information has been proposed as a promising method to enhance delay performance. In this paper, we analytically investigate the problem of how to efficiently utilize uncertain predictive information to design proactive caching strategies with provably good access-delay characteristics. We first derive an upper bound for the average amount of proactive service per request that the system can support. We then analyze the behavior of a family of threshold-based proactive strategies using an innovative Markov chain analysis, and show that the average amount of proactive service per request can be maximized by properly selecting the threshold. Finally, we propose the UNIFORM strategy, which is the threshold-based strategy with the optimal threshold. Surprisingly, we show that it outperforms the commonly used Earliest-Deadline-First (EDF) type proactive strategies in terms of delay. We perform extensive numerical experiments to demonstrate the influence of thresholds on delay performance, and explicitly compare performance of the EDF strategy and the UNIFORM strategy.