85 search results - page 8 / 17 » Small Forwarding Tables for Fast Routing Lookups |
ICNP
2009
IEEE
14 years 1 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
INFOCOM
2005
IEEE
14 years 21 days ago
2005
IEEE
— With the emergence of Voice over IP and other real-time business applications, there is a growing demand for an IP network with high service availability. Unfortunately, in tod...
JSA
2006
13 years 7 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...
INFOCOM
2002
IEEE
14 years 1 days ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...