2019 International Conference on Electrical Engineering and Informatics (ICEEI) 2019
DOI: 10.1109/iceei47359.2019.8988836
|View full text |Cite
|
Sign up to set email alerts
|

Modified-LRU Algorithm for Caching on Named Data Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…In computing, FIFO, 29 LRU, 30 LFU, 31 RR, 32 and SF‐LRU 33 are five cache replacement algorithms that manage a cache of information stored on a computer. The FIFO algorithm replaces the cache of data according to the data first entering the cache 29 .…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In computing, FIFO, 29 LRU, 30 LFU, 31 RR, 32 and SF‐LRU 33 are five cache replacement algorithms that manage a cache of information stored on a computer. The FIFO algorithm replaces the cache of data according to the data first entering the cache 29 .…”
Section: Related Workmentioning
confidence: 99%
“…The RR algorithm replaces the cache of data according to the random replacement data principle 32 . The SF‐LRU algorithm combines the LRU and LFU using the second chance concept 33 . The improved versions of the LRU and LFU algorithms are suitable for network cache applications such as content delivery networks and information‐centric networking.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, we use MATLAB tools for simulation analysis. Based on the proposed edge network architecture and collaborative caching scheme of SGIN, first, we solve the value of L and F. Second, the benefits of the content update algorithm LF are verified by comparing with the traditional algorithms least recently used (LRU) [44] and least frequently used (LFU) [45]. Second, we determine the best way to deploy edge cache nodes under different traffic conditions in different regions and verify the benefits of deploying hierarchical cache nodes.…”
Section: Simulation Analysismentioning
confidence: 99%
“…LFU [137] Hybrid Modified-LRU [81] LRFU [118] Content-based MDMR [66] Centrality-based NICE [75] Caching decision strategies Traditional CEE/LCE [73,163] LCD [162] Probabilistic Static Prob(p) [68,165] Dynamic BRR-CVR [42] MACD [50] pCASTING [68] CSCM [103] ProbCache [116] Vural et al [142] Topology/Centrality-based Betw/EgoBetw [41] BRR-CVR [42] Doan Van & Ai [50] PCS [100] CSCM [103] ProbCache [116] Shekhawat et al [132] Sun [135] Zeng & Hong [161] Zhang et al [164] LCC [170] BNC [172] Cooperative Explicit EM3C [76] Liu et al [92] PCS [100] Implicit…”
Section: Existing Studies Of Icn Caching In Iotmentioning
confidence: 99%
“…This will eventually result in higher server load, as caches accumulate stale items instead of storing fresher content, forcing more Interests to be routed to the original producers [137]. Modified-LRU [81] and LRFU [118] are novel hybrid approaches that consider both recency and frequency and as such should be less susceptible to frequency spikes.…”
Section: Least Recently Used (Lru)mentioning
confidence: 99%