Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Network Topology and Fault-Tolerant Consensus, Dimitris Sakavalas, Lewis Tseng


Варианты приобретения
Цена: 15523.00р.
Кол-во:
 о цене
Наличие: Отсутствует. 
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа


Добавить в корзину
в Мои желания

Автор: Dimitris Sakavalas, Lewis Tseng
Название:  Network Topology and Fault-Tolerant Consensus
ISBN: 9781681735689
Издательство: Mare Nostrum (Eurospan)
Классификация:


ISBN-10: 1681735687
Обложка/Формат: Hardcover
Страницы: 151
Вес: 0.48 кг.
Дата издания: 30.05.2019
Серия: Synthesis lectures on distributed computing theory
Язык: English
Размер: 235 x 191 x 10
Читательская аудитория: Professional and scholarly
Ключевые слова: Computer networking & communications,Parallel processing,Computer science, COMPUTERS / Computer Science,COMPUTERS / Networking / General,COMPUTERS / Systems Architecture / Distributed Systems & Computing
Рейтинг:
Поставляется из: Англии
Описание: 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.


Network Topology and Fault-Tolerant Consensus

Автор: Dimitris Sakavalas, Lewis Tseng
Название: Network Topology and Fault-Tolerant Consensus
ISBN: 1681735660 ISBN-13(EAN): 9781681735665
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 12335.00 р.
Наличие на складе: Нет в наличии.

Описание: 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.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия