The documentation states "When doing a memcached lookup, first the client hashes the key against the whole list of servers. Once it has chosen a server, the client then sends its request, and the server does an internal hash key lookup for the actual item data. "
My question is how then does memcache ensure that a node in the cluster doesnt fill up?
