User interest-aware content replica optimized placement algorithm
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 interes...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.003/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539739309572096 |
|---|---|
| author | Xiao-long YANG Xin-xin WANG Min ZHANG Ke-ping LONG Qiong HUANG |
| author_facet | Xiao-long YANG Xin-xin WANG Min ZHANG Ke-ping LONG Qiong HUANG |
| author_sort | Xiao-long YANG |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-74ca272c318e4673800c61d08496a952 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-74ca272c318e4673800c61d08496a9522025-01-14T06:44:29ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-12-0135212759687238User interest-aware content replica optimized placement algorithmXiao-long YANGXin-xin WANGMin ZHANGKe-ping LONGQiong HUANGA 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.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.003/eplica placementinterest-awareclustering algorithmsubjects of interest |
| spellingShingle | Xiao-long YANG Xin-xin WANG Min ZHANG Ke-ping LONG Qiong HUANG User interest-aware content replica optimized placement algorithm Tongxin xuebao eplica placement interest-aware clustering algorithm subjects of interest |
| title | User interest-aware content replica optimized placement algorithm |
| title_full | User interest-aware content replica optimized placement algorithm |
| title_fullStr | User interest-aware content replica optimized placement algorithm |
| title_full_unstemmed | User interest-aware content replica optimized placement algorithm |
| title_short | User interest-aware content replica optimized placement algorithm |
| title_sort | user interest aware content replica optimized placement algorithm |
| topic | eplica placement interest-aware clustering algorithm subjects of interest |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.12.003/ |
| work_keys_str_mv | AT xiaolongyang userinterestawarecontentreplicaoptimizedplacementalgorithm AT xinxinwang userinterestawarecontentreplicaoptimizedplacementalgorithm AT minzhang userinterestawarecontentreplicaoptimizedplacementalgorithm AT kepinglong userinterestawarecontentreplicaoptimizedplacementalgorithm AT qionghuang userinterestawarecontentreplicaoptimizedplacementalgorithm |