Sciweavers

1768 search results - page 2 / 354
» Optimal routing in Chord
Sort
View
GCC
2003
Springer
13 years 10 months ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang
ISCC
2005
IEEE
13 years 10 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
EUC
2004
Springer
13 years 10 months ago
VChord: Constructing Peer-to-Peer Overlay Network by Exploiting Heterogeneity
High heterogeneity is an unignoring factor for large-scale peer-to-peer system which leads to the born of VChord. VChord is a peer-to-peer overlay network constructed on Chord aime...
Feng Hong, Minglu Li, Xinda Lu, Yi Wang, Jiadi Yu,...
KIVS
2005
Springer
13 years 10 months ago
Recursive or iterative routing? Hybrid!
: In our current work with the Chord protocol [SMK+ 01] we had to decide whether to use iterative or recursive routing. Iterative routing provides the initiating node with a lot of...
Gerald Kunzmann
INFOCOM
2009
IEEE
13 years 12 months ago
Routing Fairness in Chord: Analysis and Enhancement
—In Peer-to-Peer (P2P) systems where stored objects are small, routing dominates the cost of publishing and retrieving an object. In such systems, the issue of fairly balancing t...
Rubén Cuevas Rumín, Manuel Urue&ntil...