An Internet Application-Driven Cache Placement Algorithm for Software-Defined Information-Centric Networking

In this thesis, we proposed a Cluster-Based Cache Replacement (CBR) scheme for 5G Networks to reduce the backhaul traffic. We developed our scheme based on the understanding of the degradation of the performance of the cache placement algorithm. We expect that whenever file request pattern differs from the file popularity distribution, such as unpopular files become more popular or vice versa, the caching system should experience performance degradation. We address this problem by presenting a cache replacement scheme based on the idea of Least Frequency Used (LFU) replacement policy, but we consider only the recent request to avoid cache pollution. We evaluated the performance of CBR through simulation and compared its performance with LRU that is widely used as a cache replacement technique in practice. We simulated three different configurations of LRU scheme in a cluster-based mobile network model. Our simulation results show that the CBR outperforms LRU, where it reduces the miss ratio from 86% to 76% and the backhaul traffic from 3.67×105 to 3.47×105 MB with 10% of cache size. This superior performance it achieves by fewer replacement decisions and storing more files in the cache.

Download Full-text

Information-Centric Networking Cache Placement Method Based on Cache Node Status and Location

Wireless Communications and Mobile Computing ◽

10.1155/2021/5648765 ◽

2021 ◽

Vol 2021 ◽

pp. 1-13

Author(s):

Dapeng Man ◽

Yao Wang ◽

Hanbo Wang ◽

Jiafei Guo ◽

Jiguang Lv ◽

...

Keyword(s):

Information Exchange ◽

Network Architecture ◽

Cache Replacement ◽

Data Simulation ◽

Information Centric Networking ◽

Network Location ◽

Deployment Strategy ◽

Cooperative Cache ◽

Web Cache ◽

Cache Placement

Information-Centric Networking with caching is a very promising future network architecture. The research on its cache deployment strategy is divided into three categories, namely, noncooperative cache, explicit collaboration cache, and implicit collaboration cache. Noncooperative caching can cause problems such as high content repetition rate in the web cache space. Explicit collaboration caching generally reflects the best caching effect but requires a lot of communication to satisfy the exchange of cache node information and depends on the controller to perform the calculation. On this basis, implicit cooperative caching can reduce the information exchange and calculation between cache nodes while maintaining a good caching effect. Therefore, this paper proposes an on-path implicit cooperative cache deployment method based on the dynamic LRU-K cache replacement strategy. This method evaluates the cache nodes based on their network location and state and selects the node with the best state value on the transmission path for caching. Each request will only select one or two nodes for caching on the request path to reduce the redundancy of the data. Simulation experiments show that the cache deployment method based on the state and location of the cache node can improve the hit rate and reduce the average request length.

Download Full-text

A Distributed Cache Placement Scheme for Large-Scale Information-Centric Networking

IEEE Network ◽

10.1109/mnet.011.2000081 ◽

2020 ◽

Vol 34 (6) ◽

pp. 126-132

Author(s):

Boubakr Nour ◽

Hakima Khelifi ◽

Hassine Moungla ◽

Rasheed Hussain ◽

Nadra Guizani

Keyword(s):

Large Scale ◽

Information Centric Networking ◽

Cache Placement ◽

Distributed Cache

Download Full-text

Cluster-based Cache Replacement in 5G Network

10.32920/ryerson.14646492.v1 ◽

2021 ◽

Author(s):

Muhammad Jaseemuddin

Keyword(s):

Mobile Network ◽

Replacement Policy ◽

Superior Performance ◽

Cache Replacement ◽

5G Network ◽

Replacement Decisions ◽

Replacement Technique ◽

Replacement Scheme ◽

Cache Placement ◽

Placement Algorithm

In this thesis, we proposed a Cluster-Based Cache Replacement (CBR) scheme for 5G Networks to reduce the backhaul traffic. We developed our scheme based on the understanding of the degradation of the performance of the cache placement algorithm. We expect that whenever file request pattern differs from the file popularity distribution, such as unpopular files become more popular or vice versa, the caching system should experience performance degradation. We address this problem by presenting a cache replacement scheme based on the idea of Least Frequency Used (LFU) replacement policy, but we consider only the recent request to avoid cache pollution. We evaluated the performance of CBR through simulation and compared its performance with LRU that is widely used as a cache replacement technique in practice. We simulated three different configurations of LRU scheme in a cluster-based mobile network model. Our simulation results show that the CBR outperforms LRU, where it reduces the miss ratio from 86% to 76% and the backhaul traffic from 3.67×105 to 3.47×105 MB with 10% of cache size. This superior performance it achieves by fewer replacement decisions and storing more files in the cache.

Download Full-text

A cache placement algorithm based on comprehensive utility in big data multi-access edge computing

KSII Transactions on Internet and Information Systems ◽

10.3837/tiis.2021.11.002 ◽

2021 ◽

Vol 15 (11) ◽

Keyword(s):

Big Data ◽

Edge Computing ◽

Cache Placement ◽

Placement Algorithm ◽

Multi Access

Download Full-text

A Cache Placement Strategy with Energy Consumption Optimization in Information-Centric Networking

Future Internet ◽

10.3390/fi11030064 ◽

2019 ◽

Vol 11 (3) ◽

pp. 64 ◽

Cited By ~ 6

Author(s):

Xin Zheng ◽

Gaocai Wang ◽

Qifei Zhao

Keyword(s):

Energy Consumption ◽

Success Rate ◽

Energy Savings ◽

Rapid Development ◽

Information Centric Networking ◽

Additional Energy ◽

Comparison Results ◽

Optimal Stopping Theory ◽

Energy Consumption Optimization ◽

Cache Placement

With the rapid development of cloud computing, big data, and Internet of Things, Information-Centric Networking (ICN) has become a novel hotspot in the field of future Internet architecture, and new problems have appeared. In particular, more researchers consider information naming, delivery, mobility, and security in ICN. In this paper, we mainly focus on the cache placement strategy and network performance of ICN, and propose a cache placement strategy with energy consumption optimization. In order to optimize the energy consumption of the ICN, the best cache placement node is selected from the view of users. First of all, the distance sequence of different nodes arriving at each user is obtained in terms of detection results of network distribution channels, and the corresponding energy consumption of information distribution is obtained from the distance sequence. Secondly, the reward function of the cache node is derived using two factors of energy consumption, which includes the additional energy consumed by the change of the cache node and the energy consumption of the content distribution. Finally, we construct the optimal stopping theory problem to solve the maximum expected energy saving. In simulations, we give the comparison results of energy savings, caching benefit, and delivery success rate. The results show that the strategy proposed by this paper has higher delivery success rate and lower energy consumption than other strategies.

Download Full-text