State reduction method of Markov chain calculation for a highly-available storage device

This thesis proposes data reduction method for Markov chain to calculate availability of a storage device. Components of a highly-available storage device are redundant to prevent service loss and data loss. The number of the states of the storage device increases exponentially following with increment of components. By this proposed method, the number of the states can be reduced from 4
²⁴
to 81.