Please use this identifier to cite or link to this item:
Title: Analysis and optimization of service availability in an HA cluster with load-dependent machine availability
Authors: Ang, C.-W.
Tham, C.-K. 
Keywords: Cluster computing
Dynamic programming
High Availability
Markov chains
Markov decision processes
Neuro-dynamic programming
Issue Date: Sep-2007
Citation: Ang, C.-W., Tham, C.-K. (2007-09). Analysis and optimization of service availability in an HA cluster with load-dependent machine availability. IEEE Transactions on Parallel and Distributed Systems 18 (9) : 1307-1319. ScholarBank@NUS Repository.
Abstract: Calculations of service availability of a High- Availability (HA) cluster are usually based on the assumption of load-independent machine availabilities. In this paper, we study the issues and show how the service availabilities can be calculated under the assumption that machine availabilities are load-dependent. we present a Markov chain analysis to derive the steady-state service availabilities of a load-dependentmachine- availability HA cluster. We show that, with loaddependent machine-availability, the attained service availability is now policy-dependent. After formulating the problem as a Markov Decision Process, we proceed to determine the optimal policy to achieve the maximum service availabilities using the method of policy iteration. Two greedy assignment algorithms are studied: least-load and FDL-based, where leastload corresponds to some load-balancing algorithms.We carry out analysis and simulations on two cases of load profiles: in the first profile, a single machine has the capacity to host all services in the HA cluster; in the second profile, a single machine does not have enough capacity to host all services. We show that the service availabilities achieved under the first load profile are the same, while the service availabilities achieved under the second load profile are different. Since the service availabilities achieved are different in the second load profile, we proceed to investigate how the distribution of service availabilities across the services can be controlled by adjusting the rewards vector. © 2007 IEEE.
Source Title: IEEE Transactions on Parallel and Distributed Systems
ISSN: 10459219
DOI: 10.1109/TPDS.2007.1071
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Nov 9, 2018


checked on Oct 31, 2018

Page view(s)

checked on Nov 10, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.