An Optimized Cache Replacement Algorithm for Information-centric Networks

Sun, Xiaocui; Wang, Zhijun

doi:10.1109/smartcity.2015.148

Cited by 6 publications

(4 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…T c is the total cycle time, which is computed using A t , T d , and R t as represented in Equation 6. T cyc is the total cycles that are computed using Equation 7. A crt is the average content retrieval time and is computed using Equation 8.…”

Section: Normalizationmentioning

confidence: 99%

See 1 more Smart Citation

Efficient content retrieval in fog zone using Nano‐Caches

Singh

Kumar

Sharma

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary It is always desired to improve the response time from cloud servers, which deliver contents without buffering. As the penetration of mobile/fog devices is increasing, the limits of cellular ranges come under question. This question arises in spite of the fact that the current Internet Service Providers and data operators are adding cellular towers frequently to reduce delay and enhance performance. This performance can be improved by increasing Nano‐Cache(s) at the edges of the network for forwarding interrelated contents to remote corner of the earth. In this research work, Nano‐Caches are integrated for delivering contents efficiently, using search‐based optimization techniques, which are energy and response aware in nature. An algorithm, namely, Modified Teaching Learning‐Based Optimization(MTLBO), is devised and implemented in fog zone to find efficient route for forwarding contents using Nano‐Caches and subsequently to improve content retrieval time. Mathematical distribution model of traffic is used for simulation process. MTLBO is compared with existing algorithms, namely, Teaching Learning‐Based Optimization (TLBO) Algorithm and Simulated Annealing (SA) Algorithm. The design of experiments (DOE) was carried out to observe number of iterations, learning rate, and by changing the network size. Java library was used for observing values of memory and execution time. The results show that Modified Teaching Learning‐Based Optimization (MTLBO) approach is better than Teaching Learning‐Based Optimization (TLBO) approach as it has less overheads in terms of memory (considering number of fog caches) and network size for delivering contents at remote areas. In comparison to the Simulated Annealing (SA) algorithm, MTLBO performs better in terms of execution time, overhead in terms of memory, and scalability as function of network size.

show abstract

Section: Normalizationmentioning

confidence: 99%

“…These specialized servers as well as software use the concept of virtual memories and caches algorithms that helps virtual devices, computers, and networks to optimize capacity and speed. Cache algorithms are either implemented as de‐facto policies in the networks or as programmable instructions …”

Section: Introductionmentioning

confidence: 99%

Efficient content retrieval in fog zone using Nano‐Caches

Singh

Kumar

Sharma

2019

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…In [17] authors have proposed two algorithms, wildcard rules caching and Rule Cache Replacement (RCR) for solving the TCAM problem in software defined networking. In these algorithms, the accumulated contribution value of a rule-set is calculated instead of individual value.…”

Section: Literature Surveymentioning

confidence: 99%

A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy

Khan¹,

Olanrewaju²,

Mir³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-The recent advancement in the field of distributed computing depicts a need of developing highly associative and less expensive cache memories for the state-of-art processors i.e., Intel Core i6, i7, etc. Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. Most of the conventional cache replacement algorithms are found to be as not so efficient on memory management and complexity analysis. Therefore, a significant and thorough analysis is required to suggest a new optimal solution for optimizing the state-of-the-art cache replacement issues. The proposed study aims to conceptualize a theoretical model for optimal cache heap object replacement. The proposed model incorporates Tree based and MRU (Most Recently Used) pseudo-LRU (Least Recently Used) mechanism and configures it with JVM's garbage collector to replace the old referenced objects from the heap cache lines. The performance analysis of the proposed system illustrates that it outperforms the conventional state of art replacement policies with much lower cost and complexity. It also depicts that the percentage of hits on cache heap is relatively higher than the conventional technologies.

show abstract

“…It exhibits the minimization of error rate by 2x with about 1.4% and 3.6 % performance overhead as compared to the LRU mechanism. Authors in [11] developed a very light weight caching management algorithm for maximizing the traffic volume of data instruction. It also minimizes the bandwidth usage.…”

Section: Literature Surveymentioning

confidence: 99%

An efficient cache replacement algorithm for minimizing the error rate in L2-STT-MRAM caches

Olanrewaju

Baba

Khan

et al. 2016

2016 Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC)

View full text Add to dashboard Cite

Abstract-In the recent times, various challenges are being encountered during SRAM cache design and development which lead to a situation of converting the memory cell technologies into on-chip embedded caches. The current research statistics towards cache designing reveals that Spin Torque Transfer Magnetic RAMs, preferably termed as STT-MRAMs has become one of the most promising areas in the field of memory chip design. Hence, it gained a lot of attention from the researchers due to its dynamic direct map and data access policies for reducing the average cost i.e. time and energy optimization. Instead of having efficient main memory access capability, STTMRAMs suffer due to high error rate caused during stochastic switching in write operations. Cache replacement algorithms play a significant role in minimizing the error rate in write operations. The proposed study aims to offer a theoretical and analytical modeling of an efficient cache replacement scheme to overcome the error as mentioned above in L2-STT-MRAM caches. The performance analysis of the proposed algorithm ensures its effectiveness in reducing the error rate and cost overheads as compared to the conventional LRU technique implemented on SRAM cells.

show abstract

An Optimized Cache Replacement Algorithm for Information-centric Networks

Cited by 6 publications

References 34 publications

Efficient content retrieval in fog zone using Nano‐Caches

Efficient content retrieval in fog zone using Nano‐Caches

A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy

An efficient cache replacement algorithm for minimizing the error rate in L2-STT-MRAM caches

Contact Info

Product

Resources

About