首页> 外文会议>International Conference on Pervasive and Embedded Computing and Communication Systems >Interdependent Multi-layer Spatial Temporal-based Caching in Heterogeneous Mobile Edge and Fog Networks
【24h】

Interdependent Multi-layer Spatial Temporal-based Caching in Heterogeneous Mobile Edge and Fog Networks

机译:异构移动边缘和雾网络中的相互依存的多层空间临时缓存

获取原文

摘要

Applications and services hosted in the mobile edge/fog networks today (e.g., augmented reality, self-driving, and various cognitive applications) may suffer from limited network coverage and localized congestion due to dynamic mobility of users and surge of traffic demand. Mobile opportunistic caching at the edges is expected to be an effective solution for bringing content closer and improve the quality of service for mobile users. To fully exploit the edge/fog resources, the most popular contents should be identified and cached. Emerging research has shown significant importance of predicting content traffic patterns related to users' mobility over time and locations which is a complex question and still not well-understood. This paper tackles this challenge by proposing K-order Markov chain-based fully-distributed multi-layer complex analytics and heuristics to predict the future trends of content traffic. More specifically, we propose the multilayer real-time predictive analytics based on historical temporal information (frequency, recency, betweenness) and spatial information (dynamic clustering, similarity, tie-strength) of the contents and the mobility patterns of contents' subscribers. This enables better responsiveness to the rising of newly high popular contents and fading out of older contents over time and locations. We extensively evaluate our proposal against benchmark (TLRU) and competitive protocols (SocialCache, OCPCP, LocationCache) across a range of metrics over two vastly different complex temporal network topologies: random networks and scale-free networks (i.e. real connectivity Infocom traces) and use Foursquare dataset as a realistic content request patterns. We show that our caching framework consistently outperforms the state-of-the-art algorithms in the face of dynamically changing topologies and content workloads as well as dynamic resource availability.
机译:目前(例如,增强现实,自动驾驶和各种认知应用)在移动边缘/雾网络中托管的应用和服务可能由于用户的动态移动性和交通需求激增而受到有限的网络覆盖范围和局部拥塞。预计边缘的移动机会管理员缓存将是一种有效的解决方案,可让内容更接近,提高移动用户的服务质量。要充分利用边缘/雾资源,应识别并缓存最流行的内容。新兴研究表明,预测与用户移动性相关的内容交通模式,随着时间的推移,这是一个复杂的问题,并且仍然没有很好地理解。本文通过提出基于K订单Markov链的全分布式多层复杂分析和启发式来解决这一挑战,以预测内容流量的未来趋势。更具体地,我们基于内容的内容的历史时间信息(频率,新近,之间)和空间信息(动态聚类,相似性,焊接强度)和内容用户的移动模式来提出多层实时预测分析。这使得能够更好地对新高流行的内容的崛起和随着时间的推移衰落而衰落。我们广泛地评估我们对基准(TLRU)和竞争协议(SocialCache,OCPCP,LocationCache)的一系列指标的提案,超过两个不同的复杂时间网络拓扑结构:随机网络和无尺度网络(即真正的连接信息迹线)和使用Foursquare DataSet作为逼真的内容请求模式。我们表明,我们的缓存框架在面对动态地改变拓扑和内容工作负载以及动态资源可用性方面始终始终占据最先进的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号