Sciweavers

447 search results - page 36 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
15 years 1 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....
IPPS
2006
IEEE
15 years 5 months ago
Privacy-aware presence management in instant messaging systems
Information about online presence allows participants of instant messaging (IM) systems to determine whether their prospective communication partners will be able to answer their ...
Karsten Loesing, Markus Dorsch, Martin Grote, Knut...
ISPAN
2005
IEEE
15 years 5 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
P2P
2005
IEEE
152views Communications» more  P2P 2005»
15 years 5 months ago
On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery
A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scalability issues that make distributed resource discovery s...
Liping Chen, K. Selçuk Candan, Jun'ichi Tat...
ICDCS
2009
IEEE
15 years 9 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...