85 search results - page 12 / 17 » Small Forwarding Tables for Fast Routing Lookups |
IEEEPACT
2003
IEEE
14 years 11 days 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...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. Saf...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
ICDCS
2012
IEEE
11 years 9 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...