Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISNCC.2019.8909138 | 2019 International Symposium on Networks, Computers and Communications (ISNCC) |
Keywords | Field | DocType |
cooperative caching,small base station,popularity file | Wireless network,Base station,Computer science,Computer network | Conference |
ISSN | ISBN | Citations |
2472-4386 | 978-1-7281-1245-9 | 0 |
PageRank | References | Authors |
0.34 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruimeng Gan | 1 | 4 | 2.45 |
| Yucheng Liao | 2 | 0 | 0.68 |
| Yue Xiao | 3 | 758 | 63.17 |
| Ping Yang | 4 | 0 | 0.68 |
| Bin Fu | 5 | 0 | 2.37 |