Sciweavers

323 search results - page 39 / 65
» Range-capable Distributed Hash Tables
Sort
View
EUROPAR
2004
Springer
14 years 1 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
CN
2010
181views more  CN 2010»
13 years 8 months ago
Building a collaborative peer-to-peer wiki system on a structured overlay
The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. Wh...
Gérald Oster, Rubén Mondéjar,...
DBISP2P
2004
Springer
162views Database» more  DBISP2P 2004»
14 years 1 months ago
CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications
Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P ca...
Jinwon Lee, Hyonik Lee, Seungwoo Kang, Sungwon Pet...
SERSCISA
2009
Springer
14 years 3 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...
SAINT
2008
IEEE
14 years 2 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...