456 search results - page 12 / 92 » On Routing in Distributed Hash Tables |
CCR
2004
13 years 8 months ago
2004
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
CISIS
2009
IEEE
14 years 3 months ago
2009
IEEE
Structured, spatial-temporal data arises in many applications areas such as transportation, sensor networks or mobile services. Peer to peer networks are the natural choice for th...
IPTPS
2003
Springer
14 years 1 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
DSOM
2006
Springer
14 years 7 days ago
2006
Springer
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
ISCC
2006
IEEE
14 years 2 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...