On Faster and fair lookup operation in content-addressable networks
Gergely Biczók, Rolland Vida · 2005
Lookup operations in CAN might take a long time, as requests are passed only to direct neighbors. Realities ease this problem, but their random nature does not ensure fairness between participating nodes. In this paper we propose multiple levels of long range neighbors, called Reference Points (RPs), placed in a deterministic manner. Their location is calculated for each node so as to ensure reaching any point in the coordinate space in a comparably small number of steps. Multi-level RPs also bring fairness to CAN.