Achieving efficient agreement within a dual-failure cloud-computing environment

doi:10.1016/j.eswa.2010.07.072

Return

Achieving efficient agreement within a dual-failure cloud-computing environment

2011-01-01

PRE

Kuo-Qin Yan *

Shu-Ching Wang

DOI：10.1016/j.eswa.2010.07.072

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2010 Elsevier Ltd. All rights reserved.

Keywords:

Byzantine Agreement

Interactive consistency

Agreement problem

Distributed system

Fault-tolerance

Cloud-computing

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.