Recent works on Information Centric Networking enable the exploitation of the caching resources in the new generation of routers (Content Routers or CR). So far, only a basic Least Recently Used (LRU) strategy implemented on every CR has been proposed. More generally, the research community lacks methods for analyzing and evaluating caching policies (other than LRU) in generic multi-cache topologies. In this paper, we provide a model that approximates the hit-ratios of any multi-cache topology for the Least Recently/Frequently Used (LRFU) caching policies, which consist of a spectrum of policies based on a trade-off between recency and frequency. We also present a way to approximate the performances of the network of caches when the input traffic changes. The approximation results can be used to decide suitable policy for CR at different positions in the network topology. With appropriate policy for each single CR, we are able to improve the performance of the whole in-network caching system.
In the context of the Open Network Automation Platform (ONAP), we develop in this paper a resource allocation strategy for deploying Virtualized Network Functions (VNFs) on distributed data centers. For this purpose, we rely on a three-level data center hierarchy exploiting co-location facilities available within Main and Core Central Offices. We precisely propose an active VNFs' placement strategy, which dynamically offload requests on the basis of the load observed within a data center. We compare via simulations the performance of the proposed solution against mechanisms so far proposed in the literature, notably the centralized approach of the multi-site project within OpenStack, currently adopted by ONAP. It turns out that the proposed algorithm yields better performance in terms of both data center occupancy and overhead. Furthermore, it allows extending the applicability of ONAP in the context of distributed cloud, without requiring any modification.