4438 search results - page 37 / 888 » On the Distribution of Keys by Hashing |
NCA
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
111
click to vote
IPTPS
2003
Springer
15 years 5 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
15 years 3 months 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...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
P2P
2007
IEEE
15 years 6 months ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...