1391 search results - page 136 / 279 » Distributed routing in networks using affinity propagation |
179
click to vote
IEEEARES
2006
IEEE
16 years 14 days ago
2006
IEEE
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
166
click to vote
JNW
2006
15 years 6 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
141
click to vote
ISPA
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
150
click to vote
EDBTW
2004
Springer
15 years 11 months ago
2004
Springer
Current simulations of P2P-networks don’t take any kind of schemas into account. We present a simulation-framework and first results for query routing based on extensible schema...
164
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...