54 search results - page 2 / 11 » A Comparison of Hashing Schemes for Address Lookup in Comput... |
ISVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail ...
ANCS
2005
ACM
14 years 21 days ago
2005
ACM
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
SIGCOMM
1997
ACM
13 years 11 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
NCA
2006
IEEE
14 years 1 months ago
2006
IEEE
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...