Centrality-Based On-Path Caching Strategies in NDN-Based Internet of Things: A Survey

The substantial growth in data volume has led to considerable technological obstacles on the Internet. In order to address the high volume of Internet traffic, the research community has investigated the improvement of Internet architecture by implementing centrality-based caching, which could involve collaborative efforts. Different centrality-based caching strategies have been put forward that allow for different data distribution. These include betweenness centrality, degree centrality, and closeness centrality. Caching provides several advantages in terms of reducing latency, improving scalability, and enhancing data manageability. In addition, this study provides an overview of cache management algorithms based on centrality in the context of Information Centric Networking (ICN), Named Data Networking (NDN), and Internet of Things (IoT). It highlights the advantages and disadvantages of these algorithms and evaluates their performance in a network simulation environment, specifically in terms of cache hit ratio, data retrieval latency, and average hop count. Ultimately, we aim to pinpoint and deliberate on possible research directions for future studies concerning various aspects of centrality-based caching in communication systems.

Authors

Institutions

Publication Details

Journal
IEEE Communications Surveys & Tutorials
Published
2024-11-07
DOI
https://doi.org/10.1109/comst.2024.3493626
Citations
9
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
3.14
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Centrality-Based On-Path Caching Strategies in NDN-Based Internet of Things: A Survey

Muhammad Ali Naeem, Ikram Ud Din, Joel J. P. C. Rodrigues, Ahmad Almogren
9 citations
IEEE Communications Surveys & Tutorials
Caching and Content Delivery
3.14
article

Centrality-Based On-Path Caching Strategies in NDN-Based Internet of Things: A Survey

Muhammad Ali Naeem, Ikram Ud Din, Joel J. P. C. Rodrigues, Ahmad Almogren
article en
9 citations

Abstract

The substantial growth in data volume has led to considerable technological obstacles on the Internet. In order to address the high volume of Internet traffic, the research community has investigated the improvement of Internet architecture by implementing centrality-based caching, which could involve collaborative efforts. Different centrality-based caching strategies have been put forward that allow for different data distribution. These include betweenness centrality, degree centrality, and closeness centrality. Caching provides several advantages in terms of reducing latency, improving scalability, and enhancing data manageability. In addition, this study provides an overview of cache management algorithms based on centrality in the context of Information Centric Networking (ICN), Named Data Networking (NDN), and Internet of Things (IoT). It highlights the advantages and disadvantages of these algorithms and evaluates their performance in a network simulation environment, specifically in terms of cache hit ratio, data retrieval latency, and average hop count. Ultimately, we aim to pinpoint and deliberate on possible research directions for future studies concerning various aspects of centrality-based caching in communication systems.

IEEE Communications Surveys & TutorialsVol. 27(4)
University of Haripur (PK), King Saud University (SA), Guangdong University of Petrochemical Technology (CN), Universidade do Estado do Amazonas (BR)
Openalex Percentile: Top 8%
Caching and Content Delivery
3.14
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.