Cart (Loading....) | Create Account
Close category search window
 

Bounding asymptotic dependability and performance measures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahevas, S. ; IRISA, Rennes, France ; Rubino, G.

One of the major drawbacks of Markov models is the size of the generated state space. Often its high value (sometimes infinite) makes the numerical analysis impossible to perform. A possible approach to deal with this problem is to bound the measures of interest. In recent years, some methods have been proposed in this direction, mainly for stationary dependability measures. In this paper, we propose a new approach which can be applied in more general conditions than previous ones. It allows, in particular, to derive performance measures of some analytically intractable queuing models. We illustrate it with examples of open models of tandem queues with blocking

Published in:

Computer Performance and Dependability Symposium, 1996., Proceedings of IEEE International

Date of Conference:

4-6 Sep 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.