Show simple item record

dc.contributor.authorTsitsiklis, John N.
dc.date.accessioned2013-07-22T16:05:00Z
dc.date.available2013-07-22T16:05:00Z
dc.date.issued2011-06
dc.identifier.isbn978-1-4577-0124-5
dc.identifier.urihttp://hdl.handle.net/1721.1/79646
dc.description.abstractIn distributed consensus and averaging algorithms, processors exchange and update certain values ("estimates" or "opinions") by forming a local average with the values of their neighbors. Under suitable conditions, such algorithms converge to consensus (every processor ends up holding the same value) or even average-consensus (consensus is achieved on the average of the initial values held by the processors). We first review some convergence rate results. We then abstract the problem by introducing a model of deterministic distributed function computation by a network of identical and anonymous nodes, with limited communication and storage capabilities, and where 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 satisfies 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, and we provide an algorithm that solves it in time that grows at most quadratically with the size of the network. (Joint work with J. Hendrickx and A. Olshevsky).en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant EECS-0701623)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/MED.2011.5983086en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceTsitsiklis via Amy Stouten_US
dc.titleAveraging algorithms and distributed anonymous discrete function computationen_US
dc.typeArticleen_US
dc.identifier.citationTsitsiklis, John N. Averaging Algorithms and Distributed Anonymous Discrete Function Computation. In 2011 19th Mediterranean Conference on Control & Automation (MED), 301-302. Institute of Electrical and Electronics Engineers, 2011.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorTsitsiklis, John N.en_US
dc.relation.journalProceedings of the 2011 19th Mediterranean Conference on Control & Automation (MED)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsTsitsiklis, John N.en_US
dc.identifier.orcidhttps://orcid.org/0000-0003-2658-8239
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record