.png){kind=icon}
.png){kind=icon}
Return
Bloom-filter-based request node collaboration caching; named data networking
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-018-2403-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To promote data caching efficiency, caching space utilization, and data content searching speed of the content store (CS) unit in named data networking (NDN) routers, a sum-up Bloom-filter-based request node collaboration caching (BRCC) approach is proposed in this paper. BRCC realizes different;
ms of caching;
different types of data content. It sets the data content life time in accordance with its request frequency. It thereby promotes caching efficiency by caching high-frequent requested data content around the request node. In addition, it enhances the data content matching rate and decreases the searching time by using the sum-up Bloom filter. Simulation results showed that BRCC can efficiently utilize the CS caching space of NDN routers, reduce duplicate data caching, promote the cache hit rate, and increase the data content searching speed.
Keywords:
Named data networking
Bloom filter
Collaboration caching
Caching life time
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.1
Papers:
5.0K
Citations:
7.5K
