2020•Procedia Computer ScienceOpen access

Enhancements To Content Caching Using Weighted Greedy Caching Algorithm In Information Centric Networking

Benadit P Julian, Kunj Pahuja, Manjot Singh Sidhu

Open full text 3 citations

Abstract

Information-Centric Networks (ICN) or Future Internet is the revolutionary concept for the existing infrastructure of the internet that changes the paradigm from host-centric networks to data-centric networks. Caching in Information-Centric Networks (ICN) has become one of the most critical research areas in today’s world, especially for the leading in content delivery over Internet companies like Netflix, Facebook, Google, etc. This paper is intended to propose a novel Caching strategy called Weighted Greedy Dual Size Frequency for caching in Information-Centric networks. In this paper, the WGDSF considers multiple critical factors for maintaining the Web Content efficiently in ICN Caching Router. Simulation is done for the various performance metrics like Cache Hit ratio, Link load, Path Stretch, and Latency for WGDSF cache replacement algorithm, and results shown that WGDSF outperforms well compared with LRU, LFU, and RAND Caching Strategies.

Open-access reader

About this research paper

What this paper is about

Information-Centric Networks (ICN) or Future Internet is the revolutionary concept for the existing infrastructure of the internet that changes the paradigm from host-centric networks to data-centric networks. Caching in Information-Centric Networks (ICN) has become one of the most critical research areas in today’s world, especially for the leading in content delivery over Internet companies like Netflix, Facebook, Google, etc. This paper is intended to propose a novel Caching strategy called Weighted Greedy Dual Size Frequency for caching in Information-Centric networks. In this paper, the WGDSF considers multiple critical factors for maintaining the Web Content efficiently in ICN Caching Router. Simulation is done for the various performance metrics like Cache Hit ratio, Link load, Path Stretch, and Latency for WGDSF cache replacement algorithm, and results shown that WGDSF outperforms well compared with LRU, LFU, and RAND Caching Strategies.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Information-Centric Networks (ICN) or Future Internet is the revolutionary concept for the existing infrastructure of the internet that changes the paradigm from host-centric networks to data-centric networks. Caching in Information-Centric Networks (ICN) has become one of the most critical research areas in today’s world, especially for the leading in content delivery over Internet companies like Netflix, Facebook, Google, etc. This paper is intended to propose a novel Caching strategy called Weighted Greedy Dual Size Frequency for caching in Information-Centric networks. In this paper, the WGDSF considers multiple critical factors for maintaining the Web Content efficiently in ICN Caching Router. Simulation is done for the various performance metrics like Cache Hit ratio, Link load, Path Stretch, and Latency for WGDSF cache replacement algorithm, and results shown that WGDSF outperforms well compared with LRU, LFU, and RAND Caching Strategies.

Key concepts: Computer science, Information-centric networking, Cache, Router, The Internet, Computer network, Latency (audio), Content delivery

Related papers

Back to paper searchBrowse research topicsOriginal source
Enhancements To Content Caching Using Weighted Greedy Caching Algorithm In Information Centric Networking — Research Paper | ScholarLens