DMCA
Weighted distributed hash tables (2005)
Cached
Download Links
- [archive.cone.informatik.uni-freiburg.de]
- [www2.cs.uni-paderborn.de]
- [archive.cone.informatik.uni-freiburg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA |
| Citations: | 17 - 3 self |
BibTeX
@INPROCEEDINGS{Schindelhauer05weighteddistributed,
author = {Christian Schindelhauer and Heinz Nixdorf},
title = {Weighted distributed hash tables},
booktitle = {In Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA},
year = {2005},
pages = {218}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present two methods for weighted consistent hashing also known as weighted distributed hash tables. The first method, called Linear Method, combines the standard consistent hasing introduced by Karger et al. [9] with a linear weighted distance measure. By using node copies and different partitions of the hash space, the balance of this scheme approximates the fair weight relationship with high probability. The second method, called the Logarithmic Method, uses a logarithmic weighted distance between the peers and the data to find the corresponding node. For distributing one data element it provides perfect weighted balance. To provide this distribution for many data elements we use partitions to achieve a fair balance with high probability. These methods provide small fragmentation, which means that the hash space is divided into at most O(n log n) intervals. Furthermore, there is an efficient data structure that assigns data elements to the nodes in expected time O(log n). If small fragmentation is not an issue one can replace the use of partitions by a method we call double hash functions. This method needs O(n) for assigning elements to a node, yet it can be directly used for Storage Area Networks, where the number of nodes is small compared to participating nodes in Peer-to-Peer networks.
Keyphrases
distributed hash table hash space high probability small fragmentation data element second method weighted consistent hashing standard consistent hasing peer-to-peer network node copy linear weighted distance measure logarithmic weighted distance different partition fair weight relationship perfect weighted balance double hash function logarithmic method first method corresponding node expected time efficient data structure storage area network linear method fair balance hash table many data element
