85 search results - page 6 / 17 » Small Forwarding Tables for Fast Routing Lookups |
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Flash analog-to-digital converters can be built using small (and fast) low-precision comparators with unpredictable thresholds followed by a digital look-up table to correct th...
NPC
2004
Springer
14 years 14 days ago
2004
Springer
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
ICCD
2004
IEEE
14 years 4 months ago
2004
IEEE
This paper will present a solution to eliminate the requirements of sorting by prefix length in IP forwarding devices using Ternary Content Addressable Memories (TCAMs). This will...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
HOTOS
2003
IEEE
14 years 12 days ago
2003
IEEE
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...