Search

Your search keyword '"Binary consensus"' showing total 2 results
Start Over Descriptor "Binary consensus" Publication Year Range Last 3 years
2 results on '"Binary consensus"'

1. Binary Consensus of Multi-agent Systems With Privacy Preserving and Random Communication Noises

Author

Wang, Shuochen, Wang, Jian, Yang, Hongyong, Zhang, Chuangchuang, Liu, Li, Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Tan, Kay Chen, Series Editor, Jia, Yingmin, editor, Zhang, Weicun, editor, Fu, Yongling, editor, and Wang, Jiqiang, editor

Published
2023
Full Text
View/download PDF

2. Implementation, validation and experimental evaluation of a self-stabilizing randomized Byzantine-tolerant binary consensus algorithm

Author

Demetriou, Constandinos, Georgiou, Chryssis, Marcoullis, Ioannis, Philippou, Anna, Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών, Τμήμα Πληροφορικής, University of Cyprus, Faculty of Pure and Applied Sciences, Department of Computer Science, and Georgiou, Chryssis [0000-0003-4360-0260]

Subjects
BINARY CONSENSUS, DISTRIBUTED SYSTEMS, SELF-STABILIZATION, BYZANTINE FAULT-TOLERANCE, RANDOMIZATION
Abstract

Binary consensus is a problem in which a set of processors must agree on a single binary value. In asynchronous systems, where a subset of the processors may be malicious, this challenge gets more challenging. We study malicious and more serious problems in this work: transient faults. These are temporary violations of the system's operating assumptions that might cause the system's state to change unexpectedly, making recovery impossible without human intervention. We implement an existing protocol for randomized Byzantine-tolerant binary consensus algorithm that is loosely-self-stabilizing using the Go programming language and the ZeroMQ communication framework. This approach is optimal in terms of resilience and termination, requires only bounded memory, and ensures that the system will automatically converge to a legal state. This is the first time-free Byzantine-tolerant binary consensus algorithm to make such guarantees, to our knowledge. We describe the first known implementation of this algorithm in this work. With this implementation, we were able to: (a) validate the algorithm; (b) compare the algorithm to its non-stabilizing version and estimate the cost of self-stabilization in terms of processing time and message load; and (c) notice that different failures in the system (whether due to transient faults or malicious behavior) have no significant overhead on recovery and decision time.

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results