456 search results - page 6 / 92 » On Routing in Distributed Hash Tables |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
FCSC
2007
13 years 8 months ago
2007
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...