Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory Jg. 54; H. 7; S. 2997 - 3007 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.07.2008
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in this context. Known iterative algorithms for averaging can be used to compute the normalized values of such functions, but these algorithms do not extend, in general, to the computation of the actual values of separable functions. The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions. The running time of the algorithm is shown to depend on the running time of a minimum computation algorithm used as a subroutine. Using a randomized gossip mechanism for minimum computation as the subroutine yields a complete fully distributed algorithm for computing separable functions. For a class of graphs with small spectral gap, such as grid graphs, the time used by the algorithm to compute averages is of a smaller order than the time required by a known iterative averaging scheme. |
|---|---|
| AbstractList | The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in this context. Known iterative algorithms for averaging can be used to compute the normalized values of such functions, but these algorithms do not extend, in general, to the computation of the actual values of separable functions. The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions. The running time of the algorithm is shown to depend on the running time of a minimum computation algorithm used as a subroutine. Using a randomized gossip mechanism for minimum computation as the subroutine yields a complete fully distributed algorithm for computing separable functions. For a class of graphs with small spectral gap, such as grid graphs, the time used by the algorithm to compute averages is of a smaller order than the time required by a known iterative averaging scheme. The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in this context. Known iterative algorithms for averaging can be used to compute the normalized values of such functions, but these algorithms do not extend, in general, to the computation of the actual values of separable functions. The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions. The running time of the algorithm is shown to depend on the running time of a minimum computation algorithm used as a subroutine. Using a randomized gossip mechanism for minimum computation as the subroutine yields a complete fully distributed algorithm for computing separable functions. For a class of graphs with small spectral gap, such as grid graphs, the time used by the algorithm to compute averages is of a smaller order than the time required by a known iterative averaging scheme. [PUBLICATION ABSTRACT] |
| Author | Shah, D. Mosk-Aoyama, D. |
| Author_xml | – sequence: 1 givenname: D. surname: Mosk-Aoyama fullname: Mosk-Aoyama, D. organization: Dept. of Comput. Sci., Stanford Univ., Stanford, CA – sequence: 2 givenname: D. surname: Shah fullname: Shah, D. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20444988$$DView record in Pascal Francis |
| BookMark | eNp9kc1rGzEQxUVxoLbTcw69LIWWXtbR964OPQS3TgyBHOqcxViWXJn1ypW0h_z30eKQQw6GATHM72me9GZo0ofeInRD8IIQrG43682CYtwuFOWSt5_QlAjR1EoKPkFTjElbK87bz2iW0qG0XBA6Rb9WkHL126cc_XbIdlfddfsQff53TJULsVqG42nIvt9Xf-0JImw7W62G3mQf-nSNrhx0yX55O-foefVns3yoH5_u18u7x9qwlua6ccZwJqykDSkFEhjFRGFG-E5St1PcAWxtSxwlhjQAUlhMnRFlvFOyZXP043zvKYb_g01ZH30ytuugt2FImnGhGOOqgD8vgoRJQYQUlBb02wf0EIbYl2doooSiDS4G5-j7GwTJQOci9MYnfYr-CPFFU8w5V-1o8PbMmRhSita9IwTrMR5d4tFjPPocT1GIDwrjM4y_miP47oLu61nnrbXvW7gYfWD2CmwcnD8 |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1145_2816819 crossref_primary_10_1016_j_sigpro_2020_107732 crossref_primary_10_1016_j_jcss_2014_10_005 crossref_primary_10_1109_TIT_2010_2095070 crossref_primary_10_1109_TIT_2015_2468584 crossref_primary_10_1109_TSP_2012_2196697 crossref_primary_10_1145_2902945_2902959 crossref_primary_10_1109_TIT_2009_2034777 crossref_primary_10_1109_JSAC_2013_130410 crossref_primary_10_1109_TNET_2010_2048122 crossref_primary_10_1109_TIT_2013_2247462 crossref_primary_10_1109_TIT_2021_3127272 crossref_primary_10_1016_j_jcss_2021_07_002 crossref_primary_10_1109_TMC_2010_59 crossref_primary_10_1007_s00446_014_0238_z crossref_primary_10_1109_TSP_2010_2045421 crossref_primary_10_1016_j_tcs_2010_11_001 crossref_primary_10_1109_TSP_2012_2215603 crossref_primary_10_1109_TSP_2012_2215604 crossref_primary_10_1109_JSAC_2013_130408 crossref_primary_10_1145_3209665 crossref_primary_10_1017_S0269888916000175 crossref_primary_10_1016_j_ins_2014_10_042 crossref_primary_10_1109_JSTSP_2011_2123078 crossref_primary_10_1109_JSTSP_2011_2124440 crossref_primary_10_1145_3173043 crossref_primary_10_1109_JSEN_2017_2712702 crossref_primary_10_1109_TWC_2013_100113_130619 crossref_primary_10_1109_TNET_2012_2230642 crossref_primary_10_1007_s00607_012_0200_5 crossref_primary_10_1109_TNSE_2019_2935068 crossref_primary_10_1145_3385075 crossref_primary_10_1109_COMST_2014_2354398 crossref_primary_10_1016_j_adhoc_2011_05_005 crossref_primary_10_1109_TNET_2012_2209676 crossref_primary_10_1016_j_ins_2014_10_035 crossref_primary_10_1109_MSP_2012_2219652 crossref_primary_10_1109_TSP_2013_2272921 crossref_primary_10_1109_TVT_2015_2508456 crossref_primary_10_1109_TSP_2014_2319777 crossref_primary_10_1007_s11134_014_9397_7 crossref_primary_10_3390_e26060448 crossref_primary_10_1109_TWC_2017_2730874 crossref_primary_10_1016_j_tcs_2015_02_044 crossref_primary_10_1109_TSIPN_2018_2881718 crossref_primary_10_1109_TAC_2013_2287113 crossref_primary_10_1017_S0963548314000194 crossref_primary_10_1007_s00778_013_0314_1 crossref_primary_10_1109_JSTSP_2014_2320229 crossref_primary_10_1016_j_tcs_2018_05_041 crossref_primary_10_1016_j_spa_2021_03_008 crossref_primary_10_1109_JPROC_2010_2052531 crossref_primary_10_1145_3593426 crossref_primary_10_1109_TPDS_2015_2458311 crossref_primary_10_1145_3301304 crossref_primary_10_1137_080743706 crossref_primary_10_1016_j_conengprac_2012_12_001 crossref_primary_10_3390_mca27020023 crossref_primary_10_1109_TIT_2018_2837050 |
| Cites_doi | 10.1109/INFCOM.2005.1498374 10.1109/INFCOM.2005.1498447 10.1007/978-1-4612-5320-4 10.1016/0022-0000(85)90041-8 10.1109/SFCS.2003.1238221 10.1007/978-1-4612-0323-0 10.1109/SFCS.2000.892324 10.1109/SFCS.2002.1181971 10.1006/jcss.1997.1534 10.1145/1031495.1031525 10.1142/S0129054199000216 10.1145/1007352.1007438 10.1007/978-3-540-27820-7_8 10.1137/0147013 10.1145/380752.380796 10.1016/0166-218X(85)90059-9 10.1109/TAC.1986.1104412 10.1109/SFCS.1994.365693 10.1109/ICDE.2004.1320018 10.1145/41840.41841 10.1145/1140277.1140283 10.1109/SFCS.2000.892006 |
| ContentType | Journal Article |
| Copyright | 2008 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2008 |
| Copyright_xml | – notice: 2008 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2008 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2008.924648 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 3007 |
| ExternalDocumentID | 1499090341 20444988 10_1109_TIT_2008_924648 4544980 |
| Genre | orig-research Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c382t-7fcc435e6271271a6a320190314d62fd94faabe81f21c17aa65e02fc54d6d9683 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 100 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000257111500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Sun Sep 28 02:41:56 EDT 2025 Sat Sep 27 19:01:01 EDT 2025 Sun Jun 29 16:17:00 EDT 2025 Mon Jul 21 09:15:12 EDT 2025 Tue Nov 18 22:27:34 EST 2025 Sat Nov 29 03:53:05 EST 2025 Tue Aug 26 16:47:25 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Averaging method Peer to peer Subroutine Wireless telecommunication Data aggregation Iterative method gossip algorithms Resource sharing Distributed computing Linear combination Computer network distributed algorithms randomized algorithms Distributed algorithm Fast algorithm Ad hoc network |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c382t-7fcc435e6271271a6a320190314d62fd94faabe81f21c17aa65e02fc54d6d9683 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 195927090 |
| PQPubID | 23500 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_34593349 pascalfrancis_primary_20444988 proquest_journals_195927090 crossref_primary_10_1109_TIT_2008_924648 proquest_miscellaneous_1365156522 crossref_citationtrail_10_1109_TIT_2008_924648 ieee_primary_4544980 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-07-01 |
| PublicationDateYYYYMMDD | 2008-07-01 |
| PublicationDate_xml | – month: 07 year: 2008 text: 2008-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2008 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref14 ref11 ref10 ref2 ref1 ref17 ref16 ref19 bertsekas (ref8) 1989 ref24 ref23 tsitsiklis (ref6) 1984 ref25 ref20 ref22 ref21 enachescu (ref26) 2004 ref7 ref9 bar-yossef (ref4) 2002 ref3 berger (ref18) 2005 ref5 |
| References_xml | – ident: ref17 doi: 10.1109/INFCOM.2005.1498374 – ident: ref2 doi: 10.1109/INFCOM.2005.1498447 – ident: ref21 doi: 10.1007/978-1-4612-5320-4 – ident: ref3 doi: 10.1016/0022-0000(85)90041-8 – year: 1989 ident: ref8 publication-title: Parallel and Distributed Computation Numerical Methods – start-page: 1 year: 2002 ident: ref4 article-title: counting distinct elements in a data stream publication-title: Random Processes – ident: ref9 doi: 10.1109/SFCS.2003.1238221 – ident: ref23 doi: 10.1007/978-1-4612-0323-0 – ident: ref13 doi: 10.1109/SFCS.2000.892324 – ident: ref15 doi: 10.1109/SFCS.2002.1181971 – ident: ref22 doi: 10.1006/jcss.1997.1534 – ident: ref1 doi: 10.1145/1031495.1031525 – ident: ref25 doi: 10.1142/S0129054199000216 – ident: ref19 doi: 10.1145/1007352.1007438 – start-page: 71 year: 2004 ident: ref26 article-title: scale free aggregation in sensor networks publication-title: Proc 1st Int Workshop on Algorithmic Aspects of Wireless Sensor Networks doi: 10.1007/978-3-540-27820-7_8 – ident: ref11 doi: 10.1137/0147013 – ident: ref16 doi: 10.1145/380752.380796 – ident: ref10 doi: 10.1016/0166-218X(85)90059-9 – ident: ref7 doi: 10.1109/TAC.1986.1104412 – year: 1984 ident: ref6 publication-title: Problems in decentralized decision making and computation – start-page: 301 year: 2005 ident: ref18 article-title: on the spread of viruses on the internet publication-title: Proc 15th Annu ACM-SIAM Symp Discrete Algorithms – ident: ref14 doi: 10.1109/SFCS.1994.365693 – ident: ref5 doi: 10.1109/ICDE.2004.1320018 – ident: ref12 doi: 10.1145/41840.41841 – ident: ref20 doi: 10.1145/1140277.1140283 – ident: ref24 doi: 10.1109/SFCS.2000.892006 |
| SSID | ssj0014512 |
| Score | 2.3162243 |
| Snippet | The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 2997 |
| SubjectTerms | Ad hoc networks Algorithm design and analysis Algorithms Applied sciences Computation Computer networks Data aggregation Distributed algorithms Distributed computing Electronics Exact sciences and technology Functions gossip algorithms Graphs Grid computing Information theory Information, signal and communications theory Iterative algorithms Mathematical analysis Mathematical models Network topology Peer to peer computing Protocols Randomized algorithms Running Spectra Studies Subroutines Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Valuation and optimization of characteristics. Simulation |
| Title | Fast Distributed Algorithms for Computing Separable Functions |
| URI | https://ieeexplore.ieee.org/document/4544980 https://www.proquest.com/docview/195927090 https://www.proquest.com/docview/1365156522 https://www.proquest.com/docview/34593349 |
| Volume | 54 |
| WOSCitedRecordID | wos000257111500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Na9VAEB9q6UEP1raKr9W6ggcPps1-JdmDh2J9KEgRfEpvYbOZ1MLzvfKS59_vTDYvVLSHQg6BnQ3L7MfMZGd-P4A3ZJK0lSgTW9VMYVY5OgcxTxQiZg2qxvaINz--5BcXxeWl-7oF78ZaGJLpk8_whF_7u_x6Gdb8q-zUWGNcQQH6gzzPYq3WeGNgrIzI4JI2MMUcA4yPTN3p7PMsJk1SrJEx0c8tC9RTqnBCpG9JJ00ks_jnXO6NzXT3fsN8Ao8Hp1KcxVWwB1u42IfdDWGDGPbvPjy6hT54AO-nvu3EOSPnMukV1uJsfrVcXXc_f7WCfFkRP0Cy4hsyRHg1RzElO9gv1afwffpx9uFTMrApJEEXqkvyJgTyjTBTuaTHZ14rLiTX0tSZampnGu8rLGSjZJC595nFVDXBUnPtskI_g-3FcoHPQZjUU9iCzjN6exW818aTp4hcFCstVhM42Wi4DAPUODNezMs-5EhdSVMSCTDjlEzg7djhJqJs3C16wBofxQZlT-D4rykc2xUD4rmC-h1t5rQctmlbMrKOylNH3V-PrbS_-NLEL3C5JhHNZPEZuakTeHWHjDbWaW3c4f_HdgQPY5YJJ_m-gO1utcaXsBN-d9ft6rhfxn8APX3vMg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB9KK6gPrbaKZ227gg8-mDb7kY998KFUjxbPQ_CUvoXNZqKF804uOf9-Z7K5UNE-CHlY2NkQZj9mJjvz-wG8IpOkE4kySsqKKcxKS-cgZpFCxLRGVScd4s3XSTad5tfX9tMWvBlqYUimSz7DU252d_nV0q_5V9mZSYyxOQXoO9RQcajWGu4MTCIDNrikLUxRRw_kI2N7NruahbRJijZSpvq5ZYM6UhVOiXQNaaUOdBZ_ncyduRnv_d-HPoLd3q0U52EdPIYtXOzD3oayQfQ7eB8e3sIfPIC3Y9e04h1j5zLtFVbifP5tubppv_9oBHmzIryAZMVnZJDwco5iTJawW6xP4Mv4_eziMur5FCKvc9VGWe09eUeYqkzS41KnFZeSa2mqVNWVNbVzJeayVtLLzLk0wVjVPqHuyqa5fgrbi-UCn4EwsaPABa1j_PbSO6eNI18RuSxWJliO4HSj4cL3YOPMeTEvuqAjtgVNSaDADFMygtfDgJ8BZ-Nu0QPW-CDWK3sEx39M4dCvGBLP5jTucDOnRb9Rm4KxdVQWWxr-cuilHcbXJm6ByzWJaKaLT8lRHcHJHTLaJFZrY5__-9tO4P7l7OOkmFxNPxzCg5Bzwim_L2C7Xa3xCO75X-1NszrulvRv0JjyeQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+Distributed+Algorithms+for+Computing+Separable+Functions&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Mosk-Aoyama%2C+Damon&rft.au=Shah%2C+Devavrat&rft.date=2008-07-01&rft.issn=0018-9448&rft.volume=54&rft.issue=7&rft.spage=2997&rft.epage=3007&rft_id=info:doi/10.1109%2FTIT.2008.924648&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2008_924648 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |