Loading...
Cache placement phase based on graph coloring
Javedankherad, M ; Sharif University of Technology | 2019
308
Viewed
- Type of Document: Article
- DOI: 10.1109/ISTEL.2018.8661009
- Publisher: Institute of Electrical and Electronics Engineers Inc , 2019
- Abstract:
- Data traffic is increasing in recent years and small cell densification is a promising solution for handling the consequences of this growth. However, it faces with backhual' constraint which limits its efficiency. Caching the popular files near to the small base stations (SBSs) is an effective technique which decreases usage of backhual links. In this paper, we model the network by a graph and propose a new popular files' placement based on graph coloring for which different powerful solutions and algorithms have been presented in the literature. In this respect, we propose an algorithm to fill the caches of SBSs with the popular files and show the efficiency of our proposed algorithm through simulations. © 2018 IEEE
- Keywords:
- Graph coloring ; Small cell densification ; Buffer storage ; Efficiency ; Backhual link ; Cache placement ; Caching ; Data traffic ; Graph colorings ; Its efficiencies ; Phase based ; Small cells ; Graph theory
- Source: 9th International Symposium on Telecommunication, IST 2018, 17 December 2018 through 19 December 2018 ; 2019 , Pages 187-191 ; 9781538682746 (ISBN)
- URL: https://ieeexplore.ieee.org/document/8661009