Sciweavers

165 search results - page 8 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
INFOCOM
1998
IEEE
15 years 2 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown
TCAD
2008
119views more  TCAD 2008»
14 years 10 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
15 years 4 months ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...
ICPP
2003
IEEE
15 years 3 months ago
Hardware-Assisted Design for Fast Packet Forwarding in Parallel Routers
A hardware-assisted design, dubbed cache-oriented multistage structure (COMS), is proposed for fast packet forwarding. COMS incorporates small on-chip cache memory in its constitu...
Nian-Feng Tzeng
ISCAS
2008
IEEE
118views Hardware» more  ISCAS 2008»
15 years 4 months ago
Algorithm for parallel inverse halftoning using partitioning of Look-Up Table (LUT)
— The Look-Up Table (LUT) method for inverse halftoning is fast and computation-free technique employed to obtain good quality images. In this work we propose a new algorithm to ...
Umair F. Siddiqi, Sadiq M. Sait