1

I'm reading a system design article about design ticketmaster. It mentions: We can use the Consistent Hashing to allocate application servers for both ActiveReservationService and WaitingUserService based upon the ‘ShowID’. This way, all reservations and waiting users of a particular show will be handled by a certain set of servers. Let’s assume for load balancing our Consistent Hashing allocates three servers for any Show But my understanding of consistent hashing is we will calculate hash(showID), and find this value on the hash ring, then go clockwise and find the next node which will be the server to use. Thus I imagine the showID will always go to the same server. How we allocates three servers for any Show? Thank you!

Improve this question
Related questions
1
Distributing users (or anything else) to database servers by hash
2
Function to shard/distribute (consistent hashing)?
6
Distributed LSH (locality sensitive hashing)
Load 7 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.