33 search results - page 1 / 7 » Adaptive Data Structures for IP Lookups |
INFOCOM
2003
IEEE
13 years 9 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
ICNP
2005
IEEE
13 years 10 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
ICPADS
2002
IEEE
13 years 9 months ago
2002
IEEE
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
ICNP
2009
IEEE
13 years 11 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 ...
SIGCOMM
1997
ACM
13 years 8 months ago
1997
ACM
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...