Distributed Anonymous Discrete Function Computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage capabilities that do not grow with the network size. Furthermore, each node only knows its neighbors, not the entire graph...
Main Authors: | Tsitsiklis, John N. (Contributor), Hendrickx, Julien (Contributor), Olshevsky, Alexander (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-10-03T17:12:05Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Distributed anonymous function computation in information fusion and multiagent systems
by: Hendrickx, Julien, et al.
Published: (2010) -
Averaging algorithms and distributed anonymous discrete function computation
by: Tsitsiklis, John N.
Published: (2013) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2020) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010) -
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012)