首页 | 本学科首页   官方微博 | 高级检索  
     

基于局部需求特征的副本优化选择算法
引用本文:梅红岩,孟祥武.基于局部需求特征的副本优化选择算法[J].北京邮电大学学报,2012,35(3):16-19.
作者姓名:梅红岩  孟祥武
作者单位:北京邮电大学 智能通信软件与多媒体北京市重点实验室,北京,100876;北京邮电大学计算机学院,北京,100876
基金项目:国家自然科学基金,北京市教育委员会共建项目专项项目
摘    要:为提高内容分发网络的用户满意度,提出一种基于局部需求特征的副本优化选择算法.在边缘代理存储能力受限的情况下,依据边缘代理所在区域的局部需求特征,通过对局部需求特征的提取并以此作为启发式信息进行副本的优化选择.仿真结果表明,与其他几种副本选择算法相比较,该算法所获得的请求覆盖率均高于其他算法.

关 键 词:内容分发网络  副本放置  局部需求特征  贪心算法
收稿时间:2011-09-21

An Optimal Replica Selection Algorithm Based on Local Request Characteristic
MEI Hong-yan , MENG Xiang-wu.An Optimal Replica Selection Algorithm Based on Local Request Characteristic[J].Journal of Beijing University of Posts and Telecommunications,2012,35(3):16-19.
Authors:MEI Hong-yan  MENG Xiang-wu
Affiliation:1Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2School of Computer, Beijing University of Posts and Telecommunications, Beijing 100876, China
Abstract:In order to improve customer satisfaction an optimal replica selection algorithm is proposed for content delivery network based on local request characteristic.In the case of limited storage capacity of surrogates,according to request characteristic of local surrogates,the local request characteristic is used as heuristic information to select replica.Simulations show that the proposed method can obtain higher request of coverage compared with several other algorithms.
Keywords:content delivery networks  replica placement  local request characteristic  greedy algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号