Timestamp-Based Selective Cache Allocation

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

scholarly journals Game-based cache allocation strategy for ICN slicing

2021 ◽  
Vol 336 ◽  
pp. 05030
Author(s):  
Liping Ge ◽  
Jinhe Zhou
Keyword(s):  
Equilibrium Solution ◽  
Base Station ◽  
Virtual Network ◽  
Game Model ◽  
Allocation Strategy ◽  
Newton Iterative Method ◽  
Content Acquisition ◽  
Simulation Results ◽  
Cache Allocation ◽  
Cooperative Game Model

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.

Scheduling, Isolation, and Cache Allocation: A Side-Channel Defense

2018 ◽  
Author(s):  
Read Sprabery ◽  
Konstantin Evchenko ◽  
Abhilash Raj ◽  
Rakesh B. Bobba ◽  
Sibin Mohan ◽  
...  
Keyword(s):  
Side Channel ◽  
Cache Allocation

Cache allocation for fixed-priority real-time scheduling on multi-core platforms

2015 ◽  
Author(s):  
Gustavo A. Chaparro-Baquero ◽  
Soamar Homsi ◽  
Omara Vichot ◽  
Shaolei Ren ◽  
Gang Quan ◽  
...  
Keyword(s):  
Real Time ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Cache Allocation

scholarly journals An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1705
Author(s):  
Yuanhang Li ◽  
Jinlin Wang ◽  
Rui Han
Keyword(s):  
Network Architectures ◽  
Expected Number ◽  
Placement Problem ◽  
Mobility Support ◽  
Allocation Method ◽  
Caching Scheme ◽  
Content Popularity ◽  
Content Placement ◽  
The Given ◽  
Cache Allocation

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).

Locality‐protected cache allocation scheme with low overhead on GPUs

2018 ◽  
Vol 12 (3) ◽  
pp. 87-94 ◽  
Author(s):  
Yang Zhang ◽  
Zuocheng Xing ◽  
Chuan Tang ◽  
Cang Liu
Keyword(s):  
Allocation Scheme ◽  
Cache Allocation
Sign in / Sign up

Export Citation Format

Share Document