000			04043nam a22004455i 4500
999			_c387312 _d387312
001			387312
003			ES-MaUEC
005			20230312132955.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2019 sz | s |||| 0|eng d
020			_a9783031020148
024	7		_a10.1007/978-3-031-02014-8 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D5 _b2019 EB
100	1		_aSakavalas, Dimitris _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687279
245	1	0	_aNetwork Topology and Fault-Tolerant Consensus _cby Dimitris Sakavalas, Lewis Tseng
250			_a1st edition 2019
264		1	_aCham _bSpringer International Publishing _c2019
300			_a1 recurso en línea (XXI, 129 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aList of Figures -- List of Tables -- List of Algorithms -- Preface -- Acknowledgments -- Introduction -- Consensus and Network Topology -- Synchronous Crash Fault Tolerance -- Asynchronous Crash Fault Tolerance -- Byzantine Fault Tolerance -- Relay Depth and Approximate Consensus -- Broadcast Under Local Adversaries -- General Adversary -- Bibliography -- Authors' Biographies .
520			_aAs the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-passing systems allows participants in the system to agree on a common value despite the malfunction or misbehavior of some components. It is a task of fundamental importance for distributed computing, due to its numerous applications. We summarize studies on the topological conditions that determine the feasibility of consensus, mainly focusing on directed networks and the case of restricted topology knowledge at each participant. Recently, significant efforts have been devoted to fully characterize the underlying communication networks in which variations of fault-tolerant consensus can be achieved. Although the deduction of analogous topological conditions for undirected networks of known topology had shortly followed the introduction of the problem, their extension to the directed network case has been proven a highly non-trivial task. Moreover, global knowledge restrictions, inherent in modern large-scale networks, require more elaborate arguments concerning the locality of distributed computations. In this work, we present the techniques and ideas used to resolve these issues. Recent studies indicate a number of parameters that affect the topological conditions under which consensus can be achieved, namely, the fault model, the degree of system synchrony (synchronous vs. asynchronous), the type of agreement (exact vs. approximate), the level of topology knowledge, and the algorithm class used (general vs. iterative). We outline the feasibility and impossibility results for various combinations of the above parameters, extensively illustrating the relation between network topology and consensus.
988			_aSynthesis Collection of Technology_2019
650		7	_2embne _9668452 _aTolerancia a los fallos (Informática)
650		7	_2embne _9156434 _aProceso distribuido (Informática)
650		7	_2embne _9151819 _aAlgoritmos computacionales
700	1		_aTseng, Lewis _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687280
776	0	8	_iPrinted edition: _z9783031001321
776	0	8	_iPrinted edition: _z9783031008863
776	0	8	_iPrinted edition: _z9783031031427
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02014-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI