Distributed Anonymous Discrete Function Computation
Name
Tsitsiklis_Distributed anonymous.pdf
Size
614.89 KB
Format
Adobe PDF
Checksum (MD5)
d33d0dbe2fe11655291c9194ec228920
Author(s)
Tsitsiklis, John N.
Hendrickx, Julien
Olshevsky, Alexander
Date Issued
August 2011
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Hendrickx, Julien M., Alex Olshevsky, and John N. Tsitsiklis. “Distributed Anonymous Discrete Function Computation.” IEEE Transactions on Automatic Control 56.10 (2011): 2276–2289.
Version
Author's final manuscript
Abstract
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. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we provide a necessary condition for computability which we show to be nearly sufficient, in the sense that every function that violates this condition can at least be approximated. The problem of computing (suitably rounded) averages in a distributed manner plays a central role in our development; we provide an algorithm that solves it in time that grows quadratically with the size of the network.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tac.2011.2163874
