79 search results - page 6 / 16 » Comparing the Performance of Distributed Hash Tables Under C... |
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
105
click to vote
CIKM
1994
Springer
15 years 3 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
81
Voted
SIGCOMM
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
JNW
2006
14 years 11 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...
100
click to vote
IEEEARES
2006
IEEE
15 years 5 months ago
2006
IEEE
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 netwo...