Sciweavers

461 search results - page 1 / 93
» Dynamic Load Balancing in Distributed Hash Tables
Sort
View
PODC
2004
ACM
13 years 10 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
GLOBECOM
2008
IEEE
13 years 11 months ago
A Dynamic Load-Balanced Hashing Scheme for Networking Applications
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
N. Sertac Artan, Haowei Yuan, H. Jonathan Chao
IPTPS
2005
Springer
13 years 10 months ago
Dynamic Load Balancing in Distributed Hash Tables
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
LCN
2008
IEEE
13 years 11 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