Sciweavers

447 search results - page 15 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
ISPAN
2005
IEEE
15 years 3 months ago
External Double Hashing with Choice
A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical resu...
Walter A. Burkhard
IPTPS
2003
Springer
15 years 2 months ago
Sloppy Hashing and Self-Organizing Clusters
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating wi...
Michael J. Freedman, David Mazières
P2P
2009
IEEE
114views Communications» more  P2P 2009»
15 years 4 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
LCN
2008
IEEE
15 years 3 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
GI
2004
Springer
15 years 2 months ago
On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics ...
Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon ...