Title: Neighbour caching content retrieval in named data networking: an enhanced utilisation method

Authors: Akari Kanazawa; Tetsuya Shigeyasu

Addresses: Department of Management Information System, Prefectural University of Hiroshima, Hiroshima, Japan ' Department of Management Information System, Prefectural University of Hiroshima, Hiroshima, Japan

Abstract: The majority of current internet traffic comprises data accessed by multiple users without modification. Users are inherently curious about the content they request. However, the existing communication infrastructure of the internet is based on location-based control leading to a disconnect between user needs and communication methods on the internet. Named Data Networking (NDN) has emerged as a novel network architecture addressing this gap. NDN leverages caches on relay routers to reduce network traffic and server loads. Nevertheless, these caches can be effectively utilised only if the desired content is cached on routers along predetermined forwarding paths. This study proposes a method for exchanging cached content information among neighbourhood routers to utilise these caches for content delivery. Through computer simulations, our research demonstrates that our proposed method significantly enhances the cache hit rate, even when there is no overlap of interest-forwarding paths between users. For example, when the CS size is set as 100 contents and three users are placed at the corner of the grid topology, the cache hit ratio can be improved about 10% and 20% and area size is set as 2 and 3, respectively.

Keywords: NDN; neighbour cache search; FIB routing.

DOI: 10.1504/IJGUC.2025.145180

International Journal of Grid and Utility Computing, 2025 Vol.16 No.2, pp.173 - 182

Received: 06 Oct 2023
Accepted: 22 Mar 2024
Published online: 24 Mar 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article