Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
A Note on Consensus on Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
netWorker - Cloud computing: PC functions move onto the web
Compute and storage clouds using wide area high performance networks
Future Generation Computer Systems
Reaching Agreement among Virtual Subnets in Hybrid Failure Mode
IEEE Transactions on Parallel and Distributed Systems
Scientific Cloud Computing: Early Definition and Experience
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
International Journal of Security and Networks
A virtual grouping based fault-tolerant scheme for autonomous networks
Engineering Applications of Artificial Intelligence
The Journal of Supercomputing
The optimal generalized Byzantine Agreement in Cluster-based Wireless Sensor Networks
Computer Standards & Interfaces
Scalable and leaderless Byzantine consensus in cloud computing environments
Information Systems Frontiers
Hi-index | 12.06 |
Fault-tolerance is an important research topic in the study of distributed systems. To counter the influence of faulty components, it is essential to reach a common agreement in the presence of faults before performing certain tasks. However, the agreement problem is fundamental to fault-tolerant distributed systems. In previous studies, protocols dealing with the agreement problem have focused on a fully connected network or on a general connectivity. However, cloud-computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. In a cloud-computing environment, the connected topology is not very significant. Therefore, previous protocols for the agreement problem are not suitable for a cloud-computing environment. To enhance fault-tolerance, the agreement problem in a cloud-computing environment is revisited in this study. The proposed protocol is called the Dual Agreement Protocol of Cloud-Computing (DAPCC). DAPCC achieves agreement on a common value among all nodes in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in a cloud-computing environment.