110 search results - page 3 / 22 » Performance analysis by topology indexed lookup tables |
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
107
click to vote
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
101
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
111
click to vote
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
130
click to vote
SBBD
2008
14 years 11 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...