456 search results - page 8 / 92 » On Routing in Distributed Hash Tables |
LCN
2006
IEEE
15 years 5 months ago
2006
IEEE
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
KIVS
2005
Springer
15 years 5 months ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
CNSR
2005
IEEE
15 years 1 months ago
2005
IEEE
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
SAINT
2008
IEEE
15 years 6 months ago
2008
IEEE
101
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...