Sciweavers

18 search results - page 3 / 4
» IP Route Lookups as String Matching
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
Performing Packet Content Inspection by Longest Prefix Matching Technology
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
Nen-Fu Huang, Yen-Ming Chu, Yen-Min Wu, Chia-Wen H...
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
13 years 10 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
INFOCOM
2009
IEEE
13 years 12 months ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...
ICNP
2007
IEEE
13 years 11 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
TON
2010
138views more  TON 2010»
12 years 12 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng