346 search results - page 14 / 70 » Routing networks for distributed hash tables |
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
SAINT
2006
IEEE
14 years 1 months ago
2006
IEEE
Despite the scalability, availability and resiliency potential suggested by Distributed Hash Tables, their lack of support for replication of mutable data and for strong consisten...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional "resourc...
DBISP2P
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Building distributed content–based publish/subscribe systems has remained a challenge. Existing solutions typically use a relatively small set of trusted computers as b...
EUROMICRO
2006
IEEE
14 years 1 months ago
2006
IEEE
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 ...