Sciweavers

45 search results - page 1 / 9
» Halo: High-Assurance Locate for Distributed Hash Tables
Sort
View
NDSS
2008
IEEE
13 years 11 months ago
Halo: High-Assurance Locate for Distributed Hash Tables
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
Apu Kapadia, Nikos Triandopoulos
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 7 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
SC
2004
ACM
13 years 10 months ago
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of...
Min Cai, Ann L. Chervenak, Martin R. Frank
GIR
2006
ACM
13 years 10 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
GLOBECOM
2009
IEEE
13 years 11 months ago
Peer-to-Peer Single Hop Distributed Hash Tables
Abstract—Efficiently locating information in large-scale distributed systems is a challenging problem to which Peer-to-Peer (P2P) Distributed Hash Tables (DHTs) can provide a hi...
Luiz Rodolpho Monnerat, Cláudio L. Amorim