Sciweavers

447 search results - page 6 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
103
Voted
PODC
2004
ACM
15 years 2 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
12 years 12 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
IPPS
2006
IEEE
15 years 3 months ago
Fault injection in distributed Java applications
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
William Hoarau, Sébastien Tixeuil, Fabien V...
93
Voted
SIGOPSE
2004
ACM
15 years 2 months ago
The lonely NATed node
In this paper we take the position that current research in the area of distributed systems has all but forgotten about one of the largest collective Internet resources - the NATe...
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S...
69
Voted
ESORICS
2005
Springer
15 years 3 months ago
Sybil-Resistant DHT Routing
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
George Danezis, Chris Lesniewski-Laas, M. Frans Ka...