29 search results - page 6 / 6 » Incrementally improving lookup latency in distributed hash t... |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— In this paper, we investigate the problem of highly available, massive-scale file distribution in the Internet. To this end, we conduct a large-scale measurement study of BitT...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...
110
click to vote
EDCC
2010
Springer
15 years 2 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
HPCA
2000
IEEE
15 years 1 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...