1,605 research outputs found
Performance Evaluation of Caching Policies in NDN - an ICN Architecture
Information Centric Networking (ICN) advocates the philosophy of accessing
the content independent of its location. Owing to this location independence in
ICN, the routers en-route can be enabled to cache the content to serve the
future requests for the same content locally. Several ICN architectures have
been proposed in the literature along with various caching algorithms for
caching and cache replacement at the routers en-route. The aim of this paper is
to critically evaluate various caching policies using Named Data Networking
(NDN), an ICN architecture proposed in literature. We have presented the
performance comparison of different caching policies naming First In First Out
(FIFO), Least Recently Used (LRU), and Universal Caching (UC) in two network
models; Watts-Strogatz (WS) model (suitable for dense short link networks such
as sensor networks) and Sprint topology (better suited for large Internet
Service Provider (ISP) networks) using ndnSIM, an ns3 based discrete event
simulator for NDN architecture. Our results indicate that UC outperforms other
caching policies such as LRU and FIFO and makes UC a better alternative for
both sensor networks and ISP networks
CLOSER: A Collaborative Locality-aware Overlay SERvice
Current Peer-to-Peer (P2P) file sharing systems make use of a considerable percentage of Internet Service Providers (ISPs) bandwidth. This paper presents the Collaborative Locality-aware Overlay SERvice (CLOSER), an architecture that aims at lessening the usage of expensive international links by exploiting traffic locality (i.e., a resource is downloaded from the inside of the ISP whenever possible). The paper proves the effectiveness of CLOSER by analysis and simulation, also comparing this architecture with existing solutions for traffic locality in P2P systems. While savings on international links can be attractive for ISPs, it is necessary to offer some features that can be of interest for users to favor a wide adoption of the application. For this reason, CLOSER also introduces a privacy module that may arouse the users' interest and encourage them to switch to the new architectur
Soft Cache Hits and the Impact of Alternative Content Recommendations on Mobile Edge Caching
Caching popular content at the edge of future mobile networks has been widely
considered in order to alleviate the impact of the data tsunami on both the
access and backhaul networks. A number of interesting techniques have been
proposed, including femto-caching and "delayed" or opportunistic cache access.
Nevertheless, the majority of these approaches suffer from the rather limited
storage capacity of the edge caches, compared to the tremendous and rapidly
increasing size of the Internet content catalog. We propose to depart from the
assumption of hard cache misses, common in most existing works, and consider
"soft" cache misses, where if the original content is not available, an
alternative content that is locally cached can be recommended. Given that
Internet content consumption is increasingly entertainment-oriented, we believe
that a related content could often lead to complete or at least partial user
satisfaction, without the need to retrieve the original content over expensive
links. In this paper, we formulate the problem of optimal edge caching with
soft cache hits, in the context of delayed access, and analyze the expected
gains. We then show using synthetic and real datasets of related video contents
that promising caching gains could be achieved in practice
- …