We present an aggregation-based algorithm for the exact analysis of Markov chains with GI/G/1-type pattern in their repetitive structure, i.e., chains that exhibit both M/G/1-type and GI/M/1-type patterns and cannot be solved with existing techniques. Markov chains with a GI/G/1 pattern result when modeling open systems with faults/repairs that accept jobs from multiple exogenous sources. Our method provides exact computation of the steady state probabilities, and allows computation of performance measures of interest including the system queue length or any of its higher moments, the exact probability of system failures and repairs, and consequently a host of performability measures. Our algorithm also applies to systems that are purely of the M/G/1-type or the GI/M/1-type, or their intersection, i.e., quasi-birth-death processes.
/lp/association-for-computing-machinery/an-aggregation-based-method-for-the-exact-analysis-of-a-class-of-gi-g-8VWNZ0JXXX