Content updating method in FemtoCaching
Work in FemtoCaching proposes the algorithm to place contents in caches of femto-cells but it does not consider changes of content ranking and content popularities. However, content ranking and content popularities change during time. Therefore, the caches should be updated. In addition, the number...
Saved in:
Main Authors: | , |
---|---|
Format: | Int. Jt. Conf. Comput. Sci. Softw. Eng.: "Hum. Factors Comput. S |
Published: |
IEEE Computer Society
2014
|
Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84904546850&partnerID=40&md5=9eea276c5adad4d82dfa78be3ac06a86 http://cmuir.cmu.ac.th/handle/6653943832/1266 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-1266 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-12662014-08-29T09:29:01Z Content updating method in FemtoCaching Pingyod A. Somchit Y. Work in FemtoCaching proposes the algorithm to place contents in caches of femto-cells but it does not consider changes of content ranking and content popularities. However, content ranking and content popularities change during time. Therefore, the caches should be updated. In addition, the number of contents to be updated should be limited. In this research, we propose a method to update contents in caches of femto-cells in FemtoCaching. The proposed method has a complexity less than the contents placement algorithm of FemtoCaching. The performance of proposed method is evaluated by a simulation. The experimental results show that the proposed method has an acceptable performance. © 2014 IEEE. 2014-08-29T09:29:01Z 2014-08-29T09:29:01Z 2014 Int. Jt. Conf. Comput. Sci. Softw. Eng.: "Hum. Factors Comput. S 106440 10.1109/JCSSE.2014.6841854 Pattaya, Chonburi 9781479958221 http://www.scopus.com/inward/record.url?eid=2-s2.0-84904546850&partnerID=40&md5=9eea276c5adad4d82dfa78be3ac06a86 http://cmuir.cmu.ac.th/handle/6653943832/1266 IEEE Computer Society |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
description |
Work in FemtoCaching proposes the algorithm to place contents in caches of femto-cells but it does not consider changes of content ranking and content popularities. However, content ranking and content popularities change during time. Therefore, the caches should be updated. In addition, the number of contents to be updated should be limited. In this research, we propose a method to update contents in caches of femto-cells in FemtoCaching. The proposed method has a complexity less than the contents placement algorithm of FemtoCaching. The performance of proposed method is evaluated by a simulation. The experimental results show that the proposed method has an acceptable performance. © 2014 IEEE. |
format |
Int. Jt. Conf. Comput. Sci. Softw. Eng.: "Hum. Factors Comput. S |
author |
Pingyod A. Somchit Y. |
spellingShingle |
Pingyod A. Somchit Y. Content updating method in FemtoCaching |
author_facet |
Pingyod A. Somchit Y. |
author_sort |
Pingyod A. |
title |
Content updating method in FemtoCaching |
title_short |
Content updating method in FemtoCaching |
title_full |
Content updating method in FemtoCaching |
title_fullStr |
Content updating method in FemtoCaching |
title_full_unstemmed |
Content updating method in FemtoCaching |
title_sort |
content updating method in femtocaching |
publisher |
IEEE Computer Society |
publishDate |
2014 |
url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-84904546850&partnerID=40&md5=9eea276c5adad4d82dfa78be3ac06a86 http://cmuir.cmu.ac.th/handle/6653943832/1266 |
_version_ |
1681419638549774336 |