An Efficient Online Cache Replacement Algorithm for 5G Networks

Gharaibeh, Ammar; Hababeh, Ismail; Alshawaqfeh, Mustafa

doi:10.1109/access.2018.2856913

Cited by 4 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results showed that the transmission delay was reduced by 14% to 22%, with a traffic saving of 15% to 23%. Gharaibeh et al [12] formulated the problem of minimizing the costs paid by the cellular networks with limited capacity as an Integer Linear Program (ILP). To implement an eviction policy in 5G networks, the authors proposed an online algorithm to decide which files to remove from the cache to allocate a space for newly requested files without knowing the request sequence.…”

Section: Literature Reviewmentioning

confidence: 99%

A smart admission control and cache replacement approach in content delivery networks

2023

View full text Add to dashboard Cite

Content Delivery Networks (CDNs) distribute most data traffic nowadays by caching the contents in a network of servers to provide users with the requested objects, and helping to reduce latency when delivering contents to the user. The content caching system performance depends upon many factors such as where the objects should be stored, which object to store, and when to cache them. The proposed methodology includes two main phases: an admission control phase and a cache replacement phase. The admission control phase is responsible for accepting or rejecting the incoming request based on training the Reinforcement Learning (RL) algorithm to make the best decision in the near future to maximize its reward, which, in this case, is the hit ratio. The cache replacement phase estimates the object's future popularity. This is achieved by building a predictive model based on the popularity prediction mechanism, where the Long-Short-Term Memory (LSTM) model is used to compute the object's popularity. The LSTM model's outcome can help decide which objects to cache and which objects to evict from the cache. The proposed methodology is tested on a dataset to demonstrate its effectiveness in enhancing the hit ratio compared to conventional replacement policies such as First-in-First-Out (FIFO), Least Recently Used (LRU), Least Frequently Used (LFU) and a recent machine learning-based algorithm. The experimental results on the dataset revealed that the proposed methodology outperformed the baseline algorithms by 34.7% to 97.17% with a cache size of 130.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A smart admission control and cache replacement approach in content delivery networks

2023

View full text Add to dashboard Cite

show abstract

“…We focus on how to deliver all the files of F u and F ms in an efficient way. To push the files of F ms to a fully-loaded cache, deciding which existing files in F c should be moved out from the cache can be based on some well-known cache replacement policies, e.g., least recently used (LRU) [3].…”

Section: A Cache Update and Content Deliverymentioning

confidence: 99%

“…For efficient caching (re)placement, in [2], an enhanced transmission scheme was proposed to enable energyefficient content placement. The authors in [3] developed an online algorithm with light overhead for fast cache replacement. On the other hand for efficient content delivery, the authors in [4] investigated minimumlatency optimization in caching content delivery.…”

Section: Introductionmentioning

confidence: 99%

Optimal Resource Allocation for NOMA-Enabled Cache Replacement and Content Delivery

Lei

Xiang

et al. 2019

2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

In a content-delivery network, files' popularity and users' requests change fast. Conventional caching schemes, e.g., caching (re)placement once per day during the off-peak hours, may not capture the up-to-date popularity. In this case, the contents in caches have to be regularly updated to prevent information becoming outdated, and at the same time users' requested files must be delivered. These two tasks are challenging in practical heavy-traffic and multiuser scenarios when the network resources are limited. In this paper, we apply non-orthogonal multiple access (NOMA) to facilitate concurrent caching replacement and content delivery in downlink transmission. We formulate a resource allocation problem to investigate how to efficiently push proactive files to the cache at the small base station and deliver the requested files to users. The resource-allocation problem is formulated as a mixed-integer exponential conic optimization problem. To enable a computationally-efficient optimal solution with finite convergence, we develop an iterative algorithm based on polyhedral outer approximation, where a polyhedral relaxation subproblem and a convex subproblem are constructed and iteratively solved to tighten the lower and upper bounds for the optimum, respectively. The numerical results demonstrate significant performance gains of the NOMA-enabled data transmission scheme in power and resource savings compared to the baseline scheme.

show abstract

Efficient cooperative cache management for latency-aware data intelligent processing in edge environment

Liu

Zhang

et al. 2021

Future Generation Computer Systems

View full text Add to dashboard Cite

An Efficient Online Cache Replacement Algorithm for 5G Networks

Cited by 4 publications

References 34 publications

A smart admission control and cache replacement approach in content delivery networks

A smart admission control and cache replacement approach in content delivery networks

Optimal Resource Allocation for NOMA-Enabled Cache Replacement and Content Delivery

Efficient cooperative cache management for latency-aware data intelligent processing in edge environment

Contact Info

Product

Resources

About