@willscott The goal is to demonstrate that we always get the same nodes for the same cid (as long as the hash ring does not change). Adding nodes that are as good as the original ones will change the hash ring and re reroute content.
Hey @aarshkshah1992 @willscott I think Aarsh's test here might still serve as a good base case test for cache affinity separate from the original intended test I wrote.
That way we have two test cases:
Testing that the hash ring only maps cids to good nodes.
Testing stability in the ring space as new good nodes join the pool .
@willscott The goal is to demonstrate that we always get the same nodes for the same cid (as long as the hash ring does not change). Adding nodes that are as good as the original ones will change the hash ring and re reroute content.
What kind of test do you have in mind here ?