Research Repository

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

Saltarin, Jonnahtan and Braun, Torsten and Bourtsoulatze, Eirina and Thomos, Nikolaos (2019) PopNetCod: A Popularity-based Caching Policy for Network Coding enabled Named Data Networking. In: 2018 IFIP Networking Conference (IFIP Networking) and Workshops, 2018-05-14 - 2018-05-16, Zurich, Switzerland.

[img]
Preview
Text
1901.01187v1.pdf - Accepted Version

Download (401kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: _not provided_
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 01 Aug 2019 10:36
Last Modified: 21 Jan 2020 11:15
URI: http://repository.essex.ac.uk/id/eprint/23831

Actions (login required)

View Item View Item