Cooperative Caching based on Small Base Station Selection for Wireless Networks

Ruimeng Gan, Yucheng Liao, Yue Xiao, Ping Yang, Bin Fu
{"title":"Cooperative Caching based on Small Base Station Selection for Wireless Networks","authors":"Ruimeng Gan, Yucheng Liao, Yue Xiao, Ping Yang, Bin Fu","doi":"10.1109/ISNCC.2019.8909138","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of caching at small base stations (SBSs) is investigated, where the SBSs are allowed to communicate with each other through a fixed communication topology. Assume that the central controller can only serve a subset of SBSs due to its limited capacity, when the cellular users request files. A problem rises in selecting which SBSs to cache the files requested in order to minimize the delay of file transmission from the SBS to the user. Moreover, the delay associated with all the user in the wireless network depends on the number of requirements. Motivated by this, the problem of selecting which SBSs to cache which file for minimizing the delay experienced by the cellular users is studied. We formulate the problem of minimizing the latency experienced by the cellular users as an integer programming problem and then propose a corresponding algorithm to obtain the optimal caching strategy. The numerical simulations show the validity of the proposed algorithm.es, or Math in Paper Title or Abstract.","PeriodicalId":187178,"journal":{"name":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2019.8909138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the problem of caching at small base stations (SBSs) is investigated, where the SBSs are allowed to communicate with each other through a fixed communication topology. Assume that the central controller can only serve a subset of SBSs due to its limited capacity, when the cellular users request files. A problem rises in selecting which SBSs to cache the files requested in order to minimize the delay of file transmission from the SBS to the user. Moreover, the delay associated with all the user in the wireless network depends on the number of requirements. Motivated by this, the problem of selecting which SBSs to cache which file for minimizing the delay experienced by the cellular users is studied. We formulate the problem of minimizing the latency experienced by the cellular users as an integer programming problem and then propose a corresponding algorithm to obtain the optimal caching strategy. The numerical simulations show the validity of the proposed algorithm.es, or Math in Paper Title or Abstract.
基于无线网络小基站选择的协同缓存
本文研究了小型基站(SBSs)上的缓存问题,在这种情况下,SBSs可以通过固定的通信拓扑相互通信。假设当蜂窝用户请求文件时,由于中央控制器的容量有限,它只能服务于SBSs的一个子集。为了最小化从SBS到用户的文件传输延迟,在选择缓存所请求文件的SBS时出现了一个问题。此外,无线网络中与所有用户相关的延迟取决于需求的数量。在此基础上,本文研究了蜂窝网络用户如何选择哪些SBSs缓存哪些文件,从而使蜂窝网络用户所经历的延迟最小化。我们将蜂窝用户经历的延迟最小化问题表述为一个整数规划问题,并提出了相应的算法来获得最优缓存策略。数值模拟结果表明了所提算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信