Optimizing cost and performance for content multihoming

Optimizing cost and performance for content multihoming
复制标题

DOI:
10.1145/2342356.2342432
复制
发表时间:
2012-08
期刊:
--
影响因子:
--
通讯作者:
H. Liu;Ye Wang;Y. Yang;Hao Wang;Chen Tian
H. Liu;Ye Wang;Y. Yang;Hao Wang;Chen Tian
中科院分区:
其他
文献类型:
--
作者:
H. Liu;Ye Wang;Y. Yang;Hao Wang;Chen Tian

文献摘要

被引文献

相似文献

许多大型内容发布商使用多个内容分发网络来交付其内容,并且许多商业系统已经可以帮助更广泛的内容发布商从使用多个分发网络中受益,我们将其称为内容多宿主。在本文中,我们进行了第一次系统的研究,优化内容多宿主,通过引入新的算法来优化性能和成本的内容多宿主。特别是,我们设计了一种新的,高效的算法来计算分配的内容对象的内容发布商的内容分发网络,同时考虑到成本和性能。我们还设计了一种新颖的,轻量级的客户端自适应算法在个人内容观众执行,以实现可扩展的,细粒度的,快速的在线适应,以优化个人观众的体验质量(QoE)。我们证明了我们的优化算法的最优性,并进行系统的,广泛的评估,使用真实的收费数据,内容观众的需求,和性能数据,以证明我们的算法的有效性。我们表明,我们的内容多宿主算法降低了高达40%的出版成本。我们在浏览器中执行的客户端算法将观众QoE降低了51%。
Many large content publishers use multiple content distribution networks to deliver their content, and many commercial systems have become available to help a broader set of content publishers to benefit from using multiple distribution networks, which we refer to as content multihoming. In this paper, we conduct the first systematic study on optimizing content multihoming, by introducing novel algorithms to optimize both performance and cost for content multihoming. In particular, we design a novel, efficient algorithm to compute assignments of content objects to content distribution networks for content publishers, considering both cost and performance. We also design a novel, lightweight client adaptation algorithm executing at individual content viewers to achieve scalable, fine-grained, fast online adaptation to optimize the quality of experience (QoE) for individual viewers. We prove the optimality of our optimization algorithms and conduct systematic, extensive evaluations, using real charging data, content viewer demands, and performance data, to demonstrate the effectiveness of our algorithms. We show that our content multihoming algorithms reduce publishing cost by up to 40%. Our client algorithm executing in browsers reduces viewer QoE degradation by 51%.