Replica Placement Algorithms in Content Distribution Networks

2010 2nd International Symposium on Information Engineering and Electronic Commerce Pub Date : 2010-07-23 DOI:10.1109/IEEC.2010.5533278

Jing Sun, Suixiang Gao, Wenguo Yang, Fei-Min Huang

引用次数: 6

Abstract

The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, we propose an optimization model for the RPPs and design efficient algorithms to minimize the total cost of the network. The algorithms include three parts: replication algorithm preprocess, constraint p-median model and algorithm of solving constraint p-median models. In the simulation, we compare our algorithms to other heuristic methods numerically. The results show that our algorithms perform better with less cost.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

内容分发网络中的副本放置算法

内容分发网络中的副本放置问题已经得到了广泛的研究。在本文中，我们提出了rpp的优化模型，并设计了有效的算法来最小化网络的总成本。算法包括复制算法预处理、约束p中值模型和求解约束p中值模型的算法三部分。在仿真中，我们将我们的算法与其他启发式方法进行了数值比较。结果表明，我们的算法具有较好的性能和较低的成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2010 2nd International Symposium on Information Engineering and Electronic Commerce

自引率

0.00%

发文量

期刊最新文献

Multiple UAVs Routes Planning Based on Particle Swarm Optimization Algorithm Toward 3-Constant Size Identity Based Broadcast Encryption Based on Proxy Re-Encryption Design of Thermal Economy On-Line Analysis System of Nuclear Power Unit Evolution and Representation on Data Information Knowledge Strategy Replica Placement Algorithms in Content Distribution Networks