Sciweavers

323 search results - page 22 / 65
» Range-capable Distributed Hash Tables
Sort
View
TELETRAFFIC
2007
Springer
14 years 2 months ago
Estimating Churn in Structured P2P Networks
In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that ...
Andreas Binzenhöfer, Kenji Leibnitz
SIGIR
2005
ACM
14 years 2 months ago
Publish/subscribe functionality in IR environments using structured overlay networks
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
13 years 10 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....
3DPVT
2002
IEEE
121views Visualization» more  3DPVT 2002»
14 years 1 months ago
Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques
In this paper we present a method for protein structure comparison that is based on indexing. Unlike most methods using indexing, ours does not use invariants of the C atoms of th...
Concettina Guerra, Stefano Lonardi, Giuseppe Zanot...
GI
2004
Springer
14 years 1 months ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle