165 search results - page 29 / 33 » Fast Routing Table Lookup Using CAMs |
CN
2010
14 years 10 months ago
2010
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
97
Voted
ICML
1995
IEEE
15 years 11 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
FPT
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
NSDI
2004
14 years 11 months ago
2004
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...