Abstract
In this article we develop probabilistic algorithms for estimating the number of active nodes in a multicomputer system which consists of independent computers that are interconnected by a communication network. The algorithms are based on routine exchange of messages among the nodes of the multicomputer, using random routing. We show that each active node can find an ϵ‐estimate of the fraction λ of active nodes in the system in time that depends only on ϵ and λ. The underlying approach can be used for finding various global properties of distributed systems with decentralized control.
| Original language | English |
|---|---|
| Pages (from-to) | 275-282 |
| Number of pages | 8 |
| Journal | Networks |
| Volume | 16 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1986 |
| Externally published | Yes |