Affiliation:
1. WNLO, Key Laboratory of Information Storage System, Engineering Research Center of data storage systems and Technology (School of Computer Science & Technology, Huazhong University of Science & Technology), Ministry of Education of China, China
Abstract
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 paper 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference30 articles.
1. Shahbaz Akhtar Abid , Mazliza Othman , and Nadir Shah . 2014. A Survey on DHT-Based Routing for Large-Scale Mobile Ad Hoc Networks. ACM Comput. Surv. 47, 2 , Article 20 (aug 2014 ), 46 pages. DOI: https://doi.org/10.1145/2632296 10.1145/2632296 Shahbaz Akhtar Abid, Mazliza Othman, and Nadir Shah. 2014. A Survey on DHT-Based Routing for Large-Scale Mobile Ad Hoc Networks. ACM Comput. Surv. 47, 2, Article 20 (aug 2014), 46 pages. DOI: https://doi.org/10.1145/2632296
2. Stephanos Androutsellis-Theotokis and Diomidis Spinellis . 2004. A survey of peer-to-peer content distribution technologies. ACM computing surveys (CSUR) 36, 4 ( 2004 ), 335–371. Stephanos Androutsellis-Theotokis and Diomidis Spinellis. 2004. A survey of peer-to-peer content distribution technologies. ACM computing surveys (CSUR) 36, 4 (2004), 335–371.
3. Ben Appleton and Michael O’Reilly. 2015. Multi-probe consistent hashing. arXiv preprint arXiv:1505.00062(2015). Ben Appleton and Michael O’Reilly. 2015. Multi-probe consistent hashing. arXiv preprint arXiv:1505.00062(2015).
4. Elaine Barker Elaine Barker William Burr William Polk Miles Smid etal 2006. Recommendation for key management: Part 1: General. National Institute of Standards and Technology Technology Administration …. Elaine Barker Elaine Barker William Burr William Polk Miles Smid et al. 2006. Recommendation for key management: Part 1: General. National Institute of Standards and Technology Technology Administration ….
5. LightStore