• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >QoS-aware replica placement for content distribution
【24h】

QoS-aware replica placement for content distribution

机译：用于内容分发的QoS感知副本放置

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The rapid growth of new information services and business-oriented applications entails the consideration of quality of service (QoS) in content distribution. This paper investigates the QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes of service models: replica-aware services and replica-blind services. In replica-aware services, the servers are aware of the locations of replicas and can therefore optimize request routing to improve responsiveness. We show that the QoS-aware placement problem for replica-aware services is NP-complete. Several heuristic algorithms for fast computation of good solutions are proposed and experimentally evaluated. In replica-blind services, the servers are not aware of the locations of replicas or even their existence. As a result, each replica only serves the requests flowing through it under some given routing strategy. We show that there exist polynomial optimal solutions to the QoS-aware placement problem for replica-blind services. Efficient algorithms are proposed to compute the optimal locations of replicas under different cost models.
机译：新信息服务和面向业务的应用的快速增长需要在内容分发中考虑服务质量（QoS）。本文针对响应性QoS需求调查了QoS感知副本放置问题。我们考虑两类服务模型：感知副本的服务和盲目的副本服务。在感知副本的服务中，服务器知道副本的位置，因此可以优化请求路由以提高响应速度。我们显示出副本感知服务的QoS感知放置问题是NP完全的。提出了几种快速求解良好解的启发式算法，并进行了实验评估。在副本盲服务中，服务器不知道副本的位置，甚至不知道副本的存在。结果，每个副本仅在某种给定的路由策略下为流经它的请求提供服务。我们表明，存在针对副本盲服务的QoS感知放置问题的多项式最优解。提出了有效的算法来计算不同成本模型下副本的最佳位置。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号