456 search results - page 85 / 92 » On Routing in Distributed Hash Tables |
100
click to vote
CCS
2010
ACM
14 years 9 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
CCGRID
2001
IEEE
15 years 1 months ago
2001
IEEE
End-users of high-performance computing resources have come to expect that consistent levels of performance be delivered to their applications. The advancement of the Computationa...
ICS
2000
Tsinghua U.
15 years 1 months ago
2000
Tsinghua U.
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
155
click to vote
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
SSD
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Modern mobile phones and PDAs are equipped with positioning capabilities (e.g., GPS). Users can access public location-based services (e.g., Google Maps) and ask spatial ...