首页> 外文会议>Computers and Communications (ISCC), 2012 IEEE Symposium on >Figures of merit for the placement (in) efficiency of interconnected CDNs
【24h】

Figures of merit for the placement (in) efficiency of interconnected CDNs

机译:互连CDN放置效率的优值

获取原文
获取原文并翻译 | 示例

摘要

CDN interconnection is currently being debated across industry, academia and standards organizations, both in terms of proposing mechanisms for inter-CDN cooperation, such as architectures and protocols, and in terms of the conditions under which cooperation is advantageous. In this paper we focus on the second part and provide contributions to the fundamental problem of when two CDNs should cooperate. Given two CDNs, we aim at quantifying the loss in provisioning efficiency that arises from inter-CDN cooperation. We solve a CDN placement problem in interconnection scenarios, in order to compare the cost of centrally provisioning a network with the joint cost of provisioning the same topology but partitioned and with both sub-topologies independently and only locally optimally provisioned. Given the complexity of the topic (particularly the computational cost) but also aiming at general figures of merit, we use a non-capacitated K-median problem and solve the problem for a large number of topologies. Among other results, we show that the incurred inefficiency of provisioning the same topology partitioned in two independent CDNs, but locally optimal, can raise up to 30%. Overall, we demonstrate with exact solutions that interconnection may not be straightforwardly advantageous.
机译:目前,就提议CDN间合作的机制(例如体系结构和协议)以及在有利于合作的条件方面,整个行业,学术界和标准组织都在讨论CDN互连。在本文中,我们专注于第二部分,并为两个CDN应该何时合作的基本问题做出了贡献。给定两个CDN,我们旨在量化因CDN之间的合作而导致的配置效率损失。我们将互连场景中的CDN放置问题解决了,以便将集中配置网络的成本与配置相同拓扑但分区且两个子拓扑独立且仅局部优化配置的联合成本进行比较。给定主题的复杂性(尤其是计算成本),但同时也针对总体价值,我们使用了无容量的K中值问题,并针对大量拓扑来解决该问题。在其他结果中,我们表明,在两个独立的CDN中分配相同的拓扑(但局部最佳)的效率低下,最多可提高30%。总体而言,我们通过精确的解决方案证明了互连可能并非直接有利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号