Efficient Gray-Code-Based Range Encoding Schemes for Packet Classification in TCAM

Chang, Yeim-Kuan; Su, Cheng-Chien; Lin, Yung‐Chieh; Hsieh, Sun-Yuan

doi:10.1109/tnet.2012.2220566

Cited by 16 publications

(7 citation statements)

References 20 publications

(36 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are two types of range-encoding algorithms: database-dependent [15]- [17], [22], [24], [35], [36] and database-independent [1], [18]. Database-dependent encoding algorithms have superior efficiency for both TCAM entry length and count, but they require extra memory accesses to map header values of the encoded fields.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

TCAM-Based Multi-Match Packet Classification Using Multidimensional Rule Layering

Chang

Wang

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Ternary content addressable memory (TCAM) has superior performance for single-match packet classification but not the case for multi-match packet classification. The limitation is caused by TCAM architecture that reports only the first matching rule. To cope with the limitation, previous algorithms use extra TCAM entries or accesses, or both, to fulfill multi-match packet classification. These algorithms also reorder rules; thus, a multi-match classifier based on these algorithms cannot maintain performance for single-match packet classification. In other words, all matching rules must be yielded to determine the highest priority matching rule. In this paper, we present a TCAM-based scheme for multi-match packet classification without single-match penalty. Our scheme partitions a rule set based on range layering, which can be applied to achieve range encoding. The rule partitioning generates rule subsets which satisfy that the rules in a subset are mutually disjoint. Each rule is then tagged a bitmap for subset identification to fulfill multi-match packet classification. Two approaches, loose coupling and tight coupling, are derived with different search procedures while incorporating range encoding. Both approaches can maintain original rule order, but with different performance tradeoff. We also present a refinement which uses all available TCAM entries to improve the performance of multi-match packet classification. The experimental results show that combining range encoding with multi-match packet classification has advantages of storage efficiency and speed superiority. The capability of supporting single-match packet classification also provides better flexibility of applying different packet actions.Index Terms-Geometric intersection, multi-match, packet classification, range encoding, ternary content addressable memory (TCAM).

show abstract

Section: Related Workmentioning

confidence: 99%

“…Layered binary reflected gray code (L-BRGC) is a scheme combining the concepts of range layering and binary reflected gray code (BRGC) [36]. L-BRGC divides a single range into primitive ranges, where denotes a constant number and each primitive range is encoded by using BRGC.…”

Section: Related Workmentioning

confidence: 99%

TCAM-Based Multi-Match Packet Classification Using Multidimensional Rule Layering

Chang

Wang

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…However, a complex distributed network with multiple firewalls and log acquisition are not contemplated. TCAM based fast packet classification is proposed in [17]. However, TCAM are expensive and power hungry, as pointed out, for example, in [18].…”

Section: Related Workmentioning

confidence: 99%

Adaptive Conflict-Free Optimization of Rule Sets for Network Security Packet Filtering Devices

Baiocchi

Maiolini²,

Mingo³

et al. 2015

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Packet filtering and processing rules management in firewalls and security gateways has become commonplace in increasingly complex networks. On one side there is a need to maintain the logic of high level policies, which requires administrators to implement and update a large amount of filtering rules while keeping them conflict-free, that is, avoiding security inconsistencies. On the other side, traffic adaptive optimization of large rule lists is useful for general purpose computers used as filtering devices, without specific designed hardware, to face growing link speeds and to harden filtering devices against DoS and DDoS attacks. Our work joins the two issues in an innovative way and defines a traffic adaptive algorithm to find conflict-free optimized rule sets, by relying on information gathered with traffic logs. The proposed approach suits current technology architectures and exploits available features, like traffic log databases, to minimize the impact of ACO development on the packet filtering devices. We demonstrate the benefit entailed by the proposed algorithm through measurements on a test bed made up of real-life, commercial packet filtering devices.

show abstract

“…14). In short, the following conditions must be satisfied when the SA is enabled to ensure a correct ML output (1) (2) where and are the sense amplifier input voltage when sensing a matched ML and a 1-miss ML, as depicted in Fig. 14.…”

Section: Offset-aware Comparator Design For Power Reductionmentioning

confidence: 99%

“…Thus, search operation can complete in a single clock cycle and return the location that stores the search data [1]. This attractive feature makes CAMs popular in hardware-based search engine implementations where throughput is the most important requirement [2]- [5].…”

Section: Introductionmentioning

confidence: 99%

0.77 fJ/bit/search Content Addressable Memory Using Small Match Line Swing and Automated Background Checking Scheme for Variation Tolerance

Tuan

Yin

Velayudhan

et al. 2014

IEEE J. Solid-State Circuits

View full text Add to dashboard Cite

This work reports a fully parallel match-line (ML) structure with an automated background checking (ABC) scheme. MLs are pre-charged to an intermediate level by a pulsed current source to minimize power. The proposed ABC scheme uses two dummy rows for digitally adjusting the pulse width and the delay of the sense amplifier enable signals of the CAM without disturbing the normal operation. Therefore, it can continuously track the optimum ML swing, making the CAM tolerant to variations. The proposed ABC scheme achieves the power reduction of 5.5× compared with the conventional ML sensing scheme. In addition, multi-V t transistors are used in the CAM cell to reduce the leakage by 15× while improving the ML discharging speed by 2× when compared with the standard-V t devices at 1.2 V, 80°C. A test chip was prototyped using a standard 65 nm CMOS process. The average energy consumption is 0.77 fJ/bit/search at 1.2 V/500 MHz. Index Terms-CAM, match-line, small match line swing, variation tolerant design.

show abstract

Efficient Gray-Code-Based Range Encoding Schemes for Packet Classification in TCAM

Cited by 16 publications

References 20 publications

TCAM-Based Multi-Match Packet Classification Using Multidimensional Rule Layering

TCAM-Based Multi-Match Packet Classification Using Multidimensional Rule Layering

Adaptive Conflict-Free Optimization of Rule Sets for Network Security Packet Filtering Devices

0.77 fJ/bit/search Content Addressable Memory Using Small Match Line Swing and Automated Background Checking Scheme for Variation Tolerance

Contact Info

Product

Resources

About