In this paper, we present a family of novel P2P routing schemes based on Chord (and its variation F-Chord(α) that trades off uniformity with efficiency without using any additional overhead. We prove that H-F-Chord(α)'s routing 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.
Non-uniform deterministic routing on F-Chord(α)
GARGANO, Luisa;NEGRO, Alberto;SCARANO, Vittorio
2004-01-01
Abstract
In this paper, we present a family of novel P2P routing schemes based on Chord (and its variation F-Chord(α) that trades off uniformity with efficiency without using any additional overhead. We prove that H-F-Chord(α)'s routing 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
