An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

Li, Yuanhang; Wang, Jinlin; Han, Rui

doi:10.3390/electronics9101705

Cited by 6 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There were also some studies with unique perspectives. Reference [34] proposed a lightweight allocation method utilizing information of both topology and content popularity to allocate cache space and get the expected number of copies of popular content. When the cache is deployed, dramatic changes are not likely to occur in the short term, while the network is constantly changing.…”

Section: Cache Size Allocation Schemementioning

confidence: 99%

A Hierarchical Cache Size Allocation Scheme Based on Content Dissemination in Information-Centric Networks

Liu

Han

2021

Future Internet

Self Cite

View full text Add to dashboard Cite

With the rapid growth of mass content retrieval on the Internet, Information-Centric Network (ICN) has become one of the hotspots in the field of future network architectures. The in-network cache is an important feature of ICN. For better network performance in ICN, the cache size on each node should be allocated in proportion to its importance. However, in some current studies, the importance of cache nodes is usually determined by their location in the network topology, ignoring their roles in the actual content transmission process. In this paper, we focus on the allocation of cache size for each node within a given total cache space budget. We explore the impact of heterogeneous cache allocation on content dissemination under the same ICN infrastructure and we quantify the importance of nodes from content dissemination and network topology. To this purpose, we implement a hierarchy partitioning method based on content dissemination, then we formulate a set of weight calculation methods for these hierarchies and to provide a per-node cache space allocation to allocate the total cache space budget to each node in the network. The performance of the scheme is evaluated on the Garr topology, and the average hit ratio, latency, and load are compared to show that the proposed scheme has better performance in these aspects than other schemes.

show abstract

Section: Cache Size Allocation Schemementioning

confidence: 99%

A Hierarchical Cache Size Allocation Scheme Based on Content Dissemination in Information-Centric Networks

Liu

Han

2021

Future Internet

Self Cite

View full text Add to dashboard Cite

show abstract

A Hybrid Caching Scheme with Dynamic Forwarding Strategy in Information‐Centric Network

Dey,

Asaduzzaman,

Arefin

et al. 2024

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

In this era of huge data traffic, the information‐centric network (ICN) is a switching strategy from conventional host‐centric communication to a new data‐centric one. In‐network caching an integral part of ICN can reduce the shortcomings of today's location‐based internet paradigm. As ICN has limited caching capability, the decision of optimal routing and content placement are the major challenges. In this study, we suggest a hybrid caching with a dynamic forwarding (HCDF) strategy which takes advantage of the off‐path hash routing scheme and on‐path caching scheme. To facilitate both caching schemes, a fraction of the caching space is allotted in each cache node for local caching. At the user‐end segment, an estimation‐based content placement (ECP) policy is designed using content popularity state and cache node position. This policy helps to cache popular content near the consumer's location using the shared cache space. At the server‐end segment, the HCDF scheme dynamically selects the most appropriate routing strategy among three strategies (symmetric, asymmetric, and multicast) based on hop count and path stretch. To demonstrate the effectiveness of HCDF, extensive simulation on real‐world internet topologies has been carried out. From our investigation, it is observed that the suggested approach exhibits an impressive performance in terms of cache hit, latency, and average link load compared to other standard hash routing and well‐known on‐path caching schemes. © 2024 The Author(s). IEEJ Transactions on Electrical and Electronic Engineering published by Institute of Electrical Engineers of Japan and Wiley Periodicals LLC.

show abstract

A near-optimal & load balanced resilient system design for high-performance computing platform

et al. 2023

View full text Add to dashboard Cite

An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

Cited by 6 publications

References 30 publications

A Hierarchical Cache Size Allocation Scheme Based on Content Dissemination in Information-Centric Networks

A Hierarchical Cache Size Allocation Scheme Based on Content Dissemination in Information-Centric Networks

A Hybrid Caching Scheme with Dynamic Forwarding Strategy in Information‐Centric Network

A near-optimal & load balanced resilient system design for high-performance computing platform

Contact Info

Product

Resources

About