A trie-based algorithm for IP lookup problem

Yilmaz, P.A.; Belenkiy, A.; Uzun, N.; Gogate, Neha; Toy, Mehmet

doi:10.1109/glocom.2000.892085

Cited by 15 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to decrease the tree level, LC scheme is used. In the LC-Trie [7][8][9][10][11][12][13][14][15][16], the root has 2 n children, and every branch is represented with 2 n bits, as shown in Fig. 2.…”

Section: Lc-tries (Level-compressed Tries)mentioning

confidence: 99%

A fast and scalable IPv4 and 6 address lookup algorithm

Leu

Chang

2006

Computer Communications

View full text Add to dashboard Cite

Section: Lc-tries (Level-compressed Tries)mentioning

confidence: 99%

A fast and scalable IPv4 and 6 address lookup algorithm

Leu

Chang

2006

Computer Communications

View full text Add to dashboard Cite

“…Although many alterations have been proposed to optimize the original trie structures, the lookup speed in trie-based mechanisms [2] using DRAM (Dynamic Random Access Memory) or SRAM (Static Random Access Memory) can hardly be further improved because of its intrinsic characteristic. TCAM is a promising device to build a high-speed lookup engine.…”

Section: Introductionmentioning

confidence: 99%

Arranging multicast forwarding table in class sequence in ternary-cam for line-speed lookup

Qiu

Lan

et al. 2009

J. Electron.(China)

View full text Add to dashboard Cite

PIM-SM (Protocol Independent Multicast-Sparse Mode) is a main multicast routing protocol in the IPv6 (Internet Protocol version 6). It can use either a shared tree or a shortest path tree to deliver data packets, consequently the multicast IP lookup engine requires, in some cases, two searches to get a correct lookup result according to its multicast forwarding rule, and it may result in a new requirement of doubling the lookup speed of the lookup engine. The ordinary method to satisfy this requirement in TCAM (Ternary Content Addressable Memory) based lookup engines is to exploit parallelism among multiple TCAMs. However, traditional parallel methods always induce more resources and higher design difficulty. We propose in this paper a novel approach to solve this problem. By arranging multicast forwarding table in class sequence in TCAM and making full use of the intrinsic characteristic of the TCAM, our approach can get the right lookup result with just one search and a single TCAM, while keeping the hardware of lookup engine unchanged. Experimental results have shown that the approach make it possible to satisfy forwarding IPv6 multicast packets at the full link rate of 20 Gb/s with just one TCAM with the current TCAM chip.

show abstract

“…Hashing algorithms have been widely adopted to provide for the address lookup process (Broder and Mitzenmacher, 2001;Chung et al, 2001;Pao et al, 2002;Yilmaz et al, 2000), i.e. the mapping of the rules onto the rule-set memory and the real-time search process to find a match.…”

Section: Introductionmentioning

confidence: 99%