Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models

We consider a class of models for multicomponent systems in which components can break down and be repaired in a dependent manner and where breakdown and repair times can be arbitrarily distributed. The problem of calculating the equilibrium distribution and, from this, the expected performability for these models is intractable unless certain assumptions are made about breakdowns and repairs. In this paper we show that the performability of multicomponent systems that do not satisfy these rules can be bounded by tractable modifications. Our results are proved by stochastic comparability arguments and a Markov reward technique, which is of interest in itself as it enables one to prove that the equilibrium distribution of one process can be bounded by that of another even when the sample paths of the process are not. This is illustrated by an example.

[1]  John A. Silvester,et al.  Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..

[2]  John F. Meyer,et al.  On Evaluating the Performability of Degradable Computing Systems , 1980, IEEE Transactions on Computers.

[3]  W. Whitt Comparing counting processes and queues , 1981, Advances in Applied Probability.

[4]  R. Schassberger Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds , 1978, Advances in Applied Probability.

[5]  Y. F. Lam,et al.  An Improved Algorithm for Performance Analysis of Networks with Unreliable Components , 1986, IEEE Trans. Commun..

[6]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[7]  R. Schassberger Insensitivity of Steady-state Distributions of Generalized Semi-Markov Processes. Part II , 1977 .

[8]  Andreas Brandt,et al.  On the Pathwise Comparison of Jump Processes Driven by Stochastic Intensities , 1994 .

[9]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[10]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[11]  Boudewijn R. Haverkort,et al.  Product forms for availability models , 1992 .

[12]  David D. Yao,et al.  Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks , 1987, Oper. Res..

[13]  William A. Massey,et al.  New stochastic orderings for Markov processes on partially ordered spaces , 1984, The 23rd IEEE Conference on Decision and Control.

[14]  Finkel,et al.  Brief review: Stochastic Modeling and the Theory of Queues by Ronald W. Wolfe (Prentice-Hall, 1989) , 1992, PERV.

[15]  Uwe Jansen,et al.  Stochastic Processes and Properties of Invariance for Queueing Systems with Speeds and Temporary Interruptions , 1977 .

[16]  Youngho Lim Minimum-Cost Dimensioning Model for Common Channel Signaling Networks Under Joint Performance and Reliability Constraints , 1990, IEEE J. Sel. Areas Commun..

[17]  A. Hordijk,et al.  Weak convergence for generalized semi-Markov processes , 1982 .

[18]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[19]  Ward Whitt,et al.  Stochastic Comparisons for Non-Markov Processes , 1986, Math. Oper. Res..

[20]  John F. Meyer,et al.  Closed-Form Solutions of Performability , 1982, IEEE Transactions on Computers.

[21]  J. Walrand,et al.  Monotonicity of Throughput in Non-Markovian Networks. , 1989 .