An Efficient Hardware-Based Multi-hash Scheme for High Speed IP Lookup

2008 ◽  
Author(s):  
Socrates Demetriades ◽  
Michel Hanna ◽  
Sangyeun Cho ◽  
Rami Melhem
Keyword(s):  
High Speed ◽  
Ip Lookup

Reconfigurable finite-state machine based IP lookup engine for high-speed router

2003 ◽  
Vol 21 (4) ◽  
pp. 501-512 ◽  
Author(s):  
M. Desai ◽  
R. Gupta ◽  
A. Karandikar ◽  
K. Saxena ◽  
V. Samant
Keyword(s):  
High Speed ◽  
Finite State Machine ◽  
State Machine ◽  
Ip Lookup ◽  
Finite State

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

2014 ◽  
Vol 58 (6) ◽  
pp. 1443-1455 ◽  
Author(s):  
N. Ayy ld z ◽  
E. G. Schmidt ◽  
H. C. Guran
Keyword(s):  
High Speed ◽  
Ip Lookup ◽  
Dynamically Reconfigurable

Scalable, memory efficient, high-speed IP lookup algorithms

2005 ◽  
Vol 13 (4) ◽  
pp. 802-812 ◽  
Author(s):  
R. Sangireddy ◽  
N. Futamura ◽  
S. Aluru ◽  
A.K. Somani
Keyword(s):  
High Speed ◽  
Ip Lookup ◽  
Memory Efficient

GENETIC-ALGORITHM MEMORY MINIMISATION FOR DESIGNING RECONFIGURABLE IP ADDRESS LOOKUP ENGINE

2005 ◽  
Vol 05 (01) ◽  
pp. 69-90
Author(s):  
SAEED SHAMSHIRI ◽  
S. MEHDI FAKHRAIE
Keyword(s):  
Genetic Algorithm ◽  
High Speed ◽  
Life Time ◽  
Fixed Number ◽  
Memory Consumption ◽  
Ip Address ◽  
Ip Lookup ◽  
Ip Address Lookup ◽  
Genetic Algorithm Approach ◽  
Number Of Segments

IP address lookup engine is the beating heart of a router. For meeting the requirements of a desirable high-speed router, speed, memory consumption, scalability, and reconfigurability of its IP lookup engine are critical. This paper uses a genetic-algorithm approach to optimise the structure of fixed-stride multibit-trie IP lookup methods. In this work, the genetic algorithm is used first in the design phase as an offline optimisation mechanism. This nature-inspired simulation finds the most memory-efficient configuration of IP address segmentation for a fixed number of address segments. Then, for adapting to network variations, the proposed method dynamically changes the number of address segments to compromise between speed and memory consumption. Each time the number of segments changes, an online genetic program is run to optimise the segmentation. Therefore, the lookup engine reconfigures itself to cover more prefixes during the time. The reconfigurability in response to the network variations, and scalability to the number of prefixes improves the life time of a router that uses this method.

A fast IP lookup scheme for high speed routers

2005 ◽  
Vol 28 (3) ◽  
pp. 521-533 ◽  
Author(s):  
Lih‐Chyau Wuu ◽  
Shou‐Yu Pin
Keyword(s):  
High Speed ◽  
Ip Lookup

Performance Analysis of an IP Lookup Algorithm for High Speed Router Systems

2003 ◽  
pp. 35-45 ◽  
Author(s):  
Min Young Chung ◽  
Jaehyung Park ◽  
Byung Jun Ahn ◽  
Namseok Ko ◽  
Jeong Ho Kim
Keyword(s):  
Performance Analysis ◽  
High Speed ◽  
Ip Lookup

An Efficient Prefix Caching Scheme with Bounded Prefix Expansion for High-Speed IP Lookup

2012 ◽  
Vol E95.B (10) ◽  
pp. 3298-3301 ◽  
Author(s):  
Junghwan KIM ◽  
Minkyu PARK ◽  
Sangchul HAN ◽  
Jinsoo KIM
Keyword(s):  
High Speed ◽  
Ip Lookup ◽  
Caching Scheme
Sign in / Sign up

Export Citation Format

Share Document