507 search results - page 3 / 102 » How good is the Chord algorithm |
AHSWN
2010
13 years 6 months ago
2010
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
KDD
2012
ACM
11 years 8 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
ICC
2011
IEEE
12 years 6 months ago
2011
IEEE
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
WAOA
2007
Springer
14 years 13 days ago
2007
Springer
How should a seller price his goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his bud...
IPTPS
2004
Springer
13 years 11 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...