Non-uniform EWMA-PCA based cache size allocation scheme in Named Data Networks

Abstract

As a data-centric cache-enabled architecture, Named Data Networking (NDN) is considered to be an appropriate alternative to the current host-centric IP-based Internet infrastructure. Leveraging innetwork caching, name-based routing, and receiver-driven sessions, NDN can greatly enhance the way Internet resources are being used. A critical issue in NDN is the procedure of cache allocation and management. Our main contribution in this research is the analysis of memory requirements to allocate suitable Content-Store size to NDN routers, with respect to combined impacts of long-term centrality-based metric and Exponential Weighted Moving Average (EWMA) of short-term parameters such as users behaviours and outgoing traffic.To determine correlations in such large data sets, data mining methods can prove valuable to researchers. In this paper, we apply a data-fusion approach, namely Principal Component Analysis (PCA), to discover relations from short-and long-term parameters of the router. The output of PCA, exploited to mine out raw data sets, is used to allocate a proper cache size to the router. Evaluation results show an increase in the hit ratio of Content-Stores in sources, and NDN routers. Moreover, for the proposed cache size allocation scheme, the number of unsatisfied and pending Interests in NDN routers is smaller than the Degree-Centrality cache size scheme.

A New Cache Replacement Policy in Named Data Network Based on FIB Table Information

“…The users' requested rate is 4 packets per second. Each data chunk is 1.5 Kbytes and the cache capacity of each router is 300 data chunks (about 10 MB) and the content popularity follows Zipf's law [27,28].…”

An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

“…Heterogeneous cache allocation schemes have been the main part of some studies such as [7,[18][19][20]. The authors of Reference [7] studied graph-related centralities metrics and they noticed that the gain brought by the heterogeneous cache is very limited.…”

“…Apart from considering topology only, References [19,20] also took network traffic into account. In Reference [19] cache was allocated according to short-term parameters such as user behaviors and outgoing traffic as well as network topology.…”

“…Apart from considering topology only, References [19,20] also took network traffic into account. In Reference [19] cache was allocated according to short-term parameters such as user behaviors and outgoing traffic as well as network topology. This method is suitable for networks where content changes dynamically but cannot allocate cache properly before gathering enough traffic information.…”