2025 : 4 : 22
Hatam Abdoli

Hatam Abdoli

Academic rank: Assistant Professor
ORCID:
Education: PhD.
ScopusId: 35178909100
HIndex:
Faculty: Faculty of Engineering
Address:
Phone:

Research

Title
Layered methods for updating AIoT-compatible TCAMS in B5G-enabled WSNs
Type
JournalPaper
Keywords
Packet classification Layering Ternary content-addressable memory Number of searches Update duration
Year
2022
Journal EURASIP Journal on Wireless Communications and Networking
DOI
Researchers Mahdi Abbasi ، Shobeir Vakilian ، Shakoor Vakilian ، Mohammad Reza Khosravi ، Hatam Abdoli

Abstract

Classification is a fundamental processing task in advanced network systems. This technique is exploited in 5G/6G wireless sensors networks where flow-based processing of the internet packets is highly demanded by intelligent applications that analyze big volumes of data in a limited time. In this process, the input packets are classified into specific streams by matching to a set of filters. The ternary content-addressable memory (TCAM) is used in hardware implementation of internet packets. However, due to the parallel search capabilities, this memory leads to an increase in the speed and drop of hardware bundles compared to other types of software bundles, but with the increase in the number of rules stored in its layers, the power required for searching, inserting and eliminating increases. Various architectures have been proposed to solve this problem, but none of them has proposed a plan to reduce power consumption while updating the rules in the TCAM memory. In this paper, two algorithms are presented for reducing power consumption during TCAM memory upgrades. The key idea in the proposed algorithms is the reduction in the search range as well as the number of displacements while inserting and deleting rules in TCAM. Implementation and evaluation of proposed methods represent a reduction of more than 50% of the number of visits to TCAM in both proposed algorithms, as well as reducing the update time in the second proposed algorithm compared to the first proposed algorithm which confirms the efficiency of both methods.