DocumentCode
2263269
Title
Non-uniform deterministic routing on F-Chord(α)
Author
Cordasco, Gennaro ; Gargano, Luisa ; Hammar, Mikael ; Negro, Alberto ; Scarano, Vittorio
Author_Institution
Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy
fYear
2004
fDate
8 Oct. 2004
Firstpage
16
Lastpage
21
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.
Keywords
IP networks; communication complexity; peer-to-peer computing; telecommunication network routing; F-Chord(α); P2P routing scheme; nonuniform deterministic routing; Application software; Computer networks; Fault tolerance; IP networks; Length measurement; Network servers; Peer to peer computing; Routing; Scalability; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Peer-to-Peer Systems, 2004. International Workshop on Hot Topics in
Print_ISBN
0-7695-2269-6
Type
conf
DOI
10.1109/PTPSYS.2004.13
Filename
1376611
Link To Document