Rank-based content updating method in FemtoCaching

© 2014 IEEE. In the FemtoCaching research, an approximation algorithm to place contents in the cache of femto-cells is proposed. However, this research does not consider changes of content ranking and content popularities that change during time. Hence, contents in femto-cells should be updated with...

Full description

Saved in:
Bibliographic Details
Main Authors: Apipong Pingyod, Yuthapong Somchit
Format: Conference Proceeding
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84940550101&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/44427
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-44427
record_format dspace
spelling th-cmuir.6653943832-444272018-04-25T07:51:16Z Rank-based content updating method in FemtoCaching Apipong Pingyod Yuthapong Somchit Agricultural and Biological Sciences © 2014 IEEE. In the FemtoCaching research, an approximation algorithm to place contents in the cache of femto-cells is proposed. However, this research does not consider changes of content ranking and content popularities that change during time. Hence, contents in femto-cells should be updated with limited number of updated contents. There is a popularity-based updating method that replaces low popularity contents by high popularity contents but its performance is not good in case of high limited threshold. This problem occurs because diversity of contents in distributed caches is decreased. Hence, we propose a new method in this paper called rank-based updating method that attempts to cache diverse contents in distributed caches. It updates contents in femto-cells by considering ranking number of each content in ranking with the same ranking number of each content in femto-cells. A complexity of the proposed method is lower than the algorithm of FemtoCaching and slightly more than the popularity-based updating method. Performance of the proposed method is evaluated by simulation. Experimental results show that the performances of the proposed method are almost the same as the limited FemtoCaching method and better than the popularity-based updating method in case of high limited threshold. 2018-01-24T04:42:40Z 2018-01-24T04:42:40Z 2015-01-01 Conference Proceeding 21593450 21593442 2-s2.0-84940550101 10.1109/TENCON.2014.7022376 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84940550101&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44427
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Agricultural and Biological Sciences
spellingShingle Agricultural and Biological Sciences
Apipong Pingyod
Yuthapong Somchit
Rank-based content updating method in FemtoCaching
description © 2014 IEEE. In the FemtoCaching research, an approximation algorithm to place contents in the cache of femto-cells is proposed. However, this research does not consider changes of content ranking and content popularities that change during time. Hence, contents in femto-cells should be updated with limited number of updated contents. There is a popularity-based updating method that replaces low popularity contents by high popularity contents but its performance is not good in case of high limited threshold. This problem occurs because diversity of contents in distributed caches is decreased. Hence, we propose a new method in this paper called rank-based updating method that attempts to cache diverse contents in distributed caches. It updates contents in femto-cells by considering ranking number of each content in ranking with the same ranking number of each content in femto-cells. A complexity of the proposed method is lower than the algorithm of FemtoCaching and slightly more than the popularity-based updating method. Performance of the proposed method is evaluated by simulation. Experimental results show that the performances of the proposed method are almost the same as the limited FemtoCaching method and better than the popularity-based updating method in case of high limited threshold.
format Conference Proceeding
author Apipong Pingyod
Yuthapong Somchit
author_facet Apipong Pingyod
Yuthapong Somchit
author_sort Apipong Pingyod
title Rank-based content updating method in FemtoCaching
title_short Rank-based content updating method in FemtoCaching
title_full Rank-based content updating method in FemtoCaching
title_fullStr Rank-based content updating method in FemtoCaching
title_full_unstemmed Rank-based content updating method in FemtoCaching
title_sort rank-based content updating method in femtocaching
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84940550101&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/44427
_version_ 1681422557467639808