Non-Uniform Deterministic Routing on F-Chord (")

Authors:
Gennaro Cordasco;Luisa Gargano;Mikael Hammar;Alberto Negro;Vittorio Scarano
Affiliations:
Università di Salerno;Università di Salerno;Università di Salerno;Università di Salerno;Università di Salerno
Venue:
HOT-P2P '04 Proceedings of the 2004 International Workshop on Hot Topics in Peer-to-Peer Systems
Year:
2004

Citing 0
Cited 3

NBDT: an efficient P2P indexing scheme for web service discovery

International Journal of Web Engineering and Technology
Dynamic Web Service discovery architecture based on a novel peer based overlay network

Journal of Systems and Software
Optimizing the finger table in chord-like DHTs

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a family of novel P2P routing schemes based on Chord [17] (and its variation F-Chord (驴)[2]) that trades off uniformity with efficiency without using any additional overhead. We prove that H-F-Chord (驴)ýsrouting is more efficient than in F-Chord (驴) in terms of its average path length that is O(log n/ log log n). We also show, by simulations, that H-F-Chord (驴) is more efficient than the corresponding F-Chord (驴) by a percentage that goes from 15% to 22% even for small n.