Sciweavers

461 search results - page 5 / 93
» Dynamic Load Balancing in Distributed Hash Tables
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
INFOCOM
2000
IEEE
14 years 3 days ago
Performance of Hashing-Based Schemes for Internet Load Balancing
Abstract—Load balancing is a key technique for improving Internet performance. Effective use of load balancing requires good traffic distribution schemes. We study the performan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
CCS
2008
ACM
13 years 9 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
IPPS
2006
IEEE
14 years 1 months ago
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
Haiying Shen, Cheng-Zhong Xu
GCC
2005
Springer
14 years 1 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen