Sciweavers

447 search results - page 13 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
SIGCOMM
2005
ACM
15 years 3 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
67
Voted
SERSCISA
2009
Springer
15 years 4 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
IPPS
2007
IEEE
15 years 3 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
ICDCS
2006
IEEE
15 years 3 months ago
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Haiying Shen, Cheng-Zhong Xu
ERCIMDL
2005
Springer
91views Education» more  ERCIMDL 2005»
15 years 2 months ago
LibraRing: An Architecture for Distributed Digital Libraries Based on DHTs
We present a digital library architecture based on distributed hash tables. We discuss the main components of this architecture and the protocols for offering information retrieva...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...