Application-centric SSD Cache Allocation for Hadoop Applications

Author(s):  
Zhen Tang ◽  
Wei Wang ◽  
Yu Huang ◽  
Heng Wu ◽  
Jun Wei ◽  
...  
Keyword(s):  
2021 ◽  
Vol 336 ◽  
pp. 05030
Author(s):  
Liping Ge ◽  
Jinhe Zhou

To reduce the delay of content acquisition, this paper proposes a game-based cache allocation strategy in the Information-Centric Network (ICN) slice. The cache resource allocation of different mobile virtual network operators (MVNOs) is modeled as a non-cooperative game model. The Newton iterative method is used to solve this problem, and the cache space allocated by the base station for each MVNO is obtained. Finally, the Nash equilibrium solution is obtained. Simulation results show that the proposed algorithm can reduce the delay.


Author(s):  
Read Sprabery ◽  
Konstantin Evchenko ◽  
Abhilash Raj ◽  
Rakesh B. Bobba ◽  
Sibin Mohan ◽  
...  

2004 ◽  
pp. 43-59 ◽  
Author(s):  
Martin Karlsson ◽  
Erik Hagersten
Keyword(s):  

Author(s):  
Gustavo A. Chaparro-Baquero ◽  
Soamar Homsi ◽  
Omara Vichot ◽  
Shaolei Ren ◽  
Gang Quan ◽  
...  

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1705
Author(s):  
Yuanhang Li ◽  
Jinlin Wang ◽  
Rui Han

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).


Sign in / Sign up

Export Citation Format

Share Document