Resilient asymptotic consensus in asynchronous robust networks

In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. The type of adversary considered is omniscient and may collude with other adversaries to achieve the goal o...

Full description

Saved in:
Bibliographic Details
Main Authors: LeBlanc, H. J., Koutsoukos, X.
Format: Conference Proceeding
Language:English
Subjects:
Adaptation models
Algorithm design and analysis
Computational modeling
Delays
Manganese
Network topology
Robustness
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1749
container_issue
container_start_page 1742
container_title
container_volume
creator LeBlanc, H. J.
Koutsoukos, X.
description In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. The type of adversary considered is omniscient and may collude with other adversaries to achieve the goal of disrupting consensus among the normal nodes. The main limitation on the behavior of the adversary nodes is that whenever the adversary nodes communicate with neighbors, they must broadcast their messages so that all neighbors receive the same information. The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes. The class of topologies studied are those that are robust. Network robustness formalizes a notion of redundancy of direct information exchange between subsets of nodes in the network, and is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.
doi_str_mv 10.1109/Allerton.2012.6483432
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6483432</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6483432</ieee_id><sourcerecordid>6483432</sourcerecordid><originalsourceid>FETCH-LOGICAL-i288t-42ff6b80b77b34a4166d477c5b91ea7d7a3002fd4361fab3d786e927015ef9213</originalsourceid><addsrcrecordid>eNpVj81KAzEURiMiKHWeQIR5gY75m9xkI5SiVigIouuSzNxgdJqUJEX69lbsxtXH-RYHDiG3jHaMUXO3mCbMNcWOU8Y7JbWQgp-RxoBmUoGQvTD8_B-DviRNKZ-U0qNCMamvyP0rljAFjLW15bDd1VTD0A4pFoxlX9oQf_84fOQU05FzcvtS24j1O-Wvck0uvJ0KNqedkffHh7flar5-eXpeLtbzwLWuc8m9V05TB-CEtJIpNUqAoXeGoYURrKCU-1EKxbx1YgSt0HCgrEdvOBMzcvPnDYi42eWwtfmwOVWLH9HCTXM</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Resilient asymptotic consensus in asynchronous robust networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>LeBlanc, H. J. ; Koutsoukos, X.</creator><creatorcontrib>LeBlanc, H. J. ; Koutsoukos, X.</creatorcontrib><description>In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. The type of adversary considered is omniscient and may collude with other adversaries to achieve the goal of disrupting consensus among the normal nodes. The main limitation on the behavior of the adversary nodes is that whenever the adversary nodes communicate with neighbors, they must broadcast their messages so that all neighbors receive the same information. The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes. The class of topologies studied are those that are robust. Network robustness formalizes a notion of redundancy of direct information exchange between subsets of nodes in the network, and is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.</description><identifier>ISBN: 9781467345378</identifier><identifier>ISBN: 1467345377</identifier><identifier>EISBN: 9781467345392</identifier><identifier>EISBN: 1467345385</identifier><identifier>EISBN: 9781467345385</identifier><identifier>EISBN: 1467345393</identifier><identifier>DOI: 10.1109/Allerton.2012.6483432</identifier><language>eng</language><publisher>IEEE</publisher><subject>Adaptation models ; Algorithm design and analysis ; Computational modeling ; Delays ; Manganese ; Network topology ; Robustness</subject><ispartof>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), , p.1742-1749</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6483432$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6483432$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>LeBlanc, H. J.</creatorcontrib><creatorcontrib>Koutsoukos, X.</creatorcontrib><title>Resilient asymptotic consensus in asynchronous robust networks</title><title>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</title><addtitle>Allerton</addtitle><description>In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. The type of adversary considered is omniscient and may collude with other adversaries to achieve the goal of disrupting consensus among the normal nodes. The main limitation on the behavior of the adversary nodes is that whenever the adversary nodes communicate with neighbors, they must broadcast their messages so that all neighbors receive the same information. The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes. The class of topologies studied are those that are robust. Network robustness formalizes a notion of redundancy of direct information exchange between subsets of nodes in the network, and is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.</description><subject>Adaptation models</subject><subject>Algorithm design and analysis</subject><subject>Computational modeling</subject><subject>Delays</subject><subject>Manganese</subject><subject>Network topology</subject><subject>Robustness</subject><isbn>9781467345378</isbn><isbn>1467345377</isbn><isbn>9781467345392</isbn><isbn>1467345385</isbn><isbn>9781467345385</isbn><isbn>1467345393</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVj81KAzEURiMiKHWeQIR5gY75m9xkI5SiVigIouuSzNxgdJqUJEX69lbsxtXH-RYHDiG3jHaMUXO3mCbMNcWOU8Y7JbWQgp-RxoBmUoGQvTD8_B-DviRNKZ-U0qNCMamvyP0rljAFjLW15bDd1VTD0A4pFoxlX9oQf_84fOQU05FzcvtS24j1O-Wvck0uvJ0KNqedkffHh7flar5-eXpeLtbzwLWuc8m9V05TB-CEtJIpNUqAoXeGoYURrKCU-1EKxbx1YgSt0HCgrEdvOBMzcvPnDYi42eWwtfmwOVWLH9HCTXM</recordid><creator>LeBlanc, H. J.</creator><creator>Koutsoukos, X.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><title>Resilient asymptotic consensus in asynchronous robust networks</title><author>LeBlanc, H. J. ; Koutsoukos, X.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i288t-42ff6b80b77b34a4166d477c5b91ea7d7a3002fd4361fab3d786e927015ef9213</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><topic>Adaptation models</topic><topic>Algorithm design and analysis</topic><topic>Computational modeling</topic><topic>Delays</topic><topic>Manganese</topic><topic>Network topology</topic><topic>Robustness</topic><toplevel>online_resources</toplevel><creatorcontrib>LeBlanc, H. J.</creatorcontrib><creatorcontrib>Koutsoukos, X.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LeBlanc, H. J.</au><au>Koutsoukos, X.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Resilient asymptotic consensus in asynchronous robust networks</atitle><btitle>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</btitle><stitle>Allerton</stitle><spage>1742</spage><epage>1749</epage><pages>1742-1749</pages><isbn>9781467345378</isbn><isbn>1467345377</isbn><eisbn>9781467345392</eisbn><eisbn>1467345385</eisbn><eisbn>9781467345385</eisbn><eisbn>1467345393</eisbn><abstract>In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. The type of adversary considered is omniscient and may collude with other adversaries to achieve the goal of disrupting consensus among the normal nodes. The main limitation on the behavior of the adversary nodes is that whenever the adversary nodes communicate with neighbors, they must broadcast their messages so that all neighbors receive the same information. The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes. The class of topologies studied are those that are robust. Network robustness formalizes a notion of redundancy of direct information exchange between subsets of nodes in the network, and is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.</abstract><pub>IEEE</pub><doi>10.1109/Allerton.2012.6483432</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781467345378
ispartof 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), , p.1742-1749
issn
language eng
recordid cdi_ieee_primary_6483432
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Adaptation models
Algorithm design and analysis
Computational modeling
Delays
Manganese
Network topology
Robustness
title Resilient asymptotic consensus in asynchronous robust networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T17%3A15%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Resilient%20asymptotic%20consensus%20in%20asynchronous%20robust%20networks&rft.btitle=2012%2050th%20Annual%20Allerton%20Conference%20on%20Communication,%20Control,%20and%20Computing%20(Allerton)&rft.au=LeBlanc,%20H.%20J.&rft.spage=1742&rft.epage=1749&rft.pages=1742-1749&rft.isbn=9781467345378&rft.isbn_list=1467345377&rft_id=info:doi/10.1109/Allerton.2012.6483432&rft.eisbn=9781467345392&rft.eisbn_list=1467345385&rft.eisbn_list=9781467345385&rft.eisbn_list=1467345393&rft_dat=%3Cieee_6IE%3E6483432%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i288t-42ff6b80b77b34a4166d477c5b91ea7d7a3002fd4361fab3d786e927015ef9213%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6483432&rfr_iscdi=true