21 search results - page 3 / 5 » A Fast and Memory Efficient Dynamic IP Lookup Algorithm Base... |
CPM
1998
Springer
13 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
JSA
2006
13 years 4 months ago
2006
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
TKDE
2008
13 years 4 months ago
2008
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
ICC
2011
IEEE
12 years 4 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
TC
2008
13 years 4 months ago
2008
One of the most critical resource management issues in the use of ternary content addressable memory (TCAM) for packet classification/filtering is how to effectively support filte...