Sciweavers

323 search results - page 24 / 65
» Range-capable Distributed Hash Tables
Sort
View
IPTPS
2003
Springer
14 years 1 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
2003
IEEE
108views Communications» more  P2P 2003»
14 years 1 months ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
SASO
2008
IEEE
14 years 2 months ago
Using Global Information for Load Balancing in DHTs
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...
Mikael Högqvist, Seif Haridi, Nico Kruber, Al...
SIGCOMM
2005
ACM
14 years 2 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...
COMPSAC
2004
IEEE
14 years 7 days ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang