Sciweavers

1080 search results - page 29 / 216
» Distributed Hash Tables
Sort
View
104
Voted
IPPS
1998
IEEE
15 years 6 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
AIMS
2009
Springer
15 years 7 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...
DEXAW
2005
IEEE
134views Database» more  DEXAW 2005»
15 years 8 months ago
Enabling High Data Availability in a DHT
Many decentralized and peer-to-peer applications require some sort of data management. Besides P2P file-sharing, there are already scenarios (e.g. BRICKS project [3]) that need m...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
102
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 8 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
HOTOS
2007
IEEE
15 years 6 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer