Lingua: Inglese
Editore: Morgan & Claypool Publishers, 2019
ISBN 10: 1681735660 ISBN 13: 9781681735665
Da: suffolkbooks, Center moriches, NY, U.S.A.
paperback. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week!
EUR 61,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 70,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 72,03
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In English.
EUR 72,02
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 78,25
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
EUR 76,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New.
EUR 59,30
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Network Topology and Fault-Tolerant Consensus | Dimitris Sakavalas (u. a.) | Taschenbuch | Synthesis Lectures on Distributed Computing Theory | xxi | Englisch | 2019 | Springer | EAN 9783031008863 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
EUR 127,74
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 151 pages. 9.25x7.50x0.33 inches. In Stock.
Lingua: Inglese
Editore: Morgan & Claypool Publishers, 2019
ISBN 10: 1681735660 ISBN 13: 9781681735665
Da: Leopolis, Kraków, Polonia
EUR 84,81
Quantità: 1 disponibili
Aggiungi al carrelloSoft cover. Condizione: New. 8vo (23.5 cm), XXI, 129 pp. Laminated wrappers. Synopsis: 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.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 54,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Da: Majestic Books, Hounslow, Regno Unito
EUR 78,50
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 79,82
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Lingua: Inglese
Editore: Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2019
ISBN 10: 3031008863 ISBN 13: 9783031008863
Da: moluna, Greven, Germania
EUR 55,78
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 co.
Lingua: Inglese
Editore: Springer, Springer Mai 2019, 2019
ISBN 10: 3031008863 ISBN 13: 9783031008863
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 64,19
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 152 pp. Englisch.