456 search results - page 83 / 92 » On Routing in Distributed Hash Tables |
76
Voted
IPTPS
2005
Springer
15 years 3 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
110
click to vote
SIGCOMM
2010
ACM
14 years 9 months ago
2010
ACM
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
84
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
TGC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...