346 search results - page 66 / 70 » Routing networks for distributed hash tables |
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
IWQOS
2004
Springer
14 years 25 days ago
2004
Springer
— Traditional SLAs, defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service avai...
CCGRID
2001
IEEE
13 years 11 months ago
2001
IEEE
End-users of high-performance computing resources have come to expect that consistent levels of performance be delivered to their applications. The advancement of the Computationa...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...