Results 11  20
of
10,247
Simple Load Balancing for Distributed Hash Tables
, 2002
"... Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argu ..."
Abstract

Cited by 135 (1 self)
 Add to MetaCart
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We
Routing Networks for Distributed Hash Tables
, 2003
"... Routing topologies for distributed hashing in peertopeer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
Routing topologies for distributed hashing in peertopeer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted
A robust aggregation tree on distributed hash tables
 in MIT Student Oxygen 2004 (SOW2004
, 2004
"... A Distributed Hash Table (DHT) is a distributed resolution mechanism that manages the distribution of data among a changing set of nodes by mapping keys to nodes. A large number of DHTs have been proposed, and are expected to ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A Distributed Hash Table (DHT) is a distributed resolution mechanism that manages the distribution of data among a changing set of nodes by mapping keys to nodes. A large number of DHTs have been proposed, and are expected to
On the Distribution of Nodes in Distributed Hash Tables
"... Abstract: We develop a model for the distribution of nodes in ringbased DHTs like Chord that position nodes randomly or based on hashfunctions. As benefit of our model we get the distribution of interval sizes and an approximation of the distribution of data load among the participating peers. The ..."
Abstract
 Add to MetaCart
Abstract: We develop a model for the distribution of nodes in ringbased DHTs like Chord that position nodes randomly or based on hashfunctions. As benefit of our model we get the distribution of interval sizes and an approximation of the distribution of data load among the participating peers
Comparing the Performance of Distributed Hash Tables Under Churn
 IN PROC. IPTPS
, 2004
"... A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churnchanges in membershipin order to maintain its ability to route lookups efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined into ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churnchanges in membershipin order to maintain its ability to route lookups efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined
TDHT: TopologyBased Distributed Hash Tables
 IN P2P ā05: PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON PEERTOPEER COMPUTING (P2Pā05
, 2005
"... In this paper, we introduce topologybased distributed hash tables (TDHT) as an infrastructure for datacentric storage, information processing, and routing in ad hoc and sensor networks. TDHTs do not rely on location information and work even in the presence of voids in the network. Using a virtu ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper, we introduce topologybased distributed hash tables (TDHT) as an infrastructure for datacentric storage, information processing, and routing in ad hoc and sensor networks. TDHTs do not rely on location information and work even in the presence of voids in the network. Using a
A Simple Fault Tolerant Distributed Hash Table
 In Second International Workshop on PeertoPeer Systems
, 2003
"... We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is robust under random deletion of nodes. The second has parallel time of log n and message complexity of log^2 n. It is robust ..."
Abstract

Cited by 55 (5 self)
 Add to MetaCart
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is robust under random deletion of nodes. The second has parallel time of log n and message complexity of log^2 n
Authentication in Stealth Distributed Hash Tables
"... Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same over ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness. However, implementing and enforcing security policies in a network where all nodes are treated equally is a nontrivial task. We therefore extend our previous work on Stealth DHTs to consider the differentiation of nodes based on their trustworthiness rather than their capabilities alone. 1.
Koorde: A simple degreeoptimal distributed hash table
, 2003
"... Koorde is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n ..."
Abstract

Cited by 216 (1 self)
 Add to MetaCart
Koorde is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O
A Case for Unstructured Distributed Hash Tables
"... Structured peertopeer overlays support compelling applications such as largescale file systems and distributed backup using the distributed hash table (DHT) interface. While unstructured filesharing systems continue to flourish, wide adoption of structured applications has been elusive. We explo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Structured peertopeer overlays support compelling applications such as largescale file systems and distributed backup using the distributed hash table (DHT) interface. While unstructured filesharing systems continue to flourish, wide adoption of structured applications has been elusive. We
Results 11  20
of
10,247