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

01/04/2019
by   Jonnahtan Saltarin, et al.
0

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.

READ FULL TEXT
research
02/20/2020

PA-Cache: Learning-based Popularity-Aware Content Caching in Edge Networks

With the aggressive growth of smart environments, a large amount of data...
research
07/29/2020

Cache-enabled HetNets with Limited Backhaul: A Stochastic Geometry Model

With the rapid explosion of data volume from mobile networks, edge cachi...
research
01/30/2019

Caching or No Caching in Dense HetNets?

Caching the content closer to the user equipments (UEs) in heterogenous ...
research
03/09/2022

Limited Associativity Caching in the Data Plane

In-network caching promises to improve the performance of networked and ...
research
03/15/2019

Impact of Traffic Characteristics on Request Aggregation in an NDN Router

The paper revisits the performance evaluation of caching in a Named Data...
research
01/29/2021

No-Regret Caching via Online Mirror Descent

We study an online caching problem in which requests can be served by a ...
research
04/15/2020

Caching Structures for Distributed Data Management in P2P-based Social Networks

Distributed applications require novel solutions to tackle problems that...

Please sign up or login with your details

Forgot password? Click here to reset