Sciweavers

456 search results - page 22 / 92
» On Routing in Distributed Hash Tables
Sort
View
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 9 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
AIMS
2009
Springer
14 years 2 months ago
Evaluation of Sybil Attacks Protection Schemes in KAD
In this paper, we assess the protection mechanisms entered into recent clients to fight against the Sybil attack in KAD, a widely deployed Distributed Hash Table. We study three m...
Thibault Cholez, Isabelle Chrisment, Olivier Festo...
P2P
2008
IEEE
222views Communications» more  P2P 2008»
14 years 4 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...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
12 years 8 days 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,...
WCW
2004
Springer
14 years 3 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker