On Faster and fair lookup operation in content-addressable networks

Authors:
Gergely Biczók;Rolland Vida
Affiliations:
Ericsson Research Hungary;Budapest University of Technology and Economics
Venue:
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Year:
2005

Citing 2
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.