If it is really not identified, the key's hash is turned into yet another quantity in the very same selection, and the request is routed to the node whose place is closest to the crucial. If older details is located, the more mature knowledge is propagated and returned to the originator, and the insert "collides".