165 search results - page 17 / 33 » Fast Routing Table Lookup Using CAMs |
90
Voted
ISPD
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
91
Voted
IEEEPACT
2003
IEEE
15 years 3 months ago
2003
IEEE
We investigate the implementation of IP look-up for core routers using multiple microengines and a tailored memory hierarchy. The main architectural concerns are limiting the numb...
85
Voted
DSN
2004
IEEE
15 years 2 months ago
2004
IEEE
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
114
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
67
Voted
NSDI
2004
14 years 11 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...