机读格式显示(MARC)
- 000 03122cam a2200361 i 4500
- 008 190529s2019 caua b 000 0 eng d
- 020 __ |a 9781681735665 |q paperback
- 020 __ |a 9781681735689 |q hardcover
- 020 __ |a 9781681735672 |q electronic
- 040 __ |a CaBNVSL |b eng |e rda |c CaBNVSL |d CaBNVSL |d UtOrBLW
- 050 _4 |a QA76.9.D5 |b S256 2019
- 100 1_ |a Sakavalas, Dimitris, |e author.
- 245 10 |a Network topology and fault-tolerant consensus / |c Dimitris Sakavalas, Lewis Tseng.
- 260 __ |a [San Rafael, California] : |b Morgan & Claypool, |c [2019]
- 300 __ |a xxi, 129 pages : |b illustrations ; |c 24 cm
- 336 __ |a text |2 rdacontent
- 337 __ |a unmediated |2 rdamedia
- 338 __ |a volume |2 rdamedia
- 490 0_ |a Synthesis lectures on distributed computing theory, |x 2155-1634 ; |v #16
- 500 __ |a Part of: Synthesis digital library of engineering and computer science.
- 504 __ |a Includes bibliographical references (pages 119-128).
- 520 3_ |a As 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.
- 650 _0 |a Computer networks.
- 650 _0 |a Electronic data processing |x Distributed processing.
- 650 _0 |a Computer algorithms.
- 650 _0 |a Fault-tolerant computing.
- 700 1_ |a Tseng, Lewis, |e author.