PopNetCod: A Popularity-based Caching Policy for Network Coding-enabled Named Data Networking

Saltarin de Arco, Jonnahtan Eduardo; Braun, Torsten; Bourtsoulatze, Eirina; Thomos, Nikolaos (14 May 2018). PopNetCod: A Popularity-based Caching Policy for Network Coding-enabled Named Data Networking. In: IFIP Networking Conference.

Text popnetcod.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (318kB) | Request a copy

In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data Networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner when they receive requests for Data packets. This allows the most popular Data packets to be cached closer to the network edges. The evaluation of PopNetCod shows an improved cache-hit rate compared to the widely used Leave Copy Everywhere placement policy and the Least Recently Used eviction policy. The improved cache-hit rate helps the clients to achieve higher goodput, while it also reduces the load on the source servers.

Interest & Impact

Downloads

17 since deposited on 12 Jun 2017
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item