Sciweavers

109 search results - page 10 / 22
» A Small IP Forwarding Table Using Hashing
Sort
View
TC
2010
13 years 6 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
INFOCOM
2009
IEEE
14 years 2 months ago
Fighting Spam with the NeighborhoodWatch DHT
—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...
Adam Bender, Rob Sherwood, Derek Monner, Nathan Go...
SIGCOMM
2004
ACM
14 years 1 months ago
A layered naming architecture for the internet
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature ...
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvi...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
14 years 27 days ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas