By Topic

The anatomy study of efficient agreement in a cloud computing environment with fallible processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. C. Wang ; Chaoyang University of Technology, Taiwan, R.O.C. ; K. Q. Yan ; W. B. Liau ; C. P. Huang

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 network topology with faulty hardware components. 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. Therefore, previous protocols for the agreement problem with fallible hardware are not suitable for a cloud computing environment with fallible processes. To enhance fault tolerance, the agreement problem in a cloud computing environment with fallible processes is revisited in this study. The proposed protocol can solve the agreement problem with a minimal number of rounds of message exchange and tolerates a maximal number of faulty processes.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:1 )

Date of Conference:

9-11 July 2010