Sciweavers

447 search results - page 31 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
MIDDLEWARE
2010
Springer
14 years 10 months ago
dFault: Fault Localization in Large-Scale Peer-to-Peer Systems
Distributed hash tables (DHTs) have been adopted as a building block for large-scale distributed systems. The upshot of this success is that their robust operation is even more imp...
Pawan Prakash, Ramana Rao Kompella, Venugopalan Ra...
96
Voted
SPAA
2009
ACM
16 years 9 days ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
INFOCOM
2003
IEEE
15 years 5 months ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...
SAINT
2008
IEEE
15 years 6 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
IPTPS
2003
Springer
15 years 5 months ago
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distribut...
Sean C. Rhea, Timothy Roscoe, John Kubiatowicz