用户兴趣感知的内容副本优化放置算法

doi:10.3969/j.issn.1000-436x.2014.12.003

Abstract

Abstract:

A user interest-aware content replica optimized placement algorithm (UIARP) is proposed.Firstly,the interest subjects of the user-collective are extracted from their content access logs by clustering algorithms,and according to the weighting of the individual interest degree,their collective interest degree would be got and updated in real time; then under the nonlinear optimization model,replicas of larger collective interest degree have priority to be placed,with the goal of minimizing the average response time,which achieves the maximum match between placing replicas and users’ content demand.This algorithm not only ensures that users get interested replicas quickly,but also improves the system efficiency.From four aspects including average response time,the matching degree of request response,load balancing and the utilization rate of adjacent replicas,using 1-Greedy-Insert or others as compared algorithms,the simulation re-sults show that each metric improves by 30% on average,which verifies the effectiveness of the proposed algorithm.

Key words: eplica placement, interest-aware, clustering algorithm, subjects of interest

Xiao-long YANG,Xin-xin WANG,Min ZHANG,Ke-ping LONG,Qiong HUANG. User interest-aware content replica optimized placement algorithm[J]. Journal on Communications, 2014, 35(12): 21-27.

Figures/Tables 5

References 18

[1]	WANG W F , WEI W H . A dynamic replica placement mechanism based on response time measure[A]. 2010 International Conference on Communications and Mobile Computing (CMC)[C].Shenzhen,China, 2010.169-173.
[2]	AYYASAMY S , SIVANANDAM S N . A cluster based replication architecture for load balancing in peer-to-peer content distribution[J]. International Journal of Computer Networks ＆ Communications (IJCNC), 2012,2(5):158-172.
[3]	GABER S M A , SUMARI P . Predictive and content-aware load bal-ancing algorithm for peer-service area based IPTV networks[J]. Mul-timedia Tools and Applications, 2012.1-24.
[4]	SUN J , GAO S X , YANG W G ,et al. Heuristic replica placement algorithms in content distribution networks[J]. Journal of Networks, 2011,6(3):416-423.
[5]	LI T Y , WANG J L , WANG L F ,et al. Replica placement algorithm in dis-tributed media service system[J]. Computer Engineering, 2010,36(2):9-12.
[6]	卫星，杨坚，奚宏生 . 同构流媒体集群系统优化内容部署[J]. 电子与信息学报， 2009，31(9)：2232-2236. WEI X , YANG J , XI H S . Optimal content distribution on clustered streaming media system consisting of homogeneous configuration[J]. Journal of Electronics ＆ Information Technology, 2009,31(9):2232-2236.
[7]	TANG X Y , XU J L . QoS-aware replica placement for content distri-bution[J]. IEEE Transactions on Parallel and Distributed Systems, 2005,16(10):921-932.
[8]	TANG X Y , XU J L . QoS-aware replica placement for content distri-bution[J]. IEEE Transactions on Parallel and Distributed Systems, 2005,16(10):921-932.
[9]	韩国栋，朱一戈，张帆 . 一种基于认知的动态副本放置方法[J]. 计算机应用与软件， 2013，30(1)：83-87. HAN G D , ZHU Y G , ZHANG F . A dynamic replica placement ap-proach based on cognition[J]. Computer Applications and Software, 2013,30(1):83-87.
[10]	韩国栋，朱一戈，张帆 . 一种基于认知的动态副本放置方法[J]. 计算机应用与软件， 2013，30(1)：83-87. HAN G D , ZHU Y G , ZHANG F . A dynamic replica placement ap-proach based on cognition[J]. Computer Applications and Software, 2013,30(1):83-87.
[11]	YAN D M , LU C H . Optimized collaborative filtering recommenda-tion based on users' interest degree and feature[J]. Application Re-search of Computers, 2012,29(2):497-500.
[12]	李连，朱爱红，苏涛 . 一种改进的基于向量空间文本相似度算法的研究与实现[J]. 计算机应用与软件， 2012，29(2)：282-284. LI L , ZHU A H , SU T . Research and implementation of an improved VSM-based text similarity algorithm[J]. Computer Application and Software, 2012,29(2):282-284.
[13]	WANG N , WANG P Y , ZHANG B W An improved TF-IDF weights function based on information theory[A]. 2010 International Confer-ence on Computer and Communication Technologies in Agriculture Engineering (CCTAE)[C]. Chengdu,China, 2010.439-441.
[14]	ZHANG Z Y , LIU P Y , ZHU Z F ,et al. Improved visit statistical method and calculation in user's interest degree[J]. Computer Engi-neering and Design, 2011,132(002):424-426.
[15]	王微微，夏秀峰，李晓明 . 一种基于用户行为的兴趣度模型[J]. 计算机工程与应用， 2012，48(8)：128-152. WANG W W , XIA X F , LI X M . Personal interest degree model based on consumer behavior[J]. Computer Engineering and Applications, 2012,48(8):128-152.
[16]	YEDLA M , PATHAKOTA S R , SRINIVASA T M . Enhancing K-means clustering algorithm with improved initial center[J]. Interna-tional Journal of Computer Science and Information Technologies, 2010,1(2):121-125.
[17]	徐风苓，孟祥武，王立才 . 基于移动用户上下文相似度的协同过滤推荐算法[J]. 电子与信息学报， 2011，33(11)：2785-2789. XU F L , MENG X W , WANG L C . A collaborative filtering recom-mendation algorithm based on context similarity for mobile users[J]. Journal of Electronics ＆ Information Technology, 2011,33(11):2785-2789.
[18]	CHEN Y , KATZ R H , KUBIATOWICZ J D . Dynamic Replica Place-ment for Scalable Content Delivery[M]. Springer Berlin Heidelberg, 2002.306-318.

Metrics

Recommended 0

No Suggested Reading articles found!

仿真参数	表示符号	参数值
响应容忍极限	T_threshold	500 ms
副本服务器容量	\|C_i\|	5～15 GB
内容副本大小	\|c_j\|	200～500 MB
用户访问分布(Zipf)	Z(γ)	γ=0.6
用户请求到达(Poisson)	P(λ)	λ=2
滑动平均权重系数	α	0.7

User interest-aware content replica optimized placement algorithm

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 5

References 18

Related Articles 11

Metrics

Recommended 0

[1]	HONGHong Z,HANGQing-yang Z,IANLi-chao T,ANGLiang-min W. Distributed key sharing based scheme for security clustering in unattended wireless sensor network [J]. Journal on Communications, 2015, 36(5): 31-39.
[2]	. Research on the optimization adjustment strategy for the SaaS multi-tenant data placement [J]. Journal on Communications, 2014, 35(Z2): 10-71.
[3]	Xiao-na LI,Qing-zhong LI,Lan-ju KONG,Zhong-min YAN. Research on the optimization adjustment strategy for the SaaS multi-tenant data placement [J]. Journal on Communications, 2014, 35(Z2): 63-71.
[4]	Jian-wei NIU,Bin DAI,Chao TONG,Guan-ying HUO,Jing PENG. Complex network clustering algorithm based on Jordan-form of Laplace-matrix [J]. Journal on Communications, 2014, 35(3): 11-21.
[5]	. Complex network clustering algorithm based on Jordan-form of Laplace-matrix [J]. Journal on Communications, 2014, 35(3): 2-21.
[6]	. User interest-aware content replica optimized placement algorithm [J]. Journal on Communications, 2014, 35(12): 3-27.
[7]	Yun YE,Xi-shan XU,Yan JIA,Zhi-chang QI,Wen-cong CHENG. Research on the risk adjacency matrix based on attack graphs [J]. Journal on Communications, 2011, 32(5): 112-120.
[8]	Kan YI,Ru-chuan WANG. Decentralized integration of task scheduling with replica placement strategy [J]. Journal on Communications, 2010, 31(9): 95-102.
[9]	Wei TIAN,Zhen YANG. New location aware clustering algorithm [J]. Journal on Communications, 2010, 31(3): 25-30.
[10]	Jing HU,Lian-feng SHEN,Tie-cheng SONG,De-sheng REN. Novel clustering algorithm for wireless sensor networks [J]. Journal on Communications, 2008, 29(7): 20-26.
[11]	Yi YANG,Jian-de ZHENG. Adaptive DoS detection technique based on ant clustering [J]. Journal on Communications, 2006, 27(11A): 88-91.