Why in the example of consistency hashing, when adding node N5, the nodes N3 AND N4 don’t get affected?
My understanding after reading on Internet is, if we have the following nodes, and each node hold a range let’s say
Node A: [0-249]
Node B: [250-499]
Node C: [500-749]
Node D: [750-999]
and we add a new node, let’s say Node E and it has to go next to Node B (as a result of the hashing), the new range of the existing nodes after E will be like
Node A: [0-249]
Node B: [250-499]
Node E: [500-624] <- New Node
Node C: [625-874] <- Adjusted range due to Node E
Node D: [875-999] <- Adjusted range due to Node E
Is my understanding correct? If so why in the example given here Ensure Scalability and Replication - Grokking Modern System Design Interview for Engineers & Managers for consistency Hashing, it is not mentioned in this way?
Also why in the example in that link, it is mentioned "N3 shares the keys from N2 to N5 with N5
". What N2 node has to do here???