9781681735665 - network topology and fault-tolerant consensus (synthesis lectures on distributed computing theory) de sakavalas, dimitris; tseng, lewis (3 resultados)
- Tapa blanda
Librería: suffolkbooks, center moriches, NY, Estados Unidos de Americasuffolkbooks
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 17,97
Envío por EUR 3,49Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
paperback. Condición: Very Good. Fast Shipping - Safe and Secure 7 days a week.
- Tapa blanda
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 129,20
Envío por EUR 11,67Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Brand New. 151 pages. 9.25x7.50x0.33 inches. In Stock.
- Tapa blanda
Librería: Leopolis, Kraków, PoloniaLeopolis
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 83,99
Envío por EUR 65,00Se envía de Polonia a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Soft cover. Condición: 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 agr…ee 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.
