Consistent Hashing

Consistent hashing is a way of evenly distributing load across a system of caches on the internet (like a content delivery network (CDN)).

In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n/m keys need to be remapped on average where n is the number of keys and m is the number of slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped because the mapping between the keys and the slots is defined by a modular operation.

Created from: Algorithms to know before system design interviews 202211231052

uid: 202211231055 tags: #algorithms #software-engineering

Date

February 22, 2023

Up next

Leaky Bucket The algorithm is used for packet transmissions, to keep within defined limits on the bandwidth and burstiness of the network. A simple leaky bucket

Previously

11-22-2022 Explaining what happened in incident-385 202211220922 for friends: Ubuntu kernel bug The service we use for managing containers on Linux, runc,