Proposed Change
As a developer of applications with varying numbers of instances using hash-based routing
I want Maglev lookup table sizes to be calculated dynamically based on the number of application instances per route pool
So that I can ensure better hash distribution for large pools.
The current implementation uses a hard-coded lookup table size of 3001 for the Maglev consistent hashing algorithm across all route pools. According to the Maglev paper recommendations, the optimal table size should be approximately 100× the number of application instances per pool. The size of 3001 may provide insufficient distribution for large pools.
Acceptance criteria
Related links
Proposed Change
As a developer of applications with varying numbers of instances using hash-based routing
I want Maglev lookup table sizes to be calculated dynamically based on the number of application instances per route pool
So that I can ensure better hash distribution for large pools.
The current implementation uses a hard-coded lookup table size of 3001 for the Maglev consistent hashing algorithm across all route pools. According to the Maglev paper recommendations, the optimal table size should be approximately 100× the number of application instances per pool. The size of 3001 may provide insufficient distribution for large pools.
Acceptance criteria
Related links