article

Bounding transient and steady-state dependability measures through algorithmic stochastic comparison

Authors:

Ana Bušić,

Jean-Michel FourneauAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 34, Issue 2

Pages 11 - 12

https://doi.org/10.1145/1168134.1168141

Published: 01 September 2006 Publication History

Get Access

Abstract

We are interested in bounding dependability measures like point and steady-state availability and reliability of systems modelled by very large Markov chains which are not numerically tractable. We suppose that the state space is divided into two classes, UP (system is operational) and DOWN states. The reliability at time t is defined as the probability that the system has always been operational between 0 and t. The point availability is the probability that the system is operational at time t, and the steady-state availability is the limit, if it exists, of this probability.

References

[1]

Busic A., Fourneau J.-M.: Bounds for Point and Steady-State Availability: an Algorithmic Approach Based on Lumpability and Stochastic Ordering. EPEW 2005, Springer LNCS 3670 (2005), 94--108

Digital Library

Google Scholar

[2]

Carrasco J. A.: Bounding steady-state availability models with group repair and phase type repair distributions, Performance Evaluation, V 35 (1999), 193--204

Digital Library

Google Scholar

[3]

Fourneau J.-M., Lecoz M., Quessette F.: Algorithms for an irreducible and lumpable strong stochastic bound. Linear Algebra and its Applications, V 386 (2004) 167--185

Crossref

Google Scholar

[4]

Muntz R., de Souza e Silva E., Goyal A.: Bounding availability of repairable computer systems. IEEE Trans. on Computers, V 38 (12) (1989), 1714--1723

Digital Library

Google Scholar

[5]

Stoyan D.: Comparison Methods for Queues and Other Stochastic Models. John Wiley & Sons, Berlin, Germany, (1983)

Google Scholar

Index Terms

Recommendations

Transient exponential-Erlang queues and steady-state simulation

The transient probabilistic structure of M/E_m/1 and E_m/M/1 queues initialized in an arbitrary deterministic state is derived in discrete time. Computational algorithms for obtaining the required probabilities are provided, and their application in ...
How Hard are Steady-State Queueing Simulations?
Special Issue on Don Iglehart

Some queueing systems require tremendously long simulation runlengths to obtain accurate estimators of certain steady-state performance measures when the servers are heavily utilized. However, this is not uniformly the case. We analyze a number of ...
Steady-state analysis of a discrete-time batch arrival queue with working vacations

This paper analyzes a discrete-time batch arrival queue with working vacations. In a Geo^X/G/1 system, the server works at a lower speed during the vacation period which becomes a lower speed operation period. This model is more appropriate for the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 34, Issue 2

September 2006

30 pages

ISSN:0163-5999

DOI:10.1145/1168134

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2006

Published in SIGMETRICS Volume 34, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
67
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Transient exponential-Erlang queues and steady-state simulation

How Hard are Steady-State Queueing Simulations?

Steady-state analysis of a discrete-time batch arrival queue with working vacations