.png){kind=icon}
返回
DxHash: A Memory-saving Consistent Hashing Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1145/3631708.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Consistent Hashing (CH) algorithms are widely adopted in networks and distributed systems for their ability to achieve load balancing and minimize disruptions. However, the rise of the Internet of Things (IoT) has introduced new challenges for existing CH algorithms, characterized by high memory usage and update overhead. This article presents DxHash, a novel CH algorithm based on repeated pseudo-random number generation. DxHash offers significant benefits, including a remarkably low memory footprint, high lookup throughput, and minimal update overhead. Additionally, we introduce a weighted variant of DxHash, enabling adaptable weight adjustments to handle heterogeneous load distribution. Through extensive evaluation, we demonstrate that DxHash outperforms AnchorHash, a state-of-the-art CH algorithm, in terms of the reduction of up to 98.4% in memory footprint and comparable performance in lookup and update.
Keyword:
DxHash
consistent hashing
load balance
memory saving
期刊
IF:
4.1
论文数:
896
被引数:
1.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Zur Klinik, Pathogenese und Therapie des Herpes zoster, insbesondere zur Häufigkeit des Zoster duplex unilateralis关于带状疱疹的临床表现、发病机制及治疗，特别是关于单侧双支带状疱疹的频率。
PREAI
分享收藏
查看更多内容