Sciweavers

81 search results - page 9 / 17
» Sybil-Resistant DHT Routing
Sort
View
SPAA
2006
ACM
14 years 1 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
P2P
2008
IEEE
14 years 1 months ago
Flexible Routing in Grouped DHTs
In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems mig...
Yiming Zhang, Dongsheng Li, Lei Chen 0002, Xicheng...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 21 days ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
DBKDA
2010
IEEE
127views Database» more  DBKDA 2010»
13 years 6 months ago
Failure-Tolerant Transaction Routing at Large Scale
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...
IPTPS
2004
Springer
14 years 25 days ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...