118 search results - page 9 / 24 » A Simple Fault Tolerant Distributed Hash Table |
ACISICIS
2008
IEEE
14 years 3 months ago
2008
IEEE
The web services technology provides an approach for developing distributed applications by using simple and well defined interfaces. Due to the flexibility of this architecture, ...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Currently, some coarse measures like global network latency are used to compare routing protocols. These measures do not provide enough insight of traffic distribution among networ...
ICPP
2008
IEEE
14 years 3 months ago
2008
IEEE
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
ICDCS
1998
IEEE
14 years 27 days ago
1998
IEEE
In this paper, we quantify the adverse effect of file sharing on the performance of reliable distributed applications. We demonstrate that file sharing incurs significant overhead...