Articoli correlati a Network Topology and Fault-tolerant Consensus
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 84,73
EUR 12,00 per la spedizione da Polonia a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Network Topology and Fault-tolerant Consensus
Foto dell'editore
Network Topology and Fault-Tolerant Consensus (Synthesis Lectures on Distributed Computing Theory)
Editore:
Morgan & Claypool Publishers, 2019
ISBN 10: 1681735660
ISBN 13: 9781681735665
Antico o usato
paperback
Da: suffolkbooks, Center moriches, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
paperback. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week! Codice articolo 3TWDDA004JLW
Quantitą: 4 disponibili
Immagini fornite dal venditore
Network Topology and Fault-Tolerant Consensus (Synthesis Lectures on Distributed Computing Theory)
Editore:
Morgan & Claypool Publishers, 2019
ISBN 10: 1681735660
ISBN 13: 9781681735665
Nuovo
Soft cover
Da: Leopolis, Kraków, Polonia
Valutazione del venditore 5 su 5 stelle
Soft 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. Codice articolo 008467
Quantitą: 1 disponibili