1768 search results - page 1 / 354 » Optimal routing in Chord |
126
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
137
Voted
STOC
2004
ACM
15 years 9 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
137
Voted
IPTPS
2004
Springer
15 years 9 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
103
Voted
COMCOM
2006
15 years 3 months ago
2006
144
click to vote
P2P
2007
IEEE
15 years 9 months ago
2007
IEEE
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...