可扩展性
计算机科学
服务器
散列函数
网络数据包
负载平衡(电力)
分布式计算
内存占用
理论(学习稳定性)
哈希表
计算机网络
并行计算
操作系统
数学
计算机安全
几何学
机器学习
网格
作者
Yoav Levi,Isaac Keslassy
标识
DOI:10.1109/icnp59255.2023.10355577
摘要
Consistent hashing (CH) is a crucial building block for load-balancers. It enables packets of the same flow to keep being mapped to the same server whenever possible. Load- balancers implement heterogeneous CH to deal with the varying server speeds. However, they mostly rely on the old Ring algorithm, suffering from practical scalability and stability issues, as well as from a lack of theoretical stability guarantees. This paper presents a new framework for heterogeneous CH. The framework relies on quantization using virtual servers, and on a min-max fairness-based mapping algorithm denoted M3. The paper establishes necessary and sufficient conditions to guarantee stability for any arbitrary heterogeneous server service rate. We also explain why M3 presents better scalability properties than all heterogeneous CH alternatives, including a faster key lookup rate and a lower memory footprint. Finally, evaluations show that M3 also offers a significantly increased stability region.
科研通智能强力驱动
Strongly Powered by AbleSci AI