By requesting a node with the most amount of segments, it reduces how many retries may be required when a rehash occurs.  Also by doing multiple segments at once we only have to iterate over the cache contents 1 time instead of N times where N is the number of segments  it owns.  I thought about having it do it by segment, but until we have an in memory store that allows for faster access this should always be more performant.  Faster access meaning we have separation of data by segment, so that would be O(N) instead of O(N*M) like it would be today where M is the number of entries.