A Centrality-measures based Caching Scheme for Content-centric Networking (CCN)

Lal, Nidhi; Kumar, Amit

doi:10.1007/s11042-017-5183-y

Cited by 27 publications

(15 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [33], an edge caching with mobility prediction was proposed, which put the contents at the edge CRs as many as possible. In [34], a centrality-measures based scheme was proposed to select the core CRs; and in [35] the densitybased spatial clustering was exploited to detect the core CRs, which put the contents at the intermediate CRs. Different from [33]- [36] fully considered their advantages and proposed a heuristic greedy strategy, which cached the most popular contents at the edge CRs, recalculated the relative popularity of each piece based on the request miss stream and then determined the contents to be cached at the core CRs.…”

Section: Related Workmentioning

confidence: 99%

“…1 and 2 respectively. Furthermore, we compare the proposed HAEE with three the-state-of-the-art mechanisms, i.e., edge caching [33], core caching [34] and greedy caching [36], called Baseline in Future Generation Computer Systems (BFGCS), Baseline in Multimedia Tools and Applications (BMTA) and Baseline in Computer Networks (BCN) respectively. In addition, Average Energy Consumption (AEC), Average CRs load (ACL), Average Cache Hit Ratio (ACHR) and Average Throughput (AT) are considered as four evaluation metrics.…”

Section: Algorithm 2 the Improved Expectation Efficiencymentioning

confidence: 99%

See 1 more Smart Citation

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

Zhao

2020

IEEE Access

View full text Add to dashboard Cite

The in-network caching is a considerably significant feature of Information-Centric Networking (ICN), especially the heterogeneous-cached ICN has been widely investigated since it accords with the actual network deployment. For the heterogeneous-cached ICN, although there have been many proposals to improve network performance, it is very difficult for these approaches to reach the optimal network performance with multiple metrics consideration. Therefore, in this paper, we propose a heuristic transferring strategy which selects some Content Routers (CRs) and combines them to facilitate the optimal network performance under a constrained total cache budget. At first, we quantify energy consumption, CR load, cache hit ratio and throughput, because the optimal network performance depends on four objects, i.e., minimizing energy consumption and CRs load as well as maximizing cache hit ratio and throughput. Then, based on the given network constraints and objects, we convert the CR transferring problem into 0-1 Knapsack Problem (KP01). Finally, in order to effectively obtain the optimal solution, we propose a heuristic approach based on Ant Colony Optimization (ACO) and expectation efficiency to solve KP01. The simulation is driven by the real YouTube dataset from campus network measurement over GTS and Deltacom topologies, and the experimental results demonstrate that the proposed strategy is more efficient compared to three baselines.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Algorithm 2 the Improved Expectation Efficiencymentioning

confidence: 99%

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

Zhao

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In our prior work, we designed an integrated caching and routing solution to maximize the chance of finding nearby cached content for efficient cache utilization in ICN [16]. In Reference [17], the authors applied the concept of centrality to Content-Centric Networking (CCN, a typical ICN platform) for the goal of realizing a centrality-measure-based caching scheme in ICN. An analytical content distribution framework for popular content in ICN was developed in Reference [18].…”

Section: Related Workmentioning

confidence: 99%

PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks

Nguyễn

Liu

Pan

et al. 2019

Sensors

View full text Add to dashboard Cite

This article proposes a novel chunk-based caching scheme known as the Progressive Popularity-Aware Caching Scheme (PPCS) to improve content availability and eliminate the cache redundancy issue of Information-Centric Networking (ICN). Particularly, the proposal considers both entire-object caching and partial-progressive caching for popular and non-popular content objects, respectively. In the case that the content is not popular enough, PPCS first caches initial chunks of the content at the edge node and then progressively continues caching subsequent chunks at upstream Content Nodes (CNs) along the delivery path over time, according to the content popularity and each CN position. Therefore, PPCS efficiently avoids wasting cache space for storing on-path content duplicates and improves cache diversity by allowing no more than one replica of a specified content to be cached. To enable a complete ICN caching solution for communication networks, we also propose an autonomous replacement policy to optimize the cache utilization by maximizing the utility of each CN from caching content items. By simulation, we show that PPCS, utilizing edge-computing for the joint optimization of caching decision and replacement policies, considerably outperforms relevant existing ICN caching strategies in terms of latency (number of hops), cache redundancy, and content availability (hit rate), especially when the CN’s cache size is small.

show abstract

“…However, we utilized the concept of reach‐centrality to find the most central link, which takes fewer hops in reaching to the BS. The more detailed information about the selection of these parameters can be found in the work of Lal and Kumar …”

Section: Proposed Workmentioning

confidence: 99%

“…The more detailed information about the selection of these parameters can be found in the work of Lal and Kumar 31. The parameters used by the ANFIS based MDF strategy are link bandwidth, centrality, latency, packet loss ratio (PLR), and signal to noise ratio (SNR).…”

mentioning

confidence: 99%

A multisensor data fusion strategy for path selection in Internet‐of‐Things oriented wireless sensor network (WSN)

Kumar

Chaurasiya

2018

Concurrency and Computation

View full text Add to dashboard Cite

To give the complete description of an environment or to take a robust decision, a number of observations are collected and combined from multiple sensor nodes. The process of combining and analyzing the observations is called multisensor data fusion. The fusion is used to produce more consistent, accurate, and useful information rather than provided by any individual sensor node. Data fusion finds wide application in many areas of such as object recognition, wireless sensor network, image processing, environment mapping, and localization. Nowadays, the Internet of Things (IoT) utilizes wireless sensor network (WSN) as a necessary platform for data sensing and communication. For efficiency, data fusion is performed on the sensed sample collected by the sensor nodes. However, fusion of the network parameters is also essential to select an appropriate sensor node for the forwarding of data. Therefore, in this paper, we propose a multisensor data fusion (MDF) strategy that performs fusion of the collected network parameters like bandwidth and centrality for the selection of an appropriate path. Extensive simulations were made, and related results showed that our proposed scheme has a better performance compared with other schemes in our simulated scenarios. KEYWORDS data fusion, Internet-of-Things, performance analysis, wireless sensor network INTRODUCTIONA wireless sensor network (WSN) is a type of network that contains large number of nodes having sensing capability such that they can easily detect any changes in the surrounding real-world environment. The nodes in WSN are used to carry sensed information from one to another desired location for further processing. 1,2 Technological advances are being developed daily, and a WSN plays a rapid contribution for providing smart communication with the use of smart devices. These smart devices perform communication at the different locations by providing a level of transparency among users and maintained an interconnected smart network. A number of sensor nodes are constituted by the smart network, which is used to send sensed information and termed as the Internet of Things (IoT). 3 In this paper, we called this network as an IoT oriented WSN. In this network, the users communicate with each other by exchanging of sensed data, monitoring of events, and surrounding and reacting autonomously. 4 The difference between the WSN and IoT oriented WSN is only the few sensors are deployed in WSN rather than along with smart devices for applications.However, the IoT oriented WSN consists of devices having sensors with full network connectivity. The network of IoT oriented WSN is concerned with the loss of packets and performance of the links for achieving high throughput in less delay.The services of IoT oriented WSN are provided by using a standard interface such that users can create a query, retrieve information, and change their states accordingly. An Internet link is used to provide the standard interface between users and IoT devices. The hardware components of a sensor no...

show abstract

A Centrality-measures based Caching Scheme for Content-centric Networking (CCN)

Cited by 27 publications

References 24 publications

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks

A multisensor data fusion strategy for path selection in Internet‐of‐Things oriented wireless sensor network (WSN)

Contact Info

Product

Resources

About