This article explains why naive modulo-based routing fails in distributed Go services, introduces the stable and scalable concept of consistent hashing, walks through a basic implementation, shows how virtual nodes improve balance, and outlines common use cases and pitfalls for production systems.
This article details a comprehensive sharding strategy for a high‑traffic message table, explaining why early partitioning is essential, how to design language‑based vertical shards combined with hash‑based horizontal shards, calculate table counts and virtual nodes, and execute a zero‑downtime migration using dual‑writes and gradual traffic rollout.
Consistent hashing, a cornerstone of distributed systems, balances load, enhances scalability, and minimizes data migration; this article explains its fundamentals, the drawbacks of basic implementations, the role of virtual nodes, and provides a complete Go-language example with code for adding, removing, and locating nodes.
Consistent hashing replaces simple modulo‑based distribution to efficiently locate cached data across changing numbers of servers, using a hash ring and virtual nodes to ensure balanced load, minimize data movement, and improve reliability in distributed caching, load balancing, and database sharding scenarios.
This article reviews the paper “Distinguished in Uniform: Self-Attention vs. Virtual Nodes,” comparing graph Transformers and MPGNNs with virtual nodes on theoretical consistency and experimental performance, revealing that neither approach universally dominates the other.
This article explains how to use Alibaba Cloud Container Service (ACK) virtual nodes and Elastic Container Instances (ECI) to achieve second‑scale elasticity, covering installation, ResourcePolicy configuration, zone‑aware scheduling, high‑availability setups, and performance results with concrete YAML examples.
This article explains the consistent hashing algorithm, its hash‑ring model, how it overcomes the limitations of simple modulo hashing in distributed caches, the role of virtual nodes for load balancing, and common use cases such as memcached, Redis clusters, and load‑balancing routers.
This article explains the fundamentals of consistent hashing, its application in load‑balancing distributed caches, analyzes common issues such as data skew and cache avalanche, introduces virtual nodes for uniform distribution, provides Java code examples, and compares it with Redis's HashSlot approach.
Zuoyebang’s shift to cloud‑native architecture leveraged Alibaba Cloud’s Kubernetes Serverless virtual nodes, achieving a 22.5% cost reduction during peak traffic by dynamically scaling workloads, while addressing scheduling, observability, and performance challenges through custom schedulers, enhanced monitoring, and careful testing.
Consistent hashing maps both servers and keys onto a virtual hash ring, allowing keys to be assigned to the nearest clockwise server, which minimizes data movement during node addition or removal, improves load distribution with virtual nodes, and is widely used in distributed caching and load balancing systems.
The article explains consistent hashing—using a circular 2^32 hash ring with virtual nodes to evenly distribute keys across dynamic cache servers—provides a complete Go implementation including host registration, key lookup, and a bounded‑load extension that tracks server load, demonstrates a proxy‑cache setup, and discusses practical testing and production‑grade enhancements.
This article explains the principles of consistent hashing, compares it with simple modulo hashing, and shows how the hash ring, virtual nodes, and key mapping improve load balancing, minimize data loss during node changes, and prevent cache avalanche in distributed caching systems.
This article explains the principles of consistent hashing, its data‑skew issue, how virtual nodes mitigate that problem, and demonstrates the implementation and usage of ConsistentHashLoadBalance in Dubbo with detailed code analysis and practical load‑balancing examples.
This article explains the drawbacks of a basic modulo hash algorithm for key distribution, demonstrates how consistent hashing resolves scaling and node‑failure issues, and discusses virtual‑node techniques to mitigate data skew and improve load balancing in distributed cache systems.
The article uses a historical story to illustrate basic hash‑based partitioning, its shortcomings when nodes change, and then introduces consistent hashing, hash rings, and virtual nodes as solutions for balanced load distribution and minimal data migration in distributed systems.
The article explains how Distributed Hash Tables replace simple modulo hashing with a ring‑based scheme, demonstrates severe data skew in basic implementations, and shows that adding multiple virtual nodes plus a load‑boundary factor dramatically balances storage and request distribution across cluster nodes.
This article experimentally validates consistent hashing by adding and removing nodes in a 5‑node cluster, reveals key distribution imbalance and avalanche risks, and proposes solutions such as node scaling and virtual node virtualization, complete with Python code examples and detailed analysis.
This article experimentally validates consistent hashing by adding and removing nodes in a simulated cluster, examines key redistribution, reveals load‑imbalance and avalanche vulnerabilities, and proposes solutions such as virtual nodes and adaptive replica factors, providing Python code examples and detailed observations.
This article explains the fundamentals of hash functions, outlines the key characteristics of a good hash algorithm, and dives deep into consistent hashing—its background, mechanism, desirable properties, fault tolerance, scalability, and the use of virtual nodes to solve data skew in distributed systems.
Consistent hashing, introduced by MIT in 1997, addresses hotspot issues in distributed systems by ensuring balance, monotonicity, spread, and load properties, using a ring hash space, virtual nodes, and minimal data movement when nodes are added or removed.
This article explains the concept of consistent hashing, its application in distributed cache load balancing, analyzes issues like data skew and cache avalanche, presents virtual‑node optimizations with Java test code, discusses graceful scaling strategies, and compares it to Redis’s HashSlot and P2P approaches.
This article uses a classic distributed caching scenario to explain consistent hashing, detailing its principles, advantages, challenges like cache avalanche, and solutions such as virtual nodes, while illustrating each step with clear diagrams and examples.
This article explains the consistent hashing algorithm, its motivation in cache systems, the concept of monotonicity, the step‑by‑step mapping process, and how virtual nodes improve balance and resilience when cache servers are added or removed.
This article explains the principles of consistent hashing, its classic design with virtual nodes, the shortcomings of the original algorithm, and how Amazon's Dynamo and other extensions improve load balancing and reduce data movement in distributed environments.
