9 search results - page 1 / 2 » UnoHop: Efficient Distributed Hash Table with O(1) Lookup Pe... |
BROADCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
NSDI
2004
13 years 6 months ago
2004
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
ANCS
2005
ACM
13 years 10 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...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
JNW
2006
13 years 4 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...