@inproceedings{4762283cd06c4ad5bb90fa595c6b245a,
title = "Hash & Adjust: Competitive Demand-Aware Consistent Hashing",
abstract = "Distributed systems often serve dynamic workloads and resource demands evolve over time. Such a temporal behavior stands in contrast to the static and demand-oblivious nature of most data structures used by these systems. In this paper, we are particularly interested in consistent hashing, a fundamental building block in many large distributed systems. Our work is motivated by the hypothesis that a more adaptive approach to consistent hashing can leverage structure in the demand, and hence improve storage utilization and reduce access time. We initiate the study of demand-aware consistent hashing. Our main contribution is H&A, a constant-competitive online algorithm (i.e., it comes with provable performance guarantees over time). H&A is demand-aware and optimizes its internal structure to enable faster access times, while offering a high utilization of storage. We further evaluate H&A empirically.",
keywords = "Consistent hashing, demand-awareness, online algorithms",
author = "Arash Pourdamghani and Chen Avin and Robert Sama and Maryam Shiran and Stefan Schmid",
note = "Publisher Copyright: {\textcopyright} Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, and Stefan Schmid.; 28th International Conference on Principles of Distributed Systems, OPODIS 2024 ; Conference date: 11-12-2024 Through 13-12-2024",
year = "2025",
month = jan,
day = "8",
doi = "10.4230/LIPIcs.OPODIS.2024.24",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Silvia Bonomi and Letterio Galletta and Etienne Riviere and Valerio Schiavoni",
booktitle = "28th International Conference on Principles of Distributed Systems, OPODIS 2024",
address = "Germany",
}