TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Reducing content retrieval latency in ICN
 
Options

Reducing content retrieval latency in ICN

Publikationstyp
Conference Paper
Date Issued
2025-07
Sprache
English
Author(s)
Derakhshan, Fariborz  
Timm-Giel, Andreas  orcid-logo
Kommunikationsnetze E-4  
Agüero, Ramón  
TORE-URI
https://hdl.handle.net/11420/58346
Start Page
368
End Page
373
Citation
International Conference on Ubiquitous and Future Networks, ICUFN 2025
Contribution to Conference
International Conference on Ubiquitous and Future Networks, ICUFN 2025  
Publisher DOI
10.1109/ICUFN65838.2025.11169822
Scopus ID
2-s2.0-105018741000
Publisher
IEEE
ISBN
979-8-3315-2488-3
979-8-3315-2487-6
To minimize content access latency within Information-centric Networking (ICN), its default caching strategy, 'Leave Copy Everywhere' (LCE), stores contents at each node along their delivery trajectory. However, this method inadvertently degrades caching efficiency due to the application of content replacement policies such as Least Recently Used (LRU). An indiscriminate replication of contents leads to lower cache hit ratios, decreased bandwidth utilization, and increased strain on content servers, resulting in longer content retrieval times. Thus, a nuanced modulation of contents' caching within the network is imperative to extend their proximity to their respective clientele. Identifying and strategically replicating high-demand contents across an optimum set of network nodes can maximize cache utilization and minimize cache pollution, notably improving network content accessibility and reducing retrieval times. We propose a caching strategy that dynamically, deterministically, and organically replicates the most popular contents to the optimum central cache nodes in the network, thus shortening the average path length that both requests and contents must traverse. Our caching strategy significantly outperforms LCE, achieving more than a 6% reduction in content retrieval path lengths. This paper comprehensively evaluates the proposed algorithm, elucidating its functionality and consequential repercussions on content redundancy, hit rate, and access time, which are paramount in the context of 6G systems. Leveraging the core principles of the introduced caching strategy, such as intelligent content distribution and proximity-based data access, can be vital for realizing Ultra-Reliable Low Latency Communications (URLLC) and enhanced Mobile Broadband (eMBB).
Subjects
Centrality-based Caching
Content Redundancy
Content Retrieval Latency
Future Communication Networks
Future Internet
In-network Caching
Information-centric Networking
Interaction-based Caching
Path Length Stretch
Popularity-based Caching
Topology-based Caching
DDC Class
003.5: Communication and Control
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback