456 search results - page 2 / 92 » On Routing in Distributed Hash Tables |
134
Voted
CIC
2003
15 years 4 months ago
2003
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
78
Voted
ISCC
2007
IEEE
15 years 9 months ago
2007
IEEE
126
Voted
OPODIS
2010
15 years 18 days ago
2010
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
115
Voted
IPTPS
2004
Springer
15 years 8 months ago
2004
Springer
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
169
Voted
SIGCOMM
2005
ACM
15 years 8 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...