@inproceedings{1bc68690efb44c38aae541371321657d,
title = "Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads \& Greedy Routing",
abstract = "Workloads of networked and distributed systems are often far from random, but exhibit certain structure: they are skewed and bursty. Networked systems which can adapt to and exploit such spatial and temporal structure, in a demand-aware manner, bear the potential to be more efficient than their demand-oblivious alternatives. This paper studies demand-awareness in the context of consistent hashing, a fundamental component in many modern distributed systems. We present a novel demand-aware consistent hashing method to improve access time and storage utilization in distributed hash tables. In particular, the resulting system supports local (greedy) routing, ensures bounded server loads, and applies to various network topologies. We formally prove that our algorithms achieve a constant approximation ratio in the offline scenario.",
keywords = "Consistent hashing, greedy routing, peer-to-peer networks",
author = "Arash Pourdamghani and Chen Avin and Stefan Schmid",
note = "Publisher Copyright: {\textcopyright} Arash Pourdamghani, Chen Avin, and Stefan Schmid.; 5th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2026 ; Conference date: 01-07-2026 Through 03-07-2026",
year = "2026",
month = jun,
day = "24",
doi = "10.4230/LIPIcs.SAND.2026.24",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Mertzios, \{George B.\} and Richa, \{Andrea W.\}",
booktitle = "5th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2026",
address = "Germany",
}