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: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/73570 https://orcid.org/0000-0003-2658-8239 |
| _version_ | 1811089115847852032 |
|---|---|
| author | Tsitsiklis, John N. Hendrickx, Julien Olshevsky, Alexander |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Tsitsiklis, John N. Hendrickx, Julien Olshevsky, Alexander |
| author_sort | Tsitsiklis, John N. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T14:13:56Z |
| format | Article |
| id | mit-1721.1/73570 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:13:56Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/735702022-10-01T19:57:09Z Distributed Anonymous Discrete Function Computation Tsitsiklis, John N. Hendrickx, Julien Olshevsky, Alexander Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Tsitsiklis, John N. Hendrickx, Julien Olshevsky, Alexander 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. National Science Foundation (U.S.) (Graduate Fellowship) National Science Foundation (U.S.) (Grant ECCS-0701623) Belgian American Educational Foundation, inc. (Postdoctoral Fellowship) Belgian National Foundation for Scientific Research (Postdoctoral Fellowship) 2012-10-03T17:12:05Z 2012-10-03T17:12:05Z 2011-08 2011-03 Article http://purl.org/eprint/type/JournalArticle 0018-9286 1558-2523 http://hdl.handle.net/1721.1/73570 Hendrickx, Julien M., Alex Olshevsky, and John N. Tsitsiklis. “Distributed Anonymous Discrete Function Computation.” IEEE Transactions on Automatic Control 56.10 (2011): 2276–2289. https://orcid.org/0000-0003-2658-8239 en_US http://dx.doi.org/10.1109/tac.2011.2163874 IEEE Transactions on Automatic Control Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Tsitsiklis, John N. Hendrickx, Julien Olshevsky, Alexander Distributed Anonymous Discrete Function Computation |
| title | Distributed Anonymous Discrete Function Computation |
| title_full | Distributed Anonymous Discrete Function Computation |
| title_fullStr | Distributed Anonymous Discrete Function Computation |
| title_full_unstemmed | Distributed Anonymous Discrete Function Computation |
| title_short | Distributed Anonymous Discrete Function Computation |
| title_sort | distributed anonymous discrete function computation |
| url | http://hdl.handle.net/1721.1/73570 https://orcid.org/0000-0003-2658-8239 |
| work_keys_str_mv | AT tsitsiklisjohnn distributedanonymousdiscretefunctioncomputation AT hendrickxjulien distributedanonymousdiscretefunctioncomputation AT olshevskyalexander distributedanonymousdiscretefunctioncomputation |