447 search results - page 22 / 90 » On the Distribution of Nodes in Distributed Hash Tables |
111
click to vote
ERLANG
2003
ACM
15 years 5 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
129
click to vote
C5
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper provides an overview of MediaDART, a framework for building online services for distributing and sharing digital media. Inspired by the participative model of Web 2.0, ...
NSDI
2004
15 years 1 months ago
2004
CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broad...
IJNSEC
2008
14 years 11 months ago
2008
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
112
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...