S-DIRECT: Scalable and Dynamically Reconfigurable TCAM Architecture for High-Speed IP Lookup

Date

2015-06-01

Author

Ayyildiz, Nizam
Schmidt, Şenan Ece
Guran, Hasan Cengiz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

85
views

0
downloads

IP address lookup modules for backbone routers should store 100Ks of entries, find the longest prefix match (LPM) for each incoming packet at 10s of Gbps line speed and support thousands of lookup table (LUT) updates each second. It is desired that these updates are non-blocking, that is without disrupting the ongoing lookups. Furthermore, considering the increasing line rates and table sizes, the scalability of the design is very important. Ternary content-addressable memory (TCAM) architectures are widely deployed for hardware IP lookup. In this paper, we propose a novel TCAM architecture, S-DIRECT-Scalable and Dynamically REConfigurable TCAM, that is custom designed for hardware IP lookup. S-DIRECT consists of hierarchically combined TCAM cells with inherent priority encoders (PEs) to support LPM. Hence, its design is scalable without any need for a separate PE or a redesign for different table size. Furthermore, S-DIRECT can perform constant time, non-blocking updates in hardware provided that certain write capabilities are present in the TCAM entries. S-DIRECT architecture is both independent of the hardware platform and the implementation of the TCAM cells. We demonstrate the generality and viability of S-DIRECT by implementing it both with prefix/mask register and LUT-based TCAM cells on FPGA.

URI

https://hdl.handle.net/11511/42807

Journal

COMPUTER JOURNAL

DOI

https://doi.org/10.1093/comjnl/bxu069

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Design and implementation of hardware architectures for high-speed IP address lookup Ayyildiz, Nizam; Güran, Hasan Cengiz; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2013) IP address lookup modules for backbone routers should store 100Ks of entries, find the longest prefix match (LPM) for each incoming packet at 10s of Gbps line speed and support thousands of lookup table updates each second. It is desired that these updates are non-blocking, that is without disrupting the ongoing lookups. Furthermore, considering the increasing line rates and table sizes, the scalability of the design is very important. The goal of this thesis is developing hardware IP lookup architectures t...
SWIM : a new multicast routing algorithm for wireless networks Akyürek, Alper Sinan; Uysal Bıyıkoğlu, Elif; Department of Electrical and Electronics Engineering (2011) In this work, a new multicast routing algorithm for wireless networks is presented. The algorithm, called SWIM (Source-initiated WIreless Multicast), is a depth-optimal multicast tree formation algorithm. SWIM is fully distributed and has an average computational complexity of O(N 2 ). SWIM forms a shared tree from the source(s) to destinations; yet, as a by-product, it creates a multicast mesh structure by maintaining alternative paths at every tree node. This makes SWIM suitable for both ad hoc networks a...
Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21) This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...
Cooperative Network Coded ARQ Strategy for Broadcast Networks Tutgun, Rasit; AKTAŞ, EMRE (2015-06-12) A novel cooperative automatic repeat request (ARQ) method with network coding is proposed for broadcast networks where single source node broadcasts multiple packets to multiple destinations. Upon a failed transmission, multiple relays cooperate with the source node at the retransmission phase, where network coding is used to combine multiple lost packets. A random access mechanism is employed where retransmission is done according to back-off counters. The proposed method employs the back-off mechanism to ...
C3: Configurable CAN FD controller: Architecture, design and hardware implementation Afşin, Mehmet Ertuǧ; Schmidt, Klaus Verner; Schmidt, Şenan Ece (2017-07-26) CAN FD (Controller Area Network with Flexible Data Rate) is a new standard which provides a fast data rate while preserving the compatibility with CAN. In this paper, we propose the C 3 (Configurable CAN FD Controller) IP core architecture, which is compatible with the non-ISO CAN FD standard. C 3 supports up to 96 transmit and receive buffers. The transmit buffers are organized as mailboxes with CAN ID prioritization in frame transmission. A separate filter mask that can be configured by the user exists fo...

Citation Formats

N. Ayyildiz, Ş. E. Schmidt, and H. C. Guran, “S-DIRECT: Scalable and Dynamically Reconfigurable TCAM Architecture for High-Speed IP Lookup,” COMPUTER JOURNAL, pp. 1443–1455, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42807.