A value-based cache replacement approach for Information-Centric Networks

Al‐Turjman, Fadi; Al-Fagih, Ashraf E.; Hassanein, Hossam S.

doi:10.1109/lcnw.2013.6758526

Cited by 22 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [19] proposed the Popularity-based cache policy for Privacy-preserving in NDN (PPNDN) using a probabilistic way based on the content popularity with information of the router. The Least Value First (LVF) algorithm [20] is a replacement algorithm that is based on the value of the delay, age and popularity of the content, which are combined with tuning parameters α, β and , allowing a priority customization based on the user-provided parameters.…”

Section: Related Workmentioning

confidence: 99%

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Silva

Araujo²,

Linder³

et al. 2019

JCIS

View full text Add to dashboard Cite

An essential aspect of the network paradigm called Named Data Networking (NDN) is that all nodes in the network have the ability to cache contents natively. The focus of this work relies on efficiently choosing which content should be removed from a full cache to allow storing another one. We propose a new caching replacement algorithm for NDN networks called Name Popularity Algorithm (NPA). The proposed algorithm adopts an extra table that takes into account a long time history for the popularity of contents. Thus, when a data content is removed from the cache, its popularity is not reset, improving the cache usage of the network routers. The performance of NPA is compared to well-known strategies in the literature through NS-3/ndnSIM simulations. The results indicate that the proposed algorithm overcomes others with lower end-to-end delay, higher cache hit ratio and smaller hop count. Besides, our code is available as open source to be accessible for other researchers and to allow reproduction of the results.

show abstract

Section: Related Workmentioning

confidence: 99%

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Silva

Araujo²,

Linder³

et al. 2019

JCIS

View full text Add to dashboard Cite

show abstract

“…Researchers have also studied peer-to-peer network scenarios in NDN. Specifically, they have studied the effect of user-assisted innetwork caching on the performance of the file sharing process [3,15,28]. They have also proposed a routing protocol to manage the delivery of data [7] and a system to synchronize files among multiple parties [19].…”

Section: Prior Work On Peer-to-peer Network Simulatorsmentioning

confidence: 99%

A Simulation Framework for Peer-to-Peer File Sharing in Named Data Networking

Raman

Chou

Mastorakis

2019

Proceedings of the 2019 Workshop on Ns-3

View full text Add to dashboard Cite

Peer-to-peer file sharing envisions a data-centric dissemination model, where files consisting of multiple data pieces can be shared from any peer that can offer the data or from multiple peers simultaneously. This aim, implemented at the application layer of the network architecture, matches with the objective of Named Data Networking (NDN), a proposed Internet architecture that features a data-centric communication model at the network layer. To study the impact of a data-centric network architecture on peer-to-peer file sharing, we proposed nTorrent, a peer-to-peer file sharing application on top of NDN. Since the initial nTorrent proposal in 2017, we have implemented its design in ndnSIM, the de facto NDN simulator. In this paper, we present the design of our nTorrent simulation framework, discussing various design decisions and trade-offs. We also describe our experimentation and validation process to ensure that our framework possesses the fundamental properties of nTorrent.KEYWORDS nTorrent, peer-to-peer, simulation, Named Data Networking (NDN), file sharing INTRODUCTIONPeer-to-peer file sharing applications, such as BitTorrent [10], have been an area of active research over the years. In such applications, a file consists of multiple individual pieces of data. The primary goal of peers is to retrieve the desired data pieces from any other peer that can offer them. This data-centric functionality exists only at the application layer of the network architecture. Since peers operate on top of the point-to-point TCP/IP architecture, they need to decide from which peer (IP address) to retrieve the desired data. Specifically, peers have to discover other peers, select specific peers to establish TCP connections to, as well as estimate the quality of these connections.Named Data Networking (NDN) [36] is a proposed Internet architecture that offers a data-centric communication model. NDN enables applications to exclusively focus on what pieces of data to fetch, while the NDN network determines from where to fetch the desired data. In other words, NDN can provide the data-centric functionality needed by peer-to-peer applications directly at the network layer of the network architecture.To explore the benefits and trade-offs of the NDN data-centric communication model for peer-to-peer file sharing, we have proposed nTorrent [21]; an application for peer-to-peer file sharing in NDN. nTorrent was initially designed and evaluated in 2017. This paper is a preprint of [32]. The definitive version will be published by the ACM library.

show abstract

“…This parameter includes the distance from the source, reachability of the router and the frequency of the content access. Al-Turjman et al in [2] introduced the Least-Value First (LVF) cache replacement policy which takes into account the delay for retrieving content as well as the popularity and age of content experienced by a node.…”

Section: B Cache Replacement Policiesmentioning

confidence: 99%

How to Cache in ICN-Based IoT Environments?

Meddeb

Dhraief

Belghith

et al. 2017

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)

View full text Add to dashboard Cite

Abstract-Information-Centric Networking (ICN) is an emerging network paradigm based on name-identified data objects and in-network caching. Therefore, ICN contents are distributed in a scalable and cost-efficient manner. With the rapid growth of IoT traffic, ICN is intended to be a suitable architecture to support IoT networks. In fact, ICN provides unique persistent naming, in-network caching and multicast communications which reduce the data producer load and the response latency. Using ICN in an IoT environment requires a study of caching policies in terms of cache placement strategies and cache replacement policies. To this end, we address, in this paper, caching challenges with the aim to identify which caching policies are suitable for IoT networks. Simulation findings show that the combination of the consumer-cache caching strategy and the RR cache replacement policy is the most convenient in IoT environments in terms of hop reduction ratio, server hit reduction and response latency.

show abstract

A value-based cache replacement approach for Information-Centric Networks

Cited by 22 publications

References 8 publications

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

A Simulation Framework for Peer-to-Peer File Sharing in Named Data Networking

How to Cache in ICN-Based IoT Environments?

Contact Info

Product

Resources

About