Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Distributed consensus revisited
Information Processing Letters
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Reaching strong consensus in the presence of mixed failure types
Information Sciences—Informatics and Computer Science: An International Journal
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering
The Byzantine Agreement Problem: Optimal Early Stopping
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Eventually Dual Failure Agreement
Fundamenta Informaticae
Efficient Malicious Agreement in a Virtual Subnet Network
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing
IEEE Transactions on Dependable and Secure Computing
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
IRM: Integrated File Replication and Consistency Maintenance in P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Cognitive MANET design for mission-critical networks
IEEE Communications Magazine
Reliable application layer multicast over combined wired and wireless networks
IEEE Transactions on Multimedia
On the Quality of Service of Crash-Recovery Failure Detectors
IEEE Transactions on Dependable and Secure Computing
Practical aspects of mobility in wireless self-organizing networks [Guest Editorial]
IEEE Wireless Communications
Unlinkability Measure for IEEE 802.11 Based MANETs
IEEE Transactions on Wireless Communications
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
The fault tolerance capability and reliability of a distributed system can be enhanced if the Strong Consensus (SC) problem can be properly addressed. Most of the extant SC protocols are designed for static networks. Besides, the number of rounds of message exchange required by all of the extant SC protocols is determined by the total number of processors in the network rather than by the actual number of faulty processors in the network. Even if there is only a few or no faulty processor in the network, the SC protocols may waste a lot of time and memory space on many unnecessary rounds of message exchange. Thus, this paper revisits the SC problem in dynamic networks and uses two rules, Detection Rule for Malicious fault in dynamic network (DRM"d"y"n) and Early Stopping Rule for Strong Consensus protocol in dynamic networks (ESRSC"d"y"n), to reduce the time consumption and space complexity of SC protocols. DRM"d"y"n is a rule that detects malicious processors, and ESRSC"d"y"n is a rule that determines whether the messages collected are enough for reaching a strong consensus. To be succinct, the proposed SC protocol can not only work in dynamic networks consisting of both dormant processors and malicious processors (dual failure mode) but also ensure that all correct processors reach a SC value within fewer rounds of message exchange than required by the extant SC protocols.