Cooperative Online Caching in Small Cell Networks with Limited Cache Size and Unknown Content Popularity
檔案
本條目沒有附加檔案。
日期
2018-01-01
類型
系所
期刊名稱
PROCEEDINGS OF 2018 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION SYSTEMS (ICCCS)
卷期與頁次
頁 173–177
語言
英文
摘要
In this paper, we study delay-aware cooperative online content caching with limited caching space and unknown content popularity in dense small cell wireless networks. We propose a Cooperative Online Content cAching algorithm (COCA) that decides in which BS the requested content should be cached with considerations of three important factors: the residual cache space in each small cell basestation (SBS), the number of coordinated connections each SBS establishes with other SBSs, and the number of served users in the coverage area of each SBS. In addition, due to limited storage space in the cache, the proposed COCA algorithm eliminates the least recently used (LRU) contents to free up the space. We compare the delay performance of the proposed COCA algorithm with the existing offline cooperative caching schemes through simulations. Simulation results demonstrate that the proposed COCA algorithm has a better delay performance than the existing offline algorithms.
所屬典藏
會議論文引用此條目
Yen, C.-T., Chien, F.-T., & Chang, M.-K. (2018). Cooperative Online Caching in Small Cell Networks with Limited Cache Size and Unknown Content Popularity. PROCEEDINGS OF 2018 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION SYSTEMS (ICCCS), 173–177. https://ir.lib.nycu.edu.tw/handle/11536/150774
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/150774