Optimizing the finger table in chord-like DHTs

Authors:
Giovanni Chiola;Gennaro Cordasco;Luisa Gargano;Alberto Negro;Vittorio Scarano
Affiliations:
Università di Genova, Dip. di Informatica e Scienze dell'Informazione, Genova, Italy;Università di Salerno, Dip. di Informatica e Applicazioni "R.M. Capocelli", Baronissi, SA, Italy;Università di Salerno, Dip. di Informatica e Applicazioni "R.M. Capocelli", Baronissi, SA, Italy;Università di Salerno, Dip. di Informatica e Applicazioni "R.M. Capocelli", Baronissi, SA, Italy;Università di Salerno, Dip. di Informatica e Applicazioni "R.M. Capocelli", Baronissi, SA, Italy
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 6
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Extended Fibonacci Distances for Fault-Tolerant Routing in Chord-Like DHTs

HOT-P2P '04 Proceedings of the 2004 International Workshop on Hot Topics in Peer-to-Peer Systems
Non-Uniform Deterministic Routing on F-Chord (")

HOT-P2P '04 Proceedings of the 2004 International Workshop on Hot Topics in Peer-to-Peer Systems
Degree-Optimal Deterministic Routing for P2P Systems

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Overlay networks with class

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between resources exploited (the size of the "finger table") and performance (the average or worst-case number of hops to reach destination). Cordasco et al. showed that a finger table based on Fibonacci distances provides lower number of hops with fewer table entries. In this paper we generalize this result, showing how to construct an improved finger table when the objective is to reduce the number of hops, possibly at the expense of an increased size of the finger table. Our results can also be exploited to guarantee low routing time in case a fraction of nodes is assumed to fail.