首页> 外文会议>Annual IEEE Consumer Communications and Networking Conference >A Bee Colony-based Algorithm for Micro-cache Placement Close to End Users in Fog-based Content Delivery Networks
【24h】

A Bee Colony-based Algorithm for Micro-cache Placement Close to End Users in Fog-based Content Delivery Networks

机译:一种基于蜜蜂殖民地的微观缓存放置算法,靠近基于FOG的内容传送网络的最终用户

获取原文

摘要

Fog-based Content Delivery Networks (CDNs) distribute contents from origin servers to cloud replica servers and to fog caches. Some of these fog caches may be located on Set-top Boxes (STBs) close to end users, assuming that the STBs can host micro-caches. This can greatly reduce latency. Network function virtualization (NFV) is a technology that can be used in fog systems. NFV-enabled STBs can therefore host micro-caches implemented as virtual network functions (VNFs). Appropriate placement mechanisms are needed to place these micro-caches to improve end-users' QoS in terms of latency while still minimizing cost. In this paper, this placement problem is modeled as an optimization problem. A bee colony-based algorithm is suggested to find the placement that minimizes an aggregation of latency and micro-cache storage cost. The simulation results show an improvement in the aggregated latency and cost when the proposed algorithm is deployed.
机译:基于FOG的内容传递网络(CDN)将原始服务器的内容分发到云副本服务器和雾库。假设STBS可以托管微高速缓存,其中一些雾缓存可以位于靠近最终用户的机顶盒(STBS)上。这可以大大减少延迟。网络功能虚拟化(NFV)是一种可用于雾系统的技术。因此,启用NFV的STB可以主机实现为虚拟网络功能(VNFS)的微高速缓存。需要适当的放置机制来将这些微高速缓存放置在延迟方面改善最终用户的QoS,同时仍然最小化成本。在本文中,该放置问题被建模为优化问题。建议蜂殖民地的算法查找最小化延迟和微高速缓存储存成本的聚合的放置。仿真结果表明,当部署所提出的算法时,汇总延迟和成本的提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号