Ingredients to enhance the performance of two-stage TCAM-based packet classifiers in internet of things: greedy layering, bit auctioning and range encoding

• Published in: EURASIP journal on wireless communications and networking Vol. 2019; no. 1; pp. 1 - 15
• Main Authors: Abbasi, Mahdi, Vakilian, Shakoor, Fanian, Ali, Khosravi, Mohammad R.
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 30.12.2019; Springer Nature B.V; SpringerOpen
• Subjects: Algorithms; Associative memory; Auctioning; Bit auctioning; Classification; Classifiers; Communications Engineering; Decision trees; Engineering; Greedy algorithms; Greedy layering; Hardware; Information Systems Applications (incl.Internet); Internet of Things; Layer encoding; Layering; Multi-modal Sensor Data Fusion in Internet of Things; Networks; Packet classification; Power consumption; Range field; Signal,Image and Speech Processing; Storage; Ternary content-addressable memory (TCAM); Layer encoding; Range field; Efficiency; Ternary content-addressable memory (TCAM); Greedy layering; Bit auctioning; Packet classification
• ISSN: 1687-1499; 1687-1472; 1687-1499
• DOI: 10.1186/s13638-019-1617-8

Using packet classification algorithms in network equipment increases packet processing speed in Internet of Things (IoT). In the hardware implementation of these algorithms, ternary content-addressable memories (TCAMs) are often preferred to other implementations. As a common approach, TCAMs are used for the parallel search to match packet header information with the rules of the classifier. In two-stage architectures of hardware-based packet classifiers, first the decision tree is created, and then the rules are distributed among its leaves. In the second step, depending on the corresponding leaves, the second part of the rules, which includes the range of source and destination ports is stored in different blocks of TCAM. Due to inappropriate storage of port range fields, the existing architectures face the problem of wasting memory and growing power consumption. This paper proposes an efficient algorithm to encode the port range. This algorithm consists of three general steps including layering, bit allocation, and encoding. A greedy algorithm in the first step places the ranges with higher weights in higher layers. Next, an auction-based algorithm allocates several bits to each layer depending on the number of the ranges in that layer. Finally, in each layer, depending on the weight order of the ranges, the bits are given values for the intended range. The evaluation results show that unlike previous methods of storing range fields, the proposed method not only increases the speed of the classification but also uses the capacity of TCAM in the second stage more efficiently.