scholarly journals An Efficient Content Store-Based Forwarding Scheme for Internet of Things

Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7607
Author(s):  
Ngoc-Thanh Dinh ◽  
Younghan Kim

One of the main advantages of information-centric networking (ICN) is that a requested piece of content can be retrieved from a content store (CS) at any intermediate node, instead of its original content producer. In existing ICN designs, nodes forward Interest packets mainly based on forwarding information base (FIB). FIB is constructed from name prefixes registered by content producers with a list of next hops to the name prefixes. The ICN forwarding engine uses those information to forward Interest packets towards corresponding content producers. CS information of a node is currently used only for checking the availability of cached content objects at the node and is not considered in the data plane of existing ICN forwarding mechanisms. This paper highlights the importance of CS information in an ICN forwarding mechanism and enables neighbor CS information in the data plane to improve the cache hit ratio and forwarding efficiency, especially for resource-constraint Internet of Things (IoT). We propose an efficient CS-based forwarding scheme for IoT. The proposed forwarding scheme exploits CS information of neighbors to find efficient routes to forward Interest packets toward nearby nodes with corresponding cached content. For that, we carefully design an efficient way for CS information sharing using counting bloom filter. We implement the proposed scheme and compare with state-of-the-art ICN forwarding schemes in IoT. Experimental results indicate that the proposed forwarding scheme achieves a significant improvement in terms of cache hit ratio, energy efficiency, content retrieval latency, and response rate.

2019 ◽  
Vol 9 (15) ◽  
pp. 3178
Author(s):  
Ju Hyoung Mun ◽  
Hyesook Lim

As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6–8% of the traffic for distributing the connectivity information and 5–9% of the memory consumption.


2014 ◽  
Vol 22 (4) ◽  
pp. 1092-1105 ◽  
Author(s):  
Ori Rottenstreich ◽  
Yossi Kanizo ◽  
Isaac Keslassy

2016 ◽  
Vol 116 (4) ◽  
pp. 304-309 ◽  
Author(s):  
Salvatore Pontarelli ◽  
Pedro Reviriego ◽  
Juan Antonio Maestro

Author(s):  
Zhou Mingzhong ◽  
Gong Jian ◽  
Ding Wei ◽  
Cheng Guang

Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 207 ◽  
Author(s):  
Yongjun Ren ◽  
Fujian Zhu ◽  
Pradip Kumar Sharma ◽  
Tian Wang ◽  
Jin Wang ◽  
...  

In the IoT (Internet of Things) environment, smart homes, smart grids, and telematics constantly generate data with complex attributes. These data have low heterogeneity and poor interoperability, which brings difficulties to data management and value mining. The promising combination of blockchain and the Internet of things as BCoT (blockchain of things) can solve these problems. This paper introduces an innovative method DCOMB (dual combination Bloom filter) to firstly convert the computational power of bitcoin mining into the computational power of query. Furthermore, this article uses the DCOMB method to build blockchain-based IoT data query model. DCOMB can implement queries only through mining hash calculation. This model combines the data stream of the IoT with the timestamp of the blockchain, improving the interoperability of data and the versatility of the IoT database system. The experiment results show that the random reading performance of DCOMB query is higher than that of COMB (combination Bloom filter), and the error rate of DCOMB is lower. Meanwhile, both DCOMB and COMB query performance are better than MySQL (My Structured Query Language).


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 167113-167122
Author(s):  
Bo Mi ◽  
Yang Li ◽  
Huang Darong ◽  
Tiancheng Wei ◽  
Qianqian Zou

2019 ◽  
Vol 28 (12) ◽  
pp. 1950203
Author(s):  
Sajjad Rostami-Sani ◽  
Mojtaba Valinataj ◽  
Saeideh Alinezhad Chamazcoti

The cache system dissipates a significant amount of energy compared to the other memory components. This will be intensified if a cache is designed with a set-associative structure to improve the system performance because the parallel accesses to the entries of a set for tag comparisons lead to even more energy consumption. In this paper, a novel method is proposed as a combination of a counting Bloom filter and partial tags to mitigate the energy consumption of set-associative caches. This new hybrid method noticeably decreases the cache energy consumption especially in highly-associative instruction caches. In fact, it uses an enhanced counting Bloom filter to predict cache misses with a high accuracy as well as partial tags to decrease the overall cache size. This way, unnecessary tag comparisons can be prevented and therefore, the cache energy consumption is considerably reduced. Based on the simulation results, the proposed method provides the energy reduction from 22% to 31% for 4-way–32-way set-associative L1 caches bigger than 16[Formula: see text]kB running the MiBench programs. The improvements are attained with a negligible system performance degradation compared to the traditional cache system.


2017 ◽  
Vol 13 (12) ◽  
pp. 155014771774974 ◽  
Author(s):  
Anum Talpur ◽  
Faisal K Shaikh ◽  
Thomas Newe ◽  
Adil A Sheikh ◽  
Emad Felemban ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document