Sciweavers

447 search results - page 21 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
PODC
2003
ACM
15 years 5 months ago
Split-ordered lists: lock-free extensible hash tables
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
Ori Shalev, Nir Shavit
TPDS
2010
126views more  TPDS 2010»
14 years 6 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
DCOSS
2006
Springer
15 years 3 months ago
Locating Compromised Sensor Nodes Through Incremental Hashing Authentication
Abstract. While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising attacks. In this paper, we propose COOL, a CO...
Youtao Zhang, Jun Yang 0002, Lingling Jin, Weijia ...
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
14 years 11 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...
MST
2006
136views more  MST 2006»
14 years 11 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl