661 search results - page 109 / 133 » On Distributed Computation in Noisy Random Planar Networks |
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
PDP
2009
IEEE
15 years 4 months ago
2009
IEEE
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
59
Voted
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
116
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...