Propagation and leader election in a multihop broadcast environment

The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cidon, Israel, Mokryn, Osnat
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 118
container_issue
container_start_page 104
container_title
container_volume
creator Cidon, Israel
Mokryn, Osnat
description The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.
doi_str_mv 10.1007/BFb0056477
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_1569310</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1569310</sourcerecordid><originalsourceid>FETCH-LOGICAL-p217t-bcced26ae4dae66e9b85ad8dd9f9ac64ad3c9e453eee85119ee61926af32d5e3</originalsourceid><addsrcrecordid>eNpFkEtPwzAQhM1LopRe-AU5cOASWMeP1EeIKCBVgkPv0cbelEBqR3ZA4t8TKBJzWWlmdg4fYxccrjlAeXO3agCUlmV5wM6EkiCNNsIcshnXnOdCSHO0D7QCreGYzUBAkZtSilO2SOkNJomiKKGYseolhgG3OHbBZ-hd1hM6ihn1ZH-9brKz3Uc_dq9hyJoY0FlMY0b-s4vB78iP5-ykxT7R4u_O2WZ1v6ke8_Xzw1N1u86Hgpdj3lhLrtBI0iFpTaZZKnRL50xr0GqJTlhDUgkiWirODZHmZnpoReEUiTm73M8OmCz2bURvu1QPsdth_Kq5mjBwmGpX-1qaEr-lWDchvKeaQ_3Dr_7nJ74B8H5fEA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Propagation and leader election in a multihop broadcast environment</title><source>Springer Books</source><creator>Cidon, Israel ; Mokryn, Osnat</creator><contributor>Kutten, Shay</contributor><creatorcontrib>Cidon, Israel ; Mokryn, Osnat ; Kutten, Shay</creatorcontrib><description>The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540650660</identifier><identifier>ISBN: 9783540650669</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540496939</identifier><identifier>EISBN: 9783540496939</identifier><identifier>DOI: 10.1007/BFb0056477</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Broadcast networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; distributed ; Exact sciences and technology ; leader election ; Software</subject><ispartof>Distributed Computing, 1998, p.104-118</ispartof><rights>Springer-Verlag Berlin Heidelberg 1998</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0056477$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0056477$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1569310$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Kutten, Shay</contributor><creatorcontrib>Cidon, Israel</creatorcontrib><creatorcontrib>Mokryn, Osnat</creatorcontrib><title>Propagation and leader election in a multihop broadcast environment</title><title>Distributed Computing</title><description>The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.</description><subject>Applied sciences</subject><subject>Broadcast networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>distributed</subject><subject>Exact sciences and technology</subject><subject>leader election</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540650660</isbn><isbn>9783540650669</isbn><isbn>3540496939</isbn><isbn>9783540496939</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkEtPwzAQhM1LopRe-AU5cOASWMeP1EeIKCBVgkPv0cbelEBqR3ZA4t8TKBJzWWlmdg4fYxccrjlAeXO3agCUlmV5wM6EkiCNNsIcshnXnOdCSHO0D7QCreGYzUBAkZtSilO2SOkNJomiKKGYseolhgG3OHbBZ-hd1hM6ihn1ZH-9brKz3Uc_dq9hyJoY0FlMY0b-s4vB78iP5-ykxT7R4u_O2WZ1v6ke8_Xzw1N1u86Hgpdj3lhLrtBI0iFpTaZZKnRL50xr0GqJTlhDUgkiWirODZHmZnpoReEUiTm73M8OmCz2bURvu1QPsdth_Kq5mjBwmGpX-1qaEr-lWDchvKeaQ_3Dr_7nJ74B8H5fEA</recordid><startdate>19980101</startdate><enddate>19980101</enddate><creator>Cidon, Israel</creator><creator>Mokryn, Osnat</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>19980101</creationdate><title>Propagation and leader election in a multihop broadcast environment</title><author>Cidon, Israel ; Mokryn, Osnat</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p217t-bcced26ae4dae66e9b85ad8dd9f9ac64ad3c9e453eee85119ee61926af32d5e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Applied sciences</topic><topic>Broadcast networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>distributed</topic><topic>Exact sciences and technology</topic><topic>leader election</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cidon, Israel</creatorcontrib><creatorcontrib>Mokryn, Osnat</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cidon, Israel</au><au>Mokryn, Osnat</au><au>Kutten, Shay</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Propagation and leader election in a multihop broadcast environment</atitle><btitle>Distributed Computing</btitle><date>1998-01-01</date><risdate>1998</risdate><spage>104</spage><epage>118</epage><pages>104-118</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540650660</isbn><isbn>9783540650669</isbn><eisbn>3540496939</eisbn><eisbn>9783540496939</eisbn><abstract>The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0056477</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Distributed Computing, 1998, p.104-118
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_1569310
source Springer Books
subjects Applied sciences
Broadcast networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
distributed
Exact sciences and technology
leader election
Software
title Propagation and leader election in a multihop broadcast environment
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T05%3A20%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Propagation%20and%20leader%20election%20in%20a%20multihop%20broadcast%20environment&rft.btitle=Distributed%20Computing&rft.au=Cidon,%20Israel&rft.date=1998-01-01&rft.spage=104&rft.epage=118&rft.pages=104-118&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540650660&rft.isbn_list=9783540650669&rft_id=info:doi/10.1007/BFb0056477&rft_dat=%3Cpascalfrancis_sprin%3E1569310%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540496939&rft.eisbn_list=9783540496939&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true