1080 search results - page 41 / 216 » Distributed Hash Tables |
123
click to vote
OSDI
2002
ACM
16 years 2 months ago
2002
ACM
Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to ful...
93
Voted
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
126
Voted
EDBT
2006
ACM
15 years 4 months ago
2006
ACM
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
130
Voted
ALENEX
2010
15 years 4 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
183
Voted
SIGCOMM
1997
ACM
15 years 6 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...