Sciweavers

346 search results - page 18 / 70
» Routing networks for distributed hash tables
Sort
View
CCS
2008
ACM
13 years 9 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 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,...
ADHOC
2008
88views more  ADHOC 2008»
13 years 7 months ago
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper...
Shu Du, Ahamed Khan, Santashil PalChaudhuri, Ansle...
P2P
2008
IEEE
222views Communications» more  P2P 2008»
14 years 1 months ago
IgorFs: A Distributed P2P File System
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, whi...
Bernhard Amann, Benedikt Elser, Yaser Houri, Thoma...
ICC
2000
IEEE
179views Communications» more  ICC 2000»
13 years 12 months ago
A Comparison of On-Demand and Table Driven Routing for Ad-Hoc Wireless Networks
—We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR...
Jyoti Raju, J. J. Garcia-Luna-Aceves